A14394 | Mikasa
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given two integers $n$ and $m$ . Find the $\operatorname{MEX}$ of the sequence $n \oplus 0, n \oplus 1, \ldots, n \oplus m$ . Here, $\oplus$ is the [bitwise XOR operator](https://en.wikipedia.org/wiki/Bitwise_operation#XOR).
$\operatorname{MEX}$ of the sequence of non-negative integers is the smallest non-negative integer that doesn't appear in this sequence. For example, $\operatorname{MEX}(0, 1, 2, 4) = 3$ , and $\operatorname{MEX}(1, 2021) = 0$ .
$\operatorname{MEX}$ of the sequence of non-negative integers is the smallest non-negative integer that doesn't appear in this sequence. For example, $\operatorname{MEX}(0, 1, 2, 4) = 3$ , and $\operatorname{MEX}(1, 2021) = 0$ .
输入格式
The first line contains a single integer $t$ ( $1 \le t \le 30\,000$ ) — the number of test cases.
The first and only line of each test case contains two integers $n$ and $m$ ( $0 \le n, m \le 10^9$ ).
The first and only line of each test case contains two integers $n$ and $m$ ( $0 \le n, m \le 10^9$ ).
输出格式
For each test case, print a single integer — the answer to the problem.
输入输出样例
输入 #1
5 3 5 4 6 3 2 69 696 123456 654321
输出 #1
4 3 0 640 530866
In the first test case, the sequence is $3 \oplus 0, 3 \oplus 1, 3 \oplus 2, 3 \oplus 3, 3 \oplus 4, 3 \oplus 5$ , or $3, 2, 1, 0, 7, 6$ . The smallest non-negative integer which isn't present in the sequence i. e. the $\operatorname{MEX}$ of the sequence is $4$ .
In the second test case, the sequence is $4 \oplus 0, 4 \oplus 1, 4 \oplus 2, 4 \oplus 3, 4 \oplus 4, 4 \oplus 5, 4 \oplus 6$ , or $4, 5, 6, 7, 0, 1, 2$ . The smallest non-negative integer which isn't present in the sequence i. e. the $\operatorname{MEX}$ of the sequence is $3$ .
In the third test case, the sequence is $3 \oplus 0, 3 \oplus 1, 3 \oplus 2$ , or $3, 2, 1$ . The smallest non-negative integer which isn't present in the sequence i. e. the $\operatorname{MEX}$ of the sequence is $0$ .
In the second test case, the sequence is $4 \oplus 0, 4 \oplus 1, 4 \oplus 2, 4 \oplus 3, 4 \oplus 4, 4 \oplus 5, 4 \oplus 6$ , or $4, 5, 6, 7, 0, 1, 2$ . The smallest non-negative integer which isn't present in the sequence i. e. the $\operatorname{MEX}$ of the sequence is $3$ .
In the third test case, the sequence is $3 \oplus 0, 3 \oplus 1, 3 \oplus 2$ , or $3, 2, 1$ . The smallest non-negative integer which isn't present in the sequence i. e. the $\operatorname{MEX}$ of the sequence is $0$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted