1566B - MIN-MEX Cut - CodeForces Solution

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
#define f(i, n) for (ll i = 0; i < n; i++)
#define ff first
#define ss second
#define pb push_back
#define mpair make_pair
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
typedef map<ll, ll> mp;
typedef tree<int, null_type, less<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    indexed_set;
struct custom_hash
{
    static uint64_t splitmix64(uint64_t x)
    {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const
    {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
#define Code ios_base::sync_with_stdio(false);
#define By cin.tie(NULL);
#define Priyanshu cout.tie(NULL);

// __builtin_ffs(x) (Find First Set) which returns (the index of the least significant bits of x) + 1.
// __lg(x) which returns the index of the highest set bit.

void solve()
{
    string s;
    cin >> s ;
    int zc=count(s.begin(),s.end(),'0');
    if(zc==0) 
    {
        cout<<0<<endl;
        return;
    }
    int ffi =s.find('0');
    int lfi= s.rfind('0');
    if(lfi-ffi+1==zc)
    {
        cout<<1<<endl;
        return;
    }
    else
    {
        cout<<2<<endl;
        return;
    }
}
int main()
{
    Code By Priyanshu
        ll t;
    cin >> t;
    while (t--)
    {
        solve();
        
    }
   
    return 0;
}