Problem:


Score : 200 points

Problem Statement

Takahashi's house has only one socket.

Takahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.

One power strip with A sockets can extend one empty socket into A empty sockets.

Find the minimum number of power strips required.

Constraints

All values in input are integers.

2 \leq A \leq 20

1 \leq B \leq 20

Input

Input is given from Standard Input in the following format:

A B

Output

Print the minimum number of power strips required.

Sample Input 1

4 10

Sample Output 1

3

3 power strips, each with 4 sockets, extend the socket into 10 empty sockets.

Sample Input 2

8 9

Sample Output 2

2

2 power strips, each with 8 sockets, extend the socket into 15 empty sockets.

Sample Input 3

8 8

Sample Output 3

1



Sample input:
4 10


Sample output:
3

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math
A,B=(int(x) for x in input().split())
math.floor(B/A)

Submission status: Wrong Answer

Solution code:
A,B = (int(i) for i in input().split())

ans = 1 
S = B-A
N = S // A + 1
ans = 1 + N
print(ans)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
for i in range(20):
    if a*i>=b:
        print(i)
        break

Submission status: Wrong Answer

Solution code:
A,B = map(int,input().split())
ans = 0
while A*ans<B:ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
# 1つだけaであとはa-1個
a, b = map(int, input().split())
if b <= a:
    print(1)
else:
    cur = a
    c = 1
    while True:
        if cur >= b:
            break
        c += 1
        cur += a - 1
    print(c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B = (int(i) for i in input().split())
if A==B:
    print(1)
else:
    print(B // A + 1)

Submission status: Wrong Answer

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

n=1

while n*(a-1) + 1 < b:
    n += 1

print(n)

Submission status: Wrong Answer

Solution code:
def main(): 
    a,b =map(int, input().split())
    i = a -1
    cnt = 1

    while True:
        if a >= b:
            break
        a += i
        cnt += 1

    print(cnt)
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())

cnt = 0
if B == 1:
    cnt = 0
elif A >= B:
    cnt = 1
else:
    # A < B
    cnt = 1
    while A < B:
        A += A-1
        cnt += 1

print(cnt)

Submission status: Wrong Answer

Solution code:
A, B = map(int,input().split())

ans = 1
B -= A
while B >= (A-1):
    B -= A-1
    ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())
i = 1
sum = A
while sum < B:
  sum += (A-1)
  i += 1
print(i)

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())

n = 1
ans = 0

for i in range(22):
  n += (A-1)
  ans += 1
  if n >= B:
    break
  
print(ans)

Submission status: Wrong Answer

Solution code:
A, B = map(int,input().split())

c = 0
taps = 1
while(True) :
    # jack = A * (taps-1) + A
    jack = (A-1) * (taps-1) + A
    if (jack >= B) :
        break
    
    taps += 1


print(taps)

Submission status: Wrong Answer

Solution code:
# B - Power Socket
inputNum = list(map(int, input().split()))
A = inputNum[0]
B = inputNum[1]

# 切り上げ
result = -(-B // A)

print(result)

Submission status: Wrong Answer

Solution code:
import sys
import math
from fractions import gcd
# import queue
# from collections import Counter
# from itertools import accumulate
# from functools import reduce

def lcm(a, b):
    return a * b // gcd(a, b)

def combination_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

def permutations_count(n, r):
    return math.factorial(n) // math.factorial(n - r)

big_prime = 1000000007

"""
# 標準入力取得
## 文字列
 =  sys.stdin.readline().rstrip()
 =  list(sys.stdin.readline().rstrip())

## 数値
 =  int(sys.stdin.readline())
 =  map(int, sys.stdin.readline().split())
 =  list(map(int, sys.stdin.readline().split()))
 =  [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""

A, B =  map(int, sys.stdin.readline().split())

now = A
cnt = 1
while True:
    if now >= B:
        break
    now += (A - 1)
    cnt += 1

print(cnt)

Submission status: Wrong Answer

Solution code:
first = [int(i) for i in input().split()]
A = first[0]
B = first[1]

dengen = 1
count = 0

for i in range(1, 100):
    dengen += A - 1
    if dengen >= B:
        print(i)
        break

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
cout,cout2 = 0,0
while True:
    if cout < b:
        cout += a
        cout2 += 1
        if cout >= b:
            break
        else:
            cout -=1
print(cout2)

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
from operator import itemgetter

def main():
	a, b = map(int, input().strip().split())
	ans = 0
	while True:
		if b <= a + ans * (a-1):
			print(ans+1)
			return
		ans += 1

if __name__ == '__main__':
	main()

Submission status: Wrong Answer

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

ans = math.ceil(b/a)

print(ans)

Submission status: Wrong Answer

Solution code:
A,B = list(map(int, input().split()))
if B == 1:
    print(0)
i=1
total = A
while total < B:
    total += (A - 1)
    i += 1

print(i)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
s=(b-1)//(a-1)
t=(b-1)%(a-1)
if t!=0:
    print(b//(a-1)+1)
else:
    print(s)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
count = a;ans = 1
while  b > count:
    count += a-1
    ans += 1
print(ans)

Submission status: Wrong Answer

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

if b == 0:
    print(0)
else:
    while sum_ < b:
        count +=1
        sum_ += a-1
    print(count)

Submission status: Wrong Answer

Solution code:
import sys

sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def solve(inputs):
    [A, B] = string_to_int(inputs[0])

    count = 0
    i = 0
    while count < B:
        if i != 0:
            count -= 1

        count += A

        i += 1
    return i


def string_to_int(string):
    return list(map(lambda x: int(x), string.split()))


if __name__ == "__main__":
    ret = solve(inputs(1))
    print(ret)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/python3
# -*- coding: utf-8 -*-
import math


A,B = map(int, input().split())
print(math.ceil(B/A))

Submission status: Wrong Answer

Solution code:
import math
A, B= [int(i) for i in input().split(' ')]

print( math.ceil(B / A ))

Submission status: Wrong Answer

Solution code:
A,B=map(int,input().split())
s=A
count=0
while True:
    s+=A-1
    count+=1
    if s>=B:
        break
print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

count = 1
ans = 0

for i in range(b):
        ans += 1
        count += a-1
        if count >= b:
                print(ans)
                exit()

Submission status: Wrong Answer

Solution code:
a, b = map(int,input().split())
i = 1
while a*i<b:
  i += 1
print(i)

Submission status: Wrong Answer

Solution code:
A,B = list(map(int,input().split()))

total = 1
taps = 0

while(True):
    taps += 1
    total += A-1
    if B <= total:
        break

print(taps)

Submission status: Wrong Answer

Solution code:
import math
 
A, B = map(int, input().split())
if B > 1:
    print(math.ceil(B/A))
else:
    print(0)

Submission status: Wrong Answer

Solution code:
m = list(map(int,input().split()))
print(-(-m[1]//m[0]))

Submission status: Wrong Answer

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

ans = b//a

if ans > 0:
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
a,b = map(int, input().split())  
t = a
res = 1
while 1:
  if t < b:
    t = t + a
    res = res + 1
  else:
    break
print(res)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

def main():
	A,B = inputMap()

	ans = 0
	to = 0
	flg = False
	while True:
		ans += 1
		if flg == False:
			to += A
			flg = True
		else:
			to = (to-1) + A
		if to >= B:
			break

	print(ans)

if __name__ == "__main__":
	main()

Submission status: Wrong Answer

Solution code:
A,B = map(int,input().split())
tap = 0
i = 0
while(tap < B):
  if i == 0:
    tap += A
  else:
    tap += A-1
  i += 1
print(i)

Submission status: Wrong Answer

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

ans = 1
c = a
while c < b:
  c += (a - 1)
  ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
import math
A, B = map(int, input().split())

if A >= B:
    print(1)
else:
    print(1 + math.ceil((B-A) / (A-1)))

Submission status: Wrong Answer

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

amari = b % a
syo = b // a

if amari == 0:
    print(syo)
else:
    print(syo + 1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import math

# input
A, B = map(int, input().split())

# solve & output
print(math.ceil(B / A))

Submission status: Wrong Answer

Solution code:
i = input().split()
a = int(i[0])
b = int(i[1])
c = (b%a) + 1
print(c)

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())

print(-(-B//A))

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
s = 0
for i in range(a):
    s += a-1
    if s >= b:
        break
print(i)

Submission status: Wrong Answer

Solution code:
import math

a, b = map(int,input().split())

print(math.ceil(b/a))

Submission status: Wrong Answer

Solution code:
a,b = (int(i) for i in input().split())
tap = a
ans = 1
while tap<b:
    tap += a-1
    ans += 1
    #if tap >= b: break
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

A, B = map(int, input().split())

ans = 1
while B >= A:
    ans += 1
    A = A + A - 1

print(ans)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split(' '))
cnt = 0
avi = 1
while 1:
    cnt += 1
    avi += a - 1
    if avi >= b:
        break
print(cnt)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
''' 
------------------------
author : iiou16
------------------------
'''

def main():
    A, B = list(map(int, input().split()))

    if B % A == 0:
        print(B // A)
    else:
        print((B // A) + 1)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
A = input().split()
if A[0] == A[1]:
  print(1)
else:
  print(int(A[1]) // int(A[0]) + 1)

Submission status: Wrong Answer

Solution code:
import sys
A,B = map(int, input().split())
tap = 1
for i in range(1,30):
  tap = tap + A - 1
  if tap >= B:
    print(i)
    sys.exit()

Submission status: Wrong Answer

Solution code:
import math

A, B = map(int, input().split())
if A >= B:
  print(1)
else:
  print(math.ceil((B-A)/(A-1))+1)

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())

if B % A >= 1:
    print(B // A + 1)
    exit()
print(B//A)

Submission status: Wrong Answer

Solution code:
A, B = map(int,input().split())
n = 1
c = 0
while (True):
  n -=1
  n += A
  c += 1
  if (B <= n):
    print(c)
    break

Submission status: Wrong Answer

Solution code:
a,b = map(int, input().split())
ans = 0
if b == 1:
    print(0)
else:
    for i in range(11):
        if a * i>=b:
            ans = i
            break
    print(ans)

Submission status: Wrong Answer

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

for i in range(100):
  if a + (a-1)*i >= b:
    print(i+1)
    break

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())

total=0
number=0

while total < B:
    number=number+1
    if (total==0):
        total=A
    else:
        total=total+A-1

print(number)

Submission status: Wrong Answer

Solution code:
A,B = map(int,input().split())
i = A
j = 1
while i < B:
    i += A - 1
    j += 1
print(j)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
n = 1
for i in range(15):
    if b <= n:
        break
    n += (a - 1)
print(i)

Submission status: Wrong Answer

Solution code:
a,b = [int(s) for s in input().split()]
p = 0
count = 1
while True:
  p += 1
  count += a - 1
  if count >= b:
    print(p)
    break

Submission status: Wrong Answer

Solution code:
A,B = map(int,input().split())
emp=1
result=0
while(emp<=B):
    emp+=A
    result+=1

print(result)

Submission status: Wrong Answer

Solution code:
#import sys
A, B = list(map(int,input().split()))
count = 0
tukaeru = A
while True :
    count += 1
    if tukaeru >= B :
        break
    else :
        tukaeru += A -1
print(count)

Submission status: Wrong Answer

Solution code:
A,B = map(int,input().split())
c = 0
ana = 0
for i in range(1000):
    if i == 0:
        c+= 1
        ana += A
    else:
        c+= 1
        ana += A-1
    if ana >= B:
        break
print(c)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
for i in range(1,20):
    if a*i-i+1>=b:
        print(i)
        break

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys


def solve(A: int, B: int):
    res = 0
    if B == 1:
        res = 0
    elif B <= A:
        res = 1
    else:
        B -= A
        res = 1
        res += B // A
        if B % A > 0:
            res += 1
    
    print(res)
        

    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    solve(A, B)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
a, b = [int(i) for i in input().split()]

n = 1
kuchi = a

while kuchi < b:
    n += 1
    kuchi += a - 1

print(n)

Submission status: Wrong Answer

Solution code:
cnt = 0

a, b = map(int, input().split())

while a < b:
    cnt += 1
    a += (a - 1)
print(cnt+1)

Submission status: Wrong Answer

Solution code:
import sys

a, b = map(int, input().split())

ava = 1
count = 0

while(1):
    count += 1
    ava = ava - 1 + a
    if ava >= b:
        break

print(count)

Submission status: Wrong Answer

Solution code:
a, b = [int(x) for x in input().split(' ')]
c = 1
d = a - 1

while a < b:
    a += d
    c += 1

print(c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#import numpy as np
#from numpy import*
#from scipy.sparse.csgraph import shortest_path #shortest_path(csgraph=graph) # dijkstra# floyd_warshall
#from scipy.sparse import csr_matrix
 
from collections import* #defaultdict Counter deque appendleft
from fractions import gcd
from functools import* #reduce
from itertools import* #permutations("AB",repeat=2) combinations("AB",2) product("AB",2) groupby accumulate
from operator import mul,itemgetter
from bisect import* #bisect_left bisect_right
from heapq import* #heapify heappop heappushpop
from math import factorial,pi
from copy import deepcopy
import sys
sys.setrecursionlimit(10**8)
#input=sys.stdin.readline  #危険！基本オフにしろ！
 
def main():
    a,b=map(int,input().split())
    if b>1:
        print((b-1)//a+1)
    else:
        print(0)
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
c=b//(a-1)
if b<=c*(a-1)+1:
    print(c)
else:
    print(c+1)

Submission status: Wrong Answer

Solution code:
from math import ceil
a,b=[int(i) for i in input().split()]
if b==1:
    print(0)
else:
    print(ceil(b/a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math


A, B = map(int, input().split())

print(math.floor((B-1)/(A-1)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
total = 0
i = 0
while total <  b:
    i += 1
    if i == 1:
        total = a
    else:
        total = (a - 1) * (i - 1) + a

print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, B = map(int,input().split())
ans = 0
for N in range(1,100):
  nokori = (A * N) - ((N-1)* 1)

  if nokori >= B:
      ans = N
      break;
print(ans)

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())

junction = A
res = 1
while junction < B:
    junction += A - 1
    res += 1

print(res)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a,b = map(int,input().split())
if b >=a:
  print(math.ceil(b/a))
else:
  print("1")

Submission status: Wrong Answer

Solution code:
#https://atcoder.jp/contests/abc139/tasks/abc139_b

a,b = map(int,input().split())

c = a-1

cnt = b // c
if b%c!=0 and b%c!=1:
    cnt+=1
print(cnt)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
ans=1
x=a
while x<b:
	x+=a-1
	ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())
k, l = 0, 0

while l < B:
  if k == 0:
    l += A
  else:
    l += A - 1
  k += 1

print(k)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
if a > b:
  print(0)
  exit()
  
if b%a==0:
  ans = b//a
else:
  ans = b//a + 1
  
print(ans)

Submission status: Wrong Answer

Solution code:
import sys

input_str = input().split(" ")
A = int(input_str[0])
B = int(input_str[1])
rem = B%A
ans = int(B/A)
if rem!=0:
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())

cnt = 1
for i in range(15):
    if A >= B :break
    else :
        A = A*2 - 1
        cnt +=1
print(cnt)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
x = a
ans = 1
while x < b:
    x += a - 1
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())

c = 1
tmp = A
while tmp < B:
    tmp = (A - 1) * c + A
    c += 1

print(c)

Submission status: Wrong Answer

Solution code:
a,b=(int(i) for i in input().split())
print(b//a+1)

Submission status: Wrong Answer

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

ans=1
c=a
z=0
while z==0:
    if c>=b:
        print(ans)
        z=1
    else:
        ans+=1
        c+=a-1

Submission status: Wrong Answer

Solution code:
n,m=input().split()
n=int(n)
m=int(m)
print((m//n)+1)

Submission status: Wrong Answer

Solution code:
A,  B = list(map(int, input().split()))

ans = 0
count = 0

while count < B:
    if count == 0:
        count += A
    else:
        count += A - 1
    ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
def main():
    A, B = map(int, input().split())

    if A >= B:
        print(1)
        exit()
    if B % (A - 1) <= 1:
        print(B // (A-1))
    else:
        print(B // (A-1) + 1)

main()

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())

n = 1
ans = 0
while n <= B:
  n += A
  ans += 1
print (ans)

Submission status: Wrong Answer

Solution code:
inp = [int(i) for i in input().split(' ')]
A = inp[0]
B = inp[1]

result = 0
counter = 1
add = A - 1
while True:
    counter += add
    result += 1
    if counter >= B:
        break
print(result)

Submission status: Wrong Answer

Solution code:
A,B=map(int,input().split())
ans=B%A
if ans != 1:
    ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

def main():
    a,b=map(int, input().split())  #複数数値入力　「A B」みたいなスペース空いた入力のとき
    if a == b:
        print(1)
    else:
        c = b // a + 1
        print(c)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

i = 0
while a * i < b:
    i += 1
print(i)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

import math
A, B = map(int, input().split())
print(math.ceil(B/A))

Submission status: Wrong Answer

Solution code:
import sys

def resolve():
    a, b = map(int, input().split())

    ans = (b) // (a-1)
    if (b % (a-1)) > 1:
        ans += 1

    print(ans)

if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

Solution code:
n,m=list(map(int,input().split()))
i=1
while True:
    if i*n>=m:
        print(i)
        break
    i+=1

Submission status: Wrong Answer

Solution code:
a,b = list(map(int,input().split()))
c = 0
x = 0
while x<b:
    c+=1
    x+=a
print(c)

Submission status: Wrong Answer

Solution code:
A, B = [int(x) for x in input().split()]
count = 1
total_kuchi = A
while True:
    if total_kuchi >= B:
        break
    total_kuchi += A - 1
    count += 1

print(count)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys


def solve(A: int, B: int):
    if B % (A-1) == 1:
        print(B // (A-1))
    else:
        print(B // (A-1) + 1)
    return


# Generated by 1.1.5 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    solve(A, B)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import math
A, B = map(int, input().split())

r = math.ceil(B / A)
print(r)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
N,M=list(map(int,input().split()))
M-=N
if M<1:
    print(1)
    #exit()
else:
    print(1+math.ceil(M/(N-1)))

Submission status: Wrong Answer

Solution code:
# coding:utf-8
def main():
    a,b = map(int, input().split())
    count = 0
    cosuu = 0

    while count < b:
        count += a
        cosuu += 1
    print(cosuu)

if __name__ == '__main__' :
    main()

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if a == 1 :
    print(b)
elif b <= a :
    print(1)
else :
    ans = 1
    b -= a
    d = a-1
    ans += ( (b+d-1) // (d))
    print(ans)

Submission status: Wrong Answer

Solution code:
while True:
    try:
        A, B = map(int, input().split())
        
        strip = 1
        socket = A
        for i in range(A+1):
            if (socket < B):
                strip += 1
                socket += (A-1)
            else:
                break
        print(strip)
    
    except:
        break

Submission status: Wrong Answer

Solution code:
a,b = (int(num) for num in input().split())
if b == 1:
    print(0)
else:
    print((b+a-1)//a)

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())

cnt = 1

s = A

while s < B:
    cnt += 1
    s += A - 1
    
print(cnt)

Submission status: Wrong Answer

Solution code:
A, B = [int(x) for x in input().split()]
ans = 0
while(1):
    ans += 1
    cnt = 1 + ans*(A-1)
    if (cnt >= B):
        break
print(ans)

Submission status: Wrong Answer

Solution code:
a,b = [int(s) for s in input().split()]
p = 0
count = 1
while True:
  p += 1
  count += a - 1
  if a >= b:
    print(p)
    break

Submission status: Wrong Answer

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

count = 1
ans = 0

for i in range (20):
  count += a-1
  ans += 1
  if count >= b:
    print(ans)
    break

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
ans = 0
while True:
    if b <= ans * a - a:
        break
    ans += 1
print(ans-1)

Submission status: Wrong Answer

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

ans = 1
tmp = a

while True:
    if tmp >= b:
        print(ans)
        quit()
    else:
        tmp += (a - 1)
        ans += 1

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())
tap = 0
ans = 0
for i in range(100):
    if tap >= B:
        break
    if ans == 0:
        tap += A
    else:
        tap += A - 1
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
if __name__ =='__main__':
    a, b = list(map(int,input().split()))
    print(int(b/a)+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
from math import ceil
def get_array(): return list(map(int , sys.stdin.readline().strip().split()))
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def input(): return sys.stdin.readline().strip()

a,b=get_ints()
print(ceil(b/a))

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
c=0
s=0
while(s<b):
  if(s>=b):
    break
  s+=a
  c+=1
  if(s>=b):
    break
print(c)

Submission status: Wrong Answer

Solution code:
#https://atcoder.jp/contests/abc139/tasks/abc139_b

a,b = map(int,input().split())

c = a-1

cnt = b // a
if b%a!=0 and b%a!=1:
    cnt+=1
print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())

kuti = 1
kosuu = 0
while True:
    kuti -= 1
    kuti += A
    kosuu += 1
    if kuti >= B:
        print(kosuu)
        exit()

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
if a > b:
  print(0)
  exit()
  
if b%a==0:
  ans = b/a
else:
  ans = b//a + 1
  
print(ans)

Submission status: Wrong Answer

Solution code:
import math

A, B = map(int, input().split())
ans = int(0)
count =int(1)
plug = int(A)

while plug<B:

    plug += A-1
    count +=1

ans = count
print(ans)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
x = a
i = 1
while x<b:
    x+=(a-1)
    i += 1
print(i)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
print((-(-b//a)) if b>1 else 0)

Submission status: Wrong Answer

Solution code:
def f_b():
    a, b = map(int, input().split())
    n, c = 1, 0
    for _ in range(15):
        n = n + a - 1
        c += 1
        if n >= b:
            break
    print(c)

if __name__ == "__main__":
    f_b()

Submission status: Wrong Answer

Solution code:
A , B = map(int , input().split())
ans = 1
tmp = A
while(tmp < B):
    tmp += A - 1
    ans += 1
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
t=a-1
print(b//t if b%t<2 else b//t+1)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
cnt  = 0
flag = 0
tap = 1
while flag == 0:
    tap += a-1
    cnt +=1
    if tap >= b:
        flag = 1
print(cnt)

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())

cond = True
tmp = 0
cnt = 0
while cond:
	cnt += 1
	tmp += A
	if tmp >= B:
		cond = False
	else:
		tmp -= 1
print(cnt)

Submission status: Wrong Answer

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

for i in range(100):
    tap+=a-1
    if tap>=b:
        print(i+1)
        exit()

Submission status: Wrong Answer

Solution code:
A,B=(int(i) for i in input().split())
ans=1
t=0
while True:
    if B<ans:
        print(t)
        break
    t+=1
    ans+=A-1

Submission status: Wrong Answer

Solution code:
import math
A,B = map(int,input().split())

if B == 1:
    print(0)
print(math.ceil((B - 1) / (A - 1)))

Submission status: Wrong Answer

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

while True:
    if b <= (a-1)*i + 1:
        print(i)
        break
    i += 1

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())
tmp = A
ans = 1
while True:
    if A < B:
        A += tmp - 1
        ans += 1
    else:
        break

print(ans)

Submission status: Wrong Answer

Solution code:
import sys


def main():
    ab = sys.stdin.readline().strip()
    a, b = [int(s) for s in ab.split(' ')]

    need = b - 1
    inc = a - 1
    ans = need // inc + need % inc
    print(ans)


main()

Submission status: Wrong Answer

Solution code:
def solve():
  a,b = (int(i) for i in input().split())
  ans = 1
  now = a
  for i in range(10000):
    if now >= b:
      print(ans)
      exit()
    else:
      now += a-1
      ans +=1
    
solve()

Submission status: Wrong Answer

Solution code:
A,B = map(int,input().split())
ans = B - A
cnt = 1
if ans <= 0:
    print(cnt)
else:
    while(ans>0):
        ans -= A-1
        cnt += 1
    print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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