Codeforces Round 944 (Div. 4) D. Binary Cut

Codeforces Round 944 (Div. 4)

D. Binary Cut

遇到 ‘10’ 分割一次,‘01’ 分割 n-1(n为’01’出现次数) 次

// By SnowDream
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e6+10;
string s;
int ans;
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    while(t--)
    {
        cin >> s;
        ans=1;
        if(s.size()<=1)
        {
            cout << ans << "\n";
            continue;
        }
        for(int i=1;i<s.size();++i)
        {
            if(s[i-1]=='1'&&s[i]=='0')
            {
                ans++;
            }
        }
        cout << ans << "\n";
    }
    return 0;
}