Consecutive Differences

Difficulty: 800 3500 ms 128 MB

implementation

Print the N−1 differences a_i+1 − a_i (print EMPTY when N = 1).

Input: the first line has N; the second line has N integers.

Output: N−1 integers, or EMPTY.

Constraints:

• 1 ≤ N ≤ 10⁵
• -10000 ≤ a_i ≤ 10000

Sample Tests

4
5 2 7 7

-3 5 0

1
3

EMPTY

Read the Editorial