QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #346862 | #5528. Least Annoying Constructive Problem | ucup-team134 | WA | 0ms | 3848kb | C++17 | 416b | 2024-03-09 03:19:18 | 2024-03-09 03:19:19 |
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(i,n);
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3724kb
input:
3
output:
1 2 2 3 1 3
result:
ok Correct
Test #2:
score: 0
Accepted
time: 0ms
memory: 3764kb
input:
4
output:
1 2 1 4 2 3 2 4 1 3 3 4
result:
ok Correct
Test #3:
score: 0
Accepted
time: 0ms
memory: 3848kb
input:
5
output:
1 2 3 5 2 3 1 4 3 4 2 5 4 5 1 3 1 5 2 4
result:
ok Correct
Test #4:
score: -100
Wrong Answer
time: 0ms
memory: 3740kb
input:
6
output:
1 2 3 5 1 6 2 3 1 4 2 6 3 4 2 5 3 6 4 5 1 3 4 6 1 5 2 4 5 6
result:
wrong answer Every consecutive n-1 edges have to form a tree, false for 2