AtCoder Beginner Contest 153
A
Serval vs Monster
AtCoder
⌀ 0
原题
←B →
翻译中…

Problem Statement

翻译中…

Serval is fighting with a monster.

翻译中…

The health of the monster is $H$.

翻译中…

In one attack, Serval can decrease the monster's health by $A$. There is no other way to decrease the monster's health.

翻译中…

Serval wins when the monster's health becomes $0$ or below.

翻译中…

Find the number of attacks Serval needs to make before winning.

翻译中…

Constraints

翻译中…
  • $1 \leq H \leq 10^4$
  • $1 \leq A \leq 10^4$
  • All values in input are integers.
翻译中…

Input

翻译中…

Input is given from Standard Input in the following format:

翻译中…

H A

翻译中…

Output

翻译中…

Print the number of attacks Serval needs to make before winning.

翻译中…

样例

Input #1
10 4
Output #1
3
- After one attack, the monster's health will be $6$. - After two attacks, the monster's health will be $2$. - After three attacks, the monster's health will be $-2$. Thus, Serval needs to make three attacks to win.
Input #2
1 10000
Output #2
1
Input #3
10000 1
Output #3
10000
题目信息
题号
abc153_a
时间限制
2 s
内存限制
1024 MB

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