QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#134877#6641. XOR Dicewtn135687#WA 1ms3536kbC++14578b2023-08-05 09:38:412023-08-05 09:38:42

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-08-05 09:38:42]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3536kb
  • [2023-08-05 09:38:41]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll

const int N = 1e6+10,mo = 1e9+7;

int a[N];




inline void solve(){
    int n,d;cin>>n>>d;
    for(int i=1;i<=6;i++)a[i]=d*i-d;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=6;j++)cout<<a[j]<<" \n"[j==6];
        a[6]+=d;
    }
    

}



signed main(){
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int WTN666=1;//cin>>WTN666;
    while(WTN666--){
        solve();
    }
}




































Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

3 2

output:

0 2 4 6 8 10
0 2 4 6 8 12
0 2 4 6 8 14

result:

ok Correct answer

Test #2:

score: -100
Wrong Answer
time: 0ms
memory: 3536kb

input:

100 60

output:

0 60 120 180 240 300
0 60 120 180 240 360
0 60 120 180 240 420
0 60 120 180 240 480
0 60 120 180 240 540
0 60 120 180 240 600
0 60 120 180 240 660
0 60 120 180 240 720
0 60 120 180 240 780
0 60 120 180 240 840
0 60 120 180 240 900
0 60 120 180 240 960
0 60 120 180 240 1020
0 60 120 180 240 1080
0 60...

result:

wrong answer Invalid output