链接 C. Mikasa
题意
给出一个 n n n, m m m 求 n n n ^ { 0 , 1 , 2 , ⋅ ⋅ ⋅ ⋅ ⋅ ⋅ , m } \left\{0,1,2,······,m\right \} {0,1,2,⋅⋅⋅⋅⋅⋅,m} 没有出现过的最小非负整数;
思路
首先,假设 k k k 为 n n n ^ { 0 , 1 , 2 , ⋅ ⋅ ⋅ ⋅ ⋅ ⋅ , m } \left\{0,1,2,······,m\right \} {0,1,2,⋅⋅⋅⋅⋅⋅,m} 没有出现过的最小非负整数,则 n n n ^ x x x = = = k k k,可知 x > m x > m x>m;
根据异或的性质,可知 n n n ^ x x x = = = k k k ⇔ \Leftrightarrow ⇔ n n n ^ k k k = = = x x x;
这样,只要按二进制枚举每一位,同时保证低位为 0
,当前位置的状态就是当前
k
k
k 的最小值(因为,当前状态除高位外,都是
0
0
0,如果发生变动,那么肯定是大于当前状态的),然后整体取
m
i
n
min
min 就可以;
同时要保证,在移位后 x x x 加一,因为 x > m x > m x>m;
AC 代码
#include <bits/stdc++.h>
#define mes memset
#define mec memcpy
#define x first
#define y second
#define pb push_back
#define be(x) (x).begin(), (x).end()
#define cl(x) memset((x), 0, sizeof (x))
#define sz(x) (int)(x).size()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<ll,ll> PLL;
const double pi = acos(-1);
const double eps = 1e-8;
const int N = 100010;
const int null = 0x3f3f3f3f,INF = 1e9;
const ll mod = 998244353;
int T;
ll n, m;
void solve()
{
scanf("%lld%lld", &n, &m);
if (n > m) cout << 0 << endl;
else
{
ll res = 0x3f3f3f3f3f3f3f3f;
for (int i = 0; i <= 32; i ++)
{
ll p = ((m >> i) + 1) << i;
ll q = (n >> i) << i;
res = min(res, q ^ p);
}
printf("%lld\n",res);
}
}
int main()
{
scanf("%d", &T);
while (T --)
{
solve();
}
}