题意:给定一个串,问有几个子串的二进制转十进制数和区间长度相等。
思路:本题的解题关键在于串的长度为2e5,所以1开头的最长20不到。所以对于每个一只需要去枚举到后二十位即可。
/*keep on going and never give up*/
#include<cstdio>
#include<iostream>
#include<queue>
#include<algorithm>
using namespace std;
#define int long long
typedef pair<int, int> pii;
#define lowbit(x) x&(-x)
#define endl '\n'
#define wk is zqx ta die
signed main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
string s;
cin >> s;
int sz = s.size();
s = '!' + s;
int cnt = 0;
int ans = 0;
for (int i = 1; i <= sz; i++) {
if (s[i] == '1') {
int ky = 0;
for (int j = i; j <= i + 20 && j <= sz; j++) {
ky = ky * 2 + (s[j] == '1');
if (ky <= j - i + 1 + cnt) {
ans++;
}
}
cnt = 0;
} else {
cnt++;
}
}
cout << ans << endl;
}
return 0;
}