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

    • Generate all prime numbers up to n

    As you can now check for the primality of any number, you are now asked to check if the number is prime for all the numbers up to n and print all the prime ones.

    Input

    The first line of the input contains a single integer n (2 ≤ n ≤ ).

    Output

    The program should print all the prime numbers smaller than or equal to n.

    Examples

    Input
    Output
    8
    2 3 5 7
    17
    2 3 5 7 11 13 17
    19
    2 3 5 7 11 13 17 19
     

    Constraints

    Time limit: 1 seconds

    Memory limit: 512 MB

    Output limit: 1 MB

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