QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#113532 | #6641. XOR Dice | YinLin | WA | 1ms | 3608kb | C++14 | 668b | 2023-06-18 13:20:49 | 2023-06-18 13:20:50 |
Judging History
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= 0; 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: 0
Wrong Answer
time: 1ms
memory: 3608kb
input:
3 2
output:
2 4 6 8 10 12 3 5 7 9 11 13 0 6 4 10 8 14
result:
wrong answer Invalid output