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())
n=(B-1)/(A-1)

if n==int(n): 
    output=n
else :
    output=int(n)+1


print(output)

A,B=map(int,input().split())
n=(B-1)/(A-1)
if n>=1:
    if n==int(n):
        output=n
    else :
        output=int(n)+1       
elif n<1 and n>0:
    output=1
else:
    output=0
print(output)   


A,B=map(int,input().split())
#
#B<=n*(A-1)+1
n=(B-1)/(A-1)

if n>=1:
    if n==int(n):
        output=n
    else :
       output=int(n)+1
else :pass

print(output)   

A,B=map(int,input().split())
n=(B-1)/(A-1)

if n>=1:
    if n==int(n):
        output=n
    else :
       output=int(n)+1
else :pass

print(output)   

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

A,B=map(int,input().split())
n=(B-1)/(A-1)
if n>=1:
    if n==int(n):
        output=int(n)
    else :
        output=int(n)+1
elif n<1 and n>0:
    output=1
else:
    output=0
print(output)   


Verdicts: Wrong Answer

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

ans = 1
c = a
while True:
  if c < b:
    c = c -1 + a
    ans = ans + 1
  else:
    print(ans)


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

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


Verdicts: Time Limit Exceeded

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:
    print(0)
n = 0
x = 1
while(1):
    if x >= B:
        print(n - 1)
        break
    else:
        x += A - 1
        n += 1


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

if B == 1:
    print(0)
n = 0
x = 1
while(1):
    if x >= B:
        print(n + 1)
        break
    else:
        x += A - 1
        n += 1


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

values = [float(s) for s in input().split(" ")] # 0 is min price, 1 increment, 2 is max price, 3 is decrement
if values[0] >=values[1]:
    print(1)
else:
    math.ceil(values[1]/(values[0]-1))

"""
sockets = values[0]
bars = 1
while sockets < values[1]:
    sockets +=values[0] - 1
    bars +=1
print(bars)
"""


A = int(input())
B = int(input())
socket = 0
count = 0
while socket < B :
    if socket + A < B :
        socket = socket + A - 1
        count += 1
    elif socket+A >= B :
        socket = socket + A
        count += 1
print(count)


def calulate(m, n) : 
	n_adapters = n//m
	if n > m :
		n_adapters += 1
	print(n_adapters)

def calulate(m, n) : 
	n_adapters = 0
	if n <= m :
		n_adapters = 1
	else :
		n_adapters = n//m
		if n % m != 0:
			n_adapters += 1
	return n_adapters

M, N = map(int, input().split())

calculate(M, N)

A = int(input())
B = int(input())
socket = A - 1
count=1
while (socket) < B :
    if (socket+A) < B :
        socket = socket + A - 1
        count+=1
    elif (socket+A) >= B :
        socket=socket+A
        count+=1
print(count)


import math
S = input()
A = int(S[0])
B = int(S[1:])
n = math.ceil(B/A)
print(n, " power strips, each with", A , "sockets, extend the socket into", A*n, "empty sockets.")

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

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

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

Verdicts: Wrong Answer

Runtime Error

Wrong Answer

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 math

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

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



a, b = list(map(int, input().split()))
tap, free = 0, 1

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

print(tap)


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("")
a, b = a.split()
a, b = int(a), int(b)
c, d = 0, 0
while d < b:
    if a == 0:
        break
    c += 1
    d = a * c - c
print(c)

a = input("")
a, b = a.split()
a, b = int(a), int(b)
c, d = 0, 0
while d < b:
    if a == 0:
        break
    c += 1
    d = a * c - (c - 1)
if b == 1:
  c = 0
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 = int(input())
B = int(input())

count = 0

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

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

ans = 0
outlet = 1

while b > outlet:
    ans = ans + 1
    outlet = outlet + (a-1)
print(ans)

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

ans = 0
outlet = 1

while B > outlet:
    ans = ans + 1
    outlet = outlet + (A-1)
print(ans)

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

total = 1
count = 0

while B > total:
    count = count + 1
    total = total -1 + A

print(count)

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

ans = 0
outlet = 1

while b > outlet:
    ans = ans + 1
    outlet = outlet + (a-1)
print(ans)

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

num = 1

taps = 0

while num < B:
  num -= 1
  num += A
  taps += 1

print(taps)

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

num = 1

taps = 0

while num < B:
  num -= 1
  num += A
  taps += 1

print(taps)

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 sys
a, b = map(int, sys.stdin.readline().split())
print(-((a-b) // (a-1)))

import sys
a, b = map(int, sys.stdin.readline().split())
print(-((a-b) // (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())
out = 1 
ans = 0
while out < B:
  out += A
  ans ++
print(ans)

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

A, B = map(int,input().split())
out = 1 
ans = 0

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

print(ans)

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())
ans = 0
white True:
  if ans * (a - 1) + 1 >= b:
    break
print(ans)

a, b = map(int, input().split())
ans = 0
white True:
  if ans * (a - 1) + 1 >= b:
    break
  ans += 1
print(ans)


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

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

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

a,b = map(int, input().split())
av = num =  a
n = 1
if num < b:
  n+=1
  num = num+av-1
elif num > b:
  pass
print(n)

import math

a,b = map(int, input().split())
av = num =  a
n = 1
if num < b:
  n+=1
  num = num*2-1
print(n)

import math

a,b = map(int, input().split())
av = num =  a
n = 1
if num <= b:
  n+=1
  num = num+av-1
print(n)

import math

a,b = map(int, input().split())
av = num =  a
n = 1
while num <= b:
  #print(num)
  n+=1
  num = num+av-1
  #print(num)
print(n)

import math

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

import math

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

import math

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

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

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

print(q)

A, B = map(int, input().split())
q = (B＋A-3)//(A-1)
print(q)
  


A, B = map(int, input().split())
q = (B+A-3)//(A-1)
print(q)

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())
tap = a - 1
count = 0
while True:
  if a + tap * count < b:
    count += 1
  else:
    break
print(count)

, b = map(int, input().split())
tap = a - 1
count = 0
while True:
  if a == b:
    count = 1
    break
  elif a + tap * count < b:
    count += 1
  else:
    count += 1
    break
print(count)

a, b = map(int, input().split())
tap = a - 1
count = 1
while True:
  if b == 1:
    count = 0
    break
  elif a == b:
    break
  elif a + tap * (count - 1) < b:
    count += 1
  else:
    break
print(count)

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())
ans=a
aa=0
c=1

while ans<=b:
    ans+=a-1
    aa+=1
    c+=1
aa=0
ans=a


if a*2+(a-1)*(c-3)==b:
    print(c-1)
else:
    print(c)

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

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

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

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


if a*2+(a-1)*(c-3)==b:
    print(c-1)
else:
    print(c)

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

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

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

A,B = map(int, input().split())
print(min(i for i in range(10**6) if 1+(A-1)*i>=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):
A = list(map(int,input().split()))
print(((A[1]-A[0])/(A[0]-1))+1)

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

import math
A = list(map(int,input().split()))
print(math.ceil((A[1]-1)/(A[0]-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
stdin = sys.stdin
sys.setrecursionlimit(10**9)
 
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

a,b = na()

import math

print(math.floor((b-1)//a+0.9999999999999))

import sys
stdin = sys.stdin
sys.setrecursionlimit(10**9)
 
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

a,b = na()

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):
A_B = input()
A_B_list = A_B.split(" ")

A = int(A_B_list[0])
B = int(A_B_list[1])

socket = 1
result = 0

if A == 2:
    print(B-1)
else:
    result = (B // (A - 1)) + 1
    print(result)
    print((A-1) * (result-1) )
    if (A-1) * (result-1) + 1 == B:
        result -= 1
    
    print(result)


A_B = input()
A_B_list = A_B.split(" ")

A = int(A_B_list[0])
B = int(A_B_list[1])

socket = 1
result = 0


# if A == 2:
#     print(B-1)
# else:
#     result = (B // (A - 1)) + 1
#     if (A-1) * (result-1) + 1 == B:
#         result -= 1
# 
#     print(result)
    
while True:
    if socket >= B:
        print(result)
        break
    socket += (A-1)
    result += 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().spit())
i = a
c = 1
while i < b:
  i += a - 1
  c += 1
if b == 1:
  print(0)
else:
  print(c)

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

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

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

A,B=[int(s) for s in input().split(" ")]

Sum=1
Count=0
while Sum < B:
    Sum=Sum+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(-(-A//B))

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

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

print(cnt-1)

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

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

print(cnt-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 = map(int,input().split(" "))
c = 0
count = 0
while True:
  c += a
  if c >= b:
    print(count)
    exit()
  c -= 1

a,b = map(int,input().split(" "))
c = 0
count = 0
if b <= 1:
    print(count)
    exit()
while True:
  c += a
  count += 1
  if c >= b:
    print(count)
    exit()
  c -= 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(input())
x = (B-A)/(A-1)+1
print(x)

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

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

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


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

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

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

# a + (n - 1) * (a - 1) >= b
# n * (a - 1) + 1 >= b
# n >= (b - 1)/(a - 1)

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

if n == int(n):
  print(n)
elif n >= int(n):
  print(n + 1)


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

# a + (n - 1) * (a - 1) >= b
# n * (a - 1) + 1 >= b
# n >= (b - 1)/(a - 1)

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

if n == int(n):
  print(int(n))
elif n >= int(n):
  print(int(n) + 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())
i = 0

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

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

if B == 1:
    print(0)
elif A > B :
    print(1)
else:
    while (A-1) * i + 1 < B:
        i += 1
    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())
tap = 0
i = 0
while(tap <= B):
  if i == 0:
    tap += A
  else:
    tap += A-1
  i += 1
print(i)



A,B = map(int,input().split())
if A == B:
  print(1)
else:
  B = B - A
  print(B//(A-1)+1 if B%(A-1) == 0 else B//(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())
if a<b:
  for i in range(1,11):
    if i*a >= b:
      print(i)
if a==b:
  print(1)
    


a,b = map(int,input().split())
ans = 0
use = 1
while True:
  if use >= b:
    break
  else:  
    ans +=1
    use +=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):
import copy
A, B = list(map(int, input().split()))
C = copy.copy(A)
count = 1
while C <= B:
    C += A - 1
    count += 1
print(count)

import copy
A, B = list(map(int, input().split()))
C = copy.copy(A)
if B == 1:
    print(0)
    exit()
count = 1
while A < B:
    A += C - 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())
tap = 1
outlet = A

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

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

print(tap)
        



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:
  ans = 1
  while True:
    if ans * a - (ans-1) >= b:
   	  break
 	ans += 1
  print(ans)

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

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

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):
n=int(input())
*a,=map(int,input().split())
t_ans =0
for i in range(n):
	t_ans  += 1/a[i]
ans = 1/t_ans
print(ans)

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

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 pin(type=int):
    return map(type,input().rstrip().split())
from math import gcd
def resolve():
    A,B=pin()
    ans=0
    plug=1
    while(1):
        ans+=1
        plug=plug-1+A
        if plug>=B:
            print(ans)
            break


def pin(type=int):
    return map(type,input().rstrip().split())

def resolve():
    A,B=pin()
    ans=0
    plug=1
    while(1):
        if plug>=B:
            print(ans)
            break
        ans+=1
        plug=plug-1+A
        
resolve()

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
 
a,b=list(map(int,input().split()))
 
mouse_tot = a
mouse_cnt = 1
wa = a-1
 
while mouse_tot <  b:
    mouse_tot += wa
    mouse_cnt += 1

if mouse_tot == b:
    mouse_cnt -= 1 

print(mouse_cnt)

# coding: utf-8
 
a,b=list(map(int,input().split()))
 
mouse_tot = a
mouse_cnt = 1
wa = a-1
 
while True:
    if mouse_tot = b:
        break
    elif mouse_tot < b:
        mouse_tot += wa
        mouse_cnt += 1
 
print(mouse_cnt)

# coding: utf-8
 
a,b=list(map(int,input().split()))
 
mouse_tot = 1
mouse_cnt = 0
add_mouse = a-1
 
while mouse_tot <  b:
    mouse_tot += add_mouse
    mouse_cnt += 1
 
if b==0:
    mouse_cnt = 0
 
print(mouse_cnt)

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

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

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

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

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

print(B//A +1)

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

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

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

print(x)

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

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

a, b = [int(i) for i in input().split()]
print(min([num for num in range(1, 20) if (a - 1) * (num - 1) + a > b]))

a, b = [int(i) for i in input().split()]
print(min([num for num in range(0, 20) if (a - 1) * (num - 1) + a >= b]))

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):
input1 = input()
x = []
y=[]
check=0

for i in input1:
    if i!=" " and check==0:
        x.append(i)
    elif i==" ":
        check=1
    elif i!=" " and check==1:
        check==1
        y.append(i)
xstring=''.join(x)
ystring=''.join(y)

xint=int(xstring)
yint=int(ystring)

if yint==1:
    print(0)
else:
    cnt=0
    while ((xint-1)*(cnt))+xint<yint:
        cnt=cnt+1
    cnt=cnt+1
    5print(cnt)
    

    


m= int(input())
n= int(input())

print(round((n/m)+0.4))

x = int(input())
y = int(input())
temp=x


cnt=1
while x<y:
    cnt=cnt+1
    x=x+temp-1

print(cnt)
    


def calulate(m, n) : 
	n_adapters = n//m
	if n > m :
		n_adapters += 1
	return n_adapters

m=int(input())
n=int(input())
r=m
i=1
while r<n :
	r=r+m-1
	i+=1
print(i)


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


Verdicts: Runtime Error

Runtime Error

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



def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10000000)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate
    #from itertools import product
    from bisect import bisect_left,bisect_right
    import heapq
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

    # N = int(input())
    # H = list(map(int, input().split()))
    # a = 0
    # res = 0
    # while a < N-1:
    #     c = 0
    
    #         if H[i]-H[i+1] >= 0:
    #             c += 1
    #         else:
    #             break
    #     a += c + 1
    #     res = max(res, c)
    # print(res)

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



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

cnt = 0
tap = 1

if tap >= B:
    print(cnt)
    exit()

tap -= 1
cnt += 1

while True:
    tap += A
    cnt += 1
    if tap >= B:
        break
    else:
        tap -= 1

print(cnt)

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

cnt = 1
tap = 1

if tap >= B:
    print(cnt)
    exit()

while True:
    tap += A
    cnt += 1
    if tap >= B:
        break
    else:
        tap -= 1

print(cnt)

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

cnt = 0
tap = 1

if tap >= B:
    print(cnt)
    exit()

tap -= 1

while True:
    tap += A
    cnt += 1
    if tap >= B:
        break
    else:
        tap -= 1

print(cnt)

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

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


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

ans = 0

while b > 0:
	if b - ( a - 1 ) > a:
    	b -= a - 1
        ans += 1
    else:
        b -= a
        ans += 1

print(ans)

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

ans = 0
out = 1

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

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

A, B = map(int, input().split())
power = 1
count = 0
while(True):
		if power >= B:
				break
		count += 1
		power = A*count - (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):
s = input().split()
a = int(s[0])
b = int(s[1])
#print(a,b)
n = 1
x = a
if a >= b:
  print(n)
  exit()
while b >= x:
  n +=1
  x = a + (a-1)*(n-1)
print(n)  

s = input().split()
a = int(s[0])
b = int(s[1])
#print(a,b)
n = 1
x = a
if a <= b:
  print(n)
  exit()
while b > x:
  n +=1
  x = a + (a-1)*n-1
print(n)  

s = input().split()
a = int(s[0])
b = int(s[1])
#print(a,b)
out = 1
n = 1
while b > out:
  out += a-1
  n +=1
print(n) 

s = input().split()
a = int(s[0])
b = int(s[1])
#print(a,b)
out = 1
n = 0
while b > out:
  out += a-1
  n +=1
print(n)

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

a,b=map(int,input().split())
q,r=divmod(b-a,a-1)
if r==0:
  print(q+1)
else:
  print(q+2)

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

plug = 1
tap = 0

for i in range():
    if plug >= B:
        break
    else:
        prug += A - 1 and tap += 1

print(tap)

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

while 1 + (a-1)*ans < b:
    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())

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

print(n)

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

print(n)

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

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


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

import sys
if b == 1:
    print(0)
    sys.exit(0)

count = a
if count >= b:
    print(1)
else:
    ans = 2
    while True:
        count += (a - 1)
        if count >= b:
            print(ans)
            break
        ans += 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 sys

stdin = sys.stdin
na = lambda: map(int, stdin.readline().split())
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())

def main():
  a, b = na()
  
  tmp = 0
  cnt = 1
  while tmp < b:
    tmp += a-1
    cnt += 1
  print(cnt)

main()

import sys

stdin = sys.stdin
na = lambda: map(int, stdin.readline().split())
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())

def main():
  a, b = na()
  
  tmp = 1
  cnt = 0
  while tmp < b:
    tmp += a-1
    cnt += 1
  print(cnt)

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

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

if b!=1:
  num = math.ceil(((b-1)/(a-1))
else:
  num = b

print(num)

import math

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

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

print(num)

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

print (result)


A, B = map(int, input().split())
tap = 1
result = 0
while B >= A:
    A += (A - 1)
    result += 1

print (result)

A, B = map(int, input().split())
tap = 1
result = 0
while tap < B:
    tap += (A - 1)
    result += 1

print (result)

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())
for i in range(1,20):
  c = a*i - (i-1)
  if c >= b:
    j = i 
    sys.exit()
print(j)

import sys
a,b = map(int,input().split())
for i in range(1,20):
  c = a*i - (i-1)
  if c >= b:
    j = i
    sys.exit()
print(j)



import sys
a,b = map(int,input().split())
for i in range(1,20):
  a = a*i - (i - 1)
  if a >= b:
    j = i
    sys.exit()
print(j)


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

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

count = A
ans = 0

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

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 = MAP()
ans=1
while a<b:
    a += a-1
    ans += 1
print(ans)

def MAP(): return map(int,input().split())
import math

a,b = MAP()
print(math.ceil((b-a)/(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())
i = 1
while i<500:
  if a*i - i + 1 >= b:
    break

print(i)    

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

a,b = input().split()
i = 1
while i<500:
  if a*i - i + 1 >= b:
    break

print(i)    

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

Verdicts: Wrong Answer

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 = input().split()

cnt = 1
num = A

if num < B:
  while num < B:
    num = num + (A -1)
    cnt += 1
elif B == 1:
  cnt = 0
  
print(cnt)

  

  
    


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

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

#ABC139B
a,b = map(int,input().split())
ans = 0 
outlet = 1
while b>outlet:
    outlet = outlet - 1
    outlet = outlet + a
    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=(int(i) for i in input().split())
a=a-1
if b//a==b/a:
  print(b//a)
else:
  print((b//a)+1)

a,b=(int(i) for i in input().split())
a=a-1
b=b-1
if b//a==b/a:
  print(b//a)
else:
  print((b//a)+1)

Verdicts: Wrong Answer

Accepted