QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #425934 | #5528. Least Annoying Constructive Problem | Diu | WA | 0ms | 3932kb | C++14 | 476b | 2024-05-30 19:10:55 | 2024-05-30 19:10:55 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int n;
void prt(int u,int v){
u=(u%n+n)%n+1,v=(v%n+n)%n+1;
if(u>v)swap(u,v);
printf("%d %d\n",u,v);
}
signed main(){
scanf("%d",&n);
if(n&1){
for(int i=0;i<=n/2;i++){
for(int j=0;j<n/2;j++)prt(j-i+1,n-j-i);
if(i==n/2)break;
for(int j=1;j<=n/2;j++)prt(j-i,n-j-i);
}
}else{
for(int i=0;i<n/2;i++){
for(int j=1;j<n/2;j++)prt(j+i,n-j+i);
for(int j=0;j<n/2;j++)prt(j+i+1,n-j+i);
}
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3928kb
input:
3
output:
1 2 2 3 1 3
result:
ok Correct
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3932kb
input:
4
output:
2 4 1 2 3 4 1 3 2 3 1 4
result:
wrong answer Every consecutive n-1 edges have to form a tree, false for 5