Chef and the XORed Number

CodeChefRating 1661Open on judge ↗

Given an integer N, Chef wants to find the smallest positive integer M such that the bitwise XOR of M and M+1 is N. If no such M exists output -1. Input The first line of input contain an integer T denoting the number of test cases. Each of the following T lines contains an integer N for that test case. Output For each test case, output a single line containing the number M or -1 as described

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