Bits Magic

CodeChefOpen on judge ↗

Given an integer, N. Convert this integer to binary and then if the Kth bit is not set then set the Kth bit otherwise leave it as it is. Then convert this binary to decimal M. Input - The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows. - The first and only line of each test case contains two space seperated integer N and

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