[Solution] Prime Xor CodeChef Solution | Codechef Solution

[Solution] Prime Xor CodeChef Solution | Codechef Solution

For 3$3$ distinct prime integers A,B,$A,B,$ and C$C$ (1<A,B,C<230)$(1<A,B,C<2^{30})$, we define positive integers X,Y,$X,Y,$ and Z$Z$ as:
X=A⊕B,Y=B⊕C,$X=A\oplus B,Y=B\oplus C,$ and Z=C⊕A$Z=C\oplus A$, where ⊕$\oplus$ denotes the bitwise XOR operation.

Given only two integers X$X$ and Y$Y$ and the fact that at least one integer amongst X,Y,$X,Y,$ and Z$Z$ is odd, find the values of A,B,$A,B,$ and C$C$.

Note:

Solution Click Below:-  👉CLICK HERE👈

👇👇👇👇👇

• You need to print the integers A,B,$A,B,$ and C$C$ in ascending order.
• It is guaranteed in the input that a unique answer exists.

Input Format

• The first line contains one integer T$T$ — the number of test cases. Then T$T$ test cases follow.

Counting Words CodeChef Solution

MATH1 Enrolment CodeChef Solution

Group Assignment CodeChef Solution

Army Training CodeChef Solution 

Sort the String CodeChef Solution

Prime Xor CodeChef Solution

Vowel Anxiety CodeChef Solution

Array sorting CodeChef Solution

• Each test case consists of one line which contains 2$2$ integers X$X$ and Y$Y$.

Output Format

• For each test case, print 3$3$ integers — A,B,$A,B,$ and C$C$ in ascending order where (1<A,B,C<230)$(1<A,B,C<2^{30})$.

Constraints

• 1≤T≤105$1\le T\le {10}^5$
• 1≤X,Y<230