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):
a, b= map(int, input().split())
x = a
y = 1
if b == 1:
    print(0)
else:
    while x < b:
        y += 1
        x += y*(a-1)
        print(x)
    print(y)

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

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

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

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

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

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

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

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

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

a,b=map(int,input().split())
c=1
count=0
for i in range(20):
    if c>=b:
        break
    c+=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, B = map(int, input().split())

amari = (B-1)%(A-1)

if amari == 0:
    ans = (B-1)/(A-1)
else:
    ans = (B-1)//(A-1) + 1

print(ans)

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

amari = (B-1)%(A-1)

if amari == 0:
    ans = (B-1)/(A-1)
else:
    ans = (B-1)//(A-1) + 1

ans2 = int(ans)

print(ans2)

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())
num = 1
ans = 0
while num < B:
  num += (A-1)
  ans += 1

A,B = map(int,input().split())
num = 1
ans = 0
while num < B:
  num += (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):
import math

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

tap = 0

if b != 1:
    while ( (tap*(a-1) +1) < b:
        tap += 1

print(tap)


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

tap = 0

if b != 1:
    while ( (tap-1)*a+1) < b:
        tap += 1

print(tap)


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

tap = 0

if b != 1:
    while(tap*(a-1) +1) < b:
        tap += 1

print(tap)


Verdicts: 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):
s=list(map(int,input().split()))
a=0
if s[1]<=1:
  print(a)
else:
  while s[1]>0:
    a=a+1
    s[1]=s[1]-s[0]
    print(a)

s=list(map(int,input().split()))
a=0
if s[1]==1:
  print(a)
else:
  a=a+1
  if s[1]<=s[0]:
    print(a)
  else:
    s[1]=s[1]-s[0]
    while s[1]<0:
      s[1]=s[1]-s[0]+1
      a=a+1
    print(a)

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

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(s) for s in input().split()]
x=1
if B=1:
  print(0)
else:
  for i in range(100):
    x+=A-1
    if x>=B:
      break
  print(i+1)

A,B= [int(s) for s in input().split()]
i=0
while(True):
  if B<=1:
    break
  B-=A-1
  i+=1
print(i)
  

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 A == B:
    print(1)
else:
    print(math.ceil(B/(A-1)))

import math

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

mytarget = (B-A)

print(1 + math.ceil(mytarget/(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()]
 
c=1
ans=0:
while True:
  if c>=b:
    break
  else:
    c+=a-1
    ans+=1
print(ans)

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

c=1
ans=0:
while True:
  if c>=b:
    break
  else:
    c+=a
    ans+=1

a,b=[int(x) for x in input().split()]
 
c=1
ans=0
while True:
  if c>=b:
    break
  else:
    c+=a
    ans+=1

a,b=[int(x) for x in input().split()]
 
c=1
ans=0
while True:
  if c>=b:
    break
  else:
    c+=a-1
    ans+=1
print(ans)

Verdicts: 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):
A,B=map(int,input().split())
M=A
a=0
for i in range(21):
    M+=A-1
    a+=1
    if M>=B:
     break
print(a)

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

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

A,B=map(int,input().split())
M=A
a=0
if B==1:
  print(0)
else:
  for i in range(19):
    M+=A-1
    a+=1
    if M>=B:
     break
  print(a)

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

x=int(input())
y=int(input())
print(int(y/x) if (y%x)==0 else int(y/x)+1)

A,B=map(int,input().split())
M=A
a=1
if B==1:
  print(0)
else:
  for i in range(19):
    if M>=B:
      print(a)
      break
    a+=1
    M+=A-1

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Time Limit Exceeded

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()))
count=0
for i in range(0,21):
    if a+(a-1)*(i-1)<= b:
        count=count+1
print(count)


a, b=list(map(int,input().split()))
count=0
for i in range(0,21):
    if a+(a-1)*(i-1)< b:
        count=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,b = [int(x) for x in input().split()]
res = 0
c = 1
while res <= b:
  c += a-1
  res += 1
print(res)

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

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

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

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):
i = list(map(int, input().split()))
A = i[0]
B = i[1]

count = 0
flag = True
if A == B:
    flag = False
    count +=1
else:
    count +=1
while flag:
    count +=1
    if (A-1) * count + A >= B:
        break

print(count)

i = list(map(int, input().split()))
A = i[0]
B = i[1]

count = 0
flag = True
if A == B:
    flag = False
    count +=1
else:
    count +=1
while flag:
    if (A-1) * count + A >= B:
        break
    count +=1

print(count)

i = list(map(int, input().split()))
A = i[0]
B = i[1]

count = 0
flag = True
if B <= 1:
    flag = False
elif A >= B:
    flag = False
    count +=1
else:
    count +=1
while flag:
    if (A-1) * count + A >= B:
        count +=1
        break
    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):
import sys
A,B = map(int, input().split())
akikuti =A
ans =1
if (akikuti >= B ):
    print(ans)

else:
    
    for i in range(1000):
        akikuti += A-1
        ans +=1
        if(akikuti >B):
            print(ans)
            sys.exit()
        else:
            continue
    

import sys
A,B = map(int, input().split())
akikuti =A
ans =1

if(B ==1):
    ans = 0
    print(ans)
elif (akikuti >= B ):
    print(ans)
    
else:
    
    for i in range(1000):
        akikuti += A-1
        ans +=1
        if(akikuti >=B):
            print(ans)
            sys.exit()
        else:
            continue
    

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 = str(input())
s = s.split(" ")
a = int(s[0])
b = int(s[1])

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


from sys import stdin
#a,b = [int(x) for x in stdin.readline().rstrip().split()]
"""
a,b = map(int,input().split())
s = input()
s = s.split(" ")
a = int(s[0])
b = int(s[1])
"""
s = list(map(int,input().split()))
a = int(s[0])
b = int(s[1])

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


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

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

from sys import stdin
#a,b = [int(x) for x in stdin.readline().rstrip().split()]
"""
a,b = map(int,input().split())
s = input()
s = s.split(" ")
a = int(s[0])
b = int(s[1])
"""
s = list(map(int,input().split()))
a = int(s[0])
b = int(s[1])

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


a,b = map(int,input().split())
"""
s = input()
s = s.split(" ")
a = int(s[0])
b = int(s[1])
"""

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


from sys import stdin
a,b = [int(x) for x in stdin.readline().rstrip().split()]
"""
a,b = map(int,input().split())
s = input()
s = s.split(" ")
a = int(s[0])
b = int(s[1])
"""

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


s = list(map(int,input().split()))
a = int(s[0])
b = int(s[1])

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


Verdicts: Runtime Error

Wrong Answer

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())
n=0
while n*a-n+1>=b:
  n+=1
print(n-1)

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

import math
a,b=map(int,input().split())
print(math.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 copy

def j(n):
    if n:print("yes")
    else:print("no")
    exit(0)
rem = 10 ** 9 + 7

"""
def ct(x,y):
    if (x>y):print("+")
    elif (x<y): print("-")
    else: print("?")
"""

def ip():
    return int(input())
def iprow():
    return [int(i) for i in input().split()]
def ips():
    return (int(i) for i in input().split())
def ipmultiplerow(n):
    a = []
    for i in range(n):
        a.append(ip())
    return a
def printrow(a):
    for i in a:
        print(i)

a,b = ips()
b-=1
n = 1
n+=b//(a-1)
print(n)

import copy

def j(n):
    if n:print("yes")
    else:print("no")
    exit(0)
rem = 10 ** 9 + 7

"""
def ct(x,y):
    if (x>y):print("+")
    elif (x<y): print("-")
    else: print("?")
"""

def ip():
    return int(input())
def iprow():
    return [int(i) for i in input().split()]
def ips():
    return (int(i) for i in input().split())
def ipmultiplerow(n):
    a = []
    for i in range(n):
        a.append(ip())
    return a
def printrow(a):
    for i in a:
        print(i)

a,b = ips()
s = 1
n=0
while s<b:
    s+=(a-1)
    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().split())
if b == 1:
    print(0)
else:
    x = b - a
    y = 1
    while x>0:
        x -= a-1
        y += 1
        print(y)


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


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):
g = a - 1
d, r = divmod(b - 1, g)
if r == 0:
    print(d)
else:
    print(d + 1)

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

g = a - 1
d, r = divmod(b - 1, g)
if r == 0:
    print(d)
else:
    print(d + 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(input().split())
print(math.ceil(((b-1)/(a-1))))

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

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

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

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

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

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

if A == B:
    print('1')
    
elif B == 1:
    print('0')
    
else:
    AAA = 1
    
    while B > AAA:
        AAA = AAA + A - 1
        
    print(C)

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

if A == B:
    print('1')
    
elif B == 1:
    print('0')
    
else:
    C = 1
    AAA = 0
    
    while B > AAA:
        AAA = AAA + A - C
        C += 1
        
    print(C)

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

if A == B:
    print('1')
    
elif B == 1:
    print('0')
    
else:
    AAA = 1
    C = 0
    
    while B > AAA:
        AAA = AAA + A - 1
        C += 1
        
    print(C)

Verdicts: 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 = [int(i) for i in input().split()]
c = 1
count = 0
while b >= c:
  count += 1
  c += (a-1)
print(count)

a, b = [int(i) for i in input().split()]
c = 1
count = 0
while b > c:
  count += 1
  c += (a - 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,b=map(int,input().split())

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

print(count)

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

result=1
count=0
while result < b:
    result += 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())

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

q, mod = divmod(a,b)
if (a >= b):
  print("1")
elif (a < b and mod == 0):
  print(q)
elif (a < b and mod != 0):
  print(q+1)
else:
  pass





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

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

print(j)




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

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

print(j)


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 = int(input())
b = int(input())
sum = 1
result = 0
while sum < b:
     sum = sum -1 + a
     result += 1

print(result)

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

print(result)

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

a, b = map(int, input().split())
if (a == b):
    print(1)
elif ((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):
import math
a,b = map(int,input().split())
ans = 1
if b>a:
  ans = int(math.log(b,a))
  if b%a!=0:
    ans+=1
print(ans)

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

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

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

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

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

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

a = []
a.append(b[0])
for i in range(n-2):
    a.append(min(b[i], b[i+1]))
a.append(b[n-2])
print(sum(a))

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

ac = 1
ans = 0
while ac < b:
    ans += 1
    ac += 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):
i = [input() for i in range(2)]
a = [i for i in i[0]]
b = [i for i in i[1]]
c = 0
for i in range(3):
  if a[i] == b[i]:
    c += 1
  else:
    c += 0
print(c)

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

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

Verdicts: 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



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

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

import math



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

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

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

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


while A < B:
    A += A
    count += 1
    if A > B:
        break

print(count)

A = int(input())
B = int(input())
count = 1

while A < B:
    A += A
    count += 1
    if A > B:
        break

print(count)


A = input()
B = input()
count = 1

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


print(count)


A = input().split()
count = 1
a = int(A[0])
b = int(A[1])
c = a
while a < b:
    a += c - 1
    count += 1
    print(a)
    if a >= b:
        break

print(count)


A = input().split()
count = 1
a = int(A[0])
b = int(A[1])
c = a

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


Verdicts: Runtime Error

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):
m,n=map(int,input().split())
x=(n-1)/(m-1)
if x%1==0:
    print(x)
else:
    print(int(x)+1)

m,n=map(int,input().split())
x=(n-1)/(m-1)
if x%1==0:
    print(int(x))
else:
    print(int(x)+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):
import math
a, b = map(int, input().split())
if b != 1:
    if b> a:
        print(math.ceil((b-a)/(a-1)))
    else:
        print(math.ceil(b/a))
else:
    print(0)

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

import math
a, b = map(int, input().split())
if b != 1:
    if b> a:
        print(math.ceil((b-a)/(a-1)+1))
    else:
        print(math.ceil(b/a))
else:
    print(0)

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):
# B - Power Socket

a = int(input())
b = int(input())
div = b // (a - 1)
mod = b % (a - 1)

print(1 if a == b else (div + 1 if mod > 1 else div))

# B - Power Socket

a, b = list(map(int, input().split()))
tgt = b - a

if tgt == 0:
    print(1)
else:
    div = tgt // (a - 1)
    mod = tgt % (a - 1)
    print(div + 2 if mod > 0 else div + 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())
for i in range(21):
  if b<=1+(i-1)*a:
    print(i)
    break

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


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
 while ( n < (b-1)/(a-1) ):
  n = n + 1

print(n)

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

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


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 = int(input())
b = int(input())
ans = b // a

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

a = int(input())
b = int(input())
strip = b // a
emp = b % a
ans = strip + (strip // emp)
print(ans)

a, b = map(int, input().split())
min_ans = b // a
mod_ans = b % a

if ((min_ans - mod_ans) > 0) :
  print(min_ans)
else : 
  print(mins_ans + 1)

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

ans = (a + b - 3) // (a - 1)
print(ans)

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 numpy as np

a,b = input().split()
a = int(a)
b = int(b)
num_plug = a
num_tap = int(0)

while 1:
  if num_plug >= b:
    print(num_tap)
    exit()
  num_plug += (a-1)
  num_tap += 1

import numpy as np

a,b = input().split()
a = int(a)
b = int(b)
num_tap = int(0)

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

if ((b-a)%(a-1))==0:
  print(num_tap+1)
else:
  print(num_tap+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())
if a <= b:
    print(1)
else:
    for i in range(20):
        if (a * i - 1) >= b:
            break
    print(i)

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

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

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

X = A
count = 1

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

print(count)


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

X = A
count = 1

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

print(count)


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

X = A
count = 1
if B > 1:
    while X < B:
        X = X + (A-1)
        count += 1

    print(count)

else:
    print(0)


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):
MM = input().split()
A = int(MM[0])
B = int(MM[1])
total = 1
count = 0
while total >= B:
  total += A-1
  count += 1
print(count)


MM = input().split()
A = int(MM[0])
B = int(MM[1])
total = 1
count = 0
while total < B:
  total += 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,b = map(int, input().split())
print((b + a - 2) // (a - 1))

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

a,b = map(int, input().split())
print((b + a - 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(i) for i in input().split()]

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


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

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


a,b = [int(i) for i in input().split()]
lim=0
for B in range(1,21):

    if B==1 and a>=2:
        lim=B*a
    elif B>1 and a>=2:
        lim+=(B-1)*(a-1)+a

    if lim>=b:
        break
print(B)


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

for B in range(1,21):
    print(B)
    if B==1 and a>=2:
        lim=B*a
    elif B>1 and a>=2:
        lim=(B-1)*(a-1)+a

    if lim>=b:
        break
print(B)


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

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


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

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

print(cnt)

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

cnt = 0
while A + (A-1)*(cnt-1) < B:
    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):
a,b = map(int, input())

b - 1 = x * (a - 1)

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

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

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

t = 0
c = 1
while t<=B:
    t = A+(A-1)
    c+=1
    
print(c)

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

t = A
c = 0
while True:
    if t<=B:
        t += (A-1)
        c+=1
    else:
        break

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

t = 1
c = 0
while True:
    if t<B:
        t = (t-1)+A
        c += 1
    else:
        break

print(c)

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(1 + max(0, b - 1) // (a - 1))

a, b = [int(x) for x in input().split()]
print(1 + max(0, b - 1) % (a - 1))


a, b = [int(x) for x in input().split()]
if b == 1:
	print(0)
else:
	i    = 1
	while a * i - (i - 1) < b:
		i += 1
	print(i)


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



def main(A, B):
    # A + N*(A-1)
    outlet = 1
    i = 0

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

    print(i)


if __name__ == "__main__":
    A, B = map(int, input().split(' '))
    print(main(A, B))


def main(A, B):
    outlet = 1
    i = 0

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

    print(i)


if __name__ == "__main__":
    A, B = map(int, input().split())

    main(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,b = list(map(int, input().split()))
x,y = divmod(a,b)
print(x+y)

import math
a,b = list(map(int, input().split()))
ans = 1
b -= a
ans += math.ceil(b / (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())
print(int((a-1)/(b-1)+0.5))

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


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


Verdicts: 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())
c = 0
i = 0
while True:
  i += 1
  if i ==0:
    c += a
  if i > 0:
    c += a-1
  if c >= b:
    print(i)
    exit()


a, b = map(int, input())
x = 0
outlet = 1
while outlet < b:
  --outlet
  outlet += a
  x+=1
print(x)

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


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

def main():
    A,B = map(int, input().split())
    cnt = 1

    while B > (A-1) * cnt +1:
        cnt += cnt 

    print(cnt)


if __name__ == '__main__':
    main()



def main():
    A,B = map(int, input().split())
    cnt = 1

    while B > (A-1) * cnt:
        cnt += cnt 

    print(cnt)


if __name__ == '__main__':
    main()



def main():
    A,B = map(int, input().split())
    aki = 1
    cnt = 0

    while aki > B:
        aki -=1
        aki += A
        cnt += 1

    print(cnt)


if __name__ == '__main__':
    main()



def main():
    A,B = map(int, input().split())
    aki = 1
    cnt = 0

    while aki < B:
        aki -=1
        aki += A
        cnt += 1

    print(cnt)


if __name__ == '__main__':
    main()


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):
A = int(input())
B = int(input())
k, l = 0, 0

while l < B:
  k += 1
  if k == 0:
    l += A
  else:
    l += A - 1
  
print(k)

A, B = map(int, input().split())
k, l = 0, 0
if B != 1:
  while l < B:
    if k == 0:
      l += A
    else:
      l += A - 1
    k += 1
  print(k)
elif B == 1:
  print(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())
if A >= B:
    print(1)
    exit()
ret = 1
N = A - 1
while True:
    if N >= B:
        print(ret)
        exit()
    ret += 1
    N += (A - 1)

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

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())
outlet = 1
ans = 0
while outlet < B:
  outlet -= 1
  outlet += a
  ans += 1
  
print(ans)

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


a,b = map(int,input().split())
outlet = 1
ans = 0
while outlet < b:
  outlet -= 1
  outlet += a
  ans += 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())

for i in range(100):
  C = A*i - i
  if C >= B:
    break
print(i)



a = [int(i) for i in input().split()]
ans=0
num=0
while True:
  	if a[1]==1:
      break
    if (a[0]-1)*num+a[0] >= a[1]:
        ans = num+1
        break
    num += 1
print(ans)


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

for i in range 100:
  C = A*i - i
  if C >= B:
    break
print(i)



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

for i in range(100):
  C = A*i - (i-1)
  if C >= B:
    break
print(i)


Verdicts: 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):
import math

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

X = B / A

print(math.ceil(X))

import math

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

X = B / A
XX = B // A

if XX == 0:
    print(X)
else:
    print(math.ceil(X))

A, B = map(int, input().split())
 
X = ((B-2) // (A-1)) + 1

print(X)

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

a, b = list(map(int, input().split()))
number = 1
outlet_number = a
while outlet_number <= b:
    outlet_number += a - 1
    number += 1
print(number)

a, b = list(map(int, input().split()))
count = int((a+ b - 3)/(a - 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())

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

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

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

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

num = 0
ind = 0
while num < B:
  num += A
  ind += 1
  print(num,ind)
  
  
print(ind)

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

num = 1
ind = 0
while num < B:
  num += A
  num -= 1
  
  ind += 1
print(ind)


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


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

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

Verdicts: Wrong Answer

Accepted