Triple Xor

CodeChefRating 1626Open on judge ↗

You are given two integers $N$ and $K$. Find number of ordered triplets $(A, B, C)$ that satisfy the following conditions: - $0 \le A, B, C \lt 2^N$ - $A, B$ and $C$ are **distinct** - $A \oplus B \oplus C = K$ Here, $\oplus$ denotes the [bitwise XOR operation](https://en.wikipedia.org/wiki/Bitwise_operation#XOR). ### Input - The first line contains a single integer $T$ — the number of test case

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI