Codeforces div.2 C. Strange Test

题意：三种op，a--,b--,a|=b，要求找出使得a==b的最小操作数

思路：由于b<=10e6，又含有位操作，可以轻易推断出该题是含有二进制枚举的题，要使得操作数最小的情况（除开单纯b-a）就是使得a，b中a位上为1，b位上为0的操作数最小的a++,b++，断言一个结论，a,b只要有一个数加加就行了，因为最后总要使得a,b中最高不相同位相同，即a,b中那一方，最高不相同位为一，就是那一方需要++

#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<string>
#include<bitset>
#include<cmath>
#include<array>
#include<atomic>
#include<sstream>
#include<stack>
#include<iomanip>
//#include<bits/stdc++.h>

//#define int ll
#define IOS std::ios::sync_with_stdio(false);std::cin.tie(0);
#define pb push_back
#define endl '\n'
#define x first
#define y second
#define Endl endl
#define pre(i,a,b) for(int i=a;i<=b;i++)
#define rep(i,b,a) for(int i=b;i>=a;i--)
#define si(x) scanf("%d", &x);
#define sl(x) scanf("%lld", &x);
#define ss(x) scanf("%s", x);
#define YES {puts("YES");return;}
#define NO {puts("NO"); return;}
#define all(x) x.begin(),x.end()

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<int, PII> PIII;
typedef pair<char, int> PCI;
typedef pair<int, char> PIC;
typedef pair<double, double> PDD;
typedef pair<ll, ll> PLL;
const int N = 200010, M = 2 * N, B = N, MOD = 998244353;
const double eps = 1e-7;
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;

int dx[4] = { -1,0,1,0 }, dy[4] = { 0,1,0,-1 };
int n, m, k;
int ans = 0;

ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lowbit(ll x) { return x & -x; }
ll qmi(ll a, ll b, ll MOD) {
    ll res = 1;
    while (b) {
        if (b & 1) res = res * a % MOD;
        a = a * a % MOD;
        b >>= 1;
    }
    return res;
}

inline void init() {}

void slove()
{
    int a, b;
    cin >> a >> b;
    ans = b - a;
    int res1, res2;
    for (int i = 0; i <= a; i++)
    {
        int res1 = i;
        for (int j = 0; j <= 20; j++)
        {
            if ((a+i) >> j & 1 && !(b >> j & 1))
                res1 += 1 << j;
        }
        ans = min(res1 + 1, ans);
    }
    for (int i = 0; i <= a; i++)
    {
        int res2 = i;
        for (int j = 0; j <= 20; j++)
        {
            if (a >> j & 1 && !((b+i) >> j & 1))
                res2 += 1 << j;
        }
        ans = min(res2 + 1, ans);
    }
    cout << ans << endl;
}

signed main()
{
    //IOS;
    int _;
    si(_);
    //_ = 1;
    init();
    while (_--)
    {
        slove();
    }
    return 0;
}