QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #819163 | #8934. Challenge NPC | HugeMouse | WA | 0ms | 3592kb | C++23 | 382b | 2024-12-18 13:28:06 | 2024-12-18 13:28:12 |
Judging History
answer
#include <iostream>
#include <vector>
using namespace std;
int main() {
int k; cin >> k;
int n = 1024, m = n - 1;
cout << n << " " << m << " " << 2 << endl;
for (int i = 0; i < n; i++) {
cout << i % 2 + 1 << " ";
}
cout << endl;
for (int i = 0; i < m; i++) {
cout << i + 1 << " " << i + 2 << endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3592kb
input:
1
output:
1024 1023 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 ...
result:
wrong answer The graph is not correct