Submission #1131250
Source Code Expand
#include <stdio.h> int main (void){ int n; scanf("%d\n",&n); char data[n][n]; int loop1,loop2; int how_b=0; for(loop1=0;loop1<n;loop1++){ for(loop2=0;loop2<n;loop2++){ scanf("%c",&data[loop1][loop2]); if(data[loop1][loop2]=='#')how_b++; } scanf("\n"); } if(how_b==0){ printf("-1\n"); return 0; } if(how_b==n*2){ printf("0\n"); return 0; } }
Submission Info
Submission Time | |
---|---|
Task | B - Row to Column |
User | infer496 |
Language | C (GCC 5.4.1) |
Score | 0 |
Code Size | 492 Byte |
Status | WA |
Exec Time | 10 ms |
Memory | 384 KB |
Compile Error
./Main.c: In function ‘main’: ./Main.c:4:5: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d\n",&n); ^ ./Main.c:10:13: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] scanf("%c",&data[loop1][loop2]); ^ ./Main.c:13:9: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result] scanf("\n"); ^
Judge Result
Set Name | Sample | Subtask | All | ||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | 0 / 1000 | ||||||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt |
Subtask | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 2_00.txt, 2_01.txt, 2_02.txt, 2_03.txt, 2_04.txt, 2_05.txt, 2_06.txt, 2_07.txt, 2_08.txt, 2_09.txt, 2_10.txt, 2_11.txt, 2_12.txt, 2_13.txt, 2_14.txt, 2_15.txt, 2_16.txt, 2_17.txt, 2_18.txt, 2_19.txt, 2_20.txt, 2_21.txt, 2_22.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | WA | 1 ms | 128 KB |
0_01.txt | AC | 1 ms | 128 KB |
0_02.txt | AC | 0 ms | 128 KB |
0_03.txt | WA | 1 ms | 128 KB |
0_04.txt | WA | 0 ms | 128 KB |
1_00.txt | AC | 0 ms | 128 KB |
1_01.txt | WA | 0 ms | 128 KB |
1_02.txt | WA | 0 ms | 128 KB |
1_03.txt | WA | 0 ms | 128 KB |
1_04.txt | WA | 0 ms | 128 KB |
1_05.txt | WA | 0 ms | 128 KB |
1_06.txt | WA | 0 ms | 128 KB |
1_07.txt | WA | 0 ms | 128 KB |
1_08.txt | WA | 0 ms | 128 KB |
1_09.txt | WA | 0 ms | 128 KB |
1_10.txt | WA | 0 ms | 128 KB |
1_11.txt | WA | 0 ms | 128 KB |
1_12.txt | AC | 0 ms | 128 KB |
1_13.txt | WA | 0 ms | 128 KB |
1_14.txt | WA | 0 ms | 128 KB |
2_00.txt | AC | 10 ms | 384 KB |
2_01.txt | WA | 10 ms | 384 KB |
2_02.txt | WA | 10 ms | 384 KB |
2_03.txt | WA | 10 ms | 384 KB |
2_04.txt | WA | 10 ms | 384 KB |
2_05.txt | WA | 10 ms | 384 KB |
2_06.txt | WA | 10 ms | 384 KB |
2_07.txt | WA | 7 ms | 384 KB |
2_08.txt | WA | 10 ms | 384 KB |
2_09.txt | WA | 9 ms | 384 KB |
2_10.txt | WA | 9 ms | 384 KB |
2_11.txt | WA | 10 ms | 384 KB |
2_12.txt | WA | 9 ms | 384 KB |
2_13.txt | WA | 8 ms | 384 KB |
2_14.txt | WA | 9 ms | 384 KB |
2_15.txt | WA | 8 ms | 384 KB |
2_16.txt | WA | 8 ms | 384 KB |
2_17.txt | WA | 8 ms | 384 KB |
2_18.txt | WA | 7 ms | 256 KB |
2_19.txt | WA | 9 ms | 384 KB |
2_20.txt | WA | 7 ms | 256 KB |
2_21.txt | WA | 6 ms | 256 KB |
2_22.txt | WA | 10 ms | 384 KB |