XOR Bit

CodeChefOpen on judge ↗

You are given $2$ integers, $N$ and $K$. Find the $K$th bit of the **bitwise XOR of all the integers in range 0 to N** (inclusive). **NOTE:** 1st bit will be the right-most bit in the binary representation. ### Input - First line contains the number of test cases, $T$. - The following $T$ lines contain $2$ space-separated integers, $N$ and $K$ ### Output For each test case, output a single inte

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