AtCoder Beginner Contest 208
翻译中…
Problem Statement
翻译中…
There are $N$ citizens in the Kingdom of Takahashi. Each citizen has a national ID number; the ID of the $i$-th citizen is $a_i$. Here, all $a_i$ are pairwise different.
翻译中…
Takahashi has $K$ pieces of sweets. He has decided to hand out these pieces to the citizens in the following way until he has no more pieces.
翻译中…
- When he has
$N$or more pieces, hand out one piece to every citizen. - Otherwise, let
$K'$be the number of pieces he has at the moment, and hand out one piece to each of the citizens with the$K'$smallest IDs.
翻译中…
When all pieces are handed out, how many pieces will the $i$-th citizen have?
翻译中…
Constraints
翻译中…
$1 \leq N \leq 2 \times 10^5$$1 \leq K \leq 10^{18}$$1 \leq a_i \leq 10^9$- All
$a_i$are pairwise different. - All values in input are integers.
翻译中…
Input
翻译中…
Input is given from Standard Input in the following format:
翻译中…
N K
a_1 a_2 \ldots a_N翻译中…
Output
翻译中…
Print $N$ lines. The $i$-th line should contain the number of pieces of sweets received by the $i$-th citizen.
翻译中…
样例
Input #1
2 7
1 8
Output #1
4
3
Takahashi will hand out the pieces as follows.
- Hand out one piece to everyone, leaving Takhashi with $5$ pieces.
- Hand out one piece to everyone, leaving Takhashi with $3$ pieces.
- Hand out one piece to everyone, leaving Takhashi with $1$ piece.
- Hand out one piece to the $1$-st citizen, leaving Takhashi with no pieces.
In the end, the $1$-st citizen will receive $4$ pieces, and the $2$-nd citizen will receive $3$ pieces.
Input #2
1 3
33
Output #2
3
Since there is just one citizen, Takahashi will hand out all pieces to that $1$-st citizen.
Input #3
7 1000000000000
99 8 2 4 43 5 3
Output #3
142857142857
142857142857
142857142858
142857142857
142857142857
142857142857
142857142857
题目信息
题面与样例版权归 AtCoder 及出题人所有；中文翻译由 AI 生成（CI 管线），如有出入请以原文为准。