10839: ABC153 - A - Serval vs Monster
[Creator : ]
Description
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.
Input
Input is given from Standard Input in the following format:
```
$H$ $A$
```
```
$H$ $A$
```
Output
Print 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.
- $1 \leq A \leq 10^4$
- All values in input are integers.
Sample 1 Input
10 4
Sample 1 Output
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.
Sample 2 Input
1 10000
Sample 2 Output
1
Sample 3 Input
10000 1
Sample 3 Output
10000