CF1217C.The Number Of Good Substrings

You are given a binary string $s$ (recall that a string is binary if each character is either $0$ or $1$).

Let $f(t)$ be the decimal representation of integer $t$ written in binary form (possibly with leading zeroes). For example $f(011) = 3, f(00101) = 5, f(00001) = 1, f(10) = 2, f(000) = 0$ and $f(000100) = 4$.

The substring $s_{l}, s_{l+1}, \dots , s_{r}$ is good if $r - l + 1 = f(s_l \dots s_r)$.

For example string $s = 1011$ has $5$ good substrings: $s_1 \dots s_1 = 1$, $s_3 \dots s_3 = 1$, $s_4 \dots s_4 = 1$, $s_1 \dots s_2 = 10$ and $s_2 \dots s_4 = 011$.

Your task is to calculate the number of good substrings of string $s$.

You have to answer $t$ independent queries.

给你一个二进制字符串 $s$（回忆一下，若字符串中每个字符均为 $0$ 或 $1$，则称该字符串为二进制字符串）。

令 $f(t)$ 表示将整数 $t$ 以二进制形式（允许有前导零）写出后所对应的十进制数值。例如：$f(011) = 3$，$f(00101) = 5$，$f(00001) = 1$，$f(10) = 2$，$f(000) = 0$，以及 $f(000100) = 4$。

子串 $s_{l}, s_{l+1}, \dots , s_{r}$ 被称为好子串，当且仅当其长度满足 $r - l + 1 = f(s_l \dots s_r)$。

例如，字符串 $s = 1011$ 共有 $5$ 个好子串：$s_1 \dots s_1 = 1$，$s_3 \dots s_3 = 1$，$s_4 \dots s_4 = 1$，$s_1 \dots s_2 = 10$，以及 $s_2 \dots s_4 = 011$。

你的任务是计算字符串 $s$ 中好子串的个数。

你需要回答 $t$ 个相互独立的查询。

The first line contains one integer $t$ ($1 \le t \le 1000$) — the number of queries.

The only line of each query contains string $s$ ($1 \le |s| \le 2 \cdot 10^5$), consisting of only digits $0$ and $1$.

It is guaranteed that $\sum\limits_{i=1}^{t} |s_i| \le 2 \cdot 10^5$.

第一行包含一个整数 $t$（$1 \le t \le 1000$）—— 表示查询次数。

每个查询仅有一行，包含一个字符串 $s$（$1 \le |s| \le 2 \cdot 10^5$），该字符串仅由数字 $0$ 和 $1$ 组成。

保证 $\sum\limits_{i=1}^{t} |s_i| \le 2 \cdot 10^5$。

For each query print one integer — the number of good substrings of string $s$.

对于每个查询，输出一个整数——字符串 $s$ 中“好”子串的数量。