AtCoder Beginner Contest 092
翻译中…
Problem Statement
翻译中…
Some number of chocolate pieces were prepared for a training camp. The camp had $N$ participants and lasted for $D$ days. The $i$-th participant ($1 \leq i \leq N$) ate one chocolate piece on each of the following days in the camp: the $1$-st day, the $(A_i + 1)$-th day, the $(2A_i + 1)$-th day, and so on. As a result, there were $X$ chocolate pieces remaining at the end of the camp. During the camp, nobody except the participants ate chocolate pieces.
翻译中…
Find the number of chocolate pieces prepared at the beginning of the camp.
翻译中…
Constraints
翻译中…
$1 \leq N \leq 100$$1 \leq D \leq 100$$1 \leq X \leq 100$$1 \leq A_i \leq 100$($1 \leq i \leq N$)- All input values are integers.
翻译中…
Input
翻译中…
Input is given from Standard Input in the following format:
翻译中…
N
D X
A_1
A_2
:
A_N翻译中…
Output
翻译中…
Find the number of chocolate pieces prepared at the beginning of the camp.
翻译中…
样例
Input #1
3
7 1
2
5
10
Output #1
8
The camp has $3$ participants and lasts for $7$ days. Each participant eats chocolate pieces as follows:
- The first participant eats one chocolate piece on Day $1$, $3$, $5$ and $7$, for a total of four.
- The second participant eats one chocolate piece on Day $1$ and $6$, for a total of two.
- The third participant eats one chocolate piece only on Day $1$, for a total of one.
Since the number of pieces remaining at the end of the camp is one, the number of pieces prepared at the beginning of the camp is $1 + 4 + 2 + 1 = 8$.
Input #2
2
8 20
1
10
Output #2
29
Input #3
5
30 44
26
18
81
18
6
Output #3
56
题目信息
题面与样例版权归 AtCoder 及出题人所有；中文翻译由 AI 生成（CI 管线），如有出入请以原文为准。