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

#複数入力
a,b=(int(x) for x in input().split())
ans=1
while True:
    if a>=b:
        break
    a+=a
    ans+=1


print(ans)

Submission status: Wrong Answer

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

#複数入力
a,b=(int(x) for x in input().split())
ans=1
while True:
    if a>=b:
        break
    a+=(a-1)
    ans+=1


print(ans)

Submission status: Wrong Answer

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

#複数入力
a,b=(int(x) for x in input().split())
ans=1
while True:
    a+=(a-1)
    ans+=1
    if a>=b:
        break

print(ans)

Submission status: Wrong Answer

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

#複数入力
a,b=(int(x) for x in input().split())
ans=1
while True:
    a+=(b-1)
    ans+=1
    if a>b:
        break

print(ans)

Submission status: Wrong Answer

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

#複数入力
a,b=(int(x) for x in input().split())
ans=0
while True:
    a+=(b-1)
    ans+=1
    if a>b:
        break

print(ans)

Submission status: Wrong Answer

Solution code:
import math
a, b = map(int, input().split())
 
t = math.floor(b/a)
if t*a == b:
  print(t)
else:
  print(t+1)

Submission status: Wrong Answer

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

print(math.floor(b/a)+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math


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

    c = 0
    ans = 0
    while ans < b:
        c += 1
        if c == 1:
            ans += a
        else:
            ans += a - 1

    print(c)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import math


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

    c = 1
    ans = 0
    for i in range(math.ceil(b / a)):
        if i == 0:
            ans += a
        else:
            ans += a - 1
        if ans >= b:
            break
        c += 1

    print(c)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

import math

print(math.ceil(i[1]/i[0]))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

plug = 0
count = 0

while plug < b:
  plug += a
  count += 1

print(count)

Submission status: Wrong Answer

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

plug = 0
count = 0

while plug < b:
  plug += a
  count += 1

if b == 1:
  print(0)
else:
  print(count)

Submission status: Wrong Answer

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

    print(i)


if __name__ == "__main__":
    main()

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:
s=list(map(int,input().split()))

ans=s[1]/s[0]

if(s[1]!=s[0]):
    ans+=1

print(int(ans))

Submission status: Wrong Answer

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

ans=s[1]/s[0]+1

print(int(ans))

Submission status: Wrong Answer

Solution code:
input1 = input()
x = []
y=[]
check=0

for i in input1:
    if i!=" " and check==0:
        x.append(i)
    elif i==" ":
        check=1
    elif i!=" " and check==1:
        check==1
        y.append(i)
xstring=''.join(x)
ystring=''.join(y)

xint=int(xstring)
yint=int(ystring)


cnt=0
while ((xint-1)*(cnt))+xint<yint:
    cnt=cnt+1
cnt=cnt+1
print(cnt)

Submission status: Wrong Answer

Solution code:
input1 = input()
x = []
y=[]
check=0

for i in input1:
    if i!=" " and check==0:
        x.append(i)
    elif i==" ":
        check=1
    elif i!=" " and check==1:
        check==1
        y.append(i)
xstring=''.join(x)
ystring=''.join(y)

xint=int(xstring)
yint=int(ystring)


cnt=1
while ((xint-1)*(cnt))+xint<yint:
    cnt=cnt+1
cnt=cnt+1
print(cnt)

Submission status: Wrong Answer

Solution code:
import math

values = [float(s) for s in input().split(" ")] # 0 is min price, 1 increment, 2 is max price, 3 is decrement
if values[0] >=values[1]:
    print(1)
else:
    print(math.ceil(values[1]/(values[0]-1)))

"""
sockets = values[0]
bars = 1
while sockets < values[1]:
    sockets +=values[0] - 1
    bars +=1
print(bars)
"""

Submission status: Wrong Answer

Solution code:
import math

values = [float(s) for s in input().split(" ")] # 0 is min price, 1 increment, 2 is max price, 3 is decrement
if values[0] >=values[1]:
    print(1)
else:
    math.ceil(values[1]/(values[0]-1))

"""
sockets = values[0]
bars = 1
while sockets < values[1]:
    sockets +=values[0] - 1
    bars +=1
print(bars)
"""

Submission status: Wrong Answer

Solution code:
input1 = input()
x = []
y=[]
check=0

for i in input1:
    if i!=" " and check==0:
        x.append(i)
    elif i==" ":
        check=1
    elif i!=" " and check==1:
        check==1
        y.append(i)
xstring=''.join(x)
ystring=''.join(y)

xint=int(xstring)
yint=int(ystring)



    

temp=xint
cnt=1
while xint<yint:
    cnt=cnt+1
    xint=xint+temp-1

print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

values = [float(s) for s in input().split(" ")] # 0 is min price, 1 increment, 2 is max price, 3 is decrement

print(int(math.ceil((values[1])/(values[0]-1)))-1)

"""
sockets = values[0] - 1
bars = 1

while sockets < values[1]:
    sockets +=values[0] - 1
    bars +=1
print(bars)
"""

Submission status: Wrong Answer

Solution code:
import math
A, B = input().split()
A = int(A)
B = int(B)
n = math.ceil(B/A)
print(n, " power strips, each with", A , "sockets, extend the socket into", A*n, "empty sockets.")

Submission status: Wrong Answer

Solution code:
import math

values = [float(s) for s in input().split(" ")] # 0 is min price, 1 increment, 2 is max price, 3 is decrement
sockets = values[0]
bars = 1
while sockets < values[1]:
    sockets +=values[0] - 1
    bars +=1
print(bars)

Submission status: Wrong Answer

Solution code:
import math

values = [float(s) for s in input().split(" ")] # 0 is min price, 1 increment, 2 is max price, 3 is decrement
print(math.ceil(values[1]/values[0]))

Submission status: Wrong Answer

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

#差込口
x = 1

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

Submission status: Wrong Answer

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

#差込口
x = 1

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

Submission status: Wrong Answer

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

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

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(" "))
if b % a > 0:
  print(int(b/a) + 1)
else:
  print(int(b/a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#A口のタップでBコンセント欲しい
a, b = map(int, input().split())
ans , tap = 0, 1

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

Submission status: Wrong Answer

Solution code:
#A口のタップでBコンセント欲しい
a, b = map(int, input().split())
ans = 0
tap = 1
ans , tap = 1, a
if b <= tap:
  print(ans)
else:
  while b >= tap:
    ans += 1
    tap += a
  print(ans)

Submission status: Wrong Answer

Solution code:
#A口のタップでBコンセント欲しい
a, b = map(int, input().split())
ans = 0
tap = 0
ans , tap = 1, a
if b <= tap:
  print(ans)
else:
  while b >= tap:
    ans += 1
    tap += a
  print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = int(1)

for i in range(20):
    ans += a-1
    if ans < b:
        continue
    elif i == 0 and ans >= b:
        print(0)
        break
    else:
        print(i+1)
        break

Submission status: Wrong Answer

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

ans = int(1)

for i in range(20):
    ans += a-1
    if ans < b:
        continue
    else:
        print(i+1)
        break

Submission status: Wrong Answer

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

ans = int(0)

for i in range(20):
    ans += a-1
    if ans < b:
        continue
    else:
        print(i)
        break

Submission status: Wrong Answer

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

if B == 1:
  print(0)
if A >= B:
  print(1)
if A < B:
  count = A
  tap = A-1
  answer = 1

  while(count<B):
    count += tap
    answer += 1
  print(answer)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
# input
a, b = map(int, input().split())
# calc
if b-a <= 0:
    print(1)
else:
    if (b-a) % (a-1) == 0:
        print(int((b-a)//(a-1)+1))
    else:
        print(int((b-a)//(a-1)+2))

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys


def solve(A: int, B: int):

    plug_num = 1
    plugable_num = A

    while plugable_num < B:
        plugable_num += A - 1
        plug_num += 1

    print(plug_num)

    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 = list(map(int,input().split()))
dengen = 1
count = 0
while dengen < B:
  new_dengen = dengen-1+A
  dengen = new_dengen
  count +=1

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())
All_tup = 1
add_tup = 0
while All_tup<B:
    if add_tup==0:
        All_tup += A
        add_tup += 1
    else:
        All_tup += A-1
        add_tup += 1

print(add_tup)

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())
All_tup = 1
add_tup = 0
while All_tup<B:
    if add_tup==0:
        All_tup += 3
        add_tup += 1
    else:
        All_tup += 2
        add_tup += 1

print(add_tup)

Submission status: Wrong Answer

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

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)
    else:
        print(B//A + 1)

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)
    else:
        print(B//A + 1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def input_line(s):
    words=[]
    line=input()
    words=line.split(s)
    return words

a=input_line(" ")
if(int(a[1])/int(a[0])==0):
    ans=int(int(a[1])/int(a[0]))
else:
    ans=int(int(a[1])/int(a[0]))+1

print(ans)

Submission status: Wrong Answer

Solution code:
def input_line(s):
    words=[]
    line=input()
    words=line.split(s)
    return words

a=input_line(" ")
if(int(int(a[1])/int(a[0]))==0):
    ans=int(int(a[1])/int(a[0]))
else:
    ans=int(int(a[1])/int(a[0]))+1

print(ans)

Submission status: Wrong Answer

Solution code:
def input_line(s):
    words=[]
    line=input()
    words=line.split(s)
    return words

a=input_line(" ")
ans=int(a[1])%int(a[0])+1

print(ans)

Submission status: Wrong Answer

Solution code:
if __name__ == '__main__':
    input = list(map(int, input().split()))
    a = input[0]
    b = input[1]
    a_count = 1
    current_plugs = a
    while current_plugs < b:
        current_plugs += a - 1
        a_count += 1

    print(a_count)

Submission status: Wrong Answer

Solution code:
if __name__ == '__main__':
    input = list(map(int, input().split()))
    a = input[0]
    b = input[1]
    a_count = 1
    isAchivied = False
    while isAchivied is False:
        if (a - 1) * (a_count - 1) + a >= b:
            isAchivied = True
            break
        a_count += 1

    print(a_count)

Submission status: Wrong Answer

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

while inlet < b:
    inlet = inlet + a
    ause = ause+1

print(ause)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
inlet = 1
ause =0

while inlet < b:
    inlet = inlet + a
    ause = ause+1

print(ause)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
inlet = 1
ause =0

while inlet <= b:
    inlet = inlet + a
    ause = ause+1

print(ause)

Submission status: Wrong Answer

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

num = B - A
count = 1
if(num <= 0):
  print(count)
else:
 if(num%(A-1)==0): count += num//(A-1)
 else: count += num//(A-1)+1
 print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

res = 1
while A < B:
    A += A - 1
    res += 1

print(res if B != 1 else 0)

Submission status: Wrong Answer

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

if A == B:
    print(1)
else:
    res = 1
    while A < B:
        A += 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/A-1)+1)

Submission status: Wrong Answer

Solution code:
import math

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

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

tap_count = int((B - A) / (A - 1) + 1)   
print(tap_count)

Submission status: Wrong Answer

Solution code:
A_B = input().split()
print(-(-int(A_B[1])//(int(A_B[0])-1)))

Submission status: Wrong Answer

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

plag_count = 0
plag_count += A 
tap_count = 1
while plag_count < B:
  plag_count += A - 1 
  tap_count += 1
  
print(tap_count)

Submission status: Wrong Answer

Solution code:
A_B = input().split()
print(-(-(int(A_B[1])-1)//int(A_B[0])))

Submission status: Wrong Answer

Solution code:
A_B = input().split()
print((int(A_B[1])-1)//int(A_B[0]))

Submission status: Wrong Answer

Solution code:
A_B = input().split()
print((int(A_B[1])-1)//(int(A_B[0])-1))

Submission status: Wrong Answer

Solution code:
A_B = input().split()
print(int(A_B[1])//(int(A_B[0])-1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B=map(int, input().split())
n=0
if B==1:
  print(0)

while (True):
  n=n+1
  if A*n>=B:
    print(n)
    break

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

ans = 0
count = 0

count += A
ans += 1

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B = list(map(int, input().split()))
count = 0
tappu = 1
if B == 1:
    print("0")

while(True):
    tappu += A-1
    count += 1
    if tappu >= B:
        break

print(count)

Submission status: Wrong Answer

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

while(True):
    tappu += A-1
    count += 1
    if tappu >= B:
        break

print(count)

Submission status: Wrong Answer

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

num = 1
ans = 0

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

print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, B = [int(i) for i in input().split()]
ana= A
count = 1
while(ana < B):
    ana += A -1
    count += 1

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
m,n = input().split()
print(int(int(n)/int(m))+1)

Submission status: Wrong Answer

Solution code:
sockets,goal = input().split()
sockets, goal = int(sockets)-1, int(goal)
increment = sockets
count = 1

while sockets < goal:
  sockets += increment
  count += 1
if goal == 1:
  count = 0

print(count)

Submission status: Wrong Answer

Solution code:
sockets,goal = input().split()
sockets, goal = int(sockets), int(goal)
increment = sockets
count = 1

while sockets < goal:
  sockets += increment
  count += 1
if goal == 1:
  count = 0

print(count)

Submission status: Wrong Answer

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

for i in range(b):
  if b ==1:
    ans =0
  elif a+(a-1)*i <b:
    ans +=1
print(ans)

Submission status: Wrong Answer

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

for i in range(b):
  if a*i < b:
    ans += 1
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split());print([1,-(-(b-a)//(a-1))+1][b-a>0])

Submission status: Wrong Answer

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

while len(T)< B:

    if len(T)==0:

        T.extend([0]*A)

        cnt += 1

    else :

        
        T.extend([0]*(A-1))

        cnt += 1

print(cnt)

Submission status: Wrong Answer

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

if B!=1:
  if B%A!=0:
    print(math.ceil(B/A))
  elif B==A:
    print("1")
  else:
    print(math.ceil(B/A)+1)
else:
  print("0")

Submission status: Wrong Answer

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

if B!=1:
  if B%A!=0:
    print(math.ceil(B/A))
  else:
    print(math.ceil(B/A)+1)
else:
  print("0")

Submission status: Wrong Answer

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

if B!=1:
  print(math.ceil(B/A))
else:
  print("0")

Submission status: Wrong Answer

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

print(math.ceil(B/A))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
num_power_taps, target_tap_num = map(int, input().split())

if target_tap_num == 1:
  print(0)
else:
  print(-(target_tap_num - 1) // (num_power_taps - 1))

Submission status: Wrong Answer

Solution code:
sockets,goal = input().split()
sockets, goal = int(sockets), int(goal)
increment = sockets
count = 1

while sockets < goal:
  sockets += increment
  count += 1

print(count)

Submission status: Wrong Answer

Solution code:
A,B=map(int,input().split(" "))
a=1
while B>A:
	A*=2
	a+=1

print(a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
# input
a, b = map(int, input().split())
o = 0
z = b
# calc
if b-a <= 0:
    print(1)
else:
    if (b-a) % (a-1) == 0:
        print((b-a)//(a-1)+1)
    else:
        print((b-a)//(a-1)+2)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
# input
a, b = map(int, input().split())
o = 0
z = b
# calc
if b-a <= 0:
    print(1)
else:
    if (b-a) % a == 0:
        print((b-a)//a+1)
    else:
        print((b-a)//a+2)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
# input
a, b = map(int, input().split())
o = 0
z = b
# calc
if b-a <= 0:
    print(1)
else:
    print((b-a)//a+2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

count = 1
d = a

while d<b:
  d += a
  count += 1

print(count)

Submission status: Wrong Answer

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

plgcnt = 0
tapcnt = 1

flg=0

while(True):
    tapcnt += a-1
    plgcnt += 1
    if tapcnt >= b:
        print(plgcnt)
        break

Submission status: Wrong Answer

Solution code:
sockets, goals = input().split()
sockets, goals = int(sockets), int(goals)
count = 1
 
while goals > sockets: 
    count += 1
    sockets *= count
print(count)

Submission status: Wrong Answer

Solution code:
sockets = 4
goal = 10
count = 1
 
while goal > sockets: 
    count += 1
    sockets *= count
print(count)

Submission status: Wrong Answer

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

plgcnt = 0

flg=0

def jijo(n):
    if n<=1:
        return 1
    return n*n+jijo(n-1)

for i in range(1,10):
    if flg==1:
        break
    for j in range(a):
        if a ** (i - 1) + a * j - j >= b:
            print((j-1)+jijo(i))
            flg = 1
            break

Submission status: Wrong Answer

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

plgcnt = 0

flg=0

def jijo(n):
    if n<=1:
        return 1
    return n*n+jijo(n-1)

for i in range(1,10):
    if flg==1:
        break
    for j in range(a):
        if a ** (i - 1) + a * j - j >= b:
            print((j-1)+jijo(i-1))
            flg = 1
            break

Submission status: Wrong Answer

Solution code:
t=input()
t=t.split()
a=int(t[0])
b=int(t[1])
x=(b-1)//(a-1)
print(x)

Submission status: Wrong Answer

Solution code:
import math


def kaijo(x,n):
    if n <= 0:
        return 1
    return x**(n-1) + kaijo(x, n - 2)


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

ans = 0
for i in range(10):
    if b == 0:
        ans = 0
        break
    if a == b:
        ans = 1
        break
    if a ** i < b:
        continue
    ans = math.floor(b / (a ** (i - 1))) -1 + kaijo(a, i-1)
    break

print(ans)

Submission status: Wrong Answer

Solution code:
import math


def kaijo(n):
    if n <= 0:
        return 1
    return n * kaijo(n - 1)


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

ans = 0
for i in range(10):
    if b == 0:
        ans = 0
        break
    if a == b:
        ans = 1
        break
    if a ** i < b:
        continue
    ans = math.floor(b / (a ** (i - 1))) + kaijo(i-1)
    break

print(ans)

Submission status: Wrong Answer

Solution code:
import math


def kaijo(n):
    if n <= 0:
        return 1
    return n * kaijo(n - 1)


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

ans = 0
for i in range(5):
    if b == 0:
        ans = 0
        break
    if a == b:
        ans = 1
        break
    if a ** i < b:
        continue
    ans = math.floor(b / (a ** (i - 1))) + kaijo(i-1)
    break

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(i)

Submission status: Wrong Answer

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