Preparing NOJ

Once Bob took a paper stripe of *n* squares (the height of the stripe is 1 square). In each square he wrote an integer number, possibly negative. He became interested in how many ways exist to cut this stripe into two pieces so that the sum of numbers from one piece is equal to the sum of numbers from the other piece, and each piece contains positive integer amount of squares. Would you help Bob solve this problem?

The first input line contains integer *n* (1 ≤ *n* ≤ 10^{5}) — amount of squares in the stripe. The second line contains *n* space-separated numbers — they are the numbers written in the squares of the stripe. These numbers are integer and do not exceed 10000 in absolute value.

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.

9

1 5 -6 7 9 -16 0 -2 2

3

3

1 1 1

0

2

0 0

1

Info

Provider CodeForces

Origin Codeforces Beta Round #18 (Div. 2 Only)

Code CF18C

Tags

data structuresimplementation

Submitted 130

Passed 47

AC Rate 36.15%

Date 03/03/2019 20:02:05

Related