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

  • Reverse the numbers

    Given a stream of numbers in the input, you are asked to write a function that would print those numbers in reversed order without using any additional data structures like lists or arrays. The input stops as soon as the number entered is -1.
    def rev():
        n = int(input())
        if n == -1:
            return
        ....

    Input

    The input contains a stream of numbers (0 ≀ ≀ ) each on a separate line. It’s guaranteed that the input contains no more than 1000 lines.

    Output

    The program should print the numbers in reversed order.

    Examples

    Input
    Output
    1 2 4 3 -1
    3 4 2 1
    Β 

    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