A13840 | $XORwice$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

In order to celebrate Twice's 5th anniversary, Tzuyu and Sana decided to play a game. Tzuyu gave Sana two integers $a$ and $b$ and a really important quest. In order to complete the quest, Sana has to output the smallest possible value of ( $a \oplus x$ ) + ( $b \oplus x$ ) for any given $x$ , where $\oplus$ denotes the [bitwise XOR operation](http://en.wikipedia.org/wiki/Bitwise_operation#XOR).

Each test contains multiple test cases. The first line contains the number of test cases $t$ ( $1 \le t \le 10^{4}$ ). Description of the test cases follows. The only line of each test case contains two integers $a$ and $b$ ( $1 \le a, b \le 10^{9}$ ).

For each testcase, output the smallest possible value of the given expression.

输入 #1

输出 #1

C++ 编辑器

输入

输出