Задачи
Нулевая строка
include <bits/stdc++.h>
define ll long long int
define ld long double
using namespace std; int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, k, ans = 0, say = 0, cvb = 0;
cin>>n;
string m;
for(int i = 0; i<n; i++){
cin>>k;
cin>>m;
for(int j = 0; j<m.size(); j++){
char s = m[j];
if(s == '0'){
ans++;
}
else{
say++;
}
}
if(ans<say){
cvb++;
cvb+=(m.size()-say);
}
else{
cvb+=(m.size()-ans);
}
cout<<cvb<<endl;
say = 0;
ans = 0;
cvb = 0;
}
} //TECHNOBLADE NEVER DIES
pragma GCC optimize("O2,O3,Ofast,unroll-loops")
pragma GCC target("sse,sse2,sse3,sse3,sse4,sse4.1,sse4.2,popcnt,lzcnt,abm,mmx,avx,avx2,fma,bmi,bmi2")
include <bits/stdc++.h>
typedef long double ld;
define p64 pair<ll,ll>
define pdd pair<double,double>
define lcm(a, b) ((a/gcd(a,b))*b)
define forn(i,e) for(ll i = 0; i < e; i++)
define forsn(i,s,e) for(ll i = s; i < e; i++)
define rforn(i,s) for(ll i = s; i >= 0; i--)
define rforsn(i,s,e) for(ll i = s; i >= e; i--)
define ln "\n"
define dbg(x) cout<<#x<<" = "<<x<<ln
define ll long long
define vint vector<int>
define vs vector<string>
define sint set<int>
define ss set<string>
define mint map<int, int>
define lb lower_bound
define ub upper_bound
define ins insert
define F first
define S second
define yes cout << "Yes\n"
define no cout << "No\n"
define ins insert
define TADICONFIRE iosbase::syncwith_stdio(0); cin.tie(0); cout.tie(0);
/** WRITEN BY YOU ░█████╗░░░░░░░░░░░░░░░ ██╔══██╗░░██╗░░░░██╗░░ ██║░░╚═╝██████╗██████╗ ██║░░██╗╚═██╔═╝╚═██╔═╝ ╚█████╔╝░░╚═╝░░░░╚═╝░░ ░╚════╝░░░░░░░░░░░░░░░
*/
define ull unsigned long long
define en "\n"
define pb push_back
define INF 1001
define ll long long
define fr(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
define ld long double
define ull unsigned long long
define maximum 9223372036854775807
define minimum -maximum
define ld long double
define sz(x) (int)(x).size()
const int sz=1e4+7; using namespace std; void solve(){ ll n; cin>>n; string s; cin>>s; ll cnt=0,cntt=0; for(int i=0;i<s.size();i++){ if(s[i]=='1'){ cnt++; } else{ cntt++; } }
cout<<min(cnt,cntt+1)<<en; cnt=0; } int main() { TADICONFIRE; ll t; cin>>t; while(t--){ solve(); } }
hahhahahaha