atcoder#ARC079B. [ABC068D] Decrease (Contestant ver.)
[ABC068D] Decrease (Contestant ver.)
Score : points
Problem Statement
We have a sequence of length consisting of non-negative integers. Consider performing the following operation on this sequence until the largest element in this sequence becomes or smaller.
- Determine the largest element in the sequence (if there is more than one, choose one). Decrease the value of this element by , and increase each of the other elements by .
It can be proved that the largest element in the sequence becomes or smaller after a finite number of operations.
You are given an integer . Find an integer sequence such that the number of times we will perform the above operation is exactly . It can be shown that there is always such a sequence under the constraints on input and output in this problem.
Constraints
Input
Input is given from Standard Input in the following format:
Output
Print a solution in the following format:
...
Here, and must hold.
0
4
3 3 3 3
1
3
1 0 3
2
2
2 2
The operation will be performed twice: [2, 2] -> [0, 3] -> [1, 1].
3
7
27 0 0 0 0 0 0
1234567894848
10
1000 193 256 777 0 1 1192 1234567891011 48 425