void solve(){
    int numElements, maxSplit;
    cin>>numElements>>maxSplit;

    vector<int> elementSequence;
    elementSequence.push_back(numElements);

    int splitCount=0;
    while(elementSequence.size() < numElements)
    {
        int currentElement=elementSequence.back();
        elementSequence.erase(elementSequence.begin()+elementSequence.size()-1);
        for(int i=0;i<min(maxSplit-1,currentElement-1);i++)
        {
            elementSequence.push_back(1);
        }
        elementSequence.push_back(currentElement-maxSplit+1);
        splitCount++;
    }

    cout<<splitCount<<endl;
}

tahmid_test.cpp vaibhav2740 AbirVaiaJoss bt_fidato AryanSingh2099 brainard27 olympiad2027 kappss

void solve() {
    int n;
    cin >> n;
    string s;
    cin >> s;
    vector<int> v;
    char prev = '1';
    for (int i = 0; i < n; i++) {
        if (s[i] == '1') v.push_back(1);
        if (s[i] == '0' && prev == '1') v.push_back(0);
        prev = s[i];
    }
    int n0 = 0, n1 = 0;
    for (int i = 0; i < v.size(); i++) {
        if (v[i] == 1) n1++;
        else n0++;
    }
    if (n0 >= n1) cout << "NO" << endl;
    else cout << "YES" << endl;

def runcase():
    n = int(input())
    s = input()
    counter = [0, 0]
    
    q = int(s[0])
    counter[q] += 1
    
    for i in range(1, n):
        k = int(s[i])
        if s[i] == s[i - 1] and s[i - 1] == '0':
            continue
        counter[k] += 1
    
    if counter[1] > counter[0]:
        print("YES")
    else:
        print("NO")

def main():
    t = int(input())
    for _ in range(t):
        runcase()

if __name__ == "__main__":
    main()

Aditya4195 tahmid_test.cpp AryanSingh2099 bt_fidato AbirVaiaJoss Aj_coder_786

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int testCases = 1;
    cin >> testCases;
    while (testCases--) {
        int number;
        cin >> number;
        int sequenceLength = 0;
        vector<int> sequence;
        vector<int> bitPositions;
        for (int i = 0; i < 61; i++) {
            if (number & (1LL << i)) {
                sequenceLength++;
                bitPositions.push_back((1LL << i));
            }
        }
        sequenceLength++;
        sequence.push_back(number);
        for (auto bitPosition : bitPositions) {
            if (number - bitPosition > 0) {
                sequence.push_back(number - bitPosition);
            }
        }

        reverse(sequence.begin(), sequence.end());
        cout << sequence.size() << endl;
        for (auto element : sequence) {
            cout << element << " ";
        }
        cout << endl;
    }

void processNumber() {
    ull number;
    cin >> number;

    set<ull> uniqueNumbers;
    ull mask = 1;

    for (int i = 0; i < 64; ++i) {
        if (number & (mask << i) && (number ^ (mask << i))) {
            uniqueNumbers.insert(number ^ (mask << i));
        }
    }
    uniqueNumbers.insert(number);

    cout << uniqueNumbers.size() << endl;
    for (auto x : uniqueNumbers) {
        cout << x << " ";
    }
    cout << endl;
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int testCases;
    cin >> testCases;
    for (int i = 0; i < testCases; ++i) {
        processNumber();
    }
}

ll power(ll a, ll b)
{
    ll res = 1;
    while (b)
    {
        if (b & 1)
        {
            res = a;
            res %= N;
        }
        a= a;
        a %= N;
        b >>= 1;
    }
    return res;
}

void solve()
{
    ll n;
    cin >> n;
    ll val=1;
    vector<ll> ans;
    while(n>=val){
        if((n&val) && (n^val!=0)){
            ans.push_back(n ^ val);
        }
        val *= 2;
    }
    reverse(ans.begin(), ans.end());
    cout << ans.size()+1 << endl;
    for(auto it: ans){
        cout << it << " ";
    }
    cout << n << endl;
}

tahmid_test.cpp bt_fidato codingkrona avinash_mario olympiad2027 ROHAN_SAMUEL_J pallavshrm27 MT2023_IIITB KALiIi24 Aj_coder_786 vaibhav2740 skshitij269 sabbirsajids45 redex Divyanshudev suvvadaappalanaidu36 _godisgreat_07_ ElayV1313 its_zeno naitikjain olympiad2027 klu2100030960 SHARHOOD

AryanSingh2099 raunakgiri21 aditya_coder7 lohithmaturi Vardan_2021110 ts0139975 Phoenix750 sabbirsajids45 klu-2100030642cser bawal Your__Mom Sree_charan me_333 shivam9878009 miaplays kaneria_1 miaplays vaibhav2740 AbirVaiaJoss zzczzzzz vaibhav2740

d4 online