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):
#coding:utf-8
import math
a, b = map(int, input().split())

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

#coding:utf-8
a, b = map(int, input().split())

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

#coding:utf-8
a, b = map(int, input().split())

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

#coding:utf-8
a, b = map(int, input().split())


tap = -(-(b-1)//(a-1))
print(tap)

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

print(int((B - 1.0) / (A - 1.0) + 1.0))

import math

A = float(input())
B = float(input())

print(int(math.ceil((B - 1.0) / (A - 1.0))))

import math

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

print(int(math.ceil((B - 1.0) / (A - 1.0))))

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

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

Verdicts: Wrong Answer

Accepted
Problem: Takahashi's house has only one socket.  Takahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.  One power strip with A sockets can extend one empty socket into A empty sockets.  Find the minimum number of power strips required.

Submission attempts (in order):
A, B = [int(i) for i in input().split()]

count = 1
t = A
q = B
while q - t >= 0:
    q = q - t
    t = A - 1
    count += 1
print(count)

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

count = 1
t = A
q = B
while q - t > 0:
    t = A - 1
    q = q - t
    count += 1
print(count)

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

i = 1

while True:
    if i == 1:
        s = A*i
    else:
        s = A*i - (i - 1)
    
    if s >= B:
        break
    i += 1

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

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

i = 1

while True:
    s = A*i - (i - 1)
    
    if s >= B:
        break
    i += 1

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

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

using namespace std;
int main(void){
    int a,b;
    cin>>a>>b;
    int x=0;
    while(x*(a-1)+1<b){
        x++;
    }
    cout<<x<<endl;
}


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

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())
c = math.ceil(b/a)
if a == b:
  print(c)
elif  a*c-c >=b:
    print(c)
else:
    print(c+1)

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

a,b = map(int,input().split())
print((b-2)//(a-1)+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())
kuchi = 1
cnt = 0
if kuchi >= b:
    break
else:
    for i in range(1, 20):
        if kuchi >= b:
                break
        else:
            for j in range(1, a ** i):
                if kuchi >= b:
                    break
                else:
                    if j < a ** i:
                        cnt += 1
                        kuchi = kuchi - 1 + a
                    else:
                        kuchi = kuchi * a
                        cnt += kuchi / a 
print(cnt)

a, b = map(int, input().split())
kuchi =  1
cnt = 0
if kuchi <= b:
    for i in range(1, 20):
        if kuchi >= b:
                break
        else:
            for j in range(1, a ** i):
                if kuchi >= b:
                    break
                else:
                    if j < a ** i:
                        cnt += 1
                        kuchi = kuchi - 1 + a
                    else:
                        kuchi = kuchi * a
                        cnt += kuchi / a 
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):
A,B=map(int,input().split())
c=int(1)
n=int(0)
while n<B:
    c+=1
    n-=1
    n+=A
print(c)


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

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


Verdicts: Wrong Answer

Accepted
Problem: Takahashi's house has only one socket.  Takahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.  One power strip with A sockets can extend one empty socket into A empty sockets.  Find the minimum number of power strips required.

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

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

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


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


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


Verdicts: Wrong Answer

Accepted
Problem: Takahashi's house has only one socket.  Takahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.  One power strip with A sockets can extend one empty socket into A empty sockets.  Find the minimum number of power strips required.

Submission attempts (in order):
S=input()
T=input()
a=0
for i in range(3):
    if S[i]==T[i]:
        a+=1
print(a)

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

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 = list(map(int,input().split(" ")))
B = math.ceil(A[1] / A[0]) + 1
print(B)

import math
A = list(map(int,input().split(" ")))
if A[1] / A[0] > 1:
    A[1] -= A[0]
    print(math.ceil(A[1]) + 1)
else:
    print("1")

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

cnt = 1
num = A

if num < B:
  while num < B:
    num = num + (A - 1)
    cnt += 1
  
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):
# -*- coding: utf-8 -*-

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

print("{}".format(-x)

# -*- coding: utf-8 -*-

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

print("{}".format( -( (1-b)//(a-1) ) )

# -*- coding: utf-8 -*-

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

print("{}".format(-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):
import sys
import math

A,B = map(int,input().split())
if not ( 2 <= A <= 20 and 1 <= B <= 20 ): sys.exit()


for I in range(math.ceil(B/A),21):
    print(I)
    if I*A-(I*A-1) >= B:
        print(I)
        sys.exit()

import sys
import math

A,B = map(int,input().split())
if not ( 2 <= A <= 20 and 1 <= B <= 20 ): sys.exit()

if B == 1: print(0);sys.exit()
for I in range(math.ceil(B/A),21):
    if I*A-(I-1) >= B:
        print(I)
        sys.exit()

Verdicts: Wrong Answer

Accepted
Problem: Takahashi's house has only one socket.  Takahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.  One power strip with A sockets can extend one empty socket into A empty sockets.  Find the minimum number of power strips required.

Submission attempts (in order):
# from math import factorial
# from collections import defaultdict, deque
#  from heapq import heappush, heappop


# A = int(input())

# Ss = ["".join(sorted(input())) for _ in range(N)]
# A = int(input())

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




# from math import factorial
# from collections import defaultdict, deque
#  from heapq import heappush, heappop


# A = int(input())

# Ss = ["".join(sorted(input())) for _ in range(N)]
# A = int(input())

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




Verdicts: Runtime Error

Accepted
Problem: Takahashi's house has only one socket.  Takahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.  One power strip with A sockets can extend one empty socket into A empty sockets.  Find the minimum number of power strips required.

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

import math
a,b=input.split(" ")
print(math.ceil(a/b))

import math
a,b=map(int,input().strip().split())
ans=0
sockets=1
while sockets<b:
  outlets-=1
  sockets+=a
  ans+=1
print(ans)

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

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

print(math.ceil(B / A))

import math

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

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

print(math.ceil(x))

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):
input_char = input()
a = int(input_char.split()[0])
b = int(input_char.split()[1])
unused_tap = 1
count = 0

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

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

while(1):
    if unused_tap >= b:
        print(count + 1)
        break
    
    unused_tap = unused_tap-1 + a 
    count += 1



input_char = input()
a = int(input_char.split()[0])
b = int(input_char.split()[1])
unused_tap = 1
count = 0

while(1):
    if unused_tap >= b:
        print(count)
        break
    
    unused_tap = unused_tap-1 + a 
    count += 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):
s = input()
t = input()
ans = 0
for i in range(3):
    if s[i] == t[i]:
        ans += 1
print(ans)

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

count = 0
if a!=b:
    while (count*a)-(count-1) <= b:
        count += 1
print(count)


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

count = 0
while (count*a)-(count-1) < b:
    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 = int(input())
b = int(input())

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

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

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

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

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

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

tmp = b // a
for i in range(tmp, 20 + 1):
    if a * i - tmp <= b:
        print(i)
        exit()


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

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

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

Verdicts: Wrong Answer

Accepted
Problem: Takahashi's house has only one socket.  Takahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.  One power strip with A sockets can extend one empty socket into A empty sockets.  Find the minimum number of power strips required.

Submission attempts (in order):
import math
a,b=map(int,input().split())
ans=math.ceil((b-1)/(a-1))

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

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


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


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi's house has only one socket.  Takahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.  One power strip with A sockets can extend one empty socket into A empty sockets.  Find the minimum number of power strips required.

Submission attempts (in order):
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: 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(_) for _ in input().split())
total = 1
ans = 0
if b == 1:
    print(1)
else:
    while total < b:
      	total -= 1
        total += a
        ans += 1
        
print(ans)

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

result = 0
cnt = 1
while cnt < B:
    result += 1
    cnt += 1

print(cnt)

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

result = 0
cnt = 1
while cnt < B:
    result += 1
    cnt += A - 1

print(result)

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())
ans=(A+B-1)//B
print(ans)


A=int(input())
B=int(input())
ans=(A+B-3)//(A-1)
print(ans)


A=int(input())
B=int(input())
ans=(A-1+B-1-1)//(A-1)
print(ans)


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

if B<=A:
    ans=1
else:
    for k in range(2,31):
        if (k-1)*A-(k-2)<B and B<=k*A-(k-1):
            ans=k
        else:
            k=k+1
print(ans)


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

if B<=A:
    ans=1
else:
    for k in range(2,100):
        if (k-1)*A-(k-2)<B and B<=k*A-(k-1):
            ans=k
        else:
            k=k+1
print(ans)


A=int(input())
B=int(input())
ans=(A+B-1)//A
print(ans)


A=int(input())
B=int(input())
ans=(B-1)//(A-1)
print(ans)


A,B=map(int,input().split())
if B==1:
    ans=0
elif 1<B and B<=A:
    ans=1
else :
    for k in range(2,100):
        if (k-1)*A-(k-2)<B and B<=k*A-(k-1):
            ans=k
        else:
            k=k+1
print(ans)


Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Takahashi's house has only one socket.  Takahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.  One power strip with A sockets can extend one empty socket into A empty sockets.  Find the minimum number of power strips required.

Submission attempts (in order):
import sys
a,b=map(int,input().split())
if a==b:
    print(1)
    sys.exit()
d=1
b-=a
while 1:
    
    b-=a-1
    d+=1
    if b<0:
        break
print(d)


import sys
a,b=map(int,input().split())
d=(b-1)//(a-1)
c=(b-1)/(a-1)
if c-d>0:
    d+=1
print(d)


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

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

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

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


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


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

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


def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def S(): return input()
def LS(): return input().split()


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


import sys


def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def S(): return input()
def LS(): return input().split()


a, b = LI()
guchi = 1
ans = 0
while guchi < b:
    guchi += 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

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

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

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

Verdicts: Runtime Error

Accepted
Problem: Takahashi's house has only one socket.  Takahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.  One power strip with A sockets can extend one empty socket into A empty sockets.  Find the minimum number of power strips required.

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

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

def main():
    print(B//A+ (1 if B%A > 0 else 0)

if __name__ == '__main__':
    main()

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

print((B-1-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=[int(x) for x in input().rstrip().split()]
if A%B==0:
  print(A//B)
else:
  print(A//B+1)


A,B=[int(x) for x in input().rstrip().split()]

if B==1:
  print(0)
else:
  ans=A
  cnt=1

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


Verdicts: Wrong Answer

Accepted
Problem: Takahashi's house has only one socket.  Takahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.  One power strip with A sockets can extend one empty socket into A empty sockets.  Find the minimum number of power strips required.

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

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

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

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

Verdicts: Wrong Answer

Accepted
Problem: Takahashi's house has only one socket.  Takahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.  One power strip with A sockets can extend one empty socket into A empty sockets.  Find the minimum number of power strips required.

Submission attempts (in order):
import numpy as np
A,B=np.array(list(map(int, input().split())))

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

import numpy as np
A,B=np.array(list(map(int, input().split())))

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

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

if B==1:
    print(0)

if A >= B:
    print(1)
if(2*A-1) >=B:
    print(2)
if(3*A-2)>=B:
    print(3)
if(4*A-3)>=B:
    print(4)
if(5*A-4)>=B:
    print(5)
if(6*A-5)>=B:
    print(6)
if(7*A-6)>=B:
    print(7)
if(8*A-7)>=B:
    print(8)
if(9*A-8)>=B:
    print(9)
if(10*A-9)>=B:
    print(10)
if(11*A-10)>=B:
    print(11)
if(12*A-11)>=B:
    print(12)
if(13*A-12)>=B:
    print(13)
if(14*A-13)>=B:
    print(14)
if(15*A-14)>=B:
    print(15)
if(16*A-15)>=B:
    print(16)
if(17*A-16)>=B:
    print(17)
if(18*A-17)>=B:
    print(18)
if(19*A-18)>=B:
    print(19)
if(20*A-19)>=B:
    print(20)

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

if B==1:
    print(0)

elif A >= B:
    print(1)
elif(2*A-1) >=B:
    print(2)
elif(3*A-2)>=B:
    print(3)
elif(4*A-3)>=B:
    print(4)
elif(5*A-4)>=B:
    print(5)
elif(6*A-5)>=B:
    print(6)
elif(7*A-6)>=B:
    print(7)
elif(8*A-7)>=B:
    print(8)
elif(9*A-8)>=B:
    print(9)
elif(10*A-9)>=B:
    print(10)
elif(11*A-10)>=B:
    print(11)
elif(12*A-11)>=B:
    print(12)
elif(13*A-12)>=B:
    print(13)
elif(14*A-13)>=B:
    print(14)
elif(15*A-14)>=B:
    print(15)
elif(16*A-15)>=B:
    print(16)
elif(17*A-16)>=B:
    print(17)
elif(18*A-17)>=B:
    print(18)
elif(19*A-18)>=B:
    print(19)
elif(20*A-19)>=B:
    print(20)

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)
c=a
b=int(b)
i=0
k=0
while c<=b:
  c=c+a-1
  k=k+1
print(k+1)

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

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

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

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

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

from math import ceil
a, b = map(int, input().split())
print(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())
total = 1
i = 0
while total < B:
  total = total + A -1
  i = i +1
  print(total,i)
print(i)

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

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

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

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

Verdicts: 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):
a = [input().split() for l in range(1)]
tap = a[0]
need = a[1]
count = 1
needed_tap = 0
while count < need:
  count = count + (tap - 1)
  needed_tap = needed_tap +1

print(str(needed_tap))


i = list(map(int, input().split()))

tap = int(i[0])
need = int(i[1])
count = 1
needed_tap = 0
while count < need:
  count = count + (tap - 1)
  needed_tap = needed_tap +1
 
print(str(needed_tap))

Verdicts: Runtime Error

Accepted
Problem: Takahashi's house has only one socket.  Takahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.  One power strip with A sockets can extend one empty socket into A empty sockets.  Find the minimum number of power strips required.

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

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

Verdicts: Wrong Answer

Accepted
Problem: Takahashi's house has only one socket.  Takahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.  One power strip with A sockets can extend one empty socket into A empty sockets.  Find the minimum number of power strips required.

Submission attempts (in order):
a,b = [int(i) for i in input().split()]
counter = 1
current = a
while current <= b:
    current -= 1
    counter += 1
    if current + a == b:
        current += a
    else:
        current += a
print(counter)

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

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

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


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

current = a
counter = 1
remain = a
if b == 1:
    print(0)
else:
    while current < b:
        current -= 1
        current += a
        counter += 1
    print(counter)

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())
capacity = 1
ans = 0

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

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

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

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

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

import sys
a, b =map(int, input().split())
if a == b:
  print(1)
  sys.exit()
elif a < b:
  print(a)
  sys.exit()
 
c = b//a
if a*c == b:
  print(c)
else:
  print(c +1)

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

a, b =map(int, input().split())
if a == b:
  print(1)
elif a < b:
  print(a)

c = b//a
if a*c == b:
  print(c)
else:
  print(c +1)

a, b = map(int, input().split())
for i in range(b):
    if  a * i == b:
        print(i)
        exit()

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

Verdicts: Runtime Error

Wrong Answer

Runtime Error

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

import sys
a,b=map(int, input().split())
hole = a
if b==1:
	print(0)
	sys.exit()
for i in range(1,30):
    if hole<b:
        hole = hole + a -1
    elif hole>=b:
        print(int(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())
cnt = 0
for i in range(1,B+1):
    if  B == 1:
        cnt = 1
        a = 0
        break
    elif count == 0 and A >= B:
        cnt = 1
        a = 1
        break
    elif (A-1)*(i-1)+A >= B:
        a = i
        break
print(a)

A,B = map(int,input().split())
cnt = 0
for i in range(1,B+1):
    if  B == 1:
        cnt = 1
        a = 0
        break
    elif count == 0 and A >= B:
        cnt = 1
        a = 1
        break
    elif (A-1)*(i-1)+A >=B:
        a = i
        break
print(a)

a,b = map(int,input().split())
cnt = 1
c = b-a
if c >0:
    cnt += (c//(a-1))
    d = c%(a-1)
    if d != 0:
        cnt += 1
if b == 1:
    cnt = 0
print(cnt)

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

n = 1   
N = A + (A - 1) * (n - 1) 


while N < B:
    n = n + 1


print(n)

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

ans = 0   
out = 1 


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

print(ans)

Verdicts: Wrong Answer

Accepted
Problem: Takahashi's house has only one socket.  Takahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.  One power strip with A sockets can extend one empty socket into A empty sockets.  Find the minimum number of power strips required.

Submission attempts (in order):
x = list(map(int, input().split()))
syou = x[0] / x[1]
amari = x[0] % x[1]

if(amari > 0 ):
    print(syou+1)
else:
    print(syou)

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

num = 1
res = 0

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

print(num)

 = input().split()
syou = x[0] / x[1]
amari = x[0] % x[1]

if(amari > 0 ):
    print(syou+1)
else:
    print(syou)

x = list(map(int, input().split()))
syou = x[1] / x[0]
amari = x[1] % x[0]

if(amari > 0 ):
    print(syou+1)
else:
    print(syou)

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

num = 1
res = 0

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

print(res)


Verdicts: Wrong Answer

Wrong Answer

Runtime Error

Wrong Answer

Accepted
Problem: Takahashi's house has only one socket.  Takahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.  One power strip with A sockets can extend one empty socket into A empty sockets.  Find the minimum number of power strips required.

Submission attempts (in order):
a = input()
b = input()
ans = sum(a[i] == b[i] for i in range(3))
print(ans)

a, b = map(int, input().split())
print((b-2) // (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):
def solve(a, b):
    n = 0
    c = 0
    while (True):
        c = sum(a, a - 1, n)
        if c >= b:
            break
        else:
            n=n+1
    return n

def sum(a0, d, n):
    return n * (2 * a0 + (n - 1) * d) // 2

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


def solve(a, b):
    n = 0
    c = 0
    while (True):
        c = a + (n - 1) * (a - 1)
        if c >= b:
            break
        else:
            n = n + 1
    return n

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


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.floor(b/a))

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



Verdicts: Wrong Answer

Accepted
Problem: Takahashi's house has only one socket.  Takahashi wants to extend it with some number of power strips, each with A sockets, into B or more empty sockets.  One power strip with A sockets can extend one empty socket into A empty sockets.  Find the minimum number of power strips required.

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

i = 0
j = 1
while j <= B:
    j += (A-1)
    i += 1

print(i)

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

i = 0
j = 1
while j < B:
    j += (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):
from math import ceil

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

cnt = ceil(B / A + 1)

print(cnt)

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

cnt = 0
socket = 1
while socket < B:
    cnt += 1
    if cnt == 1:
        socket = A
    else:
        socket += A - 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 = int(input())
b = int(input())
s = 1
c = 0
while s<b:
    s += a - 1
    c += 1
print(c)

cnm = input().split()
a = int(cnm[0])
b = int(cnm[1])
s = 1
c = 0
while s<b:
    s += a - 1
    c += 1
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 = 1
max_a = a
while True:
  if max_a>=b:
    break
  else:
    max_a = max_a -1 + a - 1
    count += 1
print(count)

a,b = map(int,input().split())
count = 0
max_a = 1
while True:
  if max_a>=b:
    break
  else:
    max_a = max_a -1 + a
    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())
for i in range(100):
  t = i*a - i + 1
  if (t > b):
    exit()
print(i)
    

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

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

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

x = 0
i = 0
while x<=b:
    i+=1
    x = a+(a-1)*(i-1)

print(i)




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

x = 0
i = 0
while True:
    x = a + (a-1)*i
    if x<b:
        i+=1

print(i)



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

x = 0
i = 0
while True:
    x = a + (a-1)*i
    if x<b:
        i+=1
    else:
        break

print(i)



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

x = 0
i = 1
while True:
    x = a + (a-1)*i
    if x<b:
        i+=1
    else:
        break

print(i)




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

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



Verdicts: Wrong Answer

Time Limit Exceeded

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


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

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

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

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

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Accepted