QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#113534#6641. XOR DiceYinLinWA 1ms3376kbC++14670b2023-06-18 13:43:302023-06-18 13:43:31

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:43:31]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3376kb
  • [2023-06-18 13:43:30]
  • 提交

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*(64*d)) << " ";
        }
        cout << "\n";
    }

}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 1ms
memory: 3376kb

input:

3 2

output:

128 128 128 128 128 128 
256 256 256 256 256 256 
384 384 384 384 384 384 

result:

wrong answer Invalid output