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:
# 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: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math

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

print(math.ceil(B / A))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N,K = [int(x) for x in input().split()]
N = N-1
kosuu = 1
if K == 1:
    print(0)
for i in range(1,1000):
    kosuu += N
    if kosuu >= K:
        print(i)
        break

Submission status: Wrong Answer

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

print(int(round((B+1)/A,0)))

Submission status: Wrong Answer

Solution code:
N,K = [int(x) for x in input().split()]
N = N-1
kosuu = 1
for i in range(1,1000):
    kosuu += N
    if kosuu >= K:
        print(i)
        break

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(round(B/A))

Submission status: Wrong Answer

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

cnt = 0
if B == 0:
    print(0)
else :
    while True:
        cnt += 1
        if cnt == 1:
            x = A * cnt
        else:
            x = (A * cnt) - (cnt - 1)
        if x >= B:
            break
    print(cnt)

Submission status: Wrong Answer

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

cnt = 0
while True:
    cnt += 1
    if cnt == 1:
        x = A * cnt
    else:
        x = (A * cnt) - (cnt - 1)
    if x >= B:
        break
print(cnt)

Submission status: Wrong Answer

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

cnt = 0
while True:
    cnt += 1
    if cnt == 1:
        x = A * cnt
    else:
        x = (A * cnt) - 1
    if x >= B:
        break
print(cnt)

Submission status: Wrong Answer

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

cnt = 0
while True:
    cnt += 1
    if cnt == 1:
        x = A * cnt
    else:
        x = (A * cnt) - 1
    if x >= B:
        print(cnt)
        break

Submission status: Wrong Answer

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

cnt = 0
while True:
    cnt += 1
    if cnt == 1:
        x = A * cnt

    x = (A * cnt) - 1
    if x >= B:
        print(cnt)
        break

Submission status: Wrong Answer

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

cnt = 0
while True:
    cnt += 1
    x = A * cnt
    if x >= B:
        print(cnt)
        break

Submission status: Wrong Answer

Solution code:
import sys


def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def S(): return input()
def LS(): return input().split()


a, b = LI()
guchi = 1
ans = 0
while ans < b:
    guchi += a - 1
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
import sys


def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def S(): return input()
def LS(): return input().split()


a, b = LI()
guchi = 2
ans = 0
while guchi < b:
    guchi += a - 1
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
import sys


def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def S(): return input()
def LS(): return input().split()


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

Submission status: Wrong Answer

Solution code:
import math
a,b = list(map(int,input().split()))
_a = a-1
num = int(b/_a)
if num*_a+1 >= b:
    print(num)
else:
    print(num+1)

Submission status: Wrong Answer

Solution code:
import math
a,b = list(map(int,input().split()))
_a = a-1
num = int(b/_a)
if num*_a+1 == b:
    print(num)
else:
    print(num+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
    a, b = map(int, input().split())
    num = 1
    ans = 0
    for i in range(20):

        ans = a * i
        if ans > b:
            print(i)
            break


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

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


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

    ans = int(b / a)
    print(ans + 1)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

while i:
    if d < b:
        d = d + a - 1
        c += 1
    else:
        i = False

print(c)

Submission status: Wrong Answer

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

while i:
    if a < b:
        a = a + a 
        c += 1
    else:
        i = False

print(c)

Submission status: Wrong Answer

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

while i:
    if a < b:
        a = a + a - 1
        c += 1
    else:
        i = False

print(c)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math

A, B = [int(x) for x in input().split(' ')]
print(math.ceil(B/A))

Submission status: Wrong Answer

Solution code:
A,B = map(int,input().split())
out = 1
count = 0
# while out < B:
#     out -= 1
#     out += A
#     count += 1
# print(count)
if B < A:
    print(count)
    exit() 

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

## Library

import sys
from fractions import gcd
import math
from math import ceil,floor
import collections
from collections import Counter

## input

# n=int(input())
# A,B,C,D=map(int, input().split())
# string = input()
# yoko = list(map(int, input().split()))
# tate = [int(input()) for _ in range(N)]
# N, M = map(int,input().split()) 
#    P = [list(map(int,input().split())) for i in range(M)]

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

print(ceil(B/A))

Submission status: Wrong Answer

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

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

print(n)

Submission status: Wrong Answer

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

for n in range(1, 21):
    if n * A - (n - 1) >= B:
        break

print(n)

Submission status: Wrong Answer

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

for n in range(1, 20):
    if n * A - (n - 1) >= B:
        break

print(n)

Submission status: Wrong Answer

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: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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

for i in range(1, 20):
    ans = A * i - ( i -1)
    if ans >= B:
        break

print(i)

Submission status: Wrong Answer

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

for i in range(1, 20):
    ans = A * i - ( i -1)
    if ans >= B:
        break

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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:
import sys
from collections import defaultdict
readline = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**8)


def geta(fn=lambda s: s.decode()):
    return map(fn, readline().split())


def gete(fn=lambda s: s.decode()):
    return fn(readline().rstrip())


def main():
    a, b = geta(int)

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

    print(n)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

if a >= b:
    ans = 1
else:
    ans = 1
    ans += math.ceil((b-a)/(a-1))
if b == 1:
    ans = 1
print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

t = 0
cnt = 0

while True:
    t += a
    cnt += 1
    if t >= b:
        print(cnt)
        exit(0)
    else :
        t -= 1

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
def main():
    a,b=map(int, input().split())
    return math.ceil(b/a)

if __name__ == "__main__":
    print(main())

Submission status: Wrong Answer

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

ans=1
if b==1:
    print(0)
else:
    while 1:
        if a>=b:
            print(ans)
            break
        else:
            ans+=1
            a=a*2-1

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(cnt)

Submission status: Wrong Answer

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

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

print(cnt)

Submission status: Wrong Answer

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

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

print(cnt)

Submission status: Wrong Answer

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

if c == 0:
    print(1)
    exit(0)

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

Submission status: Wrong Answer

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

if c == 0:
    print(1)

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

Submission status: Wrong Answer

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

if c == 0:
    print(0)

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

import math
print(math.floor((B-1)/(A-1)))

Submission status: Wrong Answer

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

import math
math.floor((B-1)/(A-1))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

cnt = 0
total = 0

if b < a:
    print(0)
    exit()

for i in range(30):
    if i == 0:
        total = a
        cnt += 1
    else:
        total += a-1
        cnt += 1
    
    if b <= total:
        break

print(cnt)

Submission status: Wrong Answer

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

cnt = 0
total = 0

for i in range(30):
    if i == 0:
        total = a
        cnt += 1
    else:
        total += a-1
        cnt += 1
    
    if b <= total:
        break

print(cnt)

Submission status: Wrong Answer

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

cnt = 1
total = a

if total == b:
    print(cnt)
    exit()

while True:
    total += a -1
    cnt += 1
    if total >= b:
        break

print(cnt)

Submission status: Wrong Answer

Solution code:
from sys import stdin, setrecursionlimit


def main():
    input = stdin.buffer.readline
    a, b = map(int, input().split())

    ans = 0

    while ans * a < b:
        ans += 1

    print(ans)


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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:
A,B = map(int,input().split())
C = (B-1)/(A-1)
r = (B-1)%(A-1)

if r == 0:
  print(C)
else:
  print(C+1)

Submission status: Wrong Answer

Solution code:
#-*-coding:utf-8-*-
A, B = map(int, input().split())
tap = 0
num = 0

while B > tap:
    tap += A
    num += 1
  
print(num)

Submission status: Wrong Answer

Solution code:
#-*-coding:utf-8-*-
A, B = map(int, input().split())

C = int(B / A)
p = B % A

if p == 0:
  print(C)
else:
  print(C + 1)

Submission status: Wrong Answer

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

n = 0
while a + (a-1)*n < b:
    n += 1
    
print(n+1)

Submission status: Wrong Answer

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

from math import ceil

print(int(ceil((b-1)/a)))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

ans = 0
outlet = 1

while outlet < B:
    outlet += A
    ans += 1

print(ans)

Submission status: Wrong Answer

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

sockets = B - A
count = 1
while sockets > 0:
    sockets -= A
    count += 1

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
a, b = map(int, input().split())
c = 0
for i in range(b):
    a += (a-1)*i
    c += 1
    if a >= b:
        break
print(c)

Submission status: Wrong Answer

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

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

elif b % a == 0:
    print(b // a)

else:
    print(b//a+1)

Submission status: Wrong Answer

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

else:
    print(b//a+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b = input().split()
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: Wrong Answer

Solution code:
a, b = input().split()
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: Wrong Answer

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

plug=1
tap=0
while plug < b:
    tap+=1
    if tap>1:
        plug-=1
    plug+=a
print(tap)