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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
A, B = [int(i) for i in input().split()]
c = B // A
d = B % A
if d != 0:
  print(c + 1)
else:
  print(c)

Submission status: Wrong Answer

Solution code:
import math
A, B = [int(i) for i in input().split()]
c = (B / A) + 1
print(math.floor(c) - 1)

Submission status: Wrong Answer

Solution code:
import math
A, B = [int(i) for i in input().split()]
for i in range(1, 401):
  if A * i >= B:
    print(i)
    break

Submission status: Wrong Answer

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

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())
for i in range(1, 20):
    if (A - 1) * i + 1 >= B:
        break
print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
a,b=map(int,input().split())
for i in range (1,21):
  if (a-1)*i+1 >=b:
    print (i)
    sys.exit()
  else:
    continue

Submission status: Wrong Answer

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

print(B // A + 1)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a,b = list(int(x) for x in input().split())
c = b - a
s = round(c/(a-1))
if c<0:
  print(1)
else:
  print(s+1)

Submission status: Wrong Answer

Solution code:
a,b = list(int(x) for x in input().split())
stop = True
k = 1
c = b - a
if c <= 0:
    stop = False
while stop:
  c = c - a
  k = k + 1
  if c <= 0:
    stop = False
print(k)

Submission status: Wrong Answer

Solution code:
a,b = list(int(x) for x in input().split())
stop = True
k = 1
c = b - a
if c <= 0:
    stop = False
while stop:
  c = c - a
  k = k + 1
print(k)

Submission status: Wrong Answer

Solution code:
a,b = list(int(x) for x in input().split())
stop = True
k = 1
c = b - a
while stop:
  c = c - a +1
  k = k + 1
  if c <= 0:
    stop = False
print(k)

Submission status: Wrong Answer

Solution code:
a,b = list(int(x) for x in input().split())
stop = True
k = 0
while stop:
  b = b - a
  k = k + 1
  if b <= 0:
    stop = False
print(k)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if a>=b:
    print(1)
else:
    print((b)//(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)+2)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

count = 0
socket = 0
if socket == 0:
    pass
else:
    count = 1
    socket = a
    while socket < b:
        socket += a -1
        count += 1 

print(count)

Submission status: Wrong Answer

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

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

print(count)

Submission status: Wrong Answer

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

r = a-1
count = 0
for i in range(100):
    if r*i + a < b:
        count += 1
        continue
    else:
        count += 1
        break
        
print(count)

Submission status: Wrong Answer

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

r = a-1
count = 0
for i in range(30):
    if r*i + a < b:
        count += 1
        continue
    else:
        count += 1
        break
        
print(count)

Submission status: Wrong Answer

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

r = a-1
count = 0
for i in range(21):
    if r*i + a < b:
        count += 1
        continue
    else:
        count += 1
        break
        
print(count)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(count)

Submission status: Wrong Answer

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

print((count-1)//(A-1))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, B = (int(i) for i in input().split())
n = 1
if B == 0:
    print(0)
    exit(0)
    
while True:
    a = A * n - (n-1)
    if a >= B:
        print(n)
        exit(0)
    n += 1

Submission status: Wrong Answer

Solution code:
A, B = (int(i) for i in input().split())
n = 1
while True:
    a = A * n - (n-1)
    if a >= B:
        print(n)
        exit(0)
    n += 1

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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())
count = B - A

if(count > 0):
  if count%(A-1) == 0:
    print(1 + count//(A-1))
  else:
    print(2 + count//(A-1))
else:
  print(1)

Submission status: Wrong Answer

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

if(count > 0):
  if count//(A-1) == 0:
    print(1 + count//(A-1))
  else:
    print(2 + count//(A-1))
else:
  print(1)

Submission status: Wrong Answer

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

if(count > 0):
	print(1 + count//(A-1))
else:
	print(1)

Submission status: Wrong Answer

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

else:
    print(C)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


print(math.ceil(b-1/a-1))

Submission status: Wrong Answer

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


print(math.ceil(b/a))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
A=list(map(int,input().split()))
count=0
if A[0]>=A[1]:
    count=1
else:
    for i in range(1,100):
        if A[0]*i<A[1]:
            count+=1
        else:
            count+=1
            break
print(count)

Submission status: Wrong Answer

Solution code:
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


# 初項s, 交差dのn個の数列の和
def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


# aとbの最大公約数
def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


# aとbの最小公倍数
def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


def main():
    A, B = map(int, input().split())
    for i in range(1, 100):
        if A * i - (i - 1) >= B:
            print(i)
            return 


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


# 初項s, 交差dのn個の数列の和
def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


# aとbの最大公約数
def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


# aとbの最小公倍数
def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


def main():
    A, B = map(int, input().split())
    print(ceil(B, A))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

x = int(b/a)

if a==b:
  ans=1
elif a*x-x >= b:
  ans=x
else:
  ans = x+1
print(ans)

Submission status: Wrong Answer

Solution code:
data = list(map(int,input().split()))
sum = data[0]
count = 1

while sum < data[1]:
    sum += data[0]-1
    count += 1

print(count)


#a+a-1  +a-1

Submission status: Wrong Answer

Solution code:
data = list(map(int,input().split()))
sum = 0
count = 0

while sum < data[1]:
    if count == 0:
        sum += data[0]
    else:
        sum += data[0]-1

    count += 1

print(count)


#a+a-1  +a-1

Submission status: Wrong Answer

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

if a >= b:
  	print(1)
else:
    n = 1
    while (a * n - (n - 1)) < b:
        n += 1

    print(n)

Submission status: Wrong Answer

Solution code:
import sys

N, K = map(int, sys.stdin.readline().split())

ans=0
sockets=0
while sockets<K:
  sockets+=N
  N-=1
  ans+=1
print(ans)

Submission status: Wrong Answer

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

import math

tap = math.ceil(B / A)

print(tap)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

tap=A
count=1

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

Submission status: Wrong Answer

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

tap=A
count=1
if tap >=B:
  print(count)


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

print(count)

Submission status: Wrong Answer

Solution code:
def main():
    A, B = map(int, input().split())
    cnt = A
    tap = 1
    while True:
        if cnt >= B:
            print(tap)
            exit()
        cnt += (A - 1)
        tap += 1




if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
def main():
    A, B = map(int, input().split())
    cnt = A
    tap = 1
    while True:
        if cnt >= B:
            print(tap)
            exit()
        cnt += A - 1
        tap += 1




if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(tap)

Submission status: Wrong Answer

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

if a >= b:
    pass
else:
    while count <= b:
        count += (a -1) + a
        tap += 1

print(tap)

Submission status: Wrong Answer

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

if a == b:
    pass
else:
    while count <= b:
        count += (a -1) + a
        tap += 1

print(tap)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
cnt = 0
if b <= 8:
    print(1)
else:
    while b > 0:
        b -= a
        print(b)
        cnt += 1
    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())
for r in range(1, 20):
        if a * r  - (r - 1) >= b : 
                print(r)
                break

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

out=1
cnt=0

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
import math
def print_ans(input_line):
    """Test Case
    >>> print_ans("4 10")
    3
    >>> print_ans("8 9")
    2
    >>> print_ans("8 8")
    1
    """
    A, B = list(map(int,input_line.split()))
    # a_sum = A
    # counter = 1
    # while a_sum < B:
    #     a_sum += A -1
    #     counter += 1
    # print(counter)
    print(math.ceil(B/A))

if __name__ == '__main__':
    s = input().rstrip()
    print_ans(s)

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
def print_ans(input_line):
    """Test Case
    >>> print_ans("4 10")
    3
    >>> print_ans("8 9")
    2
    >>> print_ans("8 8")
    1
    """
    A, B = list(map(int,input_line.split()))
    a_sum = A
    counter = 1
    while a_sum < B:
        a_sum += A -1
        counter += 1
    print(counter)

if __name__ == '__main__':
    s = input().rstrip()
    print_ans(s)

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

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if b == 0:
    pass
elif b <= a:
    cnt = 1
else:
    cnt = 1 + (b-a)//(a-1)
    if (b-a) % (a-1) > 0:
        cnt+=1

print(cnt)

Submission status: Wrong Answer

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

if b == 0:
    pass
elif b <= a:
    cnt = 1
else:
    cnt = 1 + (b-a)//(a-1)
    if (b-a) % (a-1) != 0:
        cnt+=1

print(cnt)

Submission status: Wrong Answer

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

if b == 0:
    pass
elif b <= a:
    cnt = 1
else:
    cnt = 1 + (b-a)//(a-1)
    if (b - a) % 2 == 1:
        cnt+=1

print(cnt)

Submission status: Wrong Answer

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

if b == 0:
    pass
elif b <= a:
    cnt = 1
else:
    cnt = 1 + (b-a)//(a-1)
    if b % 2 == 1:
        cnt+=1

print(cnt)

Submission status: Wrong Answer

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

if b == 0:
    pass
elif b <= a:
    cnt = 1
else:
    cnt = 1 + (b-a)//(a-1)

print(cnt)

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

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

while t < b:
  i += 1
  t += a - 1

print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

for i in range(12):
    if a*i >= b:
        print(i)
        break

Submission status: Wrong Answer

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

for i in range(11):
    if a*i >= b:
        print(i)
        break

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

C = (B - A)/(A - 1) + 1

print(round(C))

Submission status: Wrong Answer

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

C = (B - A)/(A - 1) + 1

print(C)

Submission status: Wrong Answer

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

C = (B - A)/(A - 1)

print(C)

Submission status: Wrong Answer

Solution code:
list1 = [int(i) for i in input().split()];

A = list1[0];   #A個口の電源タップ
B = list1[1];   #未使用の差込口を B口以上に拡張したい
#print(list1)
#print(list1[1])
addSupply = 1;
lack   = (B-A); #足りない個数
if lack >0 & B !=1 :
    addSupply = 1;
    addSupply += lack / (A-1); #残りの個数 
 
    if lack % (A-1) >0:
        addSupply +=1;

print(int(addSupply));

Submission status: Wrong Answer

Solution code:
list1 = [int(i) for i in input().split()];

A = list1[0];   #A個口の電源タップ
B = list1[1];   #未使用の差込口を B口以上に拡張したい
#print(list1)
#print(list1[1])
addSupply = 1;
lack   = (B-A); #足りない個数
if lack >0 & B !=1 :
    addSupply = 1;
    addSupply += lack / (A-1); #残りの個数 
 
    if lack % (A-1) >0:
        addSupply +=1;
else :
    addSupply = 0;
print(int(addSupply));

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B = map(int,input().split())
C = B - A
count = 1
tap = A -1
if C <= 0:
    print(count)
else:
    while(C > 0):
        C -= tap 
        count += 1
    print(count)

Submission status: Wrong Answer

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

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

print(b//(a-1))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
s = input()
ns = [int(i) for i in s.rsplit()]
print(math.ceil(ns[1]/ns[0] - 0.00001))

Submission status: Wrong Answer

Solution code:
import sys
A, B = [int(x)-1 for x in sys.stdin.readline().split()]

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

s = input()
ns = [int(i) for i in s.rsplit()]
print(math.ceil(ns[1]/ns[0] - 0.0001))

Submission status: Wrong Answer

Solution code:
import math

s = input()
ns = [ int(i) for i in s.rsplit() ]
print(math.ceil(ns[1]/ns[0]))

Submission status: Wrong Answer

Solution code:
import math

s = input()
ns = [int(i) for i in s.rsplit()]
print(math.ceil(ns[1]/ns[0]))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = list(map(int, input().split()))
if x[1]<=x[0]:
    print(1)
else:
    print((x[1]//x[0])+1)

Submission status: Wrong Answer

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

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

count = 0

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

print(count)

Submission status: Wrong Answer

Solution code:
import math

a,b = input().split()

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

print(math.ceil(b/a))

Submission status: Wrong Answer

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

print(math.ceil(((b-a)/a) + 1))

Submission status: Wrong Answer

Solution code:
list1 = [int(i) for i in input().split()];

A = list1[0];   #A個口の電源タップ
B = list1[1];   #未使用の差込口を B口以上に拡張したい
#print(list1)
#print(list1[1])
addSupply = 1;
lack   = (B-A); #足りない個数
if lack >0 :
    addSupply = 1;
    addSupply += lack / (A-1); #残りの個数 

    if lack % (A-1) >0:
        addSupply +=1;

print(int(addSupply));

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B=map(int,input().split());tmp=0;c=1

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

Submission status: Wrong Answer

Solution code:
A,B=map(int,input().split());tmp=0;c=1

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

Submission status: Wrong Answer

Solution code:
A,B=map(int,input().split());tmp=0;c=1

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

Submission status: Wrong Answer

Solution code:
A,B=map(int,input().split());tmp=0;c=1

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

Submission status: Wrong Answer

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

import math

socket=0;ans=0

while (True):
  if socket+a >= b:
    ans+=1
    break
  socket+=a-1
  ans+=1
  
print(ans)

Submission status: Wrong Answer

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

import math

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

Submission status: Wrong Answer

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

import math

print(math.ceil(b/a))

Submission status: Wrong Answer

Solution code:
A,B=map(int,input().split(" "))
flag=True
N=A
co=1
while flag==True:
    if N==B or N>B:
        print(co)
        flag=False
    elif N<B:
        N+=A-1
        co+=1

Submission status: Wrong Answer

Solution code:
A,B=map(int,input().split(" "))
flag=True
N=A
co=1
while flag==True:
    if N==B or N>B:
        print(co)
        flag=False
    else:
        N+=A-1
        co+=1
        if N>=B:
            print(co)
            flag=False