题解 | x_to_y_2

#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using PII=pair<ll,ll>;
using PIII=pair<int,pair<int,int>>;
const ld ESP = 1e-10;
const ld PI = acosl(-1);
const int N=1e5+10;
const int M=2e5+10;
// const int mod = 1000000007;
const int mod = 998244353;
//随机化
random_device rd;
mt19937 gen(rd());
uniform_int_distribution<> dis(1, 1000000000);
// cout<<fixed<<setprecision(10);

void solve(){
    ll x,y;
    cin>>x>>y;
    int cnt=0;
    while(x){
        int ok=1;
        for(int i=0;i<=61;i++){
            if((x>>i&1ll)&&((y>>i&1ll)==0)){
                ok=0;
                break;
            }
        }
        if(ok){
            if(x!=y)cout<<cnt+1<<'\n';
            else cout<<cnt<<'\n';
            return ;
        }
        x>>=1;
        cnt++;
    }
    if(x!=y)cout<<cnt+1<<'\n';
    else cout<<cnt<<'\n';    
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int _=1;
    cin>>_;
    while(_--){
        solve();
    }
    return 0;
}