All Gray Codes

Difficulty: 1200 2000 ms 128 MB

bitwise

Print all 2^N bit strings of length N in reflected Gray code order (consecutive strings differ in exactly one bit), starting from all zeros.

Input: one integer N.

Output: 2^N lines of N-bit strings.

Constraints:

• 1 ≤ N ≤ 12

Sample Tests

2

00
01
11
10

1

0
1

Read the Editorial