Lazy Fourth years

CodeChefOpen on judge ↗

Nuttela has been assigned an easy task, but is not willing to do. Given N, Print from 0 to $2$$N$ $-$ $1$ in binary base in non-decreasing order Note : All binary bases should be of length N only Can you help him ....? Input: - First line will contain $T$, number of test cases. - Second line contains, $N$ $-$ the number. Output: - For each Test case, Print $2$$N$ binary forms of the number

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