TLE 36pts
查看原帖
TLE 36pts
804115
yzm0325楼主2023/8/7 09:24
#include <bits/stdc++.h>
using namespace std;
long long t, n, m;
int main() {
    cin >> t;
    while(t--) {
        cin >> n >> m;
        if(n == m) {
            cout << 0 << '\n';
            continue;
        }
        int maxn = max(n, m);
        int f0 = 0, f1 = 0;
        while(maxn) {
            int a = n & 1;
            int b = m & 1;
            if(!a && b) f1 = 1;
            if(a && !b) f0 = 1;
            n >>= 1;
            m >>= 1;
            maxn >>= 1;
            //cout << '[' << n << ' ' << m << ' ' << maxn << "]\n";
        }
        cout << f0 + f1 << '\n';
    }
}

救命!

2023/8/7 09:24
加载中...