[Solution] Simple XOR CodeChef Solution | CodeChef Problem Solution 2022

[Solution] Simple XOR CodeChef Solution | CodeChef Problem Solution 2022

You are given two integers L$L$ and R(L+3≤R)$R(L+3\le R)$. Output any four distinct integers between L$L$ and R$R$ (inclusive) such that their bitwise XOR is zero.

More formally, output any four integers a1,a2,a3,a4$a_1,a_2,a_3,a_4$ such that:

• a1⊕a2⊕a3⊕a4=0$a_1\oplus a_2\oplus a_3\oplus a_4=0$
• L≤a1,a2,a3,a4≤R$L\le a_1,a_2,a_3,a_4\le R$
• ai=aj$a_i=a_j$ if and only if i=j$i=j$

Solution Click Below:-  CLICK HERE

If more than one such quadruple exists, you may output any of them. If no such quadruple exists, print −1$-1$ instead.

Input Format

• The first line of input will contain a single integer T$T$, the number of test cases. The description of the test cases follows.

Rating Improvement CodeChef Solution

Playlist CodeChef Solution

First and Last CodeChef Solution

Simple XOR CodeChef Solution

Break the Stick CodeChef Solution

The two numbers CodeChef Solution 

Split AND Sum CodeChef Solution

• Each test case consists of a single line of input, containing two space-separated integers L,R$L,R$.

Output Format

For each testcase, output any four distinct integers between L$L$ and R$R$ such that their bitwise XOR is zero, or output −1$-1$ in case no such quadruple of four distinct integers exists.

Constraints

• 1≤T≤1000$1\le T\le 1000$
• 1≤L,R≤109$1\le L,R\le {10}^9$
• L+3≤R$L+3\le R$, so there are at least four distinct integers in the range.