QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#113533#6641. XOR DiceYinLinWA 1ms3444kbC++14669b2023-06-18 13:42:402023-06-18 13:42: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-06-18 13:42:42]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3444kb
  • [2023-06-18 13:42:40]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

#define all(x) begin(x), end(x)
#define int long long
#define sz(x) (int)(x).size()

typedef pair<int, int> pii;
typedef vector<int> vi;

const int inf = (int)1e18;
const int MOD = (int)1e9+7;
const int maxn = (int)1e6;

signed main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    cin.exceptions(std::istream::failbit);
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    int n, d; cin >> n >> d;
    for(int i= 1; i<= n; i++){
        for(int j= 1; j<= 6; j++){
            cout << (int)(i*(j*d)) << " ";
        }
        cout << "\n";
    }

}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

3 2

output:

2 4 6 8 10 12 
4 8 12 16 20 24 
6 12 18 24 30 36 

result:

ok Correct answer

Test #2:

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

input:

100 60

output:

60 120 180 240 300 360 
120 240 360 480 600 720 
180 360 540 720 900 1080 
240 480 720 960 1200 1440 
300 600 900 1200 1500 1800 
360 720 1080 1440 1800 2160 
420 840 1260 1680 2100 2520 
480 960 1440 1920 2400 2880 
540 1080 1620 2160 2700 3240 
600 1200 1800 2400 3000 3600 
660 1320 1980 2640 3300...

result:

wrong answer Invalid output