complement

CodeChefOpen on judge ↗

Problem description. Given a number in it's 2's complement form as it is stored in the computer, find out the number in it's decimal form. Input The first line of the input contains an integer T denoting the number of test cases.The subsequent lines each contain a binary number(2's complement) N. Output Print the decimal form of N Constraints - 1 ≤ T ≤ 10 - 0 ≤ N ≤ 1000000 Example Input

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