Submission #3924837
Source Code Expand
#include <iostream> using namespace std; int ans[500][500]; int main() { int n,k=1; scanf("%d",&n); while (k*(k-1)/2<n) k++; if (k*(k-1)/2==n) { printf("Yes\n%d\n",k); int cur=1; for (int i=0;i<k-1;i++) { for (int j=i;j<k-1;j++) ans[i][j]=cur+j-i; for (int j=i+1;j<k;j++) ans[j][i]=cur+j-i-1; cur+=k-i-1; } for (int i=0;i<k;i++) { printf("%d",k-1); for (int j=0;j<k-1;j++) printf(" %d",ans[i][j]); printf("\n"); } } else printf("No"); }
Submission Info
Submission Time | |
---|---|
Task | C - Align |
User | mohammedehab2002 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 519 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:7:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | WA | 1 ms | 256 KB |
02.txt | WA | 1 ms | 256 KB |
03.txt | WA | 1 ms | 256 KB |
04.txt | WA | 1 ms | 256 KB |
05.txt | WA | 1 ms | 256 KB |
06.txt | WA | 1 ms | 256 KB |
07.txt | WA | 1 ms | 256 KB |
08.txt | WA | 1 ms | 256 KB |
09.txt | WA | 1 ms | 256 KB |
10.txt | WA | 1 ms | 256 KB |
11.txt | WA | 1 ms | 256 KB |
12.txt | WA | 1 ms | 256 KB |
13.txt | WA | 1 ms | 256 KB |
14.txt | WA | 1 ms | 256 KB |
15.txt | WA | 1 ms | 256 KB |
16.txt | WA | 1 ms | 256 KB |
17.txt | WA | 1 ms | 256 KB |
18.txt | WA | 1 ms | 256 KB |
19.txt | WA | 1 ms | 256 KB |
20.txt | WA | 1 ms | 256 KB |
21.txt | WA | 1 ms | 256 KB |
22.txt | WA | 1 ms | 256 KB |
23.txt | WA | 1 ms | 256 KB |
24.txt | WA | 1 ms | 256 KB |
25.txt | WA | 1 ms | 256 KB |
26.txt | WA | 1 ms | 256 KB |
27.txt | WA | 1 ms | 256 KB |
28.txt | WA | 1 ms | 256 KB |
29.txt | WA | 1 ms | 256 KB |
30.txt | WA | 1 ms | 256 KB |
31.txt | WA | 1 ms | 256 KB |
32.txt | WA | 1 ms | 256 KB |
33.txt | WA | 1 ms | 256 KB |
34.txt | WA | 1 ms | 256 KB |
35.txt | WA | 1 ms | 256 KB |
36.txt | WA | 1 ms | 256 KB |
37.txt | WA | 1 ms | 256 KB |
s1.txt | WA | 1 ms | 256 KB |
s2.txt | WA | 1 ms | 256 KB |
s3.txt | WA | 1 ms | 256 KB |