I see what you've done there, stealing contribution from the contest admin yash_daga! /j

Auto comment: topic has been updated by Dominater069 (previous revision, new revision, compare).

Dominater round

C++23 when

interesting problems!!

good problems

Can someone help me find the bug in my code for Binary Conversion? I can't seem to find what's wrong with the code. A small counterexample would be appreciated.

Edit: nevermind, generated testcases against a correct solution and found the bug

void solve(){
    int n, k;
    cin >> n >> k;
    string s1, s2;
    cin >> s1 >> s2;
    auto temp1 = s1, temp2 = s2;
    sort(temp1.begin(),temp1.end()); sort(temp2.begin(),temp2.end());
    if(temp1!=temp2) {
        cout << "NO" << endl;
        return;
    }
    int dif = 0;
    for(int i = 0; i < n; i++) if(s1[i] != s2[i]) dif++;
    bool ok = true;
    if(n==2) {
        if(s1!=s2 && k%2 ==0) ok = false; 
        else if (s1==s2 && k%2 ==1) ok = false;
        if(ok) cout << "YES" << endl;
        else cout << "NO" << endl;
        return;
        
    }
    if(dif/2 <= k) cout << "YES" << endl;
    else cout << "NO" << endl;
}

Can someone tell me how do you solve LEXMINBIN from yesterday's contest? Thanks

Nice problems!