Submission #3228462
Source Code Expand
#include<iostream> int main(){ int n ; scanf("%d",&n); int a[n]; int i ,j,k,l; int count = 0 ; for ( i = 0 ; i < n ; i++ ){ scanf("%d",&a[i]); } int sum[n-1] ; for(k = 0 ; k < n - 1 ; k++){ for (i = 0 ; i < n ; i++){ sum[k] = a[i]; if (i+1 != n&& i+k+1 < n){ for(l = i+1 ; l < k+i+1 ; l++) if(l < n )sum[k] += a[l]; if( sum[k] == -a[i+k + 1 ]) { count++; } } } } printf("%d\n",count); return 0 ; }
Submission Info
Submission Time | |
---|---|
Task | A - Zero-Sum Ranges |
User | rih0z |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 523 Byte |
Status | WA |
Exec Time | 2107 ms |
Memory | 1024 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:5:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.cpp:10:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&a[i]); ^
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 200 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask_1_01.txt | AC | 1 ms | 256 KB |
subtask_1_02.txt | WA | 1 ms | 256 KB |
subtask_1_03.txt | TLE | 2103 ms | 640 KB |
subtask_1_04.txt | TLE | 2103 ms | 384 KB |
subtask_1_05.txt | TLE | 2103 ms | 512 KB |
subtask_1_06.txt | TLE | 2103 ms | 1024 KB |
subtask_1_07.txt | TLE | 2103 ms | 1024 KB |
subtask_1_08.txt | TLE | 2103 ms | 1024 KB |
subtask_1_09.txt | TLE | 2103 ms | 1024 KB |
subtask_1_10.txt | TLE | 2107 ms | 1024 KB |
subtask_1_11.txt | TLE | 2103 ms | 1024 KB |
subtask_1_12.txt | TLE | 2103 ms | 1024 KB |
subtask_1_13.txt | TLE | 2103 ms | 1024 KB |
subtask_1_14.txt | TLE | 2103 ms | 1024 KB |
subtask_1_15.txt | TLE | 2103 ms | 1024 KB |