Codeforces 1633 B - Minority Solution







///La ilaha illellahu muhammadur rasulullah
///******Bismillahir-Rahmanir-Rahim******///
///Abul Hasnat  Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int t,i,z,one;
    cin>>t;
    while(t--)
    {
        string s;
        z=0,one=0;
        cin>>s;
        for(i=0; i<s.size(); i++)
        {
            if(s[i]=='0')
                z++;
             else
            one++;
        }
         if(z!=one)
            cout<<min(z,one)<<endl;
        else
        cout<<z-1<<endl;
    }
}

No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.