Algorithms and Data Structures

  • Profound Academy

    • Status
      • 1
        Implementation
      • 2
        Bitwise operations
      • 3
        Prefix Sums
      • 4
        Sliding window / Two pointers
      • 5
        Modular Arithmetic
      • 6
        Number Theory
      • 7
        Binary Search
      • 8
        Basic Sorting
      • 9
        Greedy Algorithms
      • 10
        Basic Dynamic Programming
      • 11
        Recursion
      • 12
        Linked LIst
      • 13
        Queue & Stack
      • 14
        Binary tree + BST
      • 15
        Divide & Conquer + Advanced Sorting
      • 16
        Heap
      • 17
        Hashing
      • 18
        Graph Representation
      • 19
        BFS

    • Gray Code

    The Gray code of length n is the list of all bit-strings of length n that differ in exactly one bit (their Hamming distance is 1).
    Given an integer n, you are asked to print the Gray code ( lines).

    Input

    The input contains a single integer n (1 ≤ n ≤ 16).

    Output

    The program should print the Gray code. Any valid solution is acceptable.

    Examples

    Input
    Output
    1
    0 1
    2
    00 01 11 10
    3
    000 001 011 010 110 111 101 100
     

    Constraints

    Time limit: 0.99 seconds

    Memory limit: 512 MB

    Output limit: 25 MB

    To check your solution you need to sign in
    Sign in to continue