QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #334153 | #5528. Least Annoying Constructive Problem | Transparent | WA | 1ms | 3692kb | C++14 | 275b | 2024-02-21 11:46:39 | 2024-02-21 11:46:39 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
int n;
cin >> n;
for (int i = 1; i < n; ++i) {
for (int j = n; j > i; --j) cout << i << " " << j << "\n";
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3608kb
input:
3
output:
1 3 1 2 2 3
result:
ok Correct
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3692kb
input:
4
output:
1 4 1 3 1 2 2 4 2 3 3 4
result:
wrong answer Every consecutive n-1 edges have to form a tree, false for 3