{"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\n*   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$.\n\nIt can be proved that the largest element in the sequence becomes $N-1$ or smaller after a finite number of operations.\nYou 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.\n\n## Constraints\n\n*   $0 ≤ K ≤ 50 \\times 10^{16}$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$K$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"arc079_b","tags":[],"sample_group":[["0","4\n3 3 3 3"],["1","3\n1 0 3"],["2","2\n2 2\n\nThe operation will be performed twice: \\[2, 2\\] -> \\[0, 3\\] -> \\[1, 1\\]."],["3","7\n27 0 0 0 0 0 0"],["1234567894848","10\n1000 193 256 777 0 1 1192 1234567891011 48 425"]],"created_at":"2026-03-03 11:01:14"}}