QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#665951#8934. Challenge NPClytqwq#WA 0ms3796kbC++14374b2024-10-22 16:00:422024-10-22 16:00:43

Judging History

This is the latest submission verdict.

  • [2024-10-22 16:00:43]
  • Judged
  • Verdict: WA
  • Time: 0ms
  • Memory: 3796kb
  • [2024-10-22 16:00:42]
  • Submitted

answer

#include<bits/stdc++.h>
#define fo(i,x,y) for(int i=x;i<=y;++i)
#define go(i,x,y) for(int i=x;i>=y;--i)
#define re return
using namespace std;

signed main(){
    int k;cin>>k;k+=2;
    int n=2*k,m=k*(k-1);
    cout<<n<<' '<<m<<' '<<"2\n";
    fo(i,1,n) cout<<(i>k?2:1)<<' ';puts("");
    fo(i,2,k) fo(j,1,i-1) printf("%d %d\n%d %d\n",i,j+k,i+k,j); 
    re 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 3796kb

input:

1

output:

6 6 2
1 1 1 2 2 2 
2 4
5 1
3 4
6 1
3 5
6 2

result:

wrong answer The graph is not correct