CF1554C.Mikasa

普及+/提高

通过率:0%

时间限制:1.00s

内存限制:256MB

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

You are given two integers nn and mm. Find the MEX⁡\operatorname{MEX} of the sequence n⊕0,n⊕1,…,n⊕mn \oplus 0, n \oplus 1, \ldots, n \oplus m. Here, ⊕\oplus is the bitwise XOR operator.

MEX⁡\operatorname{MEX} of the sequence of non-negative integers is the smallest non-negative integer that doesn't appear in this sequence. For example, MEX⁡(0,1,2,4)=3\operatorname{MEX}(0, 1, 2, 4) = 3, and MEX⁡(1,2021)=0\operatorname{MEX}(1, 2021) = 0.

给你两个整数 nn 和 mm。求序列 n⊕0,n⊕1,…,n⊕mn \oplus 0, n \oplus 1, \ldots, n \oplus m 的 MEX⁡\operatorname{MEX}。其中,⊕\oplus 是按位异或运算符。

非负整数序列的 MEX⁡\operatorname{MEX} 是未出现在该序列中的最小非负整数。例如,MEX⁡(0,1,2,4)=3\operatorname{MEX}(0, 1, 2, 4) = 3,而 MEX⁡(1,2021)=0\operatorname{MEX}(1, 2021) = 0。

输入格式

The first line contains a single integer tt (1≤t≤30 0001 \le t \le 30\,000) — the number of test cases.

The first and only line of each test case contains two integers nn and mm (0≤n,m≤1090 \le n, m \le 10^9).

第一行包含一个整数 tt(1≤t≤30 0001 \le t \le 30\,000)—— 表示测试用例的数量。

每个测试用例仅有一行,包含两个整数 nn 和 mm(0≤n,m≤1090 \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⊕0,3⊕1,3⊕2,3⊕3,3⊕4,3⊕53 \oplus 0, 3 \oplus 1, 3 \oplus 2, 3 \oplus 3, 3 \oplus 4, 3 \oplus 5, or 3,2,1,0,7,63, 2, 1, 0, 7, 6. The smallest non-negative integer which isn't present in the sequence i. e. the MEX⁡\operatorname{MEX} of the sequence is 44.

In the second test case, the sequence is 4⊕0,4⊕1,4⊕2,4⊕3,4⊕4,4⊕5,4⊕64 \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,24, 5, 6, 7, 0, 1, 2. The smallest non-negative integer which isn't present in the sequence i. e. the MEX⁡\operatorname{MEX} of the sequence is 33.

In the third test case, the sequence is 3⊕0,3⊕1,3⊕23 \oplus 0, 3 \oplus 1, 3 \oplus 2, or 3,2,13, 2, 1. The smallest non-negative integer which isn't present in the sequence i. e. the MEX⁡\operatorname{MEX} of the sequence is 00.

在第一个测试用例中,序列为 3⊕0,3⊕1,3⊕2,3⊕3,3⊕4,3⊕53 \oplus 0, 3 \oplus 1, 3 \oplus 2, 3 \oplus 3, 3 \oplus 4, 3 \oplus 5,即 3,2,1,0,7,63, 2, 1, 0, 7, 6。该序列中未出现的最小非负整数(即该序列的 MEX⁡\operatorname{MEX})为 44。

在第二个测试用例中,序列为 4⊕0,4⊕1,4⊕2,4⊕3,4⊕4,4⊕5,4⊕64 \oplus 0, 4 \oplus 1, 4 \oplus 2, 4 \oplus 3, 4 \oplus 4, 4 \oplus 5, 4 \oplus 6,即 4,5,6,7,0,1,24, 5, 6, 7, 0, 1, 2。该序列中未出现的最小非负整数(即该序列的 MEX⁡\operatorname{MEX})为 33。

在第三个测试用例中,序列为 3⊕0,3⊕1,3⊕23 \oplus 0, 3 \oplus 1, 3 \oplus 2,即 3,2,13, 2, 1。该序列中未出现的最小非负整数(即该序列的 MEX⁡\operatorname{MEX})为 00。

输入解题思路,AI测评打分。不知道怎么写?

首页