Codeforces-SolutionsA/Codes/1979 B - XOR Sequences/1979B.cpp

32 lines
590 B
C++
Raw Normal View History

2024-06-07 02:16:47 +08:00
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
ll pow(ll x,ll y,ll m=1e9+7){ll ans=1;x%=m;while(y){if(y&1)ans=(ans*x)%m;x=(x*x)%m;y>>=1;}return ans;}
void solve()
{
int x, y;
cin >> x >> y;
int ans=0;
while(true)
{
if((x^y)&1) break;
ans++;
x>>=1;
y>>=1;
}
cout<<(1<<ans)<<endl;
}
signed main()
{
ios_base::sync_with_stdio(false), cin.tie(nullptr);
int TCS = 1;
cin >> TCS;
for (int TC = 1; TC <= TCS; ++TC)
{
// cout<<"Case "<<TC<<": ";
solve();
}
}