QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#147412#6641. XOR Diceqzez#WA 1ms3952kbC++14943b2023-08-23 07:11:312023-08-25 01:29:06

Judging History

你现在查看的是最新测评结果

  • [2023-08-25 01:29:06]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3952kb
  • [2023-08-23 07:11:31]
  • 提交

answer

#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=15+5,M=(1<<15)+5,K=14348907+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,d;
void Solve(){
	int i,j;
	scanf("%d%d",&n,&d);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=6;j++) printf("%d ",j*d);
		printf("\n");
	}
}
int main(){
	int t;
	// scanf("%d",&t);
	t=1;                                                                                       
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3952kb

input:

3 2

output:

2 4 6 8 10 12 
2 4 6 8 10 12 
2 4 6 8 10 12 

result:

ok Correct answer

Test #2:

score: -100
Wrong Answer
time: 1ms
memory: 3936kb

input:

100 60

output:

60 120 180 240 300 360 
60 120 180 240 300 360 
60 120 180 240 300 360 
60 120 180 240 300 360 
60 120 180 240 300 360 
60 120 180 240 300 360 
60 120 180 240 300 360 
60 120 180 240 300 360 
60 120 180 240 300 360 
60 120 180 240 300 360 
60 120 180 240 300 360 
60 120 180 240 300 360 
60 120 180 2...

result:

wrong answer Invalid output