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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)


def solve(A: int, B: int):
    ret = 0
    if B == 1:
        ret = 1
    else:
        for i in range(100):
            if A + (A - 1) * i >= B:
                ret = i + 1
                break
    print(ret)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    solve(A, B)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

Solution code:
N, K = [int(x) for x in input().split()]
if K%N == 0:
  print(K//N)
else:
  print(K//N+1)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!

A, B = map(int,input().split())
tmp = A
ctr = 1

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

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())
import math
n = math.ceil(B/A)

print(n)

Submission status: Wrong Answer

Solution code:
import math
# cook your dish here
a,b=list(map(int,input().split()))
ans=math.ceil(b/a)
print(int(ans))

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

    ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
from math import log, ceil, floor

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

ans = floor(log(b, a))
d = b - a ** ans
ans += ceil(d / a)
print(ans)

Submission status: Wrong Answer

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

gate = 1

for i in range(A + 1):
	gate += A - 1
	if gate >= B:
		break
print(i + 1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(math.ceil(B / A))

Submission status: Wrong Answer

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

amari = b % a
syo = b // a

if amari == 0:
    print(syo)
    exit()

print(syo + 1)

Submission status: Wrong Answer

Solution code:
# 2019/09/01

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

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

Submission status: Wrong Answer

Solution code:
from math import ceil

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

ans = ceil(b/a)

print(ans)

Submission status: Wrong Answer

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

    cnt = 1

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()

a, b = na()
for i in range(0, 20):
    if a * i >= b:
        print(i)
        break

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(kotae)

Submission status: Wrong Answer

Solution code:

def MAP():
    return map(int, input().split())

a,b=MAP()

t=1
cnt=0
while True:
    t -= 1
    t += a
    cnt += 1
    if b <= t:
        break
print(cnt)

Submission status: Wrong Answer

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

c = 0
taps = 1
while(True) :
    jack = A * (taps-1) + A
    if (jack >= B) :
        break
    
    taps += 1


print(taps)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
from sys import stdin
import math
# import numpy as np
# import sys
# sys.setrecursionlimit(10**4)

def _li(): return list(map(int, stdin.readline().split()))
def _li_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def _lf(): return list(map(float, stdin.readline().split()))
def _ls(): return stdin.readline().split()
def _i(): return int(stdin.readline())
def _f(): return float(stdin.readline())
def _s(): return stdin.readline()[:-1]


A, B = _li()

print((B - 1 + A) // A)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

o = 1
cnt = 0
while 1:
    o += (A-1)
    cnt += 1
    if o >= B:
        break

print(cnt)

Submission status: Wrong Answer

Solution code:


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

a = A
c = 1
while(1):

    if a >= B:
        break

    a = a + A - 1
    c += 1

print(c)

Submission status: Wrong Answer

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

if a >= b:
    print(1)
    exit()
from math import ceil
print(1 + ceil((b-a) / (a-1)) )

Submission status: Wrong Answer

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

left = b - a
cnt = 1
while left > 0:
    left -= a - 1
    cnt += 1

print(cnt)

Submission status: Wrong Answer

Solution code:
a,b = [int(i) for i in input().split()]
counter = 1
while a*counter < b:
    counter += 1
print(counter)

Submission status: Wrong Answer

Solution code:
from sys import stdin
A,B = [int(x) for x in stdin.readline().rstrip().split()]
sasi = A
ans = 1
for i in range(200):
    if sasi >= B:
        break
    else:
        sasi += (A-1)
        ans += 1
print(ans)

Submission status: Wrong Answer

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

print(i)

Submission status: Wrong Answer

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

c = a
ans = 1
while c < b:
    ans += 1
    c += a - 1
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

def main():
	A,B = inputMap()

	ans = 0
	to = 0
	while True:
		ans += 1
		to += A
		if to >= B:
			break

	print(ans)

if __name__ == "__main__":
	main()

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:
def func():
    A, B = map(int, input().split())

    mouth = 0
    count = 0
    while mouth < B:
        mouth += A
        count += 1

    print(count)


if __name__ == '__main__':
    func()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#import numpy as np
#from numpy import*
#from scipy.sparse.csgraph import shortest_path #shortest_path(csgraph=graph) # dijkstra# floyd_warshall
#from scipy.sparse import csr_matrix
 
from collections import* #defaultdict Counter deque appendleft
from fractions import gcd
from functools import* #reduce
from itertools import* #permutations("AB",repeat=2) combinations("AB",2) product("AB",2) groupby accumulate
from operator import mul,itemgetter
from bisect import* #bisect_left bisect_right
from heapq import* #heapify heappop heappushpop
from math import factorial,pi
from copy import deepcopy
import sys
sys.setrecursionlimit(10**8)
#input=sys.stdin.readline  #危険！基本オフにしろ！
 
def main():
    a,b=map(int,input().split())
    print((b-1)//a+1)
    
    
    
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
# coding: UTF-8
import sys
#sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: map(int, sys.stdin.readline().split())
readms = lambda: map(str, sys.stdin.readline().split())

a, b = readmi()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a = B // A
b = B %A

if not b == 0:
  a += 1

print(a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
    a, b = [int(x) for x in input().split()]
    n = 1
    b -= a
    while b > 0:
        b -= a-1
        n += 1
    print(n)
    return


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
#%%
import math

a, b = map(int, input().split())
if b <= a:
    ans = 1
else:
    ans = 0
    b -= a
    ans += 1
    ans += math.ceil(b/(a-1))

print(ans)

Submission status: Wrong Answer

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

for i in range(10):
    if b <= a * i:
        print(i)
        break

Submission status: Wrong Answer

Solution code:
#インポート
import sys

#入力用
def ILI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def ISI(): return map(int, sys.stdin.readline().rstrip().split())
def II(): return int(sys.stdin.readline().rstrip())
def ISS(): return sys.stdin.readline().rstrip().split()
def IS(): return sys.stdin.readline().rstrip()

A, B = ISI()
print(int((A+B+1)/A))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

c = 1
count = 0
while(a < b):
  c += a - 1
  count += 1

print(count)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import numpy as np

if __name__ == '__main__':
    A , B = map(int, input().split())

    num = 1
    tap = 0

    while True:
        tap += 1
        num -= 1
        num += A

        if num >=B:
            break

    print(tap)

Submission status: Wrong Answer

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

print(B//(A-1))

Submission status: Wrong Answer

Solution code:
from math import ceil

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

print (ceil(b/a))

Submission status: Wrong Answer

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

answer = B // A

if (B % A) != 0:
  answer += 1
  
print(answer)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if m[1] == m[0]:
    print(1)
else:
    print(m[1]//m[0]+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)


def solve(A: int, B: int):
    ret = 0
    if B == 1:
        ret = 1
    for i in range(100):
        if A + (A - 1) * i >= B:
            ret = i + 1
            break
    print(ret)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    solve(A, B)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

kuti = 1
kosuu = 0
for i in range(1, A + 1):
    kuti -= 1
    kuti += A
    kosuu += 1
    if kuti >= B:
        print(kosuu)
        exit()

Submission status: Wrong Answer

Solution code:
def solve():
    a, b = read()
    result = think(a, b)
    write(result)


def read():
    return read_int(2)


def read_int(n):
    return list(map(lambda x: int(x), read_line().split(' ')))[:n]


def read_float(n):
    return list(map(lambda x: float(x), read_line().split(' ')))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(a, b):
    if a >= b:
        return 1
    tap = 1
    plug_count = a
    while True:
        tap += 1
        plug_count += a - 1
        if plug_count >= b:
            break
    return tap


def write(result):
    print(result)


if __name__ == '__main__':
    solve()

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
"""
AtCoder A
"""

import sys, math, random
import numpy as np

# N = int(input())
# A = list(map(int,input().split())) # N row 1 column
# A = [int(input()) for _ in range(N)] # 1 row N column
# S = str(input()) # str(input()) == input() -> 'abc'
# S = list(input()) # abc -> ['a','b','c']
# S.replace('ABC','X') # "testABCABC" -> "testXX"
# S=numpp.assaray(S)=="#"
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LLS(): return [list(sys.stdin.readline().rstrip()) for _ in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()



def main():
    A,B=LI()
    out=1
    num=A
    while num<B:
        num+=(A-1)
        out+=1
    print(out)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
a = input().split(' ')
A = int(a[0])
B = int(a[1])

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(int(1e6))

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

ans = B//A + bool(B%A)
print(ans)

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=(int(i) for i in input().split())
ans=1
t=0
while True:
    if B<ans:
        print(t)
        break
    t+=1
    ans+=A

Submission status: Wrong Answer

Solution code:
hoge = input().split()
A = int(hoge[0])
B = int(hoge[1])

n = 0
count = 0
while 1 == 1:
  if n == 0:
    n += A
    count += 1
  else:
    n += A - 1
    count += 1
  if n >= B:
    break

print(count)

Submission status: Wrong Answer

Solution code:
a,b = [int(i) for i in input().split()]
ct = 1
asum = a
while asum <b:
    ct +=1
    asum=asum+(a-1)

print(ct)

Submission status: Wrong Answer

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

ans=1
total=4
if a==b:
  print(1)
while True:
  if total<b:
    total+=a-1
  else:
    break
  ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(1000000)
from math import factorial, ceil, floor
from bisect import bisect_right as bsr
from operator import itemgetter as ig
from collections import defaultdict as dd
from collections import deque, Counter as cnt

# お約束
args = None
INF = float("inf")
MOD = int(1e9 + 7)
def input(*ps):
    if type(ps[0]) is list:
        return [input(*ps[0][:-1]) for _ in range(ps[0][-1])]
    elif len(ps) == 1:
        return ps[0](next(args))
    else:
        return [p(next(args)) for p in ps]
def nlist(n, v):
    if not n: return [] if type(v) is list else v
    return [nlist(n[1:], v) for _ in range(n[0])]

# エントリーポイント
def main():
    A, B = input(int, int)

    b, c = B, 0
    while 0 < b:
        b -= A - 1
        c += 1
        if b == 1:
            break
    print(c)


if __name__ == '__main__':
    args = iter(sys.stdin.read().split())
    main()

Submission status: Wrong Answer

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

cnt = 1
if A >= B:
    pass
else:
    while A < B:
        A += A-1
        cnt += 1

print(cnt)

Submission status: Wrong Answer

Solution code:
import sys
stdin = sys.stdin
sys.setrecursionlimit(100001)
mod = 10**9 + 7

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
sa = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]

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

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
ans = 0
while True:
    if b <= ans * a - ans:
        break
    ans += 1
print(ans-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:
from math import ceil

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

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

Submission status: Wrong Answer

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


if __name__ == '__main__':
    p_b()

Submission status: Wrong Answer

Solution code:


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

c=0

ans=0

while(c<b):
	c+=a
	ans+=1

print(ans)

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

Solution code:
import math


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

Submission status: Wrong Answer

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

ans = 0
t = 0
while True:
  t += A
  ans += 1
  if t >= B:
    break
  t -= 1

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

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

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

print(res)

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
input = sys.stdin.readline

def main():
    # a = int(input())
    a, b = map(int, input().split())
    # a = list(map(int, input().split()))
    
    if b == 1:
        print(1)
    else:
        tmp = 0
        while (a-1) * tmp + a < b:
            tmp += 1
        print(tmp+1)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#double underscore makes a class variable or a class method private
mod = 1000000007
ii = lambda :  int(input())
si = lambda :  input()
dgl = lambda : list(map(int, input()))
f = lambda :   map(int, input().split())
il = lambda :  list(map(int, input().split()))
it = lambda :  tuple(map(int, input().split()))
ls = lambda :  list(input())
a,b=f()
print(b//a+(b%a!=0))

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

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

Submission status: Wrong Answer

Solution code:

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

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

Submission status: Wrong Answer

Solution code:
import sys
MAX_INT = int(10e9)
MIN_NUM = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

A,B = IL()

cnt = A
ans = 1
while True:
  if cnt >= B:
    break
  cnt += A-1
  ans += 1

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

stdin = sys.stdin
na = lambda: map(int, stdin.readline().split())
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())

def main():
  a, b = na()
  
  cnt = 1
  tmp = a
  while tmp < b:
    tmp += a - 1
    cnt += 1
  print(cnt)

main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

print(i+1)

Submission status: Wrong Answer

Solution code:
[A,B] = list(map(int,input().split()))
output = 0
now = 0
while now < B:
    output += 1
    now += A
print(output)

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:
N, K = [int(x) for x in input().split()]
if N%K == 0:
  print(K//N)
else:
  print(K//N+1)

Submission status: Wrong Answer

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

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

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

print(math.ceil(B/A))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import math
from fractions import gcd
# import queue
# from collections import Counter
# from itertools import accumulate
# from functools import reduce

def lcm(a, b):
    return a * b // gcd(a, b)

def combination_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

def permutations_count(n, r):
    return math.factorial(n) // math.factorial(n - r)

big_prime = 1000000007

"""
# 標準入力取得
## 文字列
 =  sys.stdin.readline().rstrip()
 =  list(sys.stdin.readline().rstrip())

## 数値
 =  int(sys.stdin.readline())
 =  map(int, sys.stdin.readline().split())
 =  list(map(int, sys.stdin.readline().split()))
 =  [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""

A, B =  map(int, sys.stdin.readline().split())

print(B % A + 1)

Submission status: Wrong Answer

Solution code:
from sys import stdin
import math

A, B = [int(x) for x in stdin.readline().rstrip().split()]

print(int(math.ceil(B / A)))

Submission status: Wrong Answer

Solution code:
def makelist(n, m):
    return [[0 for _ in range(m)] for _ in range(n)]

# n = int(input())
# 
# s = input()


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

Submission status: Wrong Answer

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

if b<a:
    ans=1
elif b%a==0 and b>=a:
    ans=b//a
else:
    ans=b//a+1
print(ans)

Submission status: Wrong Answer

Solution code:
import math
N,M=list(map(int,input().split()))
M-=N
if M<1:
  print(1)
  exit()
else:
  print(1+math.ceil(M/(N-1)))

Submission status: Wrong Answer

Solution code:
import sys

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

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

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