Preparing NOJ

# Battle game

1000ms 262144K

## Description:

You are playing a game which you will battle with an enemy. As you don't want to lose, your total power can't be lower than your enemy's. Your power is simply added by the power of your soldiers, and all of your soldiers' power is exactly $a$. Now you have known that your enemy's total power is $b$. You want to know how many soldiers you need in order not to lose the battle.

## Input:

A line with two integers $a, b$, $(1 \le a, b \le 10^{9})$.

## Output:

A line with one integer, denotes the minimum number of soldiers you need.

## Sample Input:

123 456


## Sample Output:

4

Info

Provider NOJ

Code NOJ2408

Tags

Submitted 168

Passed 85

AC Rate 50.6%

Date 11/16/2019 23:11:35

Related

Nothing Yet