[Solution] Triple Xor CodeChef Solution

[Solution] Triple Xor CodeChef Solution

You are given two integers N$N$ and K$K$. Find number of ordered triplets (A,B,C)$(A,B,C)$ that satisfy the following conditions:

• 0≤A,B,C<2N$0\le A,B,C<2^N$
• A,B$A,B$ and C$C$ are distinct
• A⊕B⊕C=K$A\oplus B\oplus C=K$

Here, ⊕$\oplus$ denotes the bitwise XOR operation.

Input Format

• The first line contains a single integer T$T$ — the number of test cases. Then the test cases follow.
• The first and only line of each test case contains two space-separated integers N$N$ and K$K$ — the

Solution Click Below:-  CLICK HERE

•  parameters mentioned in the statement.

Output Format

For each test case, output on a new line the number of triplets that satisfy the given conditions.