#3767. XOR Sequences

XOR Sequences

题目描述

You are given two distinct non-negative integers x x and y y . Consider two infinite sequences a1,a2,a3, a_1, a_2, a_3, \ldots and b1,b2,b3, b_1, b_2, b_3, \ldots , where

  • an=nx a_n = n \oplus x ;
  • bn=ny b_n = n \oplus y .

Here, xy x \oplus y denotes the bitwise XOR operation of integers x x and y y .

For example, with x=6 x = 6 , the first 8 8 elements of sequence a a will look as follows: [7,4,5,2,3,0,1,14,] [7, 4, 5, 2, 3, 0, 1, 14, \ldots] . Note that the indices of elements start with 1 1 .

Your task is to find the length of the longest common subsegment ^\dagger of sequences a a and b b . In other words, find the maximum integer m m such that $ a_i = b_j, a_{i + 1} = b_{j + 1}, \ldots, a_{i + m - 1} = b_{j + m - 1} $ for some i,j1 i, j \ge 1 .

^\dagger A subsegment of sequence p p is a sequence pl,pl+1,,pr p_l,p_{l+1},\ldots,p_r , where 1lr 1 \le l \le r .

输入格式

Each test consists of multiple test cases. The first line contains a single integer t t ( 1t104 1 \le t \le 10^4 ) — the number of test cases. The description of the test cases follows.

The only line of each test case contains two integers x x and y y ( 0x,y109,xy 0 \le x, y \le 10^9, x \neq y ) — the parameters of the sequences.

输出格式

For each test case, output a single integer — the length of the longest common subsegment.

输入输出样例 #1

输入 #1

4
0 1
12 4
57 37
316560849 14570961

输出 #1

1
8
4
33554432

说明/提示

In the first test case, the first 7 7 elements of sequences a a and b b are as follows:

a=[1,2,3,4,5,6,7,] a = [1, 2, 3, 4, 5, 6, 7,\ldots]

b=[0,3,2,5,4,7,6,] b = [0, 3, 2, 5, 4, 7, 6,\ldots]

It can be shown that there isn't a positive integer k k such that the sequence [k,k+1] [k, k + 1] occurs in b b as a subsegment. So the answer is 1 1 .

In the third test case, the first 20 20 elements of sequences a a and b b are as follows:

$ a = [56, 59, 58, 61, 60, 63, 62, 49, 48, 51, 50, 53, 52, 55, 54, \textbf{41, 40, 43, 42}, 45, \ldots] $

$ b = [36, 39, 38, 33, 32, 35, 34, 45, 44, 47, 46, \textbf{41, 40, 43, 42}, 53, 52, 55, 54, 49, \ldots] $

It can be shown that one of the longest common subsegments is the subsegment [41,40,43,42] [41, 40, 43, 42] with a length of 4 4 .