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())
ans_tmp = (B-1)/(A-1)

if ans_tmp < 1:
  print(1)
else:
  print(round(ans_tmp))

Submission status: Wrong Answer

Solution code:
a = input("")
a, b = a.split()
a, b = int(a), int(b)
c, d = 0, 0
while d < b:
    if a == 0:
        break
    c += 1
    d = a * c
print(c)

Submission status: Wrong Answer

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

print(round(ans_tmp))

Submission status: Wrong Answer

Solution code:
A, B = list(int(num) for num in input().split(' '))

num_tap=0
num_source=1

while True:
  num_tap += 1
  num_source += A-1 
  
  if num_source>=B: break
    
print(num_tap)

Submission status: Wrong Answer

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

print((b % a) + 1)

Submission status: Wrong Answer

Solution code:
a = input("")
a, b = a.split()
a, b = int(a), int(b) 
c, d = 0, 0
while d < b:
  c += 1
  d = a * c
print(c)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split(" "))
c = 0
count = 0
while True:
  c += a
  count += 1
  if c >= b:
    print(count)
    exit()
  c -= 1

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split(" "))
c = 0
count = 0
while True:
  c += a
  if c >= b:
    print(count)
    exit()
  c -= 1

Submission status: Wrong Answer

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

tap=0
count=0

if b==1:
  count==0

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

Submission status: Wrong Answer

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

tap=0
count=0

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

x = B / A
if x != 1.0:
  
  x += 1
  x = int(x)

  sum = A * x - (x - 1)

  if sum < B:
    x += 1
print(int(x))

Submission status: Wrong Answer

Solution code:
a = input()
first = True
A = ""
B = ""
for i in range(len(a)):
    if a[i] != " " and first:
        A = A + a[i]
    else:
        first = False
        B = B + a[i]
A = int(A)
B = int(B)
origA = A
origB = B
count = 0
if B > A or B == A:
    while B > 0:
        B = B - A
        count = count + 1
if origA > 1 and origA < 21 and origB > 0 and origB < 21:
    print(count)

Submission status: Wrong Answer

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

x = B // A
if x != 1:
  
  x += 1

  sum = A * x - (x - 1)

  if sum < B:
    x += 1
print(x)

Submission status: Wrong Answer

Solution code:
a = input()
first = True
A = ""
B = ""
for i in range(len(a)):
    if a[i] != " " and first:
        A = A + a[i]
    else:
        first = False
        B = B + a[i]
A = int(A)
B = int(B)
count = 0
if B > A or B == A:
    while B > 0:
        B = B - A
        count = count + 1
print(count)

Submission status: Wrong Answer

Solution code:
a = input()
first = True
A = ""
B = ""
for i in range(len(a)):
    if a[i] != " " and first:
        A = A + a[i]
    else:
        first = False
        B = B + a[i]
A = int(A)
B = int(B)
count = 0
if B > A:
    while B > 0:
        B = B - A
        count = count + 1
print(count)

Submission status: Wrong Answer

Solution code:
a = input()
first = True
A = ""
B = ""
for i in range(len(a)):
    if a[i] != " " and first:
        A = A + a[i]
    else:
        first = False
        B = B + a[i]
A = int(A)
B = int(B)
count = 0
while B > 0 and B > A:
    B = B - A
    count = count + 1
print(count)

Submission status: Wrong Answer

Solution code:
#coding:utf-8
a, b = map(int, input().split())

if a >= b:
    print(1)
else:
    #1つタップを増やすとa-1口増えるので、b-1口増やすことを考える
    tap = -(-(b-1)//(a-1))
    print(tap)

Submission status: Wrong Answer

Solution code:
a = input()
first = True
A = ""
B = ""
for i in range(len(a)):
    if a[i] != " " and first:
        A = A + a[i]
    else:
        first = False
        B = B + a[i]
A = int(A)
B = int(B)
count = 0
while B > 0:
    B = B - A
    count = count + 1
print(count)

Submission status: Wrong Answer

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

if N[1]%N[0]==0:
    print(int(N[1]/N[0]))
else:
    print(int(N[1]/N[0])+1)

Submission status: Wrong Answer

Solution code:
#coding:utf-8
a, b = map(int, input().split())

if a >= b:
    print(1)
else:
    tap = -(-(b-a)//(a-1))
    print(tap)

Submission status: Wrong Answer

Solution code:
s = input()
k = s.split(" ")
a = (int)(k[0])
b = (int)(k[1])
count = 1
n = a
a-=1
while(n<b):
  n+=a
  count+=1
print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

r = 1
cnt = 0
while r < b:
	cnt += 1
	r = r * a

print(cnt)

Submission status: Wrong Answer

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

r = a
cnt = 1
while r < b:
	cnt += 1
	r = r * a

print(cnt)

Submission status: Wrong Answer

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

if b == 1:
  print(0)

elif a >= b:
  print(1)
  
else:
  kuchi, cnt = 4, 1
  while b > kuchi:
    kuchi += a-1
    cnt += 1
  print(cnt)

Submission status: Wrong Answer

Solution code:
a=list(map(int,input().split()))
b=[a[0]]
"""
if a[1]/a[0]==1:
    print(1)
else:
    b=a[1]/a[0]
    if b==1:
        print(2)
    else:
        c=b*(a[0]-1)+a[0]
        if c>=a[1]:
            print(b+1)
        if c<a[1]:
            print(b+2)
"""
count=0
for bn in b:
    if a[1]>bn:
        b.append(bn+b[0]-1)
    else:
        print(len(b))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(a)
print(b)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
i=input();print(-~-int(i[2:])//-~-int(i[:2]))

Submission status: Wrong Answer

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

n=int( (a+b-1)/a)
#print("n:" ,n)
if ((n*a)-(n-1))<b:
    print(n+1)
else:
    print(n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

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

ans = 1
while 1:
    if A * ans >= B:
        break
    ans += 1

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, B = tuple(int(i) for i in input().split(" "))
cnt = 1
total = A
while total < B:
  total += A - 1
  cnt += 1
print(cnt)

Submission status: Wrong Answer

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

c = 1
for i in range(20):
    if b > c:
        c += a-1
    else:
        break
print(c // a-1)

Submission status: Wrong Answer

Solution code:
num = [int(i) for i in input().split(" ")]
print(int(num[1] / num[0] + int(num[1] % num[0] != 0)))

Submission status: Wrong Answer

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

c = 1
for i in range(20):
    if b > c:
        c += a-1
    else:
        break
print(c // a)

Submission status: Wrong Answer

Solution code:
num = [int(i) for i in input().split(" ")]
print(num[1] / num[0] + int(num[1] % num[0] != 0))

Submission status: Wrong Answer

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

c = 1
for i in range(20):
    if b > c:
        c += a-1
    else:
        break
print(-(-c // a))

Submission status: Wrong Answer

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

socket = 1
ans = 0

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

Submission status: Wrong Answer

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

c = 1
for i in range(20):
    if b > c:
        c += a-1
    else:
        break
print(-(c // a))

Submission status: Wrong Answer

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

c = 1
for i in range(20):
    if b > c:
        c += a-1
    else:
        break
print(-(-c // a-1)-1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

c = 1
for i in range(20):
    if b > c:
        c += a-1
    else:
        break
print(-(-c // a-1))

Submission status: Wrong Answer

Solution code:
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
from math import factorial
import heapq, bisect
import math
import itertools





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

    if b == 1:
        print(0)
        sys.exit()

    ans = 1 + math.ceil((b - a) / a)
    print(ans)





if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
from math import factorial
import heapq, bisect
import math
import itertools





def main():
    a, b = map(int, input().split())
    ans = 1 + math.ceil((b - a) / a)
    print(ans)





if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

now = 1
ans = 0
if now >= b:
  print(ans)
ans += 1
now += a
if now >= b:
  print(ans)
while now < b:
  ans += 1
  now += a-1
print(ans)

Submission status: Wrong Answer

Solution code:
from sys import exit, stderr, stdin
input = stdin.readline
# setrecursionlimit(10**7)

def debug(var, name="hoge"):
    print(name +":" + str(type(var)) + " = " + repr(var), file=stderr)
    return


def main():
    N, D = map(int,input().split())
    D-=N
    if (D==1):
        print(0)
        exit()
    ans = 1
    while(D>0):
        ans +=1
        D -= N-1
    print(ans)

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import sys

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


while b >= a:
        add_value += 1
        a *= add_value
        if a >= b:
            break


print(add_value)

Submission status: Wrong Answer

Solution code:
from sys import exit, stderr, stdin
input = stdin.readline
# setrecursionlimit(10**7)

def debug(var, name="hoge"):
    print(name +":" + str(type(var)) + " = " + repr(var), file=stderr)
    return


def main():

    N, D = map(int,input().split())
    D-=N
    ans = 1
    while(D>0):
        ans +=1
        D -= N-1
    print(ans)

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import sys

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

if a >= 20 and a <= 2:
    print("0")
    sys.exit()

while True:
        add_value += 1
        a *= add_value
        if a >= b:
            break


print(add_value)

Submission status: Wrong Answer

Solution code:
import sys

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

if a >= 20 and a <= 2:
    if b >= 20 and b <= 1:
        print("0")
        sys.exit()

while True:
        add_value += 1
        a *= add_value
        if a >= b:
            break


print(add_value)

Submission status: Wrong Answer

Solution code:
import sys

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

if a >= 20 and a <= 2:
    print("0")
    sys.exit()
if b >= 20 and b <= 1:
    print("0")
    sys.exit()

while True:
        add_value += 1
        a *= add_value
        if a >= b:
            break


print(add_value)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
    a, b = map(int, input().split())
    count = 1
    nes = 0
    if b == 1:
        print("1")
    if a >= b:
        print("1")
    else:   
        while count < b:
            count += a - 1
            nes += 1
        print(nes)

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

import math
#x * (a - 1) + 1 >= b

x = math.floor((b - 1) / (a - 1))
print(x)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
taps = 0
while b > taps * a:
    taps += 1
print(taps)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

Solution code:
def power():
    A, B = map(int, input().split())
    socket = A
    numberOfStrips = 1
    if A == B:
        return 1

    while socket < B:
        socket = socket + A - 1
        numberOfStrips = numberOfStrips + 1

    return numberOfStrips


print(power())

Submission status: Wrong Answer

Solution code:
def power():
    A, B= map(int, input().split())
    socket = A
    numberOfStrips = 1
    if A == B:
      return 1
    
    while (socket < B) and (socket != B):
        numberOfStrips = numberOfStrips + 1
        socket = A * numberOfStrips - numberOfStrips
 
    return numberOfStrips
 
 
print(power())

Submission status: Wrong Answer

Solution code:
import math

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

ans = math.ceil(B / A)
while A * ans - (ans - 1) < B:
    ans += 1
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def power():
    A, B= map(int, input().split())
    socket = A
    numberOfStrips = 1
    if A == B:
      return 1
    
    temp = 0
    while (temp < B):
        numberOfStrips = numberOfStrips + 1
        temp = (socket * numberOfStrips) - numberOfStrips
 
    return numberOfStrips
 
 
print(power())

Submission status: Wrong Answer

Solution code:
def power():
    A, B= map(int, input().split())
    socket = A
    numberOfStrips = 1
    if A == B:
      return 1
    
    while (socket < B) and (socket != B):
        socket = socket + A - 1
        numberOfStrips = numberOfStrips + 1
 
    return numberOfStrips
 
 
print(power())

Submission status: Wrong Answer

Solution code:
t,h=map(int,input().split())
if t>=h:
  print(1)
  exit()
a=(h-t)%(t-1)
print((h+t-1)//t)

Submission status: Wrong Answer

Solution code:
def power():
    A, B= map(int, input().split())
    socket = A
    numberOfStrips = 1
    if A == B:
      return 1
    
    while socket < B:
        socket = socket + A - 1
        numberOfStrips = numberOfStrips + 1
 
    return numberOfStrips
 
 
print(power())

Submission status: Wrong Answer

Solution code:
import math


def power():
    A, B = map(int, input().split())
    socket = A
    numberOfStrips = 1
    if A == B:
        return 1

    while socket <= B:
        socket = socket + A - 1
        numberOfStrips = numberOfStrips + 1

    return numberOfStrips


print(power())

Submission status: Wrong Answer

Solution code:
def power():
    A, B= map(int, input().split())
    socket = A
    numberOfStrips = 1
    if A == B:
        return 1
    
    while socket <= B:
        socket = socket + A - 1
        numberOfStrips = numberOfStrips + 1
 
    return numberOfStrips
 
 
print(power())

Submission status: Wrong Answer

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

ans = math.ceil(B / A)
if A * ans - (ans - 1) < B:
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
def power():
    A, B= map(int, input().split())
    socket = A
    numberOfStrips = 1
    while socket <= B:
        socket = socket + A - 1
        numberOfStrips = numberOfStrips + 1
 
    return numberOfStrips
 
 
print(power())

Submission status: Wrong Answer

Solution code:
def power():
    A, B= map(int, input().split())
    socket = A
    numberOfStrips = 1
    while socket < B:
        socket = socket + A - 1
        numberOfStrips = numberOfStrips + 1
 
    return numberOfStrips
 
 
print(power())

Submission status: Wrong Answer

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

ans = math.ceil(B / A)
if A * ans - (ans - 1) <= B:
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
import math
 
def power():
    A, B= map(int, input().split())
    return math.ceil(B / A)
 
print(power())

Submission status: Wrong Answer

Solution code:
import math

def power():
    A, B= map(int, input().split())
    return math.ceil(A / B)

print(power())

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 = map(int, input().split())

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

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

A, B = map(int, input().split())
N = 0
count = 0
while True:
    N += 1
    count = N * A - (N - 1)
    if count >= B:
        print(N)
        exit()

Submission status: Wrong Answer

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

a -= 1
b -= 1
ans = 0
while True:
    ans += 1
    b = b-a
    if b <= 0:
        print(ans)
        break

Submission status: Wrong Answer

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

if a >= b:
    print(1)
    exit()

b = b-a
ans = 1
while True:
    ans += 1
    b = b+1-a
    if b <= 0:
        print(ans)
        break

Submission status: Wrong Answer

Solution code:
A,B=map(int,input().split())
print(B//A+1 if B%A else 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())

value = A
ans = 1

while True:
  if value >= B:
    break
  else:
    value += A
    ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
a,b=map(int, input().split())
i=1
k=1
for f in range(100):
	i+=1
	k+=1
	if a*i<b:
		continue
	else:
		print(k)
		break

Submission status: Wrong Answer

Solution code:
a,b=map(int, input().split())
i=1
k=1
for f in range(20):
	i+=1
	k+=1
	if a*i<b:
		continue
	else:
		print(k)
		break

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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())

cnt=1
kuti=a

while 1:
    if kuti > b:
        break  
    #1こ穴使ってさらに繋げる
    cnt+=1
    kuti -= 1
    kuti += a
   
print(cnt)

Submission status: Wrong Answer

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

cnt=1
kuti=a

while 1:
    if kuti >= b:
        break  
    #1こ穴使ってさらに繋げる
    cnt+=1
    kuti -= 1
    kuti += a
   
print(cnt)

Submission status: Wrong Answer

Solution code:
A, B = map(int,input().split())
Socket = 0
kuchi = 1

while kuchi < B:
    Socket += 1
    kuchi += (A - 1)

print(kuchi)

Submission status: Wrong Answer

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

out=0
cnt=1

if b<=a:
    out=1
else:
    kuti = a
    while 1:
        cnt+=1
        kuti -= 1
        kuti += a
        if kuti >= b:
            break
    out = cnt
        

print(out)

Submission status: Wrong Answer

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

out=0
cnt=1

if b<=a:
    out=1
else:
    kuti = a
    while 1:
        cnt+=1
        kuti += (a-1)
        if kuti >= b:
            break
    out = cnt
        

print(out)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
mondai = input().split(" ")
kuchi = int(mondai[0])
want = int(mondai[1])

ans = 0
num = 1
while int(num) < want:
    
    ans += 1
    num = ans * kuchi

print(ans)

Submission status: Wrong Answer

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

if A >= B:
  print(ans)
else:
  C = B - A
  D = A - 1
  while True:
    if C - D > 0:
      ans += 1
      C -= D
    else:
      ans += 1
      print(ans)
      break

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

while num < b:
    ct += 1
    num += a
    
print(ct)

Submission status: Wrong Answer

Solution code:
A,B=map(int, input().split())
n=1
while (A-1)*(n-1)+A<B:
  n+=1
print(n if B!=1 else 1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
ab=list(map(int,input().split()))
print(math.ceil(ab[1]/ab[0]))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

dp = [0] * 21
dp[0] = 1
for i in range(1, 21):
    dp[i] = dp[i-1] + (A-1)
    if dp[i] >= B:
        print(i)
        exit()

Submission status: Wrong Answer

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

count = 1
t = A
q = B
while q - t > 0:
    q = q - t
    t = A - 1
    count += 1
print(count)

Submission status: Wrong Answer

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

count = 1
t = A
q = B
while q - t > 0:
    t = A - 1
    q = q - t
    count += 1
print(count)

Submission status: Wrong Answer

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

count = 1
t = A
q = B
while q - t > 0:
    q = q - t - 1
    t = A - 1
    count += 1
print(count)

Submission status: Wrong Answer

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

count = 1
t = A
q = B
while q - t >= 0:
    q = q - t
    t = A - 1
    count += 1
print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

x = b%(a-1)

if x<=1:
  print(b//(a-1))
else:
  print(b//(a-1)+1)

Submission status: Wrong Answer

Solution code:
def resolve():
    A,B = map(int,input().split())
    ans = 1
    temp = A

    while(1):
        if temp < B:
            temp += A-1
            ans += 1
        else:
            break
    print(ans)
resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B = map(int, open(0).read().split())
MAX = 20
plug = 1
for i in range(MAX):
  plug -= 1
  plug += A
  if(plug >= B):
    print(i+1)
    break
    exit()

Submission status: Wrong Answer

Solution code:
A,B = map(int, open(0).read().split())
MAX = 1000000000000000000
plug = 1
for i in range(MAX):
  plug -= 1
  plug += A
  if(plug >= B):
    print(i+1)
    exit()

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, open(0).read().split())
MAX = 10000000000
plug = 1
for i in range(MAX):
  plug -= 1
  plug += A
  if(plug >= B):
    print(i+1)
    exit()

Submission status: Wrong Answer

Solution code:
print(-eval("-~"+input().replace(" ","//~")))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
Str=input()
ss=[int(s) for s in Str.split() if s.isdigit()]
A=ss[0]
B=ss[1]
print(math.ceil(B/A))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n,m=map(int,input().split())

if m%n==0:
    print(m//n)
else:
    print((m//n)+1)

Submission status: Wrong Answer

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

l = A
n = 1
while l < B:
    l -= 1
    l += A
    n += 1
print(n)

Submission status: Wrong Answer

Solution code:
from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations
import sys
import bisect
import string
sys.setrecursionlimit(10**6)
def SI():
    return input().split()
def MI():
    return map(int,input().split())
def I():
    return int(input())
def LI():
    return [int(i) for i in input().split()]
YN=['Yes','No']
mo=10**9+7

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

while True:
  if a >= b:
    break
  a += (a - 1)
  c += 1

print(c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

while True:
  a += (a - 1)
  c += 1
  if a >= b:
    break
    
print(c)

Submission status: Wrong Answer

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

kuti = a
ans = 1

while kuti < b:
    kuti += a - 1
    ans += 1

print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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