2472: Monster0１ - 打怪第一关
Memory Limit：128 MB
Time Limit：1.000 S
Judge Style：Text Compare
Creator：LongqiangLiu
Submit：65
Solved：49
Description
Problem Statement
You are fighting aganist a monster.
The health of the monster is H. In one attack, You can decrease the monster's health by A.
There is no other way to decrease the monster's health. You win when the monster's health becomes 0 or below.
Find the number of attacks You need to make before winning.
You are fighting aganist a monster.
The health of the monster is H. In one attack, You can decrease the monster's health by A.
There is no other way to decrease the monster's health. You win when the monster's health becomes 0 or below.
Find the number of attacks You need to make before winning.
你正在和一个怪物战斗。
怪物的生命值是
H。
每一次攻击，你可以降低怪物的生命值A。此外没有其他方法可以降低怪物的生命值。
当怪物的生命值变为0或0以下时，你可获胜。
找出在获胜之前，你最少需要进行的攻击次数。
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.
Sample Input Copy
10 4 Sample Output Copy
3HINT
例如：输入H=10， A=4，则输出 3，
这是因为：
第一次攻击后，怪物生命值变为6；
第二次攻击后，怪物生命值变为2；
第三次攻击后，怪物生命值变为-2 - you win.