Problem:

Party Dress

Yae joins a journey plan, in which parties will be held several times during the itinerary. She wants to participate in all of them and will carry several dresses with her. But the number of dresses she can carry with her may be smaller than that of the party opportunities. In that case, she has to wear some of her dresses more than once.  

  Fashion-conscious Yae wants to avoid that. At least, she wants to reduce the maximum number of times she has to wear the same dress as far as possible.

  Given the number of dresses and frequency of parties, make a program to determine how she can reduce the maximum frequency of wearing the most reused dress.

Input

  The input is given in the following format.

$A$ $B$

  The input line provides the number of dresses $A$ ($1 \leq A \leq 10^5$) and frequency of parties $B$ ($1 \leq B \leq 10^5$).

Output

  Output the frequency she has to wear the most reused dress.

Sample Input 1

3 5

Sample Output 1

2

Sample Input 2

25 10

Sample Output 2

1 



Sample input:
3 5


Sample output:
2

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())
print((B+A-1)/A)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
print((b+a-1)//a)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
print((B+A-1)//A)

Submission status: Accepted

Solution code:
#標準入力
a,b = map(int,input().split())

#ドレスの数とパーティーの数が同じであればbをaで割った商を出力する
if b % a == 0:print(b // a)

#でなければbをaで割った商に1を足した値を出力する
else:print(b // a + 1)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
if B % A == 0 :
    print(B // A)
else :
    print(B // A + 1)

Submission status: Accepted

Solution code:
import math
a,b = map(int,input().split())
print(math.ceil(b/a))

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print((b+a-1)//a)

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
print((B+A-1)//A)

Submission status: Accepted

Solution code:
n,m = list(map(int,input().split()))
print(max(m//n+(m%n != 0),1))

Submission status: Accepted

Solution code:

A,B = [int(i) for i in input().split()]
ans = 0
if B % A == 0:
    ans = B // A
else:
    ans = B // A + 1
print(ans)

Submission status: Accepted

Solution code:
l=input().split()
A=int(l[0])
B=int(l[1])
kimawasi=B//A
if B%A>0:
    kimawasi=kimawasi+1
print(kimawasi)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
print((b+a-1)//a)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())

if a >= b:
    print(1)
else:
    if b % a == 0:
        print(b // a)
    else:
        print(b // a + 1)

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print(b // a + bool(b % a))