QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #630330 | #9415. Matrix | futarian | WA | 0ms | 3912kb | C++14 | 419b | 2024-10-11 17:57:20 | 2024-10-11 17:57:20 |
Judging History
answer
#include "bits/stdc++.h"
using namespace std;
int n;
signed main()
{
puts("Yes");
scanf("%d",&n);
for(int i = 1 ; i <= n ; i ++) printf("%d ",i);puts("");
int w = n + 1;
for(int j = 2 ; j <= n - 1 ; j ++)
{
printf("%d ",w ++);
for(int i = 2 ; i <= n ; i ++) printf("%d ",1);
puts("");
}
for(int i = 1 ; i <= n - 2 ; i ++) printf("%d ",1);
printf("%d %d\n",2 * n - 1,2 * n);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3912kb
input:
2
output:
Yes 1 2 3 4
result:
ok Correct. (1 test case)
Test #2:
score: 0
Accepted
time: 0ms
memory: 3904kb
input:
3
output:
Yes 1 2 3 4 1 1 1 5 6
result:
ok Correct. (1 test case)
Test #3:
score: -100
Wrong Answer
time: 0ms
memory: 3764kb
input:
4
output:
Yes 1 2 3 4 5 1 1 1 6 1 1 1 1 1 7 8
result:
wrong answer The number of quadruples 3 is invalid. (test case 1)