QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #346868 | #5528. Least Annoying Constructive Problem | ucup-team134 | WA | 0ms | 3848kb | C++17 | 420b | 2024-03-09 03:28:33 | 2024-03-09 03:28:34 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int m;
int add(int a,int b){
a+=b;
a%=m;
if(a<0)a+=m;
if(a==0)a=m;
return a;
}
void Edge(int u,int v){
if(u>v)swap(u,v);
printf("%i %i\n",u,v);
}
int main(){
int n;
scanf("%i",&n);
m=n%2==1?n:n-1;
for(int i=1;i<=m;i++){
for(int j=0;j<m/2;j++){
Edge(add(i,-j),add(i,j+1));
}
if(n%2==0){
Edge(m-i+1,n);
}
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3848kb
input:
3
output:
1 2 2 3 1 3
result:
ok Correct
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3840kb
input:
4
output:
1 2 3 4 2 3 2 4 1 3 1 4
result:
wrong answer Every consecutive n-1 edges have to form a tree, false for 1