Codeforces-SolutionsA/Codes/1971 D - Binary Cut/1971D.cpp

30 lines
604 B
C++

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
ll pow(ll x,ll y,ll m=1e9+7){ll ans=1;x%=m;while(y){if(y&1)ans=(ans*x)%m;x=(x*x)%m;y>>=1;}return ans;}
void solve()
{
string s;
cin>>s;
ll ans=1, f=0;
for(int i=1; i<s.size(); ++i)
{
ans += (s[i] != s[i-1]);
f |= (s[i]=='1' && s[i-1]=='0');
}
cout<<ans-f<<endl;
}
signed main()
{
ios_base::sync_with_stdio(false), cin.tie(nullptr);
int TCS = 1;
cin >> TCS;
for (int TC = 1; TC <= TCS; ++TC)
{
// cout<<"Case "<<TC<<": ";
solve();
}
}