Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Fair Binary Split

Fair Binary Split

Difficulty: 1200 2000 ms 128 MB

strings prefix-sums

Count the ways to cut the binary string into two non-empty parts so both parts contain the same number of 1s.

Input: one line with a binary string.

Output: the number of valid cut positions.

Constraints:

  • 2 ≤ |S| ≤ 105

Sample Tests

Input 1
0101
Output 1
2
Input 2
111
Output 2
0

Read the Editorial Statistics

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.
Ctrl+Enter submit · Ctrl+Space autocomplete · F11 fullscreen