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

t = A
c = 1
while True:
    if t<B:
        t += (A-1)
        c+=1
    else:
        break

print(c)

Submission status: Wrong Answer

Solution code:
A,B = map(int,input().split())
C = A-1
n = 0
m = 1

while C*n + A*m < B:
    n += 1
print(n+m)

Submission status: Wrong Answer

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

ans = 1

if b > a:
  total = a
  while(True):
    total += (a - 1)
    ans += 1
    print('{} {}'.format(total, ans))
    if b <= total:
      break

print(ans)

Submission status: Wrong Answer

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

input = sys.stdin.readline
a, b = map(int, input().split())
ans = math.ceil(b / a)

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if B ==1:
  k=0
else:
  k=1

t = B-A

if t > 0:
  q, mod = divmod(t, A)
#  print("q="+str(q),mod)
  k=k+q
  if mod != 0:
    k = k+1

  

print(k)

Submission status: Wrong Answer

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

a = input_data[0]
b = input_data[1]

ans = 0

while True:
    if b == 1:
        break
    elif b > a:
        b = b - a
        ans += 1
    else:
        ans += 1
        break

print(ans)

Submission status: Wrong Answer

Solution code:
from math import ceil
def main():
    A, B = [int(i) for i in input().split()]
    one = A
    many = 0
    for N in range(20):
        if (A-1) * N >= B - A:
            many = N + 1
            break
    if A >= B:
        print(1)
    else:
        print(many)
main()

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())
flag = 1
ana = 0
a = [1]*A
print(a)
for i in range(100):
    if sum(a) >= B:
        print(flag)
        break
    a.append(A)
    a[i] -= 1
    flag += 1

Submission status: Wrong Answer

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

cnt = 0
  
for i in range(1,A):
  if i * (A-1) + A <= B+(A-1):
    cnt += 1
    
print(cnt)

Submission status: Wrong Answer

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

ans = 0
x = 0

if a >= b:
  ans = 1
else:
  while x <= b:
    ans += 1
    x += (a - 1)
  
print(ans)

Submission status: Wrong Answer

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

cnt = 0
tap = 0
while tap < b:
    if cnt == 0:
        tap += a
    else:
        tap -= 1
        tap += a
    cnt += 1
print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

while b >= 0:
    if a >= b:
        ans += 1
        break
    elif a <= b :
        b = b-(a-1)
        ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
 
import sys
 
debug = False
 
def log(text):
    if debug:
        print(text)
 
def parse_input(lines_as_string = None):
 
    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]
 
    token = lines[0].split()
    a = int(token[0])
    b = int(token[1])
 
    return (a, b)
 
 
def solve(a, b):
  
    result = -1
    for n in range(1, 100):
        if a + (n-1)*(a-1) >= b:
            result = n
            break
        
 
    return result
 
 
def main():
    # 出力
 
    print("%s" % solve(*parse_input()))
 
if __name__ == '__main__':
 
    main()

Submission status: Wrong Answer

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

print(count)

Submission status: Wrong Answer

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

c = A
count = 1
for i in range(1, 1000):
    if c >= B:
        break
    c = c + A - 1
    count = count + 1
    

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
def is_integer(n):
    if isinstance(n, int):
        return True
    if isinstance(n, float):
        return n.is_integer()
    return False

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

if a >= b:
	print 1
else:
	sub = b - 3
	div = sub/float(4)
  	print 1 + int(div)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b = map(int, input().split())  
res = 1
while 1:
  if a *res - (res -1 ) < b:
    res = res + 1
    print(a,"個口を",res,"つ使うと未使用は、",a *res - (res -1 ))
  else:
    break
print(res)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# 2019 9.1
# Power Socket

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

kuti = 1
cnt = 0

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

print(cnt)

Submission status: Wrong Answer

Solution code:
A_B = input()
A_B_list = A_B.split(" ")

A = int(A_B_list[0])
B = int(A_B_list[1])

socket = 1
result = 0

if B == 1:
    print(1)
elif A == 2:
    print(B-1)
else:
    result = (B // (A - 1)) + 1
    if (A-1) * (result-1) + 1 == B:
        result -= 1

    print(result)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
List = list(map(int, input().split()))
A = List[0]
B = List[1]
an = B/A
if B==1:
    print(0)
elif an <1:
    print(1)
elif B%A==0:
    print(int(an))
else:
    i=1
    K=0
    while True:
        if B<=(A*i-K):
            print(i)
            break
        i+=1
        K+=1

Submission status: Wrong Answer

Solution code:
import sys

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

Submission status: Wrong Answer

Solution code:
import math

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

ans = 0

if a != b:
    if b % a == 0:
        ans = math.floor(b / a)
    else :
        ans = math.floor(b / a) + 1
else:
 ans = 1

print(ans)

Submission status: Wrong Answer

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

while(1):
	if (i+i*x)>=y:
		i+=1
		break
	else:
		i+=1

print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
lines = input().split(" ")

A = int(lines[0])
B = int(lines[1])

if B == 1 or B == 2:
    print(1)
elif A == 20:
    print(1)
elif A >= B:
    print(1)
else:
    if B % A == 0:
        print((B / A) + 1)
    else:
        print(math.ceil(B / A))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i in range(A-1):
  x+=(A-1)
  ans+=1
  if x>=B:
    print(ans)
    exit()

Submission status: Wrong Answer

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

k=1
#if B ==1:
#  k=0
#else:
#  k=1

t = B-A

if t > 0:
  q, mod = divmod(t, A)
#  print("q="+str(q),mod)
  k=k+q
  if mod != 0:
    k = k+1

  

print(k)

Submission status: Wrong Answer

Solution code:
s,t=map(int,input().split())
kuti=s
kosuu=0

if s>t:
    kosuu=kosuu+1

while kuti<=t:
    kuti=kuti+s-1
    kosuu=kosuu+1

print(kosuu)

Submission status: Wrong Answer

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

if A >= B:
    Count = 1
else:
    Count = 1 + (B - A) // (A - 1)
    if ((B - A) % (A - 1)) > 0:
        Count = Count + 1

print(Count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
def is_integer(n):
    if isinstance(n, int):
        return True
    if isinstance(n, float):
        return n.is_integer()
    return False

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

if a >= b:
	print 1
else:
	sub = b - 4
	div = sub/float(3)
  	print 1 + int(div)

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:


def main():

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

   
   count = 0
   ans = 0

   count += A
   ans += 1

   if count >= B:
      print(ans)
      exit()
   

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


      

if __name__== "__main__":
    main()

Submission status: Wrong Answer

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

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

print(cnt)

Submission status: Wrong Answer

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

cnt = 0
  
for i in range(1,A):
  if i * A <= B+(A/2):
    cnt += 1
    
print(cnt)

Submission status: Wrong Answer

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

ans = int()

if B <= A :
	print(1)

else :
	ans = (B-1)//(A-1)

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

count = 0
while True:
  a = (A - 1) * count
  a += A
  if a >= B:
    break
  
  count += 1
  
print(count)

Submission status: Wrong Answer

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

if A == 2:
    ans = B-1

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

print(ans)

Submission status: Wrong Answer

Solution code:
A_B = input()
A_B_list = A_B.split(" ")

A = int(A_B_list[0])
B = int(A_B_list[1])

socket = 1
result = 0

if B == 1:
    print(0)
elif A == 2:
    print(B-1)
else:
    result = (B // (A - 1)) + 1
    if (A-1) * (result-1) + 1 == B:
        result -= 1

    print(result)

Submission status: Wrong Answer

Solution code:
import math
a,b = map(int, input().split())
print('1') if b < a else print(str(math.floor((b-a)/(a-1)+1)))

Submission status: Wrong Answer

Solution code:
A, B = map(int,input().split())
T = A
if B == 1:
	print(0)
elif T >= B:
	print(1)
else:
	for i in range(2,20):
		if T < B:
			T += A-1
			continue
		else:
			print(i-1)
			break

Submission status: Wrong Answer

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

x = a

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

Submission status: Wrong Answer

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

a = int(a)
b = int(b)
count = 1

while True:
  buffer = a - count if count > 1 else 0  
  if a * count - buffer >= b:
    break
  else:
    count += 1

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = 0
x = a

if a >= b:
  ans = 1
else:
  while x < b:
    ans += 1
    x += (a - 1)
  
print(ans)

Submission status: Wrong Answer

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

while C*n + A <= B:
    n += 1

print(n)

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())
c=1
i=A

while B>i:
    c+=1
    i+=A-1

print(c)

Submission status: Wrong Answer

Solution code:
import sys
a,b=map(int,input().split())
if b==1:
  print(0)
if 1<b<=a:
  print(1)
for i in range(1,6):
  for j in range(1,(a**i)+1):
    if (a**i)-(j-1)+(j-1)*a<b<=(a**i)-j+j*a:
      print((a**i)+j)
      sys.exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# 2019 9.1
# Power Socket

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

cnt = 0

# B -= 1

while True:
    if B <= 0:
        break

    B -= A
    cnt += 1

print(cnt)

Submission status: Wrong Answer

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

socket = A
sum_socket = A
tap = 1
while sum_socket < B:
    sum_socket = sum_socket - 1 + socket
    tap += 1
print(tap)

Submission status: Wrong Answer

Solution code:
in_data = input()
data = in_data.split(' ')
A = int(data[0])
B = int(data[1])
c = (B - 1) // (A - 1)
 
print(c)

Submission status: Wrong Answer

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

if a == 2:
  print(b-1)
else:
  if b % (a-1) == 1:
    print(c)
  else:
    print(c+1)

Submission status: Wrong Answer

Solution code:
A_B = input()
A_B_list = A_B.split(" ")

A = int(A_B_list[0])
B = int(A_B_list[1])

socket = 1
result = 0

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

    print(result)

Submission status: Wrong Answer

Solution code:
a, b=list(map(int,input().split()))
count=0
for i in range(0,21):
    if a+(a-1)*(i-1)<= b:
        count=count+1
print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

from sys import stdin
import math

# 標準入力をスペースで区切って、intに変換 listに収納
int_list  = [int(x) for x in stdin.readline().rstrip().split()]

A = int_list[0]
B = int_list[1]

plug=0
cnt=0
while plug<B :
    if cnt == 0:
        plug+=A
    else:
        plug+= A - 1
    cnt+=1

print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
s = input().split()
a = int(s[0])
b= int(s[1])
#print(a,b)
n = 0
while b > n:
  b = b - a + n
  n +=1
print(n)

Submission status: Wrong Answer

Solution code:
A, B = (int(i) for i in input().split())
a = A - 1
ans = 1
c = A
while c < B:
    c = c + a
    ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
s,t=map(int,input().split())
kuti=s
kosuu=0

while kuti<=t:
    kuti=kuti+s-1
    kosuu=kosuu+1

print(kosuu)

Submission status: Wrong Answer

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

ans = 0
x = a

if a >= b:
  ans = 1
else:
  while x <= b:
    ans += 1
    x += (a - 1)
  
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:



import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
##############################

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

count = 0
while True:
    if -(-B//A) == 1:
        print(count+1)
        exit()

    count += 1
    B -= (A-1)

Submission status: Wrong Answer

Solution code:
s=list(map(int,input().split()))
a=0
if s[1]==1:
  print(a)
else:
  a=a+1
  if s[1]<=s[0]:
    print(a)
  else:
    s[1]=s[1]-s[0]
    while s[1]<0:
      s[1]=s[1]-s[0]+1
      a=a+1
    print(a)

Submission status: Wrong Answer

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

cnt = 1
temp =0
while True:
	if temp == 0:
		temp = a
	else:
		temp += a-1
	if temp >= b:
		break
	else:
		cnt+=1

print(cnt)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
List = list(map(int, input().split()))
A = List[0]
B = List[1]
an = B/A
if B==1:
    print(0)
elif an <1:
    print(1)
elif B%A==0:
    print(int(an))
else:
    i=1
    while True:
        if B<=(A*(int(an)+i)-(int(an)+i-1)):
            print(int(an)+i)
            break
        i+=1

Submission status: Wrong Answer

Solution code:
A_B = input()
A_B_list = A_B.split(" ")

A = int(A_B_list[0])
B = int(A_B_list[1])

socket = 1
result = 0

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

Submission status: Wrong Answer

Solution code:
import sys
import math

line = sys.stdin.readlines()
a, b = line[0].split(' ')
a, b = int(a), int(b)
if b==1:
  print(0)
elif a>=b:
  print(1)
else:
  print(math.ceil(int(b)/int(a)))

Submission status: Wrong Answer

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

c=int(a[1])%int(a[0])
d=int(a[1])//int(a[0])
d=d
if c!=0:
    d+=1

print(d)

Submission status: Wrong Answer

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

a = input_data[0]
b = input_data[1]

ans = 0

while True:
    if b > a:
        b = b - a
        ans += 1
    else:
        ans += 1
        break

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

import math

C = B + 1
print(math.ceil(C/A))

Submission status: Wrong Answer

Solution code:
# 2019 9.1
# Power Socket

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

cnt = 0

B -= 1

while True:
    if B <= 0:
        break

    B -= A
    cnt += 1

print(cnt)

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

cnt = 0
  
for i in range(1,A):
  if i * A <= B:
    cnt += 1
    
print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=input().split(" ")
A=int(a[0])
B=int(a[1])
b=(B-1)//A
if (B-1)%A!=0:
    b+=1
print(b)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

a = int(a)
b = int(b)
count = 1

while True:
  buffer = count -1 if count > 1 else 0  
  if a * count - buffer >= b:
    break
  else:
  	count += 1

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a,b = map(int, input().split())
check = b
ans = 1
while check > a:
    ans += check//a
    check = check//a + check%a



print (ans)

Submission status: Wrong Answer

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

input = sys.stdin.readline
a, b = map(int, input().split())
ans = math.ceil(b / a)
tmp = a * ans - (ans - 1)
if tmp < b:
    ans += 1

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:


tap,out = map(int,input().split())

count = 1

while(1):
    if(out>tap):
        out = out - (tap-1)
        count += 1
    else:
        break
print(count)

Submission status: Wrong Answer

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

for i in range(2,21):
    if b%a==0:
        ans = b/a
        print(int(ans))
        exit()
    if a*i > b:
        ans = i
        print(ans)
        exit()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
 
import sys
 
debug = False
 
def log(text):
    if debug:
        print(text)
 
def parse_input(lines_as_string = None):
 
    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]
 
    token = lines[0].split()
    a = int(token[0])
    b = int(token[1])
 
    return (a, b)
 
 
def solve(a, b):
  
    result = -1
    for n in range(1, 20):
        if a + (n-1)*(a-1) >= b:
            result = n
            break
        
 
    return result
 
 
def main():
    # 出力
 
    print("%s" % solve(*parse_input()))
 
if __name__ == '__main__':
 
    main()

Submission status: Wrong Answer

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

ans = int()

if B <= A :
	print(1)

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

Submission status: Wrong Answer

Solution code:

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

ans = 0
cnt = a
while b > cnt :
    cnt = a + (( a - 1 ) * (ans))
    ans += 1

print( ans if ans != 0 else 1 )

Submission status: Wrong Answer

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

count = 1
a = A
while(A<B):
    A += a
    count += 1
    pass

print(count)

Submission status: Wrong Answer

Solution code:
from math import ceil
def main():
    A, B = [int(i) for i in input().split()]
    one = A
    many = ceil((float(B) - float(A)) / (float(A) - 1.)) + 1
    if A >= B:
        print(1)
    else:
        print(many)
main()

Submission status: Wrong Answer

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

print(((b-1) // a) + 1)

Submission status: Wrong Answer

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

c = b[0]
d = b[1]
amari = 0

for i in range(20):
  d -= c
  amari += 1
  if d <=0:
    print(amari)
    break

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import sys
# import collections

# import bisect
# import math
# import numpy as np
# from fractions import gcd

"""Template"""


class IP:
    """
    入力を取得するクラス
    """

    def __init__(self):
        self.input = sys.stdin.readline

    def I(self):
        """
        1文字の取得に使います
        :return: int
        """
        return int(self.input())

    def S(self):
        """
        1文字の取得(str
        :return: str
        """
        return self.input()

    def IL(self):
        """
        1行を空白で区切りリストにします(int
        :return: リスト
        """
        return list(map(int, self.input().split()))

    def SL(self):
        """
        1行の文字列を空白区切りでリストにします
        :return: リスト
        """
        return list(map(str, self.input().split()))

    def ILS(self, n):
        """
        1列丸々取得します(int
        :param n: 行数
        :return: リスト
        """
        return [int(self.input()) for _ in range(n)]

    def SLS(self, n):
        """
        1列丸々取得します（str
        :param n: 行数
        :return: リスト
        """
        return [self.input() for _ in range(n)]

    def SILS(self, n):
        """
        Some Int LineS
        横に複数、縦にも複数
        :param n: 行数
        :return: list
        """
        return [self.IL() for _ in range(n)]

    def SSLS(self, n):
        """
        Some String LineS
        :param n: 行数
        :return: list
        """
        return [self.SL() for _ in range(n)]


class Idea:
    def __init__(self):
        pass

    def HF(self, p):
        """
        Half enumeration
        半分全列挙です
        pの要素の和の組み合わせを作ります。
        ソート、重複削除行います
        :param p: list : 元となるリスト
        :return: list : 組み合わせられた和のリスト
        """
        return sorted(set(p[i] + p[j] for i in range(len(p)) for j in range(i, len(p))))

    def Bfs2(self, a):
        """
        bit_full_search2
        bit全探索の改良版
        全探索させたら2進数のリストと10進数のリストを返す
        :return: list２つ : １個目 2進数(16桁)  2個目 10進数
        """
        # 参考
        # https://blog.rossywhite.com/2018/08/06/bit-search/
        # https://atcoder.jp/contests/abc105/submissions/4088632
        value = []
        for i in range(1 << len(a)):
            output = []

            for j in range(len(a)):
                if self.bit_o(i, j):
                    """右からj+1番目のiが1かどうか判定"""
                    # output.append(a[j])
                    output.append(a[j])
            value.append([format(i, 'b').zfill(16), sum(output)])

        value.sort(key=lambda x: x[1])
        bin = [value[k][0] for k in range(len(value))]
        val = [value[k][1] for k in range(len(value))]
        return bin, val

    def S(self, s, r=0, m=-1):
        """
        ソート関係行います。色々な設定あります。
        :param s: 元となるリスト
        :param r: reversするかどうか 0=False 1=True
        :param m: （2次元配列）何番目のインデックスのソートなのか
        :return: None
        """
        r = bool(r)
        if m == -1:
            s.sort(reverse=r)
        else:
            s.sort(reverse=r, key=lambda x: x[m])

    def bit_n(self, a, b):
        """
        bit探索で使います。0以上のときにTrue出します
        自然数だからn
        :param a: int
        :param b: int
        :return: bool
        """
        return bool((a >> b & 1) > 0)

    def bit_o(self, a, b):
        """
        bit探索で使います。1のときにTrue出すよ
        oneで1
        :param a: int
        :param b: int
        :return: bool
        """
        return bool(((a >> b) & 1) == 1)

    def ceil(self, x, y):
        """
        Round up
        小数点切り上げ割り算
        :param x: int
        :param y: int
        :return: int
        """
        return -(-x // y)

    def ave(self, a):
        """
        平均を求めます
        :param a: list
        :return: int
        """
        return sum(a) / len(a)

    def gcd(self, x, y):
        if y == 0:
            return x
        else:
            return self.gcd(y, x % y)

    def lcm(self, x, y):
        return (x * y) // self.gcd(x, y)


"""ここからメインコード"""


def main():
    # 1文字に省略
    r, e = range, enumerate
    ip = IP()
    id = Idea()

    """この下から書いてね"""
    a, b = ip.IL()
    count = 0
    ans = 0
    while count < b:
        # print(count)
        if count == 0:
            count += a
        else:
            count += a-1
        ans += 1
    print(ans)



main()

Submission status: Wrong Answer

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

ans = int()

if B <= A :
	print(1)

else :
	ans = B//A + 1 

print(ans)