-
Notifications
You must be signed in to change notification settings - Fork 0
/
18C.cpp
41 lines (34 loc) · 982 Bytes
/
18C.cpp
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
#include <vector>
#include <string>
#include <iostream>
#include <cstdio>
#include <sstream>
#include <cctype>
#include <utility>
#include <algorithm>
#include <math.h>
using namespace std;
#define ll long long
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define SZ(S) ((int) ((S).k()))
#define DEBUG(x) { cout << #x << " = " << x << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
int main(){
int x;
scanf("%d", &x);
int a[100000], s1 = 0, s2 = 0, r = 0;
REP(i, x){
cin >> a[i];
(i != x-1 ? s1+= a[i] : s2+=a[i]);
}
for(int i = x-2; i>=0; i--){
if(s1==s2) r++;
s1 -= a[i]; s2 += a[i];
}
printf("%d\n", r);
return 0;
}