Shil Loves Exclusive Or

CodeChefOpen on judge ↗

Shil has a number X.He challenges you to find minimum positive number K such that F(K) is equal to X. - F(x) is defined as 1^2^3^....x. ^ denotes the bitwise Xor operation Input First line of input will consists of total number of test cases T.Next T lines contains a number X. Output For each test case , output minimum possible value of K such that F(K) is equal to X.If there is no such K ,

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