XOR AND ADDITION

CodeChefOpen on judge ↗

Given a number 'A' find the smallest positive value of b such that A ⊕ B = A + B where ⊕ denotes XOR operation ### Input - The first line contains a single integer $T$ — the number of test cases. - The first line of each test case contains $A$ (1≤$A$≤10^18) ### Output - Output minimum possible positive value of B ### Constraints - (1≤T≤2*10^6). - (1≤A≤10^18). ### Subtasks - 30 points : $1 \le

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