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: Runtime Error

Solution code:
# template by 3xC and starkizard.
# contributors: 

#####################################################################################
from __future__ import division, print_function 

import sys
import os
from collections import Counter, deque, defaultdict
import itertools
import math
import io


"""Uncomment modules according to your need"""


# from bisect import bisect_left, bisect_right, insort
# from heapq import heappop, heapify, heappush
# from random import randint as rn
# from Queue import Queue as Q
# from copy import deepcopy
# from decimal import *
# import re
# import operator

#####################################################################################
# this enables you to write python3 code with PyPy2 (Python 2)
if sys.version_info[0] < 3:
    input = raw_input
    range = xrange

    filter = itertools.ifilter
    map = itertools.imap
    zip = itertools.izip

#####################################################################################

"""value of mod"""
MOD = 998244353
mod = 10**9 + 7

"""Uncomment next 4 lines if doing huge recursion"""
# import threading
# threading.stack_size(1<<27)
# sys.setrecursionlimit(10000

def prepare_factorial(mod=mod):
    """ returns two lists, factorial and inverse factorial modulo argument by default 10**9 +7 """
    # Comment code out when you don't need inverse factorial or vice versa
    fact = [1]
    for i in range(1, 200005):
        fact.append((fact[-1] * i) % mod)

    ifact = [0] * 200005
    ifact[200004] = pow(fact[200004], mod - 2, mod)
    for i in range(200004, 0, -1):
        ifact[i - 1] = (i * ifact[i]) % mod
 
    return fact, ifact

def modinv(n, p):
    """ returns N inverse modulo p """
    return pow(n, p - 2, p)
 
def ncr(n, r,  fact, ifact):
    """ takes 4 arguments: n , r and factorial and inverse factorial lists"""
    t = (fact[n] * (ifact[r]*ifact[n-r]) % MOD)% MOD
    return t


def get_n(Sum):    
    """this function returns the maximum n for which Summation(n) <= Sum"""
    ans = (-1 + sqrt(1 + 8*Sum))//2
    return ans

def sieve(n):
    """ returns a list of prime numbers till n """
    if n < 2: return list()
    prime = [True for _ in range(n + 1)]
    p = 3
    while p * p <= n:
        if prime[p]:
            for i in range(p * 2, n + 1, p):
                prime[i] = False
        p += 2
    r = [2]
    for p in range(3, n + 1, 2):
        if prime[p]:
            r.append(p)
    return r



def divs(n, start=1):
    """ returns a list of all divisors till n """
    divisors = []
    for i in range(start, int(math.sqrt(n) + 1)):
        if n % i == 0:
            if n / i == i:
                divisors.append(i)
            else:
                divisors.extend([i, n // i])
    return divisors



def divn(n, primes):
    """ returns the number of divisors, two arguments n and the sieve till n """
    divs_number = 1
    for i in primes:
        if n == 1:
            return divs_number
        t = 1
        while n % i == 0:
            t += 1
            n //= i
        divs_number *= t



def lrfind(d, x, default=-1):
    """ Takes 2 arguments an iterable and an element. returns a tuple (firstoccurence,lastoccurence) -1 if not found """
    left = right = -1
    for i in range(len(d)):
        if d[i] == x:
            if left == -1: left = i
            right = i
    if left == -1:
        return default, default
    else:
        return left, right

def gcd(x, y): # math.gcd is slower
    """ returns greatest common divisor of x and y """
    while y:
        x, y = y, x % y
    return x

def ceil(n, k): return n // k + (n % k != 0) #returns math.ceil but protecting against floating inconsistencies
def input(): return sys.stdin.readline().strip()
def ii(): return int(input()) #inputs integer
def mi(): return map(int, input().split()) # inputting space seperated variables for example x,y,z
def li(): return list(map(int, input().split())) #inputting a space seperated list of integers
def lw(): return input().split() #inputting a space seperated list of strings
def lcm(a, b): return abs(a * b) // gcd(a, b) #returns LCM of two arguments
def prr(a, sep=' ', end='\n'): print(sep.join(map(str, a)), end=end) #For printing an iterable with seperator sep as optional second argument (default : " "), ending character (default: "\n") as optional third
def dd(): return defaultdict(int) #returns a dictionary with values defaulted to 0
def ddl(): return defaultdict(list) #returns a dictionary with values defaulted to []
def write(s): return sys.stdout.write(s)

###################################################################
def main():
    #CODE GOES HERE:
    a,b=mi()
    print(ceil(b/a))
""" -------- Python 2 and 3 footer by Pajenegod and c1729 ---------"""
 
py2 = round(0.5)
if py2:
    from future_builtins import ascii, filter, hex, map, oct, zip
    range = xrange
 
import os, sys
from io import IOBase, BytesIO
 
BUFSIZE = 8192
 
class FastIO(BytesIO):
    newlines = 0
 
    def __init__(self, file):
        self._file = file
        self._fd = file.fileno()
        self.writable = "x" in file.mode or "w" in file.mode
        self.write = super(FastIO, self).write if self.writable else None
 
    def _fill(self):
        s = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
        self.seek((self.tell(), self.seek(0, 2), super(FastIO, self).write(s))[0])
        return s
 
    def read(self):
        while self._fill(): pass
        return super(FastIO, self).read()
 
    def readline(self):
        while self.newlines == 0:
            s = self._fill();
            self.newlines = s.count(b"\n") + (not s)
        self.newlines -= 1
        return super(FastIO, self).readline()
 
    def flush(self):
        if self.writable:
            os.write(self._fd, self.getvalue())
            self.truncate(0), self.seek(0)
 
 
class IOWrapper(IOBase):
 
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        if py2:
            self.write = self.buffer.write
            self.read = self.buffer.read
            self.readline = self.buffer.readline
        else:
            self.write = lambda s: self.buffer.write(s.encode('ascii'))
            self.read = lambda: self.buffer.read().decode('ascii')
            self.readline = lambda: self.buffer.readline().decode('ascii')
 
 
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip('\r\n')
# sys.stdin = open('input.txt', 'r')
# sys.stdout = open('output.txt', 'w')
 
""" main function"""
 
if __name__ == '__main__':
    main()
    # threading.Thread(target=main).start()

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(math.ceil((A -1) / (B - 1)))

Submission status: Runtime Error

Solution code:
>>> a,b=(int(x) for x in input().split())
tap = 1
count = 0

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

Submission status: Runtime Error

Solution code:
>>> a,b=(int(x) for x in input().split())
tap = 1
count = 0

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

Submission status: Runtime Error

Solution code:
L, R = input().split()
s = (R - 1) // ( L - 1)
ans = s + 1
print(ans)

Submission status: Runtime Error

Solution code:
L, R = input().split()
s = (R-1) // (L-1)
ans = s + 1
print()

Submission status: Runtime Error

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

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

print(cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a, b = input()
a = int(a)
b = int(b)

x = 1
num = 0
while True:
    x += a - 1
    num += 1
    if x >= b:
        break
        
print(num)

Submission status: Runtime Error

Solution code:
A = int(input())
B = int(input())
C = -(-B // A)
print(C)

Submission status: Runtime Error

Solution code:
A = int(input()) #ここで標準入力
B = int(input()) #ここで標準入力

C = A/B + 1

print(C)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b=[int(x) for x in input().split()]
 
c=1
ans=0:
while True:
  if c>=b:
    break
  else:
    c+=a-1
    ans+=1
print(ans)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
A, B = float(input)
print(math.floor(B/A))

Submission status: Runtime Error

Solution code:
import math
A, B = float(input())
print(math.floor(B/A))

Submission status: Runtime Error

Solution code:
A = int(input())
B = int(input())
socket = 0
count = 0
if B==1 :
    count=0
elif B != 0 :
    while socket < B :
        if socket + A < B :
            socket = socket + A - 1
            count += 1
        elif socket+A >= B :
            socket = socket + A
            count += 1
print(count)

Submission status: Runtime Error

Solution code:
A = int(input())
B = int(input())
socket = 0
count = 0
if B==1 :
    count=0
elif i != 0 :
    while socket < B :
        if socket + A < B :
            socket = socket + A - 1
            count += 1
        elif socket+A >= B :
            socket = socket + A
            count += 1
print(count)

Submission status: Runtime Error

Solution code:
A = int(input())
B = int(input())
socket = 0
count = 0
while socket < B :
    if socket + A < B :
        socket = socket + A - 1
        count += 1
    elif socket+A >= B :
        socket = socket + A
        count += 1
print(count)

Submission status: Runtime Error

Solution code:
A = int(input())
B = int(input())
socket = A - 1
count=1
while (socket) < B :
    if (socket+A) < B :
        socket = socket + A - 1
        count+=1
    elif (socket+A) >= B :
        socket=socket+A
        count+=1
print(count)

Submission status: Runtime Error

Solution code:
i = [input() for i in range(2)]
a = [i for i in i[0]]
b = [i for i in i[1]]
c = 0
for i in range(3):
  if a[i] == b[i]:
    c += 1
  else:
    c += 0
print(c)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
i = 1
c = i*a
while c > b:
    i += 1
if a == b:
    print(1)
else:print(i+1)

Submission status: Runtime Error

Solution code:
# -*- coding: <encoding name> -*-

import math
a, b = map(int, input().split())
# range = d * 2 + 1
# c == 1 + a * n - n >= b
print(math.ceil((b - 1) / (a - 1))

Submission status: Runtime Error

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

c = 1
d = 0
for b >= c:
    c = c+a-1
    d++
    
print(d)

Submission status: Runtime Error

Solution code:
あ

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:





i = input()
out = input()
n = 1

while (int(i)*n-(n-1)) < int(out):
    n += 1

else:
    print(n)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

c = 1
outlet = a
if(B==1):
  print(0)

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from sys import stdin

a,b = stdin.readline().rstrip()
print(b/a)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

if B == 1:
    print(0)
else:
    C = A
    cnt = 1
    while C < B:
        C += A - 1
        cnt += 1

print(cnt)

Submission status: Runtime Error

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

ans = 0
A = 1
while A < b:
  ans += 1
  s += (a - 1)
print(ans)

Submission status: Runtime Error

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

ans = 0
A  = 1
while A < b:
  ans += 1
  s += a - 1
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
if B < A:
    print("0")
elif B ==A:
    print("1")
else:
    while ans < B:
        ans += A
        ans -= 1
        c += 1
    print(c)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <random>
#include <iomanip>
#include <functional>
#include <cassert>

using namespace std;

typedef long long ll;

int main() {
  ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
  freopen("input.txt", "r", stdin);
#endif
  int a, b;
  cin >> a >> b;
  cout << (b + a - 1) / a << '\n';
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(math.ceil(B/(A-1))

Submission status: Runtime Error

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

print(B//A +1)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
args = [int(input()) for in range(2)]

a = args[0]
b = args[1]

tap = 1
socket = a
while socket < b:
  tap += 1
  socket = socket + a - 1

print(tap)

Submission status: Runtime Error

Solution code:
import sys
args = []
for l in sys.stdin:
  args.append(int(l))

a = args[0]
b = args[1]

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

Submission status: Runtime Error

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

print(math.ceil(B / A))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# 初期入力
A,B = (int(x) for x in input().split())

#
import math
tapp_num = (B//(A-1))
sasikomiguti_misiyou=0
if B<=A:
    print(1)
else:        
    sasikomiguti_misiyou =A +(tapp_num -1)*(A-1)
    if B <= sasikomiguti_misiyou:
        print(tapp_num)
    else:

Submission status: Runtime Error

Solution code:
import sys
A,B = map(int,input().split())
plug = 1
socket = 0
while True:
  new_plug += A
  socket += 1
  if new_plug >= B:
    print(socket)
    sys.exit(0)

Submission status: Runtime Error

Solution code:
a, b = map(int, input().split())
min_ans = b // a
mod_ans = b % a

if ((min_ans - mod_ans) > 0) :
  print(min_ans)
else : 
  print(mins_ans + 1)

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
ans = b // a

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

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
strip = b // a
emp = b % a
ans = strip + (strip // emp)
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def pin(type=int):
    return map(type,input().rstrip().split())
from math import gcd
def resolve():
    A,B=pin()
    ans=0
    plug=1
    while(1):
        ans+=1
        plug=plug-1+A
        if plug>=B:
            print(ans)
            break
resolve()

Submission status: Runtime Error

Solution code:
def pin(type=int):
    return map(type,input().rstrip().split())
from math import gcd
def resolve():
    A,B=pin()
    ans=0
    plug=1
    while(1):
        ans+=1
        plug=plug-1+A
        if plug>=B:
            print(ans)
            break

Submission status: Runtime Error

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

for i in range 100:
  C = A*i - i
  if C >= B:
    break
print(i)

Submission status: Runtime Error

Solution code:
A = int(input())
B = int(input())

for i in range(25):
  if B <= A + (A-1)*i:
    print(i + 1)
    break

Submission status: Runtime Error

Solution code:
A = int(input())
B = int(input())
int i = 0

for i in range(25):
  if B <= A + (A-1)*i:
    print(i + 1)
    break
  else:

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a, b = map(int, input().split())
 
if b == 0:
    return 1
else:
    inpu = 1
    while b > (a -1) * inpu + a:
        inpu +=1
    print(inpu + 1)

Submission status: Runtime Error

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

if b == 0:
	return 1
else:
	inpu = 1
    while b > (a -1) * inpu + a:
    	inpu +=1
    print(inpu + 1)

Submission status: Runtime Error

Solution code:
k = 1
ans = 0
 
if b == 1:
  print(0)
else:
  while k<b:
    k += a-1
    ans += 1
  print(ans)

Submission status: Runtime Error

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

if B == 1:
  return 0

if B <= A:
  return 1

B -= A
ans = 1

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

Submission status: Runtime Error

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

if B == 1:
  return 0

if B <= A:
  return 1

B -= A
ans = 1

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

count = 0

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from math import *
a=int(input())
b=int(input())
if(20>=a>1 and 20>b>1):
  print(ceil((b-1)/(a-1)))
else:
  a=int(input())
  b=int(input())

Submission status: Runtime Error

Solution code:
from math import *
a=int(input())
b=int(input())
print(ceil((b-1)/(a-1)))

Submission status: Runtime Error

Solution code:
a=int(input())
b=int(input())
print(ceil((b-1)/(a-1)))

Submission status: Runtime Error

Solution code:
a, b = map(int, input())
x = 0
outlet = 1
while outlet < b:
  --outlet
  outlet += a
  x+=1
print(x)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
inilfl

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;

int main() {
  int a ,b;
  cin>>a>>b;

  for(int i=0; i<30; i++){
  int c= a*i-i+1;
  if(c>=b){
  cout<< i <<endl;
  break;}
  } 
}

Submission status: Runtime Error

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

print(n)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
from math import gcd


# 入力を整数に変換して受け取る
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: Runtime Error

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B = MAP()
C = (B-A)/(A-1) +1
if C%1 == 0:
  print(C)
else:
  print(C+1)

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

K = 1
ans = 0

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

print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

Solution code:
import math

A,B = input().split()

print(math.ceil((B-1)/(A-1)))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#B
a = int(input())
b = int(input())
if b == 1:
    print(0)
elif a >= b:
    print(1)
else:
    print((b-a)//a + 2)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
p,q= input().split()
a,b =(int(p), int(q))
count = 1

for i in range(math.floor(b/a  + 4)):
    if count < b:
        count += a -1
    else:
        ans = i
        break

print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

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

if __name__ == '__main__':
    a = [int(i) for i in input().split()]
    
    if a[1] <= a[0]:
        print(1)
    else:
        print(2 + (a[1]-1[0])//(a[1] -1) )

Submission status: Runtime Error

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

n = 1
c = 0

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

print(c)

Submission status: Runtime Error

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

n = 1
c = 0

if B==1 :
  print("0")
else :
	while n < B:
		n = n + A -1
		c = c+1
    print(c)

Submission status: Runtime Error

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

n = 1
c = 0

while n < B:
	n = n + A -1
	c = c+1
 
if B != 1:
	print(c)
else
	print("0")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b = input().split()
i = 1
while i<500:
  if a*i - i + 1 >= b:
    break

print(i)

Submission status: Runtime Error

Solution code:
for n in range(0,20):
    if n*a-n>=b-1:
        break

print(n)

Submission status: Runtime Error

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