QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #430215 | #5528. Least Annoying Constructive Problem | 36champ | WA | 1ms | 3732kb | C++20 | 364b | 2024-06-03 16:01:24 | 2024-06-03 16:01:25 |
Judging History
answer
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
for(int i=1; i<=n; i++)
{
for(int j=i+1; j<=n; j++)
{
cout << j - i << " " << j << "\n";
}
}
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3732kb
input:
3
output:
1 2 2 3 1 3
result:
ok Correct
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3688kb
input:
4
output:
1 2 2 3 3 4 1 3 2 4 1 4
result:
wrong answer Every consecutive n-1 edges have to form a tree, false for 4