Ones and Zeroes I

Given a binary string, $f(S)$ is defined as follows: - A prefix $S[1, i]$ is called good if it contains at least as many ones as zeroes. - $f(S)$ is the number of good prefixes of the string $S$. --- You are given a binary string $S$ of length $N$. Find $f(S)$. ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - Each test case consists