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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, B = list(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())
c = 1 
ans = 1
if c < b:
  c += a-1
  ans += 1
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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())
print((b+1)//a)

Submission status: Wrong Answer

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

ans = 1
while(n < m):
  n += (n-1)
  ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:

a, b = input().strip().split()

a, b = int(a), int(b)

if b == 1:
    print(0)
elif b/a <= 1:
  print(1)
else:
    sockets = a
    p = 1
    while True:
        a += a-1
        p += 1
        if a >= b:
            print(p)
            break

Submission status: Wrong Answer

Solution code:

a, b = input().strip().split()

a, b = int(a), int(b)

if b/a <= 1:
  print(1)
else:
    sockets = a
    p = 1
    while True:
        a += a-1
        p += 1
        if a >= b:
            print(p)
            break

Submission status: Wrong Answer

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

a, b = int(a), int(b)

if b/a == 1:
  print(1)
else:
  sockets = a
  p = 1
  while True:
    a += a-1
    p += 1
    if a >= b:
      print(p)
      break

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

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

outlet = 1
taps = 0
while outlet < b:
    taps += 1
    outlet += a - 1

print(outlet)

Submission status: Wrong Answer

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

outlet = 1
taps = 0
while outlet < b:
    taps += 1
    outlet += a - 1

Submission status: Wrong Answer

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

ans = a

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

  else:
    ans += a -1

Submission status: Wrong Answer

Solution code:
import sys

# 入力を整数に変換して受け取る
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
# 入力全てを整数に変換したものの配列を受け取る
def LI(): return list(map(int, sys.stdin.readline().split()))
# 入力全てを整数に変換して1引いたものの配列を受け取る
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SR(): return sys.stdin.readline().rstrip()

ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
ascii_uppercase2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ'

# リストを改行区切りで出力する
p2D = lambda x: print(*x, sep="\n")
p2E = lambda x: print(''.join(x))
p2S = lambda x: print(*x, sep=" ")



a,b=MI()
x=a
if x >= b:
    print(1)
    exit()
for i in range(2,21):
    x+=(a-1)
    if x >= b:
        print(i)
        exit()

Submission status: Wrong Answer

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

print(int((B-1)/(A-1))) if (B-1)%(A-1)<=1 else print(int((B-1)/(A-1))+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(int(B/(A-1))) if B%(A-1)<=1 else print(int(B/(A-1))+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

A, B = map(int, ipt().split())
print(-(-B//A))

Submission status: Wrong Answer

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

print(B//A+ (1 if B%A > 0 and B>A else 0))

Submission status: Wrong Answer

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

def main():
    print(B//A+ (1 if B%A > 0 else 0))

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

def main():
    print(B//A+1)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

count = 1
ans = 0
while True:
    count -= 1
    count += a
    ans += 1
    if count >= b:
        break
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)))

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

K = A
ans = 1

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


print(ans)

Submission status: Wrong Answer

Solution code:
# abc139_b.py
import math
A, B = map(int,input().split())
print(math.floor((B-A)/(A-1)+1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
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())

K = A
ans = 1

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

Submission status: Wrong Answer

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

K = A
ans = 1

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x,y = map(int,input().split())
if y==1:
    i=1
    
else:
    for i in range(1,x):
        ans = x-(i-1)+x*(i-1)
        #print(ans)
        if ans >= y:
            break
    #print(ans)
print(i)

Submission status: Wrong Answer

Solution code:
x,y = map(int,input().split())
if x%y==0:
    i = x//y
else:
    for i in range(1,x):
        ans = x-(i-1)+x*(i-1)
        #print(ans)
        if ans >= y:
            break
    #print(ans)
print(i)

Submission status: Wrong Answer

Solution code:
x,y = map(int,input().split())

for i in range(x):
    ans = x-(i-1)+x*(i-1)
    #print(ans)
    if ans >= y:
        break
#print(ans)
print(i)

Submission status: Wrong Answer

Solution code:
x,y = map(int,input().split())

for i in range(x):
    ans = x-i+x*i
    #print(ans)
    if ans >= y:
        break
#print(ans)
print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if A != B:
    while count < B:
        if A < B:
            N += 1
        if A*N > B:
            print(N)
            break
else :
    #print("no")
    print(1)

Submission status: Wrong Answer

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

#n = int(input())
#l = list(map(int, input().split()))

'''
A=[]
B=[]
for i in range():
    a, b = map(int, input().split())
    A.append(a)
    B.append(b)'''
a, b = map(int, input().split())
flg=False
cnt=0
while not flg:
    if b-a<=0:
        flg=True
        break
    b-=a-1
    cnt+=1
print(cnt+1)

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

i = 1
tmp = 0
ans = 0

while b > tmp:
  tmp = a * i - (i-1)
  ans += 1
  i += 1

print(ans)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
 
a,b=list(map(int,input().split()))
 
mouse_tot = a
mouse_cnt = 1
add_mouse = a-1
 
while mouse_tot <  b:
    mouse_tot += add_mouse
    mouse_cnt += 1
 
if a>b:
    mouse_cnt = 1
 
print(mouse_cnt)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
 
a,b=list(map(int,input().split()))
 
mouse_tot = a
mouse_cnt = 1
add_mouse = a-1
 
while mouse_tot <  b:
    mouse_tot += add_mouse
    mouse_cnt += 1
 
if b==0:
    mouse_cnt = 0
 
print(mouse_cnt)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
 
a,b=list(map(int,input().split()))
 
mouse_tot = a
mouse_cnt = 1
add_mouse = a-1
 
while mouse_tot <  b:
    mouse_tot += add_mouse
    mouse_cnt += 1

if a > b:
    mouse_cnt = 0

print(mouse_cnt)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
 
a,b=list(map(int,input().split()))
 
mouse_tot = a
mouse_cnt = 1
wa = a-1
 
while mouse_tot <  b:
    mouse_tot += wa
    mouse_cnt += 1

if mouse_tot == b:
    mouse_cnt -= 1 

print(mouse_cnt)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
 
a,b=list(map(int,input().split()))
 
mouse_tot = a
mouse_cnt = 1
wa = a-1
 
while mouse_tot <  b:
    mouse_tot += wa
    mouse_cnt += 1
 
print(mouse_cnt)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
 
a,b=list(map(int,input().split()))
cnt = 1
 
while a <  b:
    a += a-1
    cnt += 1
 
print(cnt)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
 
a,b=list(map(int,input().split()))
 
mouse_tot = a
mouse_cnt = 1
 
while mouse_tot <  b:
    mouse_tot += a-1
    mouse_cnt += 1
 
print(mouse_cnt)

Submission status: Wrong Answer

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

mouse_tot = a
mouse_cnt = 1

while mouse_tot <  b:
    mouse_tot += a
    mouse_cnt += 1

print(mouse_cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

# 入力を整数に変換して受け取る
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
# 入力全てを整数に変換したものの配列を受け取る
def LI(): return list(map(int, sys.stdin.readline().split()))
# 入力全てを整数に変換して1引いたものの配列を受け取る
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SR(): return sys.stdin.readline().rstrip()

ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
ascii_uppercase2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ'

# リストを改行区切りで出力する
p2D = lambda x: print(*x, sep="\n")
p2E = lambda x: print(''.join(x))


a,b=MI()
x=a
if x >= b:
    print(1)
    exit()
for i in range(2,21):
    x+=a-1
    if x >= b:
        print(i)
        exit()

Submission status: Wrong Answer

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

x = a[0]
y = a[1]

n = 2
if x >= y:
    print(1)
else:
    while ((x * n) - (n - 1)) < y:
        n += 1
    print(n)

Submission status: Wrong Answer

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

x = a[0]
y = a[1]

n = 2
if x >= y:
    print(1)
else:
    while ((x * n) - 1) < y:
        n += 1
    print(n)

Submission status: Wrong Answer

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

flag = 1

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

Submission status: Wrong Answer

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

x = a[0]
y = a[1]

n = 2
if x >= y:
    print(1)
else:
    while ((x - 1) * n) + 1 < y:
        n += 1
    print(n)

Submission status: Wrong Answer

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

x = a[0]
y = a[1]

n = 2
if x >= y:
    print(1)
else:
   while ((x - 1) * n) + 1 < y:
        n += 1

print(n)

Submission status: Wrong Answer

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

x = a[0]
y = a[1]

if x == y:
	print(1)
elif y * (y // (x - 1)) >= y:
	print(y // (x - 1))
else:
	print(y // (x - 1) + 1)

Submission status: Wrong Answer

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

x = a[0]
y = a[1]

if y * (y // (x - 1)) >= y:
	print(y // (x - 1))
else:
	print(y // (x - 1) + 1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B = map(int,input().split())
def ceil(n): # ceiling関数
    if n > int(n):
        return(int(n)+1)
    else:
        return(int(n))
if A>=B:
    print(1)
else:
    print(ceil((B-A)/(A-1))+1)

Submission status: Wrong Answer

Solution code:
import math
A, B = map(int, input().split())
 
if B> A:
	print(math.floor((B-1+A-2)/(A-1)))
else:
	print(1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if B> A:
	print(B//A+1)
  
else:
	print(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())
c = 1
if a >= b:
    print(1)
for i in range(1,b+1):
    if a*i-(i-1) >= b:
        break
    c += 1
print(c)

Submission status: Wrong Answer

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

print(c+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = 1
if(B == 1):
    print(0)
    sys.exit()

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if A != B:
    while count < B:
        if A < B:
            N += 1
        if A*N > B:
            print(N)
            break
elif A == B:
    print(1)  
else :
    #print("no")
    print(0)

Submission status: Wrong Answer

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

if A != B:
    #print("yes")
    while count < B:
        #print(count)
        #print(N)
        if A < B:
            N += 1
        if A*N > B:
            print(N)
            break

elif A == B:
    print(1)
            
else :
    #print("no")
    print(0)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
printV = lambda x: print(*x, sep="\n")
printH = lambda x: print(" ".join(map(str,x)))
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LII(rows_number): return [II() for _ in range(rows_number)]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]

def main():
	a,b = MI()
	if b == 1:
		print(0)
	elif(b%a==0):
		print(b//a)
	else:
		print(b//a+1)

if __name__ == '__main__':
	main()

Submission status: Wrong Answer

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

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

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:
import math

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
import math
import collections
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

a,b=MI()
for i in range(1,100):
    num=a+(a-1)*(i-1)
    if num>=b:
        print(i)
        sys.exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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 = A
ans = 1
while x < B:
    x += A+1
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
A,B = map(int,input().split())
a = A
count = 1
for i in  range(10**5):
    if a >= B:
        print(count)
        break
    else:
        a += A-1
        count += 1

Submission status: Wrong Answer

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def debug(*args):
    if debugmode:
        print(*args)
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]
debugmode = False

a, b = MAP()
ans = b // (a - 1)
tmp = b % (a - 1)
if tmp > 1:
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
AB = input().split()
A,B = int(AB[0]), int(AB[1])
n = 0
count = 0
# if(A != B):
while n < B:
    if(n + A != B):
        count+=1
    n = n + (A - 1)
print(count)

Submission status: Wrong Answer

Solution code:
import math
AB = input().split()
A,B = int(AB[0]), int(AB[1])

n = (B - 1)/A + 1
print(math.floor(n))

Submission status: Wrong Answer

Solution code:
import math
AB = input().split()
A,B = int(AB[0]), int(AB[1])

n = (A + B - 1) / A
print(math.floor(n))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

    print(ans)


if __name__ == '__main__':
    q2()

Submission status: Wrong Answer

Solution code:
def q2():
    """ B - Power Socket """
    A, B = (int(i) for i in input().split())
    d, m = divmod(B - A, A)
    if m > 0:
        d += 1
    print(d+1)


if __name__ == '__main__':
    q2()

Submission status: Wrong Answer

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

if a >= b:
    print(1)
else:
    if mod == 0:
        print(count + 1)
    else:
        print(count + 2)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

    elif (a-1) * i + a >= b:
        print(i+1)
        break

Submission status: Wrong Answer

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

for i in range(1,100):
    if a <= b:
        print(1)
        break

    elif (a-1) * i + a >= b:
        print(i+1)
        break

Submission status: Wrong Answer

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

for i in range(1,100):
    if a == b:
        print(1)
        break

    elif (a-1) * i + a >= b:
        print(i+1)
        break

Submission status: Wrong Answer

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

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

print(i+1)

Submission status: Wrong Answer

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

ans = 1
temp = A

while temp < B:
    ans += 1
    temp += A - 1

print(ans)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
ans = 1
cur = a
while cur < b:
  cur = cur - 1 + a
  ans += 1
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:
#B
a,b = map(int,input().split())

k = (b // a) + 1

if b == 1:
    print(0)
elif a >= b:
    print(1)
else:
    print(k)

Submission status: Wrong Answer

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

if b == 1:
    print(0)
elif a >= b:
    print(1)
else:
    print((b-a)//a + 2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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