Problem:
Score : 100 points

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.

Sample Input 1

10 4

Sample 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.

Sample Input 2

1 10000

Sample Output 2

1

Sample Input 3

10000 1

Sample Output 3

10000

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.util.Scanner;

/**
 * A - Serval vs Monster
 * サーバルはモンスターと戦っています。
 * モンスターの体力は H です。
 * サーバルが攻撃を 1 回行うとモンスターの体力を A 減らすことができます。
 * 攻撃以外の方法でモンスターの体力を減らすことはできません。
 * モンスターの体力を 0 以下にすればサーバルの勝ちです
 * サーバルがモンスターに勝つために必要な攻撃の回数を求めてください。
 */
public class Main {

    public static void main(String[] args) {

        Scanner sc = new Scanner( System.in );
        // モンスターの体力
        int h = sc.nextInt();
        // サーバルが行う１回の攻撃で減らすことができるモンスターの体力
        int a = sc.nextInt();
        double result = ( double ) h / a;

        System.out.println( ( int ) Math.ceil( result ) );

        sc.close();
    }
}