Submission #3229511
Source Code Expand
#include<iostream>
int count = 0 ;
int n;
bool dfs(int *a,int i , int sum ,int presum ,int add ){
if(sum == 0 && add && presum != sum){
count++;
}
if(i < n){
if(add){
dfs(a,i+1,sum + a[i],sum,1);
}
else{
dfs(a,i+1 , sum,sum,0);
dfs(a,i+1,sum + a[i],sum,1);
}
}
}
int main(){
int j ;
scanf("%d",&n);
int a[n];
for ( j = 0 ; j < n ; j++ ){
scanf("%d",&a[j]);
}
dfs(a,0,0,0,0);
printf("%d\n",count);
return 0 ;
}
Submission Info
Submission Time
2018-09-20 16:29:34+0900
Task
A - Zero-Sum Ranges
User
rih0z
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
511 Byte
Status
WA
Exec Time
2104 ms
Memory
12416 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:21:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
./Main.cpp:24:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&a[j]);
^
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
2104 ms
4864 KB
subtask_1_04.txt
WA
928 ms
1920 KB
subtask_1_05.txt
TLE
2104 ms
4608 KB
subtask_1_06.txt
TLE
2104 ms
10368 KB
subtask_1_07.txt
TLE
2103 ms
12416 KB
subtask_1_08.txt
TLE
2104 ms
10368 KB
subtask_1_09.txt
TLE
2104 ms
10368 KB
subtask_1_10.txt
TLE
2104 ms
10368 KB
subtask_1_11.txt
TLE
2103 ms
12416 KB
subtask_1_12.txt
TLE
2104 ms
10368 KB
subtask_1_13.txt
TLE
2104 ms
10368 KB
subtask_1_14.txt
TLE
2104 ms
10368 KB
subtask_1_15.txt
TLE
2104 ms
10368 KB