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 = (int(x) for x in input().split())

S = A
num  = 1
i = 0

if (B == 1):
    print("0")
elif (A >= B):
    print("1")
else:
    while(S < B):
        i = 0
        A = A * 2
        S = A - i
        num += 1
        i += 1
    
    print(num)

Submission status: Wrong Answer

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

S = A
num  = 1
i = 0

if (A > B):
    print("0")
elif (A == B):
    print("1")
else:
    while(S < B):
        i += 1
        A = A * 2
        S = A - i
        num += 1

print(num)

Submission status: Wrong Answer

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

S = A
num  = 0
i = 0

while(S < B):
    i += 1
    A = A * 2
    S = A - i
    num += 1

print(num)

Submission status: Wrong Answer

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

S = A
num  = 1
i = 0

while(S < B):
    i += 1
    A = A * 2
    S = A - i
    num += 1

print(num)

Submission status: Wrong Answer

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

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

print(num)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/local/bin/python3
# coding: utf-8


hairu = input()
sockets = 0
plugs = 1
ab = hairu.split()

while True:
    sockets += 1
    plugs -= 1
    plugs += int(ab[0])
    if int(ab[1]) <= plugs:
        print(sockets)
        break

Submission status: Wrong Answer

Solution code:
#!/usr/local/bin/python3
# coding: utf-8


hairu = input()
sockets = 0
plugs = 1
ab = hairu.split()

while True:
    sockets += 1
    plugs -= 1
    plugs += int(ab[0])
    if int(ab[1]) < plugs:
        print(sockets)
        break

Submission status: Wrong Answer

Solution code:
x = input().split()

a = int(x[0])
b = int(x[1])

c = 1
outlet = a

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

Submission status: Wrong Answer

Solution code:
x = input().split()

a = int(x[0])
b = int(x[1])

c = 1
outlet = a

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

Submission status: Wrong Answer

Solution code:
x = input().split()

a = int(x[0])
b = int(x[1])

c = 1
outlet = 1

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

Submission status: Wrong Answer

Solution code:
x = input().split()

a = int(x[0])
b = int(x[1])

c = 1
outlet = a

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

Submission status: Wrong Answer

Solution code:
x = input().split()

a = int(x[0])
b = int(x[1])

c = 1
outlet = a

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

Submission status: Wrong Answer

Solution code:
x = input().split()

a = int(x[0])
b = int(x[1])

c = 1
outlet = a

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

Submission status: Wrong Answer

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

t = B // A
min = 1

for i in range(1,t+1):
    if ((A * i) - i-1) <= B:
        min += 1
    else:
        break
    

print(min)

Submission status: Wrong Answer

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

sumu = 1
count = 0
while True:
    sumu += A-1
    count += 1
    if sumu >= B:
        break

print(count)

Submission status: Wrong Answer

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

sumu = 0
count = 0
for i in range(A):
    if i==0:
        sumu += A
        count += 1
    else:
        sumu += A-1
        count += 1
    if sumu >= B:
        break

print(count)

Submission status: Wrong Answer

Solution code:
import sys
import math
import bisect

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

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

result=b/a+b%a

print(int(result))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B = [int(hoge) for hoge in input().split()]
print((B-1)//(A-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())
 
n = int(b-1/a-1) + 1
 
print(n)

Submission status: Wrong Answer

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

n = int(a-1/b-1) + 1

print(n)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

result = 0
cnt = 1
while cnt < B:
    result += 1
    cnt += 1

print(cnt)

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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 + 1 ) // A))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
  print( (b - 1) / (a - 1) )

Submission status: Wrong Answer

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

for i in range(10):
  c = (a * i) - (i - 1)
  if c >= b:
    ans = i
    break
  
print(ans)

Submission status: Wrong Answer

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

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:
import math
s = input().split()
A = int(s[0])
B = int(s[1])
y = B / (A - 1)
x = math.ceil(y)
print(x)

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)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
    s, t = list(map(int, input().split()))
    tap = s
    count = 1
    while tap < t:
        tap += s - 1
        count += 1
    print(count)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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:
from sys import argv

debug = 'a' in argv
a, b = map(int, input().split())
ans = 0
if b < 2:
    print(0)
    raise SystemExit(0)
if b <= a:
    print(1)
    raise SystemExit(0)
if debug:
    print("eeeeeeeeeeeeeeeeeeeeeeeeeee")
for i in range(int(1e9)):
    if i != 0:
        a *= 2
    b += 1
    ans += 1
    if a >= b:
        print(ans)
        break

Submission status: Wrong Answer

Solution code:
# B - Power Socket

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

Submission status: Wrong Answer

Solution code:
# B - Power Socket

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

Submission status: Wrong Answer

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

while True:
    if b <= s:
        break
    else:
        s = s + a - 1
        t = t + 1

print(t)

Submission status: Wrong Answer

Solution code:
import math

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

print(math.ceil(b / a))

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())
if(a != b):
  ans = (b // a) + 1
else:
  ans = b // a
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
### ----------------
### ここから
### ----------------

import sys
from io import StringIO
import unittest

def yn(b):
    print("Yes" if b==1 else "No")
    return

def resolve():
    readline=sys.stdin.readline

    a,b=map(int, readline().rstrip().split())
    #arr=list(map(int, readline().rstrip().split()))
    #n=int(readline())
    #ss=readline().rstrip()
    #yn(1)
    n=1
    tap=0
    while 1:
        n-=1
        n+=a
        tap+=1
        if n>=b:
            print(tap)
            break


    return

if 'doTest' not in globals():
    resolve()
    sys.exit()

### ----------------
### ここまで 
### ----------------

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if a>=b:
    n = 0
else:
    n = 1
    while n*a-n+1<b:
        n += 1

print(n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(n)

Submission status: Wrong Answer

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

for i in range(10):
  if a * i >= b:
    ans = i
    print(ans)
    sys.exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

cont=0

cont+=A
cnt=1

while cont<B:
    cont+=A-1
    cnt+=1

print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

input = sys.stdin.readline

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys

input = sys.stdin.readline

def main():
    a,b = map(int, input().split())
    ans = b // a
    if ans != 1:
        ans += 1
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

cnt = 0
while True:
  cnt = B // A
  B = B % A
  if B < A:
    break

if B != 0:
  cnt += 1
    
print(cnt)

Submission status: Wrong Answer

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

result =  a
cnt =1

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

Submission status: Wrong Answer

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

result =0
cnt =1

while 1:
    if a*cnt-1 < b:
            cnt+=1
    else:
        break

print(cnt)

Submission status: Wrong Answer

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

temp = b//a

if b%a!=0:
    temp+=1
    
print(temp)

Submission status: Wrong Answer

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


resolve()

Submission status: Wrong Answer

Solution code:

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

resolve()

Submission status: Wrong Answer

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

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

resolve()

Submission status: Wrong Answer

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

ans = 0
s = 1
while s < b:
  ans += a
  s += a - 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())

s = b - a
ans = (s //(a - 1)) + 1
print(ans)

Submission status: Wrong Answer

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

tmp = A
ans = 1

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

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:
from math import factorial as fact
import math
import sys
import itertools
import numpy as np
from collections import Counter
import datetime


#入力:N(int:整数)
def input1():
	return int(input())

#入力:N,M(int:整数)
def input2():
	return map(int,input().split())

#入力:[n1,n2,...nk](int:整数配列)
def input_array():
	return list(map(int,input().split()))

def keta(N):
	return len(str(N))


def input_daytime(input_time):
	time,distance=input_time.split()
	t=time.split(":")
	se=str(t[-1]).split(".")
	dt1 = datetime.timedelta(hours=int(t[0]),minutes=int(t[1]),seconds=int(se[0]),milliseconds=int(se[1]))
	return dt1

def combinations(n,r):
	return list(itertools.combinations(range(n),r))



def all_sets(num_list):
	subsets=[]
	for i in range(2,len(num_list) + 1):
		for c in combinations(num_list, i):
			subsets.append(c) 
	return subsets

#公約数の列挙
def ch(x1):
	cf=[]
	for i in range(2,math.sqrt(x1)+1):
		if x1 % i==0:
			cf.append(i)
	return cf

def CountOneRoots(x,y):
	#x:縦，y:横
	return fact(x+y)/fact(x)/fact(y)

# 素因数分解
def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a
			


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

Submission status: Wrong Answer

Solution code:
from math import factorial as fact
import math
import sys
import itertools
import numpy as np
from collections import Counter
import datetime


#入力:N(int:整数)
def input1():
	return int(input())

#入力:N,M(int:整数)
def input2():
	return map(int,input().split())

#入力:[n1,n2,...nk](int:整数配列)
def input_array():
	return list(map(int,input().split()))

def keta(N):
	return len(str(N))


def input_daytime(input_time):
	time,distance=input_time.split()
	t=time.split(":")
	se=str(t[-1]).split(".")
	dt1 = datetime.timedelta(hours=int(t[0]),minutes=int(t[1]),seconds=int(se[0]),milliseconds=int(se[1]))
	return dt1

def combinations(n,r):
	return list(itertools.combinations(range(n),r))



def all_sets(num_list):
	subsets=[]
	for i in range(2,len(num_list) + 1):
		for c in combinations(num_list, i):
			subsets.append(c) 
	return subsets

#公約数の列挙
def ch(x1):
	cf=[]
	for i in range(2,math.sqrt(x1)+1):
		if x1 % i==0:
			cf.append(i)
	return cf

def CountOneRoots(x,y):
	#x:縦，y:横
	return fact(x+y)/fact(x)/fact(y)

# 素因数分解
def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a
			


a,b=input2()
p=0
count=a
for i in range(2,20):
	count+=a-1
	if count>=b:
		print(i)
		break

Submission status: Wrong Answer

Solution code:
from math import factorial as fact
import math
import sys
import itertools
import numpy as np
from collections import Counter
import datetime


#入力:N(int:整数)
def input1():
	return int(input())

#入力:N,M(int:整数)
def input2():
	return map(int,input().split())

#入力:[n1,n2,...nk](int:整数配列)
def input_array():
	return list(map(int,input().split()))

def keta(N):
	return len(str(N))


def input_daytime(input_time):
	time,distance=input_time.split()
	t=time.split(":")
	se=str(t[-1]).split(".")
	dt1 = datetime.timedelta(hours=int(t[0]),minutes=int(t[1]),seconds=int(se[0]),milliseconds=int(se[1]))
	return dt1

def combinations(n,r):
	return list(itertools.combinations(range(n),r))



def all_sets(num_list):
	subsets=[]
	for i in range(2,len(num_list) + 1):
		for c in combinations(num_list, i):
			subsets.append(c) 
	return subsets

#公約数の列挙
def ch(x1):
	cf=[]
	for i in range(2,math.sqrt(x1)+1):
		if x1 % i==0:
			cf.append(i)
	return cf

def CountOneRoots(x,y):
	#x:縦，y:横
	return fact(x+y)/fact(x)/fact(y)

# 素因数分解
def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a
			


a,b=input2()
p=0
count=0
while p<b:
	p+=a-1
	count+=1
print(count)

Submission status: Wrong Answer

Solution code:
from math import factorial as fact
import math
import sys
import itertools
import numpy as np
from collections import Counter
import datetime


#入力:N(int:整数)
def input1():
	return int(input())

#入力:N,M(int:整数)
def input2():
	return map(int,input().split())

#入力:[n1,n2,...nk](int:整数配列)
def input_array():
	return list(map(int,input().split()))

def keta(N):
	return len(str(N))


def input_daytime(input_time):
	time,distance=input_time.split()
	t=time.split(":")
	se=str(t[-1]).split(".")
	dt1 = datetime.timedelta(hours=int(t[0]),minutes=int(t[1]),seconds=int(se[0]),milliseconds=int(se[1]))
	return dt1

def combinations(n,r):
	return list(itertools.combinations(range(n),r))



def all_sets(num_list):
	subsets=[]
	for i in range(2,len(num_list) + 1):
		for c in combinations(num_list, i):
			subsets.append(c) 
	return subsets

#公約数の列挙
def ch(x1):
	cf=[]
	for i in range(2,math.sqrt(x1)+1):
		if x1 % i==0:
			cf.append(i)
	return cf

def CountOneRoots(x,y):
	#x:縦，y:横
	return fact(x+y)/fact(x)/fact(y)

# 素因数分解
def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a
			


a,b=input2()
count=0
for i in range(1000):
	count+=a
	if count>=b:
		print(i+1)
		break

Submission status: Wrong Answer

Solution code:
from math import factorial as fact
import math
import sys
import itertools
import numpy as np
from collections import Counter
import datetime


#入力:N(int:整数)
def input1():
	return int(input())

#入力:N,M(int:整数)
def input2():
	return map(int,input().split())

#入力:[n1,n2,...nk](int:整数配列)
def input_array():
	return list(map(int,input().split()))

def keta(N):
	return len(str(N))


def input_daytime(input_time):
	time,distance=input_time.split()
	t=time.split(":")
	se=str(t[-1]).split(".")
	dt1 = datetime.timedelta(hours=int(t[0]),minutes=int(t[1]),seconds=int(se[0]),milliseconds=int(se[1]))
	return dt1

def combinations(n,r):
	return list(itertools.combinations(range(n),r))



def all_sets(num_list):
	subsets=[]
	for i in range(2,len(num_list) + 1):
		for c in combinations(num_list, i):
			subsets.append(c) 
	return subsets

#公約数の列挙
def ch(x1):
	cf=[]
	for i in range(2,math.sqrt(x1)+1):
		if x1 % i==0:
			cf.append(i)
	return cf

def CountOneRoots(x,y):
	#x:縦，y:横
	return fact(x+y)/fact(x)/fact(y)

# 素因数分解
def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a
			


a,b=input2()
count=0
for i in range(20):
	count+=a
	if count>=b:
		count=i+1
		break

print(count)

Submission status: Wrong Answer

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

ans = 0
for i in range(20):
    if A * i >= B:
        ans = i
        break
print(ans)

Submission status: Wrong Answer

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

ans = 0
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())
if a >= b:
    print(1)
else:
    dum = b - a
    ans = 1
    syo,amari = divmod(dum,a-1)
    if amari != 0:
        ans += 1
    ans = ans + syo
    print(ans)

Submission status: Wrong Answer

Solution code:
import math
A,B  = list(map(int,input().split()))
ans  = 1
c = 0
if B <= A:
    print("1")
else:
    while ans < B:
        ans += A-1
        c += 1
    print(c)

Submission status: Wrong Answer

Solution code:
import math
A,B  = list(map(int,input().split()))
ans  = 1
c = 0
if B < A:
    print("0")
elif B == A:
    print("1")
else:
    while ans < B:
        ans += A-1
        c += 1
    print(c)

Submission status: Wrong Answer

Solution code:
import math
A,B  = list(map(int,input().split()))
ans  = A
c = 0
if B < A:
    print("0")
elif B == A:
    print("1")
else:
    while ans <= B:
        ans += A-1
        c += 1
    print(c)

Submission status: Wrong Answer

Solution code:
import math
A,B  = list(map(int,input().split()))
ans  = 4
c = 1
if B < A:
    print("0")
elif B == A:
    print("1")
else:
    while ans < B:
        ans += A-1
        c += 1
    print(c)

Submission status: Wrong Answer

Solution code:
import math
A,B  = list(map(int,input().split()))
ans  = A
c = 1
if B < A:
    print("0")
else:
    while ans < B:
        ans += A
        ans -= 1
        c += 1
    print(c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

while True:
  if b <= current:
    print(nums)
    exit(0)
  current += (a - 1)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import math
A, B = map(int, input().split())
if B - A > 0:
    num = 1
    B = B - A
    print(num + math.ceil(B/(A-1)))
else:
    print(1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# 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 = map(int, input().split())
print(math.ceil(b-1)/(a-1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B = map(int,input().split())
ans = 0
while True:
    if A*(ans+1) - ans == B:
        print(ans + 1)
        exit(0)
    elif A*ans + A - ans > B:
        print(ans + 1)
        exit(0)
    ans += 1

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B = map(int,input().split())
A -= 1
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())
kosuu=0
sum=0

while sum<b:
    sum=a+(a-1)*kosuu
    kosuu+=1
print(kosuu)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

def main():
    A,B = map(int, input().split())
    aki = 1
    cnt = 0

    while aki > B:
        aki -=1
        aki += A
        cnt += 1

    print(cnt)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:

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

    while B > (A-1) * cnt +1:
        cnt += cnt 

    print(cnt)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:

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

    while B > (A-1) * cnt:
        cnt += cnt 

    print(cnt)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:

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

    print(-(-B//A))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(B//A+1)

Submission status: Wrong Answer

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