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

    • Restore the array

    In the magical world of , the information is stored in prefix sum arrays. This helps them move faster and saves time. Yet, they sometimes lose the initial information and get stuck. Can you help them restore the initial array given the prefix sum?

    Input

    The first line of the input contains a single integer n - the number of elements in the array (1 ≤ n ≤ ). The next line contains n integers separated by a space, that represent the elements of the prefix sum .

    Output

    The program should print n space-separated integers representing the initial array.

    Examples

    Input
    Output
    8 8 11 9 13 23 22 22 27
    8 3 -2 4 10 -1 0 5
     

    Constraints

    Time limit: 2 seconds

    Memory limit: 512 MB

    Output limit: 10 MB

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