Description
Once Bob took a paper stripe of n
Input
The first input line contains integer n (1 ≤ n ≤ 105) — amount of squares in the stripe. The second line contains n
Output
Output the amount of ways to cut the stripe into two non-empty pieces so that the sum of numbers from one piece is equal to the sum of numbers from the other piece. Don't forget that it's allowed to cut the stripe along the squares' borders only.
Sample Input
Input
9
1 5 -6 7 9 -16 0 -2 2 Output
3
Input
3
1 1 1
Output
Input
2
0 0
Output
1
簡單統計字首和就好了。
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
typedef long long LL;
const int low(int x){ return x&-x; }
const int mod = 51123987;
const int maxn = 1e5 + 10;
int n, a[maxn], sum, now, ans;
int main()
{
while (~scanf("%d",&n))
{
ans = sum = now = 0;
for (int i = 1; i <= n; i++)
{
scanf("%d", &a[i]);
sum += a[i];
}
for (int i = 1; i < n;i++)
{
now += a[i];
if (now + now == sum) ans++;
}
printf("%d\n", ans);
}
return 0;
}