Decrease (Contestant ver.)

AtCoder

IDarc079_b

Time2000ms

Memory256MB

Difficulty—

We have a sequence of length $N$ consisting of non-negative integers. Consider performing the following operation on this sequence until the largest element in this sequence becomes $N-1$ or smaller. * Determine the largest element in the sequence (if there is more than one, choose one). Decrease the value of this element by $N$, and increase each of the other elements by $1$. It can be proved that the largest element in the sequence becomes $N-1$ or smaller after a finite number of operations. You are given an integer $K$. Find an integer sequence $a_i$ such that the number of times we will perform the above operation is exactly $K$. It can be shown that there is always such a sequence under the constraints on input and output in this problem. ## Constraints * $0 ≤ K ≤ 50 \times 10^{16}$ ## Input Input is given from Standard Input in the following format: $K$ [samples]

Samples

Input #1

Output #1

4
3 3 3 3

Input #2

Output #2

3
1 0 3

Input #3

Output #3

2
2 2

The operation will be performed twice: \[2, 2\] -> \[0, 3\] -> \[1, 1\].

Input #4

Output #4

7
27 0 0 0 0 0 0

Input #5

1234567894848

Output #5

10
1000 193 256 777 0 1 1192 1234567891011 48 425

API Response (JSON)

{
  "problem": {
    "name": "Decrease (Contestant ver.)",
    "description": {
      "content": "We have a sequence of length $N$ consisting of non-negative integers. Consider performing the following operation on this sequence until the largest element in this sequence becomes $N-1$ or smaller. ",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "arc079_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "We have a sequence of length $N$ consisting of non-negative integers. Consider performing the following operation on this sequence until the largest element in this sequence becomes $N-1$ or smaller.\n...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments