TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: 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.

Submission attempts (in order):
import sys
sys.setrecursionlimit(100000000000)

a,b=map(int,input().split()[:2])

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

import sys
sys.setrecursionlimit(1000000000)

a,b=map(int,input().split()[:2])

i=0
while True:

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

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
m, n = input().split()
m, n = int(m), int(n)
 
tot = 0
a = 1
while a<n:
  a-=1
  a+=m
  tot+=1
 
print(c)

m, n = input().split()
m, n = int(m), int(n)
 
tot = 0
a = 1
while a<n:
  a-=1
  a+=m
  tot+=1
 
print(tot)

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
# coding: utf-8
# Your code here!

a,b = input().split()
a = int(a)
b = int(b)
ngo = 1
ans = 0
while ngo < b:
    ngo += a-1
    ans + =1
print(ans)

# coding: utf-8
# Your code here!

a,b = input().split()
a = int(a)
b = int(b)
ngo = 1
ans = 0
while ngo < b:
    ngo += a-1
    ans += 1
print(ans)

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
A=list(map(int,input().split()))
count=0
max(1,A[1]//A[0] + (A[1]%A[0]!=0))

A=list(map(int,input().split()))
count=0
A[1]=A[1]-1
A[0]=A[0]-1
print(A[1]//A[0] + (A[1]%A[0]!=0))

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
a,b=map(int,input().split())
ans,num=0,1:
while num<b:
    num-=1
    num+=a
    ans+=1
print(ans)

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

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
A,B=map(int,input().split())

s=0

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


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

s=0

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
l = list(map(int,input().split()))
a = l[0]
b = l[1]
if b == 1:
    print(0)
else:
    print((b-1//(a-1))+1)



l = list(map(int,input().sprit()))
a = l[0]
b = l[1]
if b == 1:
    print(0)
else:
    print((b-1//a)+1)


l = list(map(int,input().sprit()))
a = l[0]
b = l[1]
if b == 1:
    print(0)
else:
    print((b+1) // a+1)

l = list(map(int,input().split()))
a = l[0]
b = l[1]
if b == 1:
    print(0)
else:
    print((b-1//a)+1)


l = list(map(int,input().split()))
a = l[0]
b = l[1]
if b == 1:
    print(0)
else:
    if (b-1)%(a-1) == 0:
        print((b-1)//(a-1))
    else:
        print((b-1)//(a-1)+1)

Verdicts: Wrong Answer

Runtime Error

Runtime Error

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
import math
A, B = map(int, input().split())
print(math.ceil((B+1)/(A-1)))

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

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

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
import sys

input = sys.stdin.readline

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

if __name__ == '__main__':
    main()

import sys

input = sys.stdin.readline

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

if __name__ == '__main__':
    main()

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
A, B = map(int, input().split())
flag = 1
ana = 0
a = [1]*A
print(a)
for i in range(100):
    if sum(a) >= B:
        print(flag)
        break
    a.append(A)
    a[i] -= 1
    flag += 1

A, B = map(int, input().split())
outlet = 1
flag = 0
while outlet < B:
    outlet -= 1
    outlet += A
    flag += 1
print(flag)

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
a,b = map(int, input().split())
ans =0

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

a,b = map(int, input().split())
tap =1
total =0
while total <b:
  total =a+1
  tap +=1
print(tap)

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

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
a, b = map(int, input().split())

count = 1

kuchi = a

while True :
    if kuchi >= b :
        break
    kuchi = kuchi + a - 2
    count +=1
    
print(count)

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

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

    kuchi = a

    while kuchi < b :
        count+=1

        kuchi = (a - 1) * count + 1
    else :
        print(count)

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
a, b = map(int, input().sprit(" "))

count = 0
n = 1
while True:
  if n >= b:
    break
  n += a -1
  count += 1
  
print(count)
  

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

count = 0
n = 1
while True:
  if n >= b:
    break
  n += a - 1
  count += 1
  
print(count)
  

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
a, b= map(int, input().split())
s = 0
while a <= b:
    s += 1
    if a == b:
        break;
    elif s > 1:
        a = 2*a + 1
        print(a)
print(s)

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
A,B=map(int,input().split())
sum=A
cnt=1
while sum<=B:
    sum+=A-1
    cnt+=1
print(cnt)


A,B=map(int,input().split())
sum=1
cnt=0
while True:
    if sum>=B:
      break
    sum+=A-1
    cnt+=1
print(cnt)


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
import math
a,b = map(int,input().split())
if a == b:
  print(int(math.log(b,a)))
else:
  print(int(math.log(b,a)) + 1)


import math
a,b = map(int,input().split())
i = 0
while i < math.log(b,a):
  i += 1
print(i)


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


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
A, B = map(int, input().split())
tap = 1
for i in range(10):
  if tap+(A-1)*i >= B:
    print(i)
    break
  tap = tap + A - 1

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
A, B = map(int, input().split())

if(B==1):
	print(0)
elif(A>=B):
	print(1)
else:
	print((A//B)+1)

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

if(B==1):
	print(0)

elif(A>=B):
	print(1)


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

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

if(B==1):
	print(0)

elif(A>=B):
	print(1)


else:
	print(A//B+1)

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

ans = 0
t = 1

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

print(ans)

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
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)
  

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

if B==1:
  print(0)
else:
  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)
  

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
a, b = map(int, input().split())
n = 1
e = a
if e >= b:
  print(n)
else:
  e += a-1
  n += 1


a, b = map(int, input().split())
n = 1
e = a
if b = 1:
  print(0)
  quit()
while n > 0:
  if e >= b:
    print(n)
    n = 0
  else:
    e += a-1
    n += 1

a, b = map(int, input().split())
n = 1
e = a
if b == 1:
  print(0)
  quit()
while n > 0:
  if e >= b:
    print(n)
    n = 0
  else:
    e += a-1
    n += 1

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
from math import ceil
A, B = map(int, input())
print(ceil(B/A))

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

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
from math import ceil

inputs = input()
a = int(inputs.split(" ")[0])
b = int(inputs.split(" ")[1])
print(ceil((b + 1) / (a - 1)))


inputs = input()
a, b = int(inputs.split(' '))
a * n - (n - 1) >= b
print(int((b + 1) / (a -1))


from math import ceil

inputs = input()
a = int(inputs.split(" ")[0])
b = int(inputs.split(" ")[1])
print(ceil((b - 1) / (a - 1)))


Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
import math

A = int(input())
B = int(input())

x = ((B-1) / (A-1))+0
print(math.ceil(x))


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

x = b//(a-1)

print(x)


import math

A = int(input())
B = int(input())

x = ((B-1) // (A-1))+1
print(math.ceil(x))


import math

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

x = (b)/(a-1)

print(math.ceil(x))

import math

A = int(input())
B = int(input())
if a >= 2 and B>= 1
    x = (B-1) / (A-1)

    print(math.ceil(x))

import math
 
a = int(input())
b = int(input())
print(math.ceil((b-1) / (a-1)))
 

import math

A = int(input())
B = int(input())
if a >= 2 and B>= 1:
    x = (B-1) / (A-1)

    print(math.ceil(x))


import math

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

x = (b-1) / (a-1)

print(math.ceil(x))



import math

A = int(input())
B = int(input())

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

print(math.ceil(x))


import math

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

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


Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
A, B = map(int, input().split())
 
cnt = 1
temp_A = A

for i in range(1, 30):
    if cnt * A - cnt > B :
        break
    else :
        cnt +=1

if B == 1:
    cnt = 0

print(cnt)

A, B = map(int, input().split())
 
cnt = 1
temp_A = A

for i in range(1, 30):
    if cnt * A - cnt + 1 >= B :
        break
    else :
        cnt +=1

if B == 1:
    cnt = 0

print(cnt)

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
import sys
args = []
for l in sys.stdin:
  args.append(int(l))

a = args[0]
b = args[1]

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

args = [int(input()) for in range(2)]

a = args[0]
b = args[1]

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

print(tap)

args = input().split()
a = int(args[0])
b = int(args[1])
 
tap = 0
socket = 1
while socket < b:
  socket -= 1
  tap += 1
  socket += a
  
print(tap)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
def solve(a,b):
  def needTaps(a,b,holes=1,res=0):
    if holes >= b:
      return res
    elif:
      return needTaps(a,b,holes+a-1,res+1)
    
  return needTaps(a,b)

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


def solve(a,b):
  def needTaps(a,b,holes=1,res=0):
    if holes >= b:
      return res
    else:
      return needTaps(a,b,holes+a-1,res+1)
    
  return needTaps(a,b)

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


Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
stdin = [int(x) for x in input().split()]
ans = 0
for ans in range(100):
    ans += 1
    if stdin[0] * (ans - 1) < stdin[1] < stdin[0] * ans:
        print(ans + 1)
        exit()
    elif stdin[0] == stdin[1]:
        print(1)
        exit()


stdin = [int(x) for x in input().split()]
division = stdin[1] // stdin[0]
if stdin[1] % stdin[0] == 0:
    print(division)
elif stdin[0] < stdin[1]:
    print(1)
else:
    print(division + 1)


from math import ceil
stdin = [int(x) for x in input().split()]
print(ceil(stdin[1] / (stdin[0] - 1)))


from math import ceil
stdin = [int(x) for x in input().split()]
print(ceil(stdin[1] / (stdin[0] - 1)))


stdin = [int(x) for x in input().split()]
entry = 1
adptr = 0
while entry < stdin[1]:
    entry -= 1
    entry += stdin[0]
    adptr += 1
print(adptr)


Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
a,b = map(int,input().split())
ans = 0
n = 1

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

a,b = map(int,input().split())
ans = 0
n = 1

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


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
x,y = map(int,input().split())

for i in range(x):
    ans = x-i+x*i
    #print(ans)
    if ans >= y:
        break
#print(ans)
print(i)

a,b  = map(int,input().split())
emp = 1
cnt = 0
while emp < b:
    #print("emp",emp)
    emp = emp-1+a
    #print("emp",emp,cnt)
    cnt += 1

    

print(cnt)

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):

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

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

if B == 1:
    print(0)
    exit()

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

count = 2
B -= (A-1)
while True:
    if A >= B:
        print(count)
        exit()

    count += 1
    B -= (A-2)



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

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

if B == 1:
    print(0)
    exit()

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

count = 2
B -= (A-1)
while True:
    if A >= B:
        print(count)
        exit()

    count += 1
    B -= (A-1)


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
a,b=map(int,input().split())
ans=1
i=0
while True:
  if ans>=B:
    print(i)
    exit()
  ans+=a-1
  i+=1

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

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
A,B = map(int,input().split())
outlet = 1
while outlet < B :
    outlet = outlet + A - 1
print(outlet)

A,B = map(int,input().split())
outlet = 1
cnt = 0
while outlet < B :
    outlet = outlet + A - 1
    cnt += 1
print(cnt)

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
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()

A,B = map(int, input().split())
ans=1
if B==1:
    print(0)
    exit()
if A>=B:
    print(1)
    exit()

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



Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
A, B = map(int, input().split())

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

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

count = 0
num_slot = 1 
while num_slot < B:
  num_slot += (A-1)
  count += 1
print(count) 
 

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
a=list(map(int,input().split()))

ans=1
c=a[:]
if a[1]==1:
    print(0)
    exit()
while c[0]<a[1]:
    c-=1
    c+=a[0]
    ans+=1
print(ans)

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

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

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
def main():
    a, b = map(int, input().split())
    num = 1
    ans = 0
    for i in range(1, 21):

        ans = a * i - (i-1)
        if ans > b:
            print(i)
            break
    
        


if __name__ == "__main__":
    main()


def main():
    a, b = map(int, input().split())
    num = 1
    ans = 0
    for i in range(2, 21):
        ans = a * i - (i-1)
        print(ans)
        if ans >= b:
            print(i)
            break
    
        


if __name__ == "__main__":
    main()


def main():
    a, b = map(int, input().split())
    outlet = 1
    ans = 0
    while outlet < b:
        outlet += a - 1
        ans += 1

    print(ans)
    
        


if __name__ == "__main__":
    main()


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
a,b = list(map(int, input().split()))
cnt = 1
if(a >= b):
  print(cnt)
  exit()
limit = 10**10
for i in range(1, limit):
  cnt += 1
  if((a + ((a-1) * i)) >= b):
    print(i, cnt)
    exit()

def test2(a, b):
  cnt = 1
  if(b == 1):
    return 0
  if(a >= b):
    return cnt
  limit = 10**10
  for i in range(1, limit):
    cnt += 1
    if((a + ((a-1) * i)) >= b):
      return cnt
a,b=map(int,input().split())
print(test2(a,b))

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
a=int(input())
b=int(input())
k=int(1)
z=0
while(k<b):
    z+=1
    k+=a-1

print(z)




(a,b)=map(int,input().split())
k=int(1)
z=0
while(k<b):
    z+=1
    k+=a-1

print(z)




Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
if __name__ =='__main__':
    a, b = list(map(int,input().split()))
    if b = 1:
        print(0)
    else :
        c = 1
        d = a
        while True:
            if d >= b:
                print(c)
                break
            else :
                d += a-1
                c+=1

if __name__ =='__main__':
    a, b = list(map(int,input().split()))
    if b == 1:
        print(0)
    else :
        c = 1
        d = a
        while True:
            if d >= b:
                print(c)
                break
            else :
                d += a-1
                c+=1

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
a,b = map(int,input().split())

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

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

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

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

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

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

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

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

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

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

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

a,b = map(int,input().split())
import math
#print(((b-1)//(a-1))+1)

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

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
a,b = map(int, input().split())

ans = 0
A  = 1
while A < b:
  ans += 1
  s += a - 1
print(ans)


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

ans = 0
A = 1
while A < b:
  ans += 1
  s += (a - 1)
print(ans)


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

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

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
A,B=map(int,input().split())
import math
print(math.ceil(B/(A-1)))

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
# coding: utf-8
A, B = map(int, input().split())
B = B-A
for i in range(20):
	if B<=0:
    	print(i+1)
    	break()
    B=B-A+1

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

B = B-A
for i in range(20):
	if B<=0:
    	print(i+1)
    	break()
    B=B-A+1

# coding: utf-8

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

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
a,b = list(map(int,input().split()))
i = 0
while a < b:
    a += a-1
    i += 1
print(i)

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
a,b=input().split()
c=(b-1)//a+1
print(c)

a,b=input.split
print((b+1)//a)

a,b=input().split()
print((b+1)//a)

a,b=input().split()
print((b-1)//a+1)

a,b=int(input().split())
print((b+1)//a)

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
a, b = map(int, input().split())
if (b == a ):
    print(1)
else:
    print((b-1)//(a-1)+1)



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



Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
a,b = [int(x) for x in input().split()]
n = 0
def extend(x,a,b,n):
  assert x>=1
  if x >= b:
    return n
  else:
    n += 1
    extended =  x - 1 + a
    return extend(extended, a, b, n)

a,b = [int(x) for x in input().split()]
def extend(x,a,b,n):
  assert x>=1
  if x >= b:
    return n
  else:
    n += 1
    extended =  x - 1 + a
    return extend(extended, a, b, n)
extend(1, a, b, 0)

a,b = [int(x) for x in input().split()]
def extend(x,a,b,n):
  assert x>=1
  if x >= b:
    return n
  else:
    n += 1
    extended =  x - 1 + a
    return extend(extended, a, b, n)
extend(1, a, b, 0)

a,b = [int(x) for x in input().split()]
def extend(x,a,b,n):
  assert x>=1
  if x >= b:
    return n
  else:
    n += 1
    extended =  x - 1 + a
    return extend(extended, a, b, n)
print(extend(1, a, b, 0))

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
import math
a, b = map(int, input().split())

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

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

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
a, b = map(int, input().split())
count=0
k = 1
while b<k:
  k=k+a-1
  count+=1
print(count)

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
S, T = input().split()
print(S + T -1) // S

a, b = list(map(int, input().split()))
s = a - 1
t = b-1
asn = (s + t -1) // s

n = list(map(int, input().split(' '))
print(-(-n[1] + 1) // (n[0] -1))
         

a, b = map(int, input().split())
s = a - 1
t = b-1
asn = (s + t -1) // s

a, b = int(input().split())
s = a - 1
t = b-1
asn = (s + t -1) // s

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

Verdicts: Runtime Error

Wrong Answer

Runtime Error

Wrong Answer

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
b, c = map(int, input().split())
     
a = c / b
print(a)

a,b=map(int, input().split())
c = (b-1) / (a-1)

if (b-1) % (a-1) > 0 :
   c = c+1
print(c)

a,b=map(int, input().split())
c = (b-1) / (a-1)

if( (b-1) % (a-1) > 0:
   c = c+1
print(c)


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

a = c // b
print(a)

a,b=map(int, input().split())
c = (b-1) // (a-1)

if (b-1) % (a-1) > 0 :
   c = c+1
print(c)

Verdicts: Wrong Answer

Wrong Answer

Runtime Error

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
A,B = map(int, input().split())
for x in range(20):
  s = (A-1)*(x-1)+A
  if B <= s:
    print(x)
	break

A, B = map(int, input().split())
for x in range(20):
  s = (A-1)*(x-1) + A
  if B<=s:
    print(x)
    exit()

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
A, B = map(int, input().split())
c = 1
ans = 0
while c<B:
  c += (A-1)
  ans += 1
print(1)

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
A,B=map(int,input().split())
if B==1:
    print(0)
else:
    if (B-1)%(A-1)==1:
        print(B//(A-1))
    else:
        print((B-1)//(A-1)+1)


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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
a,b=map(int,input().split())
if a>b or a==b:print(1)
  elif a<b and b%a==0:print(b//a)
    elif a<b and b%a!=0:print((b//a)+1)
      else:print(0)

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

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

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
import sys

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

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

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

import sys

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

if(B==1):
    print('0')
    sys.exit()

while True:
    if(A+(A-1)*x>=B):
        print(x+1)
        sys.exit()
    x+=1

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
import math
a, b = map(int, input().split())

if b = 1:
  ans = 0
else:
  ans = math.ceil((b - 1) / (a - 1))

print(ans)


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

if b == 1:
  ans = 0
else:
  ans = math.ceil((b - 1) / (a - 1))

print(ans)


Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
import math
A,B = map(int,input().split())

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

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

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
#B Power Socket
import math
a,b=map(int,input().split())
print(math.ceil(b+1/a))

#B Power Socket
import math
a,b=map(int,input().split())
print(math.ceil(b/(a+1)))

#B Power Socket
import math
a,b=map(int,input().split())
out=1
ans=0
while out<b:
    out-=1
    out+=a
    ans+=1
print(ans)

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
a,b = map(int, input.split())

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

print(ans)

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

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

print(ans)


Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
import math
print(math.ceil((B-1)/A))

A,B=input().split()
import math
print(math.ceil(B-1)/A)

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

A,B=input().split()
import math
math.ceil((int(B)-1)/int(A))

A,B=input().split()
import math
math.ceil((int(B)-1)/(int(A)-1))


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

A,B=input().split()
import math
print(math.ceil((B-1)/A))


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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Wrong Answer

Wrong Answer

Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
a, b = map(int, input().split())
print((a+b-2)//(a-1))

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

else:
  print(int(c)+1)

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

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
a, b = (int(x) for x in input().split())
print(int((b-1) / (a-1))
  
  

a, b = (int(x) for x in input().split())
print(int((b-1) / (a-1)) + (1 if (b-1) % (a-1) != 0 else 0))

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
a, b = map(int, input().split())

ans = a
cnt = 1
for i in range(50):
    if ans > b:
        print(cnt)
        exit()
    ans += a -1
    cnt += 1


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

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

ans = a
cnt = 1
for i in range(50):
    if ans >= b:
        print(cnt)
        exit()
    ans += a -1
    cnt += 1


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
# coding: utf-8
a, b = map(int, input().split())
ans = 0
sum = 1
print(ans)
while sum <= b:
    sum = sum + a - 1
    ans = ans + 1
print(ans)

# coding: utf-8
a, b = map(int, input().split())
ans = 0
sum = 1
while sum < b:
    sum = sum + a - 1
    ans = ans + 1
print(ans)


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):

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

while(a <= b):
    cnt += 1
    a += a

print(cnt)


a, b = map(int, input().split())
cnt = 0
power = 1

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

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

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

print(cnt)

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
A,B = map(int,input().split())
n = 0
if A >= B:
    print(1)
else:
    while A+(A-1)*(n-1) <= B:
        n += 1
    print(n)


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


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
A B = map(int(input()))

num = B / A

if B == 0:
  print(int(0))
elif B % A == 0:
  print(int(num))
else:
  print(int(num + 1))

A, B = map(int, split())
num = B / A

if B == 0 or B == 1:
  print(int(0))
elif B % A == 0:
  print(int(num))
else:
  print(int(num + 1))

A B = map(int(input()))

num = B / A
if B == 1:
  print("0")
else if B % A == 0:
  print(int(num))
else:
  print(int(num + 1))

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

num = B / A

if B == 0:
  print(int(0))
elif B % A == 0:
  print(int(num))
else:
  print(int(num + 1))

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

num = B / A

if B % A == 0:
  print(int(num))
else:
  print(int(num + 1))

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted