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:
N,K = map(int,input().split())
c = N
ans = 1
while c < K:
    ans += 1
    c += N-1
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
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 LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 10 ** 9 + 7
import math
a, b = LI()

# a は電源タップの口数
# b　は欲しい口数>
# 何個電源タップが必要ですか？
# ただしもとから一つの差し込み口がある。

if b == 1:
    print(0)
else:
    x = math.ceil(b / a)
    print(x)

Submission status: Wrong Answer

Solution code:
import sys
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
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 LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 10 ** 9 + 7
import math
a, b = LI()

# a は電源タップの口数
# b　は欲しい口数>
# 何個電源タップが必要ですか？

x = math.ceil(b / a)
print(x)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b = map(int, input().split())
Sokect = [(a-1)*i for i in range(21)]

for i in range(21):
    if b-Sokect[i] <= a:
        print(i+1)
        break

Submission status: Wrong Answer

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

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

print(cnt)

Submission status: Wrong Answer

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

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

print(cnt)

Submission status: Wrong Answer

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

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

print(cnt)

Submission status: Wrong Answer

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

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

print(cnt)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if b == a:
    print(1)
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())
cnt=A
ans=1
while cnt<B:
    cnt+=A-1
    ans+=1
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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(100):
    if a * i >= b:
        print(i)
        break

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


cn = 0
C = 0

if A == B:
    print(1)
    exit()
elif A > B:
    print(0)
    exit()
for i in range(100):
    if i == 0:
        C = C + A
        cn = cn + 1
    else:
        C = C + A - 1
        cn = cn + 1
        if C >= B:
            print(cn)
            break

Submission status: Wrong Answer

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


cn = 0
C = 0

if A == B:
    print(1)
    exit()
elif A > B:
    print(0)
    exit()
for i in range(100):
    if i == 0:
        C = A
        cn = cn + 1
    else:
        C = C + A - 1
        cn = cn + 1
        if C >= B:
            print(cn)
            break

Submission status: Wrong Answer

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


cn = 0
C = 0

if A == B:
    print(1)
    exit()
for i in range(100):
    if i == 0:
        C = A
        cn = cn + 1
    else:
        C = C + A - 1
        cn = cn + 1
        if C >= B:
            print(cn)
            break

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

    ans = 0
    while True:
        ans += 1
        if (n - 1) * ans + 1 >= k:
            print(ans)
            break


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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


d, r = divmod(b, a)
if r == 0:
    print(d)
else:
    print( d + 1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b = [int(x) for x in input().split()]
res = 0
c = 1
while res <= b:
  c += a-1
  res += 1
print(res)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b = [int(x) for x in input().split()]
print((b + a - 1)//a)

Submission status: Wrong Answer

Solution code:
a,b = [int(x) for x in input().split()]
print(b + a - 1//a)

Submission status: Wrong Answer

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


def solve(A: int, B: int):
    if B == 1:
        print(0)
    t = A
    ans = 1
    while True:
        if t >= B:
            print(ans)
            break
        t += A-1
        ans += 1
    return


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
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:
#!/usr/bin/env python3
import sys


def solve(A: int, B: int):
    t = A
    ans = 1
    while True:
        if t >= B:
            print(ans)
            break
        t += A-1
        ans += 1
    return


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
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())
plug = 0
count = 0
while plug < B :
    plug += A
    if plug < B :
        plug -= 1
    count += 1
print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, B = map(int, input().split())
 
# 電源タップの個数をa, 差込口の個数をnumとおく 
a = 0
num = 1
while num < B:
  num -= 1
  num += a
  a += 1

print(a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

# A*x-(x-1) >= B
# (A-1)*x >= B-1
# x >= ceil((B-1)/(A-1))
print(-(-B+1)//(A-1))

Submission status: Wrong Answer

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

N = 0
sum = A

while (sum < B):
     N += 1
     sum = A + (A-1)*(N-1)

     if sum >= B:
         break

ans = N

print(ans)

Submission status: Wrong Answer

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

N = 1
sum = A

while (sum < B):
     N += 1
     sum = A * N

     if sum >= B:
         break

ans = N

print(ans)

Submission status: Wrong Answer

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

N = 1
sum = A

while (sum < B):
     N += 1
     sum = A + (A-1)*(N-1)

     if sum >= B:
         break

ans = N

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
d = list(map(int,input().split()))
A = d[0]
B = d[1]
cnt = 1
while True:
    if A*cnt - cnt +1 >= B:
        print(cnt)
        sys.exit(0)
    cnt +=1

Submission status: Wrong Answer

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

else:
    print(ans)

Submission status: Wrong Answer

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

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())
c = 0
d = 0
for i in range(b):
    if i == 0:
        c += a
    else:
        c += a - 1
    d += 1
    if c >= b:
        print(d)
        exit()

Submission status: Wrong Answer

Solution code:
#-*-coding:utf-8-*-
import sys
input=sys.stdin.readline

def main():
    a,b = map(int,input().split())
    count=1
    plug=0

    if a==b:
        print(1)
        exit()

    plug+=a
    while True:
        if plug >= b:
            break
        plug+=a-1
        count+=1
#        print("count={},plug={}".format(count,plug))
    print(count)

if __name__=="__main__":
    main()

Submission status: Wrong Answer

Solution code:
#-*-coding:utf-8-*-
import sys
input=sys.stdin.readline

def main():
    a,b = map(int,input().split())
    count=1
    plug=0

    if a==b:
        print(1)
        exit()

    plug+=a
    while b > plug:
        plug+=a-1
        count+=1
#        print("count={},plug={}".format(count,plug))
    print(count)

if __name__=="__main__":
    main()

Submission status: Wrong Answer

Solution code:
#-*-coding:utf-8-*-
import sys
input=sys.stdin.readline

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

    if b<=a:
        print(1)
        exit()
    
    for i in range(100):
        if b > a:
            count+=1
            b-=a-1
        elif b<=a:
            count+=1
            b-=a
            break
    print(count)

if __name__=="__main__":
    main()

Submission status: Wrong Answer

Solution code:
#-*-coding:utf-8-*-
import sys
input=sys.stdin.readline

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

    if b==a:
        print(1)
        exit()
    
    for i in range(100):
        if b > a:
            count+=1
            b-=a-1
        elif b<=a:
            count+=1
            b-=a
            break
    print(count)

if __name__=="__main__":
    main()

Submission status: Wrong Answer

Solution code:
#-*-coding:utf-8-*-
import sys
input=sys.stdin.readline

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

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


if __name__=="__main__":
    main()

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
 
tap_num = 0
con_num = a + (a * tap_num -1)
 
# con_num > b となることが必要条件
# a + (a * tap_num -2) < b < a + (a * tap_num -1)
 
for tap_num in range(b):
    if tap_num == 0:
        if a >= b: break
    else:
        if a + ((a - 1) * (tap_num -1)) >= b: break
    
print(tap_num + 1)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
 
tap_num = 0
con_num = a + (a * tap_num -1)
 
# con_num > b となることが必要条件
# a + (a * tap_num -2) < b < a + (a * tap_num -1)
 
for tap_num in range(b):
    if tap_num == 0:
        if a >= b: break
    else:
        if a + (a * tap_num -1) >= b: break
    
print(tap_num + 1)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
 
tap_num = 0
con_num = a + (a * tap_num -1)
 
# con_num > b となることが必要条件
# a + (a * tap_num -2) < b < a + (a * tap_num -1)
 
for tap_num in range(b):
    if a + (a * tap_num -1) >= b:
        break
    
print(tap_num)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
 
tap_num = 0
con_num = a + (a * tap_num -1)
 
# con_num > b となることが必要条件
# a + (a * tap_num -2) < b < a + (a * tap_num -1)
 
for tap_num in range(b):
    if a + (a * tap_num -1) > b:
        break
    
print(tap_num)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

Solution code:
a,b=input().split()
a=int(a)
b=int(b)
if b==0:
  print(0)
elif a>=b:
  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:
a,b=input().split()
a=int(a)
b=int(b)
if a>=b:
  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:
a,b=input().split()
a=int(a)
b=int(b)
if a>=b:
  print(1)
else:
  if (b-a)%(a-1)==0:
    print(int(b/(a-1)))
  else:
    print(int(b/(a-1))+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

else:
    ans = 0
    y = 0
    while y < b:
        ans+=1
        y = ans*(a-1)+1
        print(f'y{y}')
    print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
def resolve():
    A, B = [int(x) for x in input().split(" ")]
    n = A
    t = 1
    while True:
        if n >= B:
            print(t)
            return
        else:
            t += 1
            n += n - 1
resolve()

Submission status: Wrong Answer

Solution code:
def resolve():
    A, B = [int(x) for x in input().split(" ")]
    n = 0
    while True:
        if A + (A - 1) * n >= B:
            print(n+1)
            break
        else:
            n += 1
resolve()

Submission status: Wrong Answer

Solution code:
def resolve():
    A, B = [int(x) for x in input().split(" ")]
    n = A
    t = 1
    while True:
        if n >= B:
            print(t)
            return
        else:
            t += 1
            n += n - 1

Submission status: Wrong Answer

Solution code:
def resolve():
    A, B = [int(x) for x in input().split(" ")]
    n = 0
    while True:
        if A + (A - 1) * n >= B:
            print(n+1)
            break
        else:
            n += 1

Submission status: Wrong Answer

Solution code:
def resolve():
    import math
    A, B = [int(x) for x in input().split(" ")]
    print(math.ceil(B/A))
resolve()

Submission status: Wrong Answer

Solution code:
import math
a, b = map(int, input().split())
c=0
if b>a*2-1:
    c=a*2-1
print(math.ceil((c+a-1)/a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

print(ceil( B / (A-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())
ans=1

if A>=B:
    print(1)
    exit()

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

Submission status: Wrong Answer

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

if A>=B:
    print(1)
    exit()

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

print(ans)

Submission status: Wrong Answer

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

if A>=B:
    print(1)

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

print(ans)

Submission status: Wrong Answer

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

if A>=B:
    print(1)

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
"""
A:プラグの数
B:必要なプラグの数
"""

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

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

    print(count)

Submission status: Wrong Answer

Solution code:
"""
A:プラグの数
B:必要なプラグの数
"""

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

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

    print(count)

Submission status: Wrong Answer

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

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

print(-(-b // a))

Submission status: Wrong Answer

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

if a > b:
    print(0)
elif a == b:
    print(1)
else:
    SumPowerSocket = a
    NumUsePowerTap = 1
    while True:
        if b > SumPowerSocket:
            SumPowerSocket += a - 1
            NumUsePowerTap += 1
        else:
            print(NumUsePowerTap)
            break

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if b <= a :
    print('1')

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

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
z = b // a
x = b % a
if (z==1 & x==0) or z==0 :
    print('1')

elif x != 0:
    b -= a
    a -= 1
    y = b % a
    if y==0:
        print(1 + b//a)
    else:
        print(2 + b//a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if a >= b:
    print(1)
else:
    SumPowerSocket = a
    NumUsePowerTap = 1
    while True:
        if b > SumPowerSocket:
            SumPowerSocket += a - 1
            NumUsePowerTap += 1
        else:
            print(NumUsePowerTap)
            break

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:
# -*- coding:utf-8 -*-
a,b = map(int,input().split())

if a >= b:
    print(1)
else:
    PowerSocketNum = a
    PowerSocket = 1
    while True:
        if b > PowerSocketNum:
            PowerSocketNum += a - 1
            PowerSocket += 1
        else:
            print(PowerSocket)
            break

Submission status: Wrong Answer

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

if a >= b:
    print(1)
else:
    PowerSocketNum = a
    PowerSocket = 1
    while True:
        if b > PowerSocketNum:
            PowerSocketNum += a
            PowerSocket += 1
        else:
            print(PowerSocket)
            break

Submission status: Wrong Answer

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

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

print(cnt-1)

Submission status: Wrong Answer

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

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

print(cnt)

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

print(-(-A//B))

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

tup = A
i = 1
while tup < B:
  tup = tup - 1 + A
  i += 1

print(i)

Submission status: Wrong Answer

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

ans=int((b-2)/(a-1))+1

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

    print(ans)


if __name__ == "__main__":
    main()