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())
c = 1
while a < b:
  a += a-1
  c += 1
print(c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

while True:
    for e in range(1, s+1):
        c += 1
        s = s - 1 + e * a
        if s >= b:
            print(c)
            break
    else:
        continue
    break

Submission status: Wrong Answer

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

while True:
    for e in range(1, s+1):
        c += 1
        s = s - 1 + e * a
        # print("c", c)
        # print("s", s)
        if s >= b:
            print(c)
            break
    else:
        continue
    break

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
datos=input().split()
M=int(datos[0])
N=int(datos[1])
if M>=2 and M<=20 and N>=1 and N<=20:
    division=N/M
    residuo= N%M
    if residuo == 0:
        print(str(int(division)))
    elif residuo != 0:
        print(str(int(division)+1))
    else:
        exit

Submission status: Wrong Answer

Solution code:
M, N = input().split()
M=float(M)
N= float(N)

if M >= 2 and M <= 20 and N >= 1 and N <= 20 :
    A = N/M
    cont = 1
    while A > 0:
        #print(N%M)
        if N%M != 0:
            cont+=1
            M+=M
            A=N//M
        elif N%M == 0:
            cont+=1
            break
        else:
            break
    print(cont)

Submission status: Wrong Answer

Solution code:
MN=input().split()
cont=0
M=int(MN[0]) #outs
N=int(MN[1]) #friends  
div=int(N/M)
if N>M:
  if (N%M)<N and (N%M)>0:
    cont=1 
  elif (N%M)==0: 
    cont=0
  print(cont+div)

elif N<M or N==M:
  cont=1
  print(cont)

Submission status: Wrong Answer

Solution code:
def calulate(m, n) : 
	n_adapters = 0
	if n <= m :
		n_adapters = 1
	else :
		n_adapters = n//m
		if n % m != 0:
			n_adapters += 1
	print(n_adapters)

M, N = map(int, input().split())

calulate(M, N)

Submission status: Wrong Answer

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

if M >= 2 and M <= 20 and N >= 1 and N <= 20 :
    A = N/M
    cont = 1
    while A > 0:
        #print(N%M)
        if N%M != 0:
            cont+=1
            M+=M
            A=N//M
        elif N%M == 0:
            cont+=1
            break
        else:
            break
    print(cont)

Submission status: Wrong Answer

Solution code:
def calulate(m, n) : 
	n_adapters = 0
	if n <= m :
		n_adapters = 1
	else :
		n_adapters = n//m
		if n % m != 0:
			n_adapters += 1
	return n_adapters

M, N = map(int, input().split())
print(calulate(M, N))

Submission status: Wrong Answer

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

if M >= 2 and M <= 20 and N >= 1 and N <= 20 :
    A = N/M
    cont = 1
    while A > 0:
        #print(N%M)
        if N%M != 0:
            cont+=1
            M+=M
            A=N//M
         
        else:
            break
    print(cont)

Submission status: Wrong Answer

Solution code:
MN=input().split()
cont=0
M=int(MN[0]) #outs
N=int(MN[1]) #friends  
div=int(N/M)
if N>M:
  if (N%M)<N and (N%M)>0:
    cont=1 
  elif (N%M)==0: 
    cont=0
  print(cont+div)

elif N<M:
  cont=1
  print(cont)

Submission status: Wrong Answer

Solution code:
datos=input().split()
M=int(datos[0])
N=int(datos[1])
division=N/M
residuo= N%M
if residuo == 0:
   print(str(int(division)))
elif residuo != 0:
   print(str(int(division)+1))
else:
    exit

Submission status: Wrong Answer

Solution code:
datos=input().split()
M=int(datos[0])
N=int(datos[1])
division=N/M
residuo= N%M
if residuo == 0:
   print(str(int(division)))
elif residuo != 0:
   print(str(int(round(division))+1))

Submission status: Wrong Answer

Solution code:
def calulate(m, n) : 
	n_adapters = n//m
	if n % m != 0:
		n_adapters += 1
	return n_adapters

Submission status: Wrong Answer

Solution code:
def calulate(m, n) : 
	n_adapters = n//m
	if n > m :
		n_adapters += 1
	print(n_adapters)

Submission status: Wrong Answer

Solution code:
def calulate(m, n) : 
	n_adapters = n//m
	if n > m :
		n_adapters += 1
	return n_adapters

Submission status: Wrong Answer

Solution code:
mn = list(input().split())
mn = [int(i) for i in mn]
m = mn[0]
n = mn[1]
if m>=n:
	print("1")
else:
	outputs = m
	i = 2
	while outputs<n:
		outputs = m*i
		i += 1
	print(str(i-1)+" adapters, each with "+str(m)+" audio outputs, extend the single audio output to "+str(n))

Submission status: Wrong Answer

Solution code:
def calulate(m, n) : 
	n_adapters = 0
	while n > 0 :
		if n > m :
			n = n - m + 1
		else :
			n = n-m
		n_adapters += 1
	return n_adapters

Submission status: Wrong Answer

Solution code:
def calulate(m, n) : 
	n_adapters = 0
	while n > 0 :
		if n > m :
			n = n - m + 1
		else :
			n = n-m
		n_adapters += 1
	return n_adapters

print(calulate(4, 10))

Submission status: Wrong Answer

Solution code:
m, n = map(int, input().split())
r=m
i=1
while r<n :
	r=r+m-1
	i+=1
print(i)

Submission status: Wrong Answer

Solution code:
datos=input().split()
M=int(datos[0])
N=int(datos[1])
division=N/M
residuo= N%M
if residuo == 0:
   print(str(division))
elif residuo != 0:
   print(str(int(round(division))+1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
[a, b]= input().split(' ')
m = int(b) % int(a)
print(m+1 if m >=0 else m)

Submission status: Wrong Answer

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


for i in range(1,21):
    N = 1 + A*i -i
    if N >=B:
        print(i)
        break
    else:
        pass

Submission status: Wrong Answer

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


if A >= B:
    print(1)

elif A < B:
    for i in range(2,21):
        C = A * i -1
        if C >= B:
            print(i)
            break

Submission status: Wrong Answer

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


if A >= B:
    print(1)

elif A < B:
    for i in range(2,20):
        C = A * i -1
        if C >= B:
            print(i)
            break

Submission status: Wrong Answer

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

n = 1
if A >= B:
    print(1)

elif A < B:
    for i in range(2,20):
        C = i*A - (i-1)
        if C >= B:
            print(i)
            break

Submission status: Wrong Answer

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

if A >= B:
    print(1)
    
elif A<B:
    print(B//A +1)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(B//A +1)

Submission status: Wrong Answer

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


solve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
[a,b] = [int(i) for i in 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())
num = 1
ans = 0
while num < B:
  num += (A-1)
  ans += 1

Submission status: Wrong Answer

Solution code:
#B - Power Socket
A,B = map(int,input().split())

count = 0
total_plug = 1
for i in range(1,100):
    count += 1
    total_plug += (A - 1)
    if B <= total_plug:
        break
        
print(count)

Submission status: Wrong Answer

Solution code:
#B - Power Socket
A,B = list(map(int,input().split()))

count = 0
total_plug = 1
for i in range(1,20):
    count += 1
    total_plug += (A - 1)
    if B <= total_plug:
        break
        
print(count)

Submission status: Wrong Answer

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

print(cnt)

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

Submission status: Wrong Answer

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

else:
    som = 0
    cnt = 0
    while(som < b):
        cnt = cnt+1
        som = som+a
        if som >= b:
            break

        else:
            som = som-1

    print(cnt)

Submission status: Wrong Answer

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

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

    print(cnt)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
som = 0
cnt = 0
while(som < b):
    som = som+a
    cnt = cnt + 1
    if som < b:
        continue

    else:
        print(cnt)
        break

Submission status: Wrong Answer

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

num = 1
res = 0

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

print(num)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
#f = 0
if b <= a:
    print(1)

else:
    som = a
    cnt = 1
    while (som < b):
        som = som + a
        cnt = cnt + 1
        if som < b:
            som = som - 1

        else:
            print(cnt)
            break

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
#f = 0
if b <= a:
    print(0)
    
else:
    som = 0
    cnt = 0
    while (som < b):
        som = som + a
        cnt = cnt + 1
        if som < b:
            som = som - 1

        else:
            print(cnt)
            break

Submission status: Wrong Answer

Solution code:
x = list(map(int, input().split()))
syou = x[1] / x[0]
amari = x[1] % x[0]

if(amari > 0 ):
    print(syou+1)
else:
    print(syou)

Submission status: Wrong Answer

Solution code:
x = list(map(int, input().split()))
syou = x[0] / x[1]
amari = x[0] % x[1]

if(amari > 0 ):
    print(syou+1)
else:
    print(syou)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
#f = 0
som = 0
cnt = 0
while(som < b):
    som = som+a
    cnt = cnt + 1
    if som < b:
        som = som-1

    else:
        print(cnt)
        break

#print(cnt)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
f = 0
som = 0
cnt = 0
while(som < b and f == 0):
    som = som+a
    if som < b:
        som = som-1
        cnt = cnt+1

print(cnt+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b = [int(x) for x in input().split()]
print((b - a) // (a - 1) + 1)

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

Solution code:
MM = input().split()
A = int(MM[0])
B = int(MM[1])
total = 1
count = 0
while total >= B:
  total += A-1
  count += 1
print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b = list(map(int, input().strip().split()))
t=a
s=1
for i in range(b*2):
   t+=a-1
   s+=1
   if t>=b:
       break
if b<=a:
    s=1
print(s)

Submission status: Wrong Answer

Solution code:
A,B=[int(x) for x in input().split(" ")]
for i in range(20):
    if A+i*(A-1)>=B: break
print(i)

Submission status: Wrong Answer

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

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

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=list(map(int,input().split()))
a=A[0]
b=A[1]
count=1
i=a
while i<b:
    count=count+1
    i=i+a-1
print(count)

Submission status: Wrong Answer

Solution code:
A=list(map(int,input().split()))
a=A[0]
b=A[1]
i=0
count=1
while a<b:
    count=count+1
    i=i+1
    a=a+a-1
print(count)

Submission status: Wrong Answer

Solution code:
A=list(map(int,input().split()))
a=A[0]
b=A[1]
i=0
count=1
while a*i+a-i<b:
    count=count+1
    i=i+1
print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A=list(map(int,input().split()))
a=A[0]
b=A[1]
count=1
while a<b:
    a=a+a
    count=count+1
print(count)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
num=1
hoge=a
while b>hoge:
  hoge+=a
  num+=1

print(num)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
num=1
hoge=a
while b>=hoge:
  hoge+=a
  num+=1

print(num)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
num=1
hoge=a
while hoge>=b:
  hoge+=a
  num+=1

print(num)

Submission status: Wrong Answer

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

count = 1
nums = A
while nums < B:
    nums += A - 1
    count += 1

print(count)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
ans=1
for i in range(a,b,a-1):
  ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
ans=1
for i in range(a,b,a-1):
  ans+=1
print(ans+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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:
import math
A, B = map(int, input().split())

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

count=0

while count*A+count-1<=B:
    count+=1

print(count)

Submission status: Wrong Answer

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

count=0

while count*A+count-1<B:
    count+=1

print(count)

Submission status: Wrong Answer

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

count=0

while count*A+A-1<B:
    count+=1

print(count)

Submission status: Wrong Answer

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))

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

ans = 0
for i in range(1,1000000000):
    if (b <= 0):
        break
    if (i == 1):
        b -= a
    else:
        b -= (a-1)
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))

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

ans = 0
for i in range(1,1000000000):
    if (b >= 0):
        break
    if (i == 1):
        b -= a
    else:
        b -= (a-1)
    ans += 1
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))

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

ans = 0
for i in range(1,1000000000):
    if (i == 1):
        b -= a
    else:
        b -= (a-1)
    ans += 1
    if (b <= 0):
        break
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b = list(map(int, input().split()))
s = a - 1
t = b-1
asn = (s + t -1) // s

Submission status: Wrong Answer

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

def main():

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

    n = (B // (A - 1)) + 1

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

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

main()

Submission status: Wrong Answer

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

main()

Submission status: Wrong Answer

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

main()

Submission status: Wrong Answer

Solution code:
import heapq
t = 1
def max(a,b):
	if a > b:
		return a
	return b
def min(a,b):
	if a < b:
		return a
	return b

while t > 0:
	t -= 1
	a,b = map(int,input().split())
	i = 1
	c = a
	while a < b:
		if(i == 0):
			a = a+(c)
		else:
			a = a+(c-1)
		i += 1
		# a = a*c
	print(i)

Submission status: Wrong Answer

Solution code:
import heapq
t = 1
def max(a,b):
	if a > b:
		return a
	return b
def min(a,b):
	if a < b:
		return a
	return b

while t > 0:
	t -= 1
	a,b = map(int,input().split())
	i = 1
	while a*i < b:
		i += 1
	print(i)
	# n = int(input())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i in range(11):
  if i * A >= B:
    break
print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

# b -= a
# counter = 1
# while b > 0:
#     b -= a - 1
#     counter += 1

# print(counter)

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

Submission status: Wrong Answer

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

b -= a
counter = 1
while b > 0:
    b -= a - 1
    counter += 1

print(counter)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x, y = list(map(int, input().strip().split()))
print(y//x+1)

Submission status: Wrong Answer

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

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());print([b//a+1,b//a][b%a==0])

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:
def solve(a,b):
  def needTaps(a,b,holes=0,res=0):
    if holes >= b:
      return res
    elif holes == 0:
      holes += 1
    return needTaps(a,b,holes+a-1,res+1)
    
  return needTaps(a,b)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
if (b == 1)|(a == b):
    ans = 1
else:
    result = a*2 - 1
    ans = 2
    for _ in range(20):
        if result >= b:
            break
        else:
            result += a-1
            ans += 1
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

result = 0
result += a
cnt = 1

while b < result:
    result += a - 1
    cnt += 1

print(cnt)

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
if a>=b: print(1)
else:
	x=a+a-1
	t=1
	while x<b:
		t+=1
		x+=a-1
		pass
	print(t+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
num = list(input().split()) 
a = int(num[0])
b = int(num[1])
ans = 0
while b > 0:
    b -= a
    ans += 1

print(ans)

Submission status: Wrong Answer

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

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 = map(int, input().split())
print((b >= a) + max(((b - a) // (a - 1)), 0))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = list(map(int, input().split(' ')))
if 10 % n[0] == 0:
  print(10 // n[0])
else:
  print(10 // n[0] +1)

Submission status: Wrong Answer

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

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

n = 1
for i in range(1,50):
  n += A-1
  if n>=B:break

print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
    A,B = [int(x) for x in input().split()]
    ans = 0
    p = 1
    for i in range(A+1):
        if p >= B:
            break
        p += A-1
        ans += 1
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

while True:
  sums += a-1
  count +=1
  if sums >= b:
    print(count)
    exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import math

A,B = map(int,input().split())
if not ( 2 <= A <= 20 and 1 <= B <= 20 ): sys.exit()

for I in range(math.ceil(B/A),21):
    if I*A-(I-1) >= B:
        print(I)
        sys.exit()

Submission status: Wrong Answer

Solution code:
import sys
import math

A,B = map(int,input().split())
if not ( 2 <= A <= 20 and 1 <= B <= 20 ): sys.exit()


for I in range(math.ceil(B/A),21):
    print(I)
    if I*A-(I*A-1) >= B:
        print(I)
        sys.exit()

Submission status: Wrong Answer

Solution code:
import sys
import math

A,B = map(int,input().split())
if not ( 2 <= A <= 20 and 1 <= B <= 20 ): sys.exit()

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

Submission status: Wrong Answer

Solution code:
import sys
import math

A,B = map(int,input().split())
if not ( 2 <= A <= 20 and 1 <= B <= 20 ): sys.exit()

print(math.ceil(B/A))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
A,B=list(map(int, input().split()))
ans=0
for i in range(B):
    if A*i<B:
        ans=ans+1
print(ans)

Submission status: Wrong Answer

Solution code:
A,B=list(map(int, input().split()))
ans=0
for i in range(B):
    if A*i<=B:
        ans=ans+1
print(ans)

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())
import math
print(math.ceil(b/a))

Submission status: Wrong Answer

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

x = 1

while A * x - (x - 1) < B:
    x += 1
    print(x)
print(x)

Submission status: Wrong Answer

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

x = 1

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

print(x)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if B == 1:
    print(0)
else:
    result += require_socket // (A - 1)
    if (require_socket / (A - 1)).is_integer() is False:
        result += 1

print(result)

Submission status: Wrong Answer

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

if B == 1:
    print(0)
else:
    result += require_socket // A - 1
    if (require_socket / A - 1).is_integer() is False:
        result += 1

print(result)

Submission status: Wrong Answer

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

if B == 1:
    print(0)
else:
    result += require_socket // A
    if (require_socket / A).is_integer() is False:
        result += 1

print(result)

Submission status: Wrong Answer

Solution code:
A,B = map(int, input().split())
sumA = A
if sumA >= B:
  print(1)
  exit(0)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B = map(int, input().split())
sumA = A
for i in range(1,20):
  if sumA >= B:
    print(i)
    break
  else:
    sumA += A