#pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define IOS std::ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define endl '\n'
void solve()
{
ll n,m;
cin>>n>>m;
ll l=max(n-m,0ll);
ll r=n+m;
ll ans=0;
for(int i=31;i>=0;i--)
{
if((l&(1ll<<i))||(r&(1ll<<i))||(l>>(i+1)!=(r>>(i+1))))//取高位 高位不同 l和r不同
ans|=(1ll<<i);
}
cout<<ans<<endl;
}
int main() {
IOS;
int t;
cin>>t;
while(t--)
{
solve();
}
}
Codeforces Round 949 (Div. 2) B
最新推荐文章于 2024-09-27 14:28:55 发布