-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path229.c
47 lines (39 loc) · 1.29 KB
/
229.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
/*
Solution for the problem 229 of aceptaelreto.com
- Cuentas paralelas -
Copyright (C) 2018 hnko
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <stdio.h>
int main(int argc, char const *argv[])
{
int num_movements, movements[100000], sum_up, sum_down, count, i;
while(1){
scanf("%d", &num_movements);
if (num_movements == 0) return 0;
sum_down = 0;
for (i=0; i < num_movements; i++){
scanf("%d", &movements[i]);
sum_down += movements[i];
}
sum_up = 0;
count = 0;
if (sum_up == sum_down) count++;
for (i = 0; i < num_movements; i++){
sum_down -= movements[i];
sum_up += movements[i];
if(sum_down == sum_up) count++;
}
printf("%d\n", count);
}
return 0;
}