1902A - Binary Imbalance - CodeForces Solution

#include <bits/stdc++.h>
    #include <iostream>
    using namespace std;
    #define sz(x) ((int)(x).size())
    #define all(x) (x).begin(), (x).end()
    #define forr(i, a) for (int i = 0; i < (a); ++i)
    #define forc(i, a) for (int i = 1; i <= (a); ++i)
    #define fora(i, a, b) for (int i = (a); i <= (b); ++i)
    #define fore(it, x) for (auto &it : (x))
    #define range(i, a, b, c) for (int i = (a); (c) > 0 ? i <= (b) : i >= (b); i += (c))
    #define sum(v,r) fore(i,(v)) r+=i
    #define res(v,r) fore(i,(v)) r-=i
    #define mul(v,r) fore(i,(v)) r*=i
    #define div(v,r) fore(i,(v)) r/=i
    #define mtx(m,a,b) vector<int[(a)]> m(b) 
    #define pb push_back
    #define pob pop_back
    #define emb emplace_back
    #define mak make_pair
    #define mkt make_tuple
    typedef long long ll;
    typedef long double ld;
    inline bool sol(){
        int t;cin>>t;string s;cin>>s;
        forr(u,t) {
            if(!(int(s[u])-'0')){return true;}
        }
        return false;
    }
    int main(){
        int l;scanf("%d",&l);
        while(l--){
            if(sol()){puts("YES");}else{puts("NO");}
        }
    }