Codeforces Round 355 (Div. 2)
B
Vanya and Food Processor
Codeforces
1400
原题
← AC →
翻译中…

Vanya smashes potato in a vertical food processor. At each moment of time the height of the potato in the processor doesn't exceed $*h*$ and the processor smashes $*k*$ centimeters of potato each second. If there are less than $*k*$ centimeters remaining, than during this second processor smashes all the remaining potato.

翻译中…

Vanya has $*n*$ pieces of potato, the height of the $*i*$-th piece is equal to $*a*_{*i*}$. He puts them in the food processor one by one starting from the piece number $1$ and finishing with piece number $*n*$. Formally, each second the following happens:

翻译中…
  1. If there is at least one piece of potato remaining, Vanya puts them in the processor one by one, until there is not enough space for the next piece.
  2. Processor smashes $*k*$ centimeters of potato (or just everything that is inside).
翻译中…

Provided the information about the parameter of the food processor and the size of each potato in a row, compute how long will it take for all the potato to become smashed.

翻译中…

Input

翻译中…

The first line of the input contains integers $*n*$, $*h*$ and $*k*$ ($1 ≤ *n* ≤ 100 000, 1 ≤ *k* ≤ *h* ≤ 10^{9}$) — the number of pieces of potato, the height of the food processor and the amount of potato being smashed each second, respectively.

翻译中…

The second line contains $*n*$ integers $*a*_{*i*}$ ($1 ≤ *a*_{*i*} ≤ *h*$) — the heights of the pieces.

翻译中…

Output

翻译中…

Print a single integer — the number of seconds required to smash all the potatoes following the process described in the problem statement.

翻译中…

Note

翻译中…

Consider the first sample.

翻译中…
  1. First Vanya puts the piece of potato of height $5$ into processor. At the end of the second there is only amount of height $2$ remaining inside.
  2. Now Vanya puts the piece of potato of height $4$. At the end of the second there is amount of height $3$ remaining.
  3. Vanya puts the piece of height $3$ inside and again there are only $3$ centimeters remaining at the end of this second.
  4. Vanya finally puts the pieces of height $2$ and $1$ inside. At the end of the second the height of potato in the processor is equal to $3$.
  5. During this second processor finally smashes all the remaining potato and the process finishes.
翻译中…

In the second sample, Vanya puts the piece of height $5$ inside and waits for $2$ seconds while it is completely smashed. Then he repeats the same process for $4$ other pieces. The total time is equal to $2·5 = 10$ seconds.

翻译中…

In the third sample, Vanya simply puts all the potato inside the processor and waits $2$ seconds.

翻译中…

样例

Input #1
5 6 3
5 4 3 2 1
Output #1
5
InputCopy OutputCopy
Input #2
5 6 3
5 5 5 5 5
Output #2
10
InputCopy OutputCopy
Input #3
5 6 3
1 2 1 1 1
Output #3
2
InputCopy OutputCopy
题目信息
题号
677B
时间限制
1 s
内存限制
256 MB
标签
模拟
数学

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。