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
sys.setrecursionlimit(10 ** 6)
#from collections import defaultdict
#d = defaultdict(int)
#import fractions
#import math
#import collections
#from collections import deque
#from bisect import bisect_left
#from bisect import insort_left
#N = int(input())
#A = list(map(int,input().split()))
#S = list(input())
#S.remove("\n")
#N,M = map(int,input().split())
#S,T = map(str,input().split())
#A = [int(input()) for _ in range(N)]
#S = [input() for _ in range(N)]
#A = [list(map(int,input().split())) for _ in range(N)]
#import itertools
#import heapq
#import numpy as np
A,B = map(int,input().split())
if B <= A:
    print(1)
else:
    B -= A 
    c = 1
    while (A-1)*c < B:
        c += 1
    print(c+1)

Submission status: Wrong Answer

Solution code:
import sys
input=sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
#from collections import defaultdict
#d = defaultdict(int)
#import fractions
#import math
#import collections
#from collections import deque
#from bisect import bisect_left
#from bisect import insort_left
#N = int(input())
#A = list(map(int,input().split()))
#S = list(input())
#S.remove("\n")
#N,M = map(int,input().split())
#S,T = map(str,input().split())
#A = [int(input()) for _ in range(N)]
#S = [input() for _ in range(N)]
#A = [list(map(int,input().split())) for _ in range(N)]
#import itertools
#import heapq
#import numpy as np
A,B = map(int,input().split())
if B <= A:
    print(1)
else:
    B -= A + 1
    c = B // (A-1)
    print(1+c+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:
import math
A, B=map(int, input().split())

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

if math.ceil(B/A)==1:
  print(1)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

if math.ceil(B/A)==1:
  print(1)

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

Submission status: Wrong Answer

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

if math.ceil(B/A)==1:
  print(1)

else:
  print(B//(A-1))

Submission status: Wrong Answer

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

if math.ceil(B/A)==1:
  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)
  
if B%A!=0:
  print(B//A+1)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

ans = 1
X = A * ans

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
x, y = map(int, input().split())
if y == 1:
  print(1)
  sys.exit()
if y%x == 0:
  print(y//x)
else:
  print(y//x+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math



def main(a, b):
    if a == b:
        return 1
    n = math.ceil(b / (a - 1))
    return n

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def II(): return int(input())
def MI(): return map(int,input().split())
def LMI(): return list(map(int,input().split()))
def LIIN(n): return list(int(input()) for _ in range(n))
def LMIN(n): return [list(map(int, input().split())) for _ in range(n)]
def IS(): return input()
def MS(): return map(str,input().split())
def LMS(): return list(map(str,input().split()))
def LISN(n): return list(input() for _ in range(n))
def LMSN(n): return [input().split() for _ in range(n)]
MOD = 10**9+7
INF = 10**18

def main():
    a,b = MI()
    print((b-a+(a-1)-1)//(a-1))

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
args = input().split()
a,b = int(args[0]),int(args[1])
if b<=a:
  print("1")
else:
  print(int((b-a)/(a-1))+1+((b-a)%(a-1)!=0))

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

print(n)

Submission status: Wrong Answer

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

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

print(n)

Submission status: Wrong Answer

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

if a == b:
    print(1)
    exit()
misiyo = a - 1
kosuu = 0
while misiyo <= b - 1:
    kosuu += 1
    misiyo *= kosuu

print(kosuu)

Submission status: Wrong Answer

Solution code:
def solve(A, B):
    available = 1
    ans = 0
    while available < B:
        available += A-1
        ans += 1
    return ans

Submission status: Wrong Answer

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

else:
  print(int(c)+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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] = [int(i) for i in input().split()]

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

# B - Power Socket
a, b = map(int, input().split())

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

	print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
tap_num = a
num = 1
while True:
  if a > b:
    num = 0
    break
  elif tap_num <= b and not tap_num == b:
    tap_num = tap_num + a - 1
    num += 1
  else:
    break
print(num)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
tap_num = a
num = 1
while True:
  if tap_num > b:
    break
  elif tap_num <= b and not tap_num == b:
    tap_num = tap_num + a - 1
    num += 1
  else:
    break
print(num)

Submission status: Wrong Answer

Solution code:
a, b = map(int, input().split())
tap_num = a
num = 1
while True:
  if tap_num <= b and not tap_num == b:
    tap_num = tap_num + a - 1
    num += 1
  else:
    break
print(num)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding:utf-8
A, B = map(int, input().split())
# 1個プラグが増えると未使用の差込口がA-1個増える
n = 0
b = 0
while b < B:
    n += 1 
    if n == 1:
        b += A
    else:
        b += A-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())

print(B//A +1)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

for x in range(B):
  if A+(A-1)*x < B:
    cnt+=1
  else:
    break
    
print(cnt+1)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
n,m=map(int,input().split())
s=m/(n-1)
if m%(n-1)<=1:
  print(m//(n-1))
else:
  print(m//(n-1)+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
sum = 0
sum += b//a

print(sum)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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())
print(b//(a-1)+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from fractions import gcd # 最大公約数
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // gcd(x, y)) # 最小公倍数
# list(map(int, input().split()))

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import numpy as np

def main():
    A, B = map(int, read().split())
    print(-((B-1) // (A-1)))
    return

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import numpy as np

def main():
    A, B = map(int, read().split())
    print((B-1) // (A-1))
    return

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import numpy as np

def main():
    A, B = map(int, read().split())
    print((B-1) % (A-1))
    return

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = 0

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import sys
a, b = map(int, sys.stdin.readline().split())
print(-((a-b) // (a-1)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

print(math.ceil(B / A))

Submission status: Wrong Answer

Solution code:
args = input().split()
a = int(args[0])
b = int(args[1])

tap = 1
socket = a
while socket < b:
  tap += 1
  socket += (a - 1)
  
print(tap)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a,b=map(int,input().split())
if b >1:
  print(math.ceil(b/a))
elif b == 1:
  print(0)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input().split(" ")
a = int(s[0])
b = int(s[1])

if a >= b:
    if b == 1:
        print(0)
    else:
        print(1)
else:
    if(b//a * a) < b:
        print((b//a) + 1)
    else:
        print(b//a)

Submission status: Wrong Answer

Solution code:
s = input().split(" ")
a = int(s[0])
b = int(s[1])

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

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
ans=0
for i in range(1000):
    if a<=b:
        ans+=1
    if b-a-((a-1)*i)<=0:
        print(ans)
        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())
c=a-1
for i in range(1000):
    if b/a<=1:
        print(i+1)
        break
    else:
        a=a+c

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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


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

    print(ans)

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

Solution code:
import math

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

print(math.ceil((B+A-1)/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())
now = 0
ans = 0
for i in range(10**5):
    if now >= B:
        print(ans)
        break
    else:
        if i == 0:
            now += A
            ans += 1
        else:
            now += A-1
            ans += 1

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

a,b = map(int,input().split())
num = 0
count = 1

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

print(count)

Submission status: Wrong Answer

Solution code:

a,b = map(int,input().split())
num = a
count = 1

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

print(count)

Submission status: Wrong Answer

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

ans = 1
b -= a
while (True):
    if b <= 0:
        break
    b -= a
    ans += 1

print(ans)

Submission status: Wrong Answer

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

ans = 0
while (True):
    if b <= 0:
        break
    b -= a
    ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
# 初期入力
A,B = (int(x) for x in input().split())

#
import math
tapp_num = math.ceil( (B-1)//(A-1) )
#print(tapp_num)


sasikomiguti_misiyou=0
if B<=A:
    print(1)
else:        
    sasikomiguti_misiyou =(tapp_num -1)*(A) +A
    if B <= sasikomiguti_misiyou-1:
        print(tapp_num)
    else:
        print(tapp_num +1)

Submission status: Wrong Answer

Solution code:
# 初期入力
A,B = (int(x) for x in input().split())

#
import math
tapp_num = math.ceil( (B-1)//(A-1) )
print(tapp_num)

Submission status: Wrong Answer

Solution code:
# 初期入力
A,B = (int(x) for x in input().split())

#
import math
tapp_num = ((B-1)//(A-1))
sasikomiguti_misiyou=0
if B<=A:
    print(1)
else:        
    sasikomiguti_misiyou =(tapp_num -1)*(A) +A
    if B <= sasikomiguti_misiyou:
        print(tapp_num)
    else:
        print(tapp_num +1)

Submission status: Wrong Answer

Solution code:
# 初期入力
A,B = (int(x) for x in input().split())

#
import math
tapp_num = (B//(A-1))
sasikomiguti_misiyou=0
if B<=A:
    print(1)
else:        
    sasikomiguti_misiyou =(tapp_num -1)*(A) +A-1
    if B <= sasikomiguti_misiyou:
        print(tapp_num)
    else:
        print(tapp_num +1)

Submission status: Wrong Answer

Solution code:
# 初期入力
A,B = (int(x) for x in input().split())

#
import math
tapp_num = (B//(A-1))
sasikomiguti_misiyou=0
if B<=A:
    print(1)
else:        
    sasikomiguti_misiyou =(tapp_num -1)*(A) +A
    if B <= sasikomiguti_misiyou:
        print(tapp_num)
    else:
        print(tapp_num +1)

Submission status: Wrong Answer

Solution code:
# 初期入力
A,B = (int(x) for x in input().split())

#
import math
tapp_num = (B//(A-1))
sasikomiguti_misiyou=0
if B<=A:
    print(1)
else:        
    sasikomiguti_misiyou =A +(tapp_num -1)*(A-1)
    if B <= sasikomiguti_misiyou:
        print(tapp_num)
    else:
        print(tapp_num +1)

Submission status: Wrong Answer

Solution code:
# 初期入力
A,B = (int(x) for x in input().split())

#
import math
tapp_num = (B//(A-1))
sasikomiguti_misiyou=0
if B<=A:
    print(tapp_num)
else:        
    sasikomiguti_misiyou =A +(tapp_num -1)*(A-1)
    if B <= sasikomiguti_misiyou:
        print(tapp_num)
    else:
        print(tapp_num +1)

Submission status: Wrong Answer

Solution code:
# 初期入力
A,B = (int(x) for x in input().split())

#
import math
tapp_num = (B//(A-1))
if tapp_num ==1:
    if B <=A:
        print(tapp_num)
else:        
    sasikomiguti_misiyou =A +(tapp_num -1)*(A-1)
    if B <= sasikomiguti_misiyou:
        print(tapp_num)
    else:
        print(tapp_num +1)

Submission status: Wrong Answer

Solution code:
# 初期入力
A,B = (int(x) for x in input().split())

#
import math
tapp_num = (B//(A-1))
sasikomiguti_misiyou =A +(tapp_num -1)*(A-1)
if B <= sasikomiguti_misiyou:
    print(tapp_num)
else:
    print(tapp_num +1)

Submission status: Wrong Answer

Solution code:
# 初期入力
A,B = (int(x) for x in input().split())

#
import math
tapp_num = (B//(A-1))
sasikomiguti_misiyou =A +(tapp_num -1)*(A-1)
if B <= sasikomiguti_misiyou:
    print(tapp_num)
elif B <= sasikomiguti_misiyou +1:
    print(tapp_num +1)
elif B <= sasikomiguti_misiyou +2:
    print(tapp_num +2)
elif B <= sasikomiguti_misiyou +3:
    print(tapp_num +3)

Submission status: Wrong Answer

Solution code:
# 初期入力
A,B = (int(x) for x in input().split())

#
import math
tapp_num = math.ceil(B/A)
sasikomiguti_misiyou =A +(tapp_num -1)*(A-1)
if B <= sasikomiguti_misiyou:
    print(tapp_num)
else:
    print(tapp_num +1)

Submission status: Wrong Answer

Solution code:
# 初期入力
A,B = (int(x) for x in input().split())

#
import math
tapp_num = math.ceil(B/A)
sasikomiguti_misiyou =tapp_num *A +(B -tapp_num)
if B <= sasikomiguti_misiyou:
    print(tapp_num)
else:
    print(tapp_num +1)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

A, B = [int(s) for s in input().split()]
if B == 1:
    print(0)

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

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

print(tap)

Submission status: Wrong Answer

Solution code:
a,b = list(map(int,input().split()))
l = []
for i in range(1,20):
    l.append(i)
if a==b:
    print(b//a)
elif a>b:
    print(b)
elif b>a:
    x = [j for j in l if a*j<b]
    print(max(x)+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a, b = list(map(int, input().split(' ')))
hoge = 1
if b == 1:
    print(0)
else:
    ct = 0
    while hoge < b:
        hoge += a - 1
        ct += 1
        print(hoge)
    print(ct)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

A, B = [int(s) for s in input().split()]
if A >= B:
    print(1)
    sys.exit()

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

print(tap)

Submission status: Wrong Answer

Solution code:
a, b = list(map(int, input().split(' ')))
hoge = 1
if b == 1:
    print(0)
else:
    hoge = 0
    while hoge < b:
        hoge += a
    print(hoge // a)

Submission status: Wrong Answer

Solution code:
a,b = list(map(int,input().split()))
if a<b and b%2!=0:
    a=((b//a)+1)
    print(a)
if a<b and b%2==0:
    a=((b//a))
    print(a)
elif a>b:
    print(b)
elif a ==b:
    print(b//a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
a, b=map(int, input().split())
t=1
k=a
while 1:
    if k>=b:
        print(t)
        sys.exit(0)
    t+=1
    k=(a-(t-1))+(t-1)*a

Submission status: Wrong Answer

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

while (a-(t-1))+(t-1)*a<b:
    t+=1

print(t)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

while 1:
    if (a-(t-1))+(t-1)*a>=b:
        break
    t+=1

print(t)

Submission status: Wrong Answer

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

while 1:
    if (a-(t-1))+(t-1)*a>=b:
        print(t)
        exit()
    t+=1

Submission status: Wrong Answer

Solution code:
a, b=map(int, input().split())
t=1
k=a
while 1:
    if k>=b:
        print(t)
        exit()
    t+=1
    k=(a-(t-1))+(t-1)*a

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:
import sys
A,B = map(int,input().split())
plug = 1
socket = 0
while True:
  plug += A
  socket += 1
  plug -= 1
  if plug >= B:
    print(socket)
    sys.exit(0)

Submission status: Wrong Answer

Solution code:
import sys
A,B = map(int,input().split())
plug = 1
socket = 0
while True:
  plug += A
  socket += 1
  if plug >= B:
    print(socket)
    sys.exit(0)

Submission status: Wrong Answer

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