QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #84499 | #5528. Least Annoying Constructive Problem | kkio | WA | 2ms | 3512kb | C++14 | 596b | 2023-03-06 15:25:58 | 2023-03-06 15:26:31 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int n;
int calc(int x){return (x-1+n)%n+1;}
int main()
{
scanf("%d",&n);
if(n&1)
{
for(int i=1;i<=n;i++)
for(int j=1;j<=(n-1)/2;j++)
{
int u=calc(i-j+1),v=calc(i+j);
if(u>v)swap(u,v);
printf("%d %d\n",u,v);
}
}
else
{
n--;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=(n-1)/2;j++)
{
if(i>=2&&j==1)printf("%d %d\n",i,n+1);
int u=calc(i-j+1),v=calc(i+j);
if(u>v)swap(u,v);
printf("%d %d\n",u,v);
}
}
printf("%d %d\n",1,n+1);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3416kb
input:
3
output:
1 2 2 3 1 3
result:
ok Correct
Test #2:
score: -100
Wrong Answer
time: 2ms
memory: 3512kb
input:
4
output:
1 2 2 4 2 3 3 4 1 3 1 4
result:
wrong answer Every consecutive n-1 edges have to form a tree, false for 1