qyliang/CodeNanoFix huggingface dataset:
Buggy code:
# A: 0.08 tax, B: 0.10 tax
A, B = list(map(int, input().split()))

# find candidate prices
candidate_prices = [(B*10) + i for i in range(0 , 6)]

# find minimum possible price
for p in candidate_prices:  
    if int(p*(0.08)) == A:
        print(p)

print(-1)

Fixed code:
# A: 0.08 tax, B: 0.10 tax
A, B = list(map(int, input().split()))

# find candidate prices
candidate_prices = [(B * 10) + i for i in range(0, 9)]

# find minimum possible price
min_price = -1
for p in candidate_prices:
    if int(p * (0.08)) == A:
        min_price = p
        break

print(min_price)
Buggy code:
A,B = map(int, input().split())

for x in range(1010):
    if(x * 8 // 100 == A and x * 10 // 100):
        print(x)
        exit()
    
print(-1)

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

for x in range(1010):
    if(x * 8 // 100 == A and x * 10 // 100 == B):
        print(x)
        exit()
    
print(-1)
Buggy code:
def main():
    A, B = map(int, input().split())
    for i in range(1, 10000):
        if i * 0.08 == A and i * 0.1 == B:
            print(i)
            break
    else:
        print(-1)


if __name__ == "__main__":
    main()


Fixed code:
def main():
    A, B = map(int, input().split())
    for i in range(1, 10000):
        if int(i * 0.08) == A and int(i * 0.1) == B:
            print(i)
            break
    else:
        print(-1)


if __name__ == "__main__":
    main()
Buggy code:
A, B =map(int, input().split())
max_A=(A+1)*25/2
max_B=10*(B+1)
p=int(round(max([A*12.5,B*10])+0.4999999999,0))
print(p if(p<min([(A+1)*25/2, 10*(B+1)]) or 4<5*A-4*B or 5*A-4*B<-5) else -1)

Fixed code:
A, B =map(int, input().split())
max_A=(A+1)*25/2
max_B=10*(B+1)
p=int(round(max([A*12.5,B*10])+0.4999999999,0))
print(p if(p<min([(A+1)*25/2, 10*(B+1)]) and not(4<5*A-4*B) and not(5*A-4*B<-5)) else -1)
Buggy code:
A,B=map(int,input().split())
for i in range(1,1010):
  if i*0.08==A and i*0.1==B:
    print(i)
    break
else:
  print(-1)
  

Fixed code:
A,B=map(int,input().split())
for i in range(1,1010):
  if (i*100*0.08)//100==A and (i*100*0.1)//100==B:
    print(i)
    break
else:
  print(-1)
Buggy code:
A,B=map(int,input().split())
miA=-(-A//0.08)
maA=-(-(A+1)//0.08)-1
miB=-(-B//0.1)
maB=-(-(B+1)//0.1)-1
if max(miA,miB)<=maA and max(miA,miB)<=maB:
  print(max(miA,miB))
else:
  print(-1)

Fixed code:
A,B=map(int,input().split())
miA=-(-A//0.08)
maA=-(-(A+1)//0.08)-1
miB=-(-B//0.1)
maB=-(-(B+1)//0.1)-1
if max(miA,miB)<=maA and max(miA,miB)<=maB:
  print(int(max(miA,miB)))
else:
  print(-1)
Buggy code:
a, b = map(int , input().split())

answer = -1
for i in range(1,101):
  print(i)
  if int(i*8//100) == a and int(i*10//100) == b:
    answer = i
    break
    
print(answer)

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

answer = -1
for i in range(1,10100):
  if i * 8 // 100 == a and i * 10 // 100 == b:
    answer = i
    break
    
print(answer)
Buggy code:
l=list(input().split())
A=int(l[0])
B=int(l[1])
c=0
for i in range(1,100001):
	if int(i*0.08)==A and int(i**0.1)==B:
  		print(i)
        c=1
        break
if c==1:
	print(-1)



Fixed code:
l=list(input().split())
A=int(l[0])
B=int(l[1])
c=0
for i in range(1,100001):
  if int(i*0.08)==A and int(i*0.1)==B:
    print(i)
    c=1
    break
if c==0:
	print(-1)
Buggy code:
A, B = map(int, input().split())

x1 = -(-25*A//2)
x2 = 25*(A+1)//2
x3 = 10*B
x4 = 10*(B+1)
print(x1, x2, x3, x4)

if x1 <= x3 and x3 < x2:
  print(x3)
elif x3 <= x1 and x1 < x4:
  print(x1)
else:
  print(-1)

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

x1 = -(-25*A//2)
x2 = 25*(A+1)//2
x3 = 10*B
x4 = 10*(B+1)
#print(x1, x2, x3, x4)

if x1 <= x3 and x3 < x2:
  print(x3)
elif x3 <= x1 and x1 < x4:
  print(x1)
else:
  print(-1)
Buggy code:
import math

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

a = []
b = []

for i in range(1,1001):
  if math.floor(i*0.08) == A:
    a.append(i)
    
  else:
    pass

for i in range(1,1001):
  if math.floor(i*0.1) == B:
    b.append(i)
    
  else:
    pass
   
a_and_b = set(a) & set(b)

print(min(a_and_b))
  

Fixed code:
import math

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

a = []
b = []

for i in range(1,1001):
  if math.floor(i*0.08) == A:
    a.append(i)
    
  else:
    pass

for i in range(1,1001):
  if math.floor(i*0.1) == B:
    b.append(i)
    
  else:
    pass
   
a_and_b = set(a) & set(b)


if len(a_and_b) == 0:
  print(-1)
else:
  print(min(a_and_b))
Buggy code:
import math
a,b=map(int,input().split())
n=101
for i in range(1,n):
    if math.floor(i*0.08)==a and math.floor(i*0.1)==b:
        exit()
print(-1)

Fixed code:
import math
a,b = map(int,input().split())
n = 100000
for i in range(1,n):
    if math.floor(i * 0.08) == a and math.floor(i * 0.1) == b:
        print(i)
        exit()
print(-1)
Buggy code:
import math
a, b = list(map(int, input().split()))
for i in range(1, 1250):
    p8 = math.floor(i * 0.08)
    p10 = math.floor(i * 0.10)
    if p8 == a and p10 == b:
        print(i)
        return
print(-1)

Fixed code:
import math
a, b = list(map(int, input().split()))
for i in range(1, 1250):
    p8 = math.floor(i * 0.08)
    p10 = math.floor(i * 0.10)
    if p8 == a and p10 == b:
        print(i)
        exit()
print(-1)
Buggy code:
A, B = map(int, input().split())
for i in range(1, 1001):
    if int(i * 0.08 ) == A and int(i * 1.10) == B:
        print(i)
        exit()
print(-1)

Fixed code:
A, B = map(int, input().split())
for i in range(1, 1001):
    if int(i * 0.08 ) == A and int(i * 0.10) == B:
        print(i)
        exit()
print(-1)
Buggy code:
A, B = map(int, input().split())

down_a = A / 0.08
up_a = (A+1) / 0.08
down_b = B / 0.1
up_b = (B+1) / 0.1

a = [i for i in range(down_a, up_a)]
b = [j for j in range(down_b, up_b)]

ans = -1
for num in a:
  if num in b:
    ans = num
    break;
print(ans)

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

down_a = math.ceil(A / 0.08)
up_a = math.ceil((A+1) / 0.08)
down_b = int(B / 0.1)
up_b = int((B+1) / 0.1)

a = [i for i in range(down_a, up_a)]
b = [j for j in range(down_b, up_b)]

ans = -1
for num in a:
  if num in b:
    ans = num
    break;
print(ans)
Buggy code:
a,b=(int(x) for x in input().split())
if int(25*(a+1)/2)<=int(10*b):
  print(-1)
if int(10*(b+1))<=int(25*a/2):
  print(-1)
else:
  if a%2==1:
    print(max([int(25*a/2+1),int(10*b)]))
  else:
    print(max([int(25*a/2),int(10*b)]))
    

Fixed code:
a,b=(int(x) for x in input().split())
if int(25*(a+1)/2)<int(10*b):
  print(-1)
elif int(25*(a+1)/2)==int(10*b):
  if a%2==1:
    print(-1)
  else:
    print(int(10*b))
elif int(10*(b+1))<=int(25*a/2):
  print(-1)
elif int(10*(b+1)-1)==int(25*a/2):
  if a%2==1:
    print(-1)
  else:
    print(int(25*a/2))  
else:
  if a%2==1:
    print(max([int(25*a/2+1),int(10*b)]))
  else:
    print(max([int(25*a/2),int(10*b)]))
Buggy code:
a, b  = map(int, input().split())

for i in range(10000):
  if i * 0.08 == a and i * 0.1 == b:
    print(i)
    exit(0)
    
print(-1)
    
    


Fixed code:
a,b = map(int, input().split())
for i in range(1111):
    if int(i*0.08)==a and int(i*0.1)==b:
        print(i)
        exit()
print(-1)
Buggy code:
a,b= map(int, input().split())

amin = a//0.08
amax = (a+1)//0.08
bmin = b//0.1
bmax = (b+1)//0.1

if a%0.08 > 0:
	amin += 1
if (a+1)%0.08:
	amax -= 1
if b%0.1 > 0:
	bmin += 1
if (b+1)%0.1 > 0:
	bmax -= 1

if amin <= bmin:
	if bmin <= amax:
		print(bmin)
	else:
		print(-1)
else:
	if amin <= bmax:
		print(amin)
	else:
		print(-1)


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

amin = int(a//0.08)
amax = int((a+1)//0.08)
bmin = int(b//0.1)
bmax = int((b+1)//0.1)

if a%0.08 > 0:
	amin += 1
if (a+1)%0.08 > 0:
	amax -= 1
if b%0.1 > 0:
	bmin += 1
if (b+1)%0.1 > 0:
	bmax -= 1

if amin <= bmin:
	if bmin <= amax:
		print(bmin)
	else:
		print('-1')
else:
	if amin <= bmax:
		print(amin)
	else:
		print('-1')
Buggy code:
a, b  = map(int, input().split())

for i in range(10000):
  if i == a * 0.08 and i ==  b * 0.1:
    print(i)
    exit(0)
  else:
    print('-1')
    exit(0)
    


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

for i in range(10000):
    if int(i * 0.08) == a and int(i * 0.1) == b:
        print(i)
        exit(0)

else :
        print(-1)
Buggy code:
def main():

    A, B = map(int, input().split())
    v_A = int(A / 0.08)
    v_B = int(B / 0.1)
    v_A2 = int((A+1) / 0.08)
    v_B2 = int((B+1) / 0.1)

    A_cand = [i for i in range(v_A+1, v_A2)]
    B_cand = [i for i in range(v_B+1, v_B2)]

    # print(A_cand)
    # print(B_cand)
    ab_cand = set(A_cand) & set(B_cand)
    if len(ab_cand) == 0:
        print(-1)
    else:
        print(min(ab_cand))
    # print(ab_cand)


if __name__ == '__main__':
    main()


Fixed code:
def main():

    A, B = map(int, input().split())
    v_A = int(A / 0.08)
    if (100*A) % (100*0.08) != 0:
        v_A += 1
    v_B = int(B / 0.1)
    if (100*B) % (100*0.1) != 0:
        v_B += 1
    v_A2 = int((A+1) / 0.08)
    v_B2 = int((B+1) / 0.1)

    A_cand = [i for i in range(v_A, v_A2)]
    B_cand = [i for i in range(v_B, v_B2)]

    # print(A_cand)
    # print(B_cand)
    ab_cand = set(A_cand) & set(B_cand)
    if len(ab_cand) == 0:
        print(-1)
    else:
        print(min(ab_cand))
    # print(ab_cand)


if __name__ == '__main__':
    main()
Buggy code:
a,b = map(int,input().split())
for i in range(b * 10,(b + 1) * 10):
    if int(x * 0.08) == a and int(x * 0.1) == b:
        print(x)
        break
    else:
        print(-1)

Fixed code:
a,b = map(int,input().split())
for x in range(b * 10,(b + 1) * 10):
    if int(x * 0.08) == a and int(x * 0.1) == b:
        print(x)
        break
else:
    print(-1)
Buggy code:
A,B = map(int,input().split())

for i in range(1,10100):
    if int(i*0.08)==A and int(i*0.1)==B:
        print(i)
        break

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

for i in range(1,10100):
    if int(i*0.08)==A and int(i*0.1)==B:
        print(i)
        break
else:
    print(-1)
Buggy code:
A, B = map(int, input().split())
result = True
for a in range(1, 1001):
    if int(a * 0.08) == A and int(a * 0.1) == B:
        print(a)
        break
        result = False
        exit()
        
if result:
    print(-1)

Fixed code:
A, B = map(int, input().split())
result = True
for a in range(1, 1001):
    if int(a * 0.08) == A and int(a * 0.1) == B:
        print(a)
        result = False
        break
        exit()
        
if result:
    print("-1")
Buggy code:
A,B = [int(x) for x in input().split()]

number1 = int(A*100/8)
number2 = int(B*100/10)
if number1/1 == number1//1:
    number1 = number1//1 + 1
if number2/1 == number2//1:
    number2 = number2//1 + 1

if number1//10 == B:
    if number2*8//100 == A:
        if number1 <= number2:
            print(number1)
        else:
            print(number2)
    else:
        print(number1)
else:
    if number2*8//100 == A:
        print(number2)
    else:
        print(-1)

Fixed code:
A,B = [int(x) for x in input().split()]

number1 = A*100/8
number2 = B*100/10
if number1 != number1//1:
    number1 = number1//1 + 1
if number2 != number2//1:
    number2 = number2//1 + 1
number1 = int(number1)
number2 = int(number2)

if number1//10 == B:
    if number2*8//100 == A:
        if number1 <= number2:
            print(number1)
        else:
            print(number2)
    else:
        print(number1)
else:
    if number2*8//100 == A:
        print(number2)
    else:
        print(-1)
Buggy code:
import numpy as np

a, b = list(map(int, input().split()))
minXa = int(np.ceil(a / 0.08))
minXb = b * 10
maxXa = int(np.ceil((a+1) / 0.08))
maxXb = (b+1) * 10

ansX = 9999
ansY = 9999
for x in range(minXa, maxXa):
    if(int(x*0.1) == xb):
        ansX = x
        break

for y in range(minXb, maxXb):
    if(int(y*0.08) == a):
        ansY = y
        break

        
if(ansX == 9999 and ansY == 9999):
    print(-1)
else:
    print(min(ansX, ansY))

Fixed code:
import numpy as np

a, b = list(map(int, input().split()))
minXa = int(np.ceil(a / 0.08))
minXb = b * 10
maxXa = int(np.ceil((a+1) / 0.08))
maxXb = (b+1) * 10

ansX = 9999
ansY = 9999
for x in range(minXa, maxXa):
    if(int(x*0.1) == b):
        ansX = x
        break

for y in range(minXb, maxXb):
    if(int(y*0.08) == a):
        ansY = y
        break

        
if(ansX == 9999 and ansY == 9999):
    print(-1)
else:
    print(min(ansX, ansY))
Buggy code:
tax8, tax10 = map(int,input().split())
import math

tax10_list = []
list = []
count = 0

for i in range(10):
    tax10_list.append(math.floor(tax10*10+i))

for x in range(tax10_list[0],tax10_list[9]):
    if math.floor(x * 0.08) == tax8:
        print(math.floor(x * 0.08))

        break
    else:
        count += 1

if count == 9:
    print("-1")
else:
    None

Fixed code:
tax8, tax10 = map(int,input().split())
import math

tax10_list = []
list = []
count = 0

for i in range(10):
    tax10_list.append(math.floor(tax10*10+i))

for x in range(10):
    if math.floor(tax10_list[x] * 0.08) == tax8:
        print(tax10_list[x])

        break
    else:
        count += 1

if count == 10:
    print("-1")
else:
    None
Buggy code:
import math
A, B = list(map(int, input().split()))

amax = math.floor((A + 1) / 8 * 100)
amin = math.ceil(A / 8 * 100)
bmax = math.floor((B + 1) / 10 * 100)
bmin = math.ceil(B / 10 * 100)

if amin > bmax or bmin > amax:
    print(-1)
print(int(max(amin, bmin)))


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

amax = math.ceil((A + 1) / 8 * 100) - 1
amin = math.ceil(A / 8 * 100)
bmax = math.ceil((B + 1) * 10) - 1
bmin = math.ceil(B * 10)

if amin > bmax or bmin > amax:
    print(-1)
else:
    print(int(max(amin, bmin)))
Buggy code:
A,B=map(int,input().split())
for i in range(10000):
  if A==int(i*0.08) and B==(i*0.1) :
    print(i)
    exit()
plint("-1")

Fixed code:
A,B=map(int,input().split())
for i in range(10000):
  if A==int(i*0.08) and B==int(i*0.1) :
    print(i)
    exit()
print("-1")
Buggy code:
A, B = map(int,input().split())

min8 = (A * 25 + 1) // 2 
max8 = ((A+1) * 25 - 1) // 2
min10 = A * 10
max10 = (A+1) * 10 - 1

if min10 > max8 or min8 > mix10:
	print(-1)
else:
	print(min[min8, min10])


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

min8 = (A * 25 + 1) // 2 
max8 = ((A+1) * 25 - 1) // 2
min10 = B * 10
max10 = (B+1) * 10 - 1

if min10 > max8 or min8 > max10:
	print(-1)
else:
	print(max([min8, min10]))
Buggy code:
a, b = map(int, input().split())

pa = int(a * 100/8)
pb = int(b * 100/10)

ans1 = None
ans2 = None

print(pa,pb)

for price in range(pb-1, pa+2):
    if int(price * 0.08) == a and int(price * 0.1) == b:
        ans1 = price
        break

for price in range(pa-1, pb+2):
    if int(price * 0.08) == a and int(price * 0.1) == b:
        ans2 = price
        break

if ans1 is None and ans2 is None:
    print(-1)
elif ans2 is None:
    print(ans1)
elif ans1 is None:
    print(ans2)
else:
    print(min(ans1,ans2))


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

pa = int(a * 100/8)
pb = int(b * 100/10)

ans1 = None
ans2 = None

for price in range(pb-1, pa+2):
    if int(price * 0.08) == a and int(price * 0.1) == b:
        ans1 = price
        break

for price in range(pa-1, pb+2):
    if int(price * 0.08) == a and int(price * 0.1) == b:
        ans2 = price
        break

if ans1 is None and ans2 is None:
    print(-1)
elif ans2 is None:
    print(ans1)
elif ans1 is None:
    print(ans2)
else:
    print(min(ans1,ans2))
Buggy code:
import sys
A, B = map(int, input().split())

for i in range(10 ** 5):
  if (i * 0.08) == A and (i * 0.1) == B:
    print(i)
    sys.exit()
  else:
    continue
else:
  print(-1)

Fixed code:
import sys
A, B = map(int, input().split())
 
for i in range(10 ** 5):
  if int(i * 0.08) == A and int(i * 0.1) == B:
    print(i)
    sys.exit()
  else:
    continue
else:
  print(-1)
Buggy code:
mport math

eight, ten = map(int, input().split())

eight_price = eight / 0.08
ten_price = ten / 0.1

if eight_price >= ten_price:
    bigger = eight_price
    if (bigger // 10) != ten:
        print("-1")
    else:
        print(math.ceil(bigger))
else:
    bigger = ten_price
    if (bigger * 8 // 100) != eight:
        print("-1")
    else:
        print(math.ceil(bigger))

Fixed code:
import math

eight, ten = map(int, input().split())

eight_price = eight / 0.08
ten_price = ten / 0.1

if eight_price >= ten_price:
    bigger = eight_price
    if (bigger // 10) != ten:
        print("-1")
    else:
        print(math.ceil(bigger))
else:
    bigger = ten_price
    if (bigger * 8 // 100) != eight:
        print("-1")
    else:
        print(math.ceil(bigger))
Buggy code:
import math
a,b = [float(i) for i in input().split()]
ans = 1000000000
Flag = False

for i in range(1,10000):
    ans8 = int(math.floor(i*0.08))
    ans10 = int(math.floor(i*0.1))
#     print(ans8,ans10)
    if ans8 == a and ans10 == b:
        ans = min(ans, i)
        flag = True

if flag:
    print(ans)
else:
    print(-1)

Fixed code:
import math
a,b = [float(i) for i in input().split()]
ans = 1000000000
flag = False

for i in range(1,10000):
    ans8 = int(math.floor(i*0.08))
    ans10 = int(math.floor(i*0.1))
#     print(ans8,ans10)
    if ans8 == a and ans10 == b:
        ans = min(ans, i)
        flag = True

if flag is True:
    print(ans)
else:
    print(-1)
Buggy code:
a,b = map(int,input().split())
low = int(min(a//0.08,b//0.1))
high = int(max((a+1)//0.08,(b+1)//0.1))
for i in range(low,high+1):
    if int(i*0.08)==a and int(i*0.1)==b:
        print(i);  break
print(-1)

Fixed code:
a,b = map(int,input().split())
low = int(min(a//0.08,b//0.1))
high = int(max((a+1)//0.08,(b+1)//0.1))
for i in range(low,high+1):
    if int(i*0.08)==a and int(i*0.1)==b:
        print(i);  break
else:
    print(-1)
Buggy code:
a,b = map(int,input().split())
for i in range(1,1251):
    if int(i*0.08)==a and int(i*0.1)==b:
        print(i); break
print('-1')

Fixed code:
a,b = map(int,input().split())
for i in range(1,1251):
    if int(i*0.08)==a and int(i*0.1)==b:
        print(i); break
else:
    print('-1')
Buggy code:
import math
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

x = a / 0.08
y = b / 0.1
left = math.floor(min(x, y))
right = math.ceil(max(x, y))
print(x,y,left,right)
for i in range(left , right + 1):
    if int(i * 0.08) == a and int(i * 0.1) == b:
        print(i)
        exit()
print('-1')

Fixed code:
import math
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

x = a / 0.08
y = b / 0.1
left = math.floor(min(x, y))
right = math.ceil(max(x, y))
for i in range(left , right + 1):
    if int(i * 0.08) == a and int(i * 0.1) == b:
        print(i)
        exit()
print('-1')
Buggy code:
a, b = map(int, input().split())

start = b * 10
flg = True
for i in range(10):
  tmp = (start + i) * 0.08
  if tmp == a:
    flg = False
    break
if flg:
  print('-1')
else:
  print(int(tmp))

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

start = b * 10
flg = True
for i in range(10):
  tmp = start + i
  if int(tmp*0.08) == a:
    flg = False
    break
if flg:
  print('-1')
else:
  print(int(tmp))
Buggy code:
# input
A,B = map(int, input().split())
# calculate
price = -1
for n in range(100):
  if int(n * 0.08) == A and int(n * 0.1) == B:
    price = n
    break
  else:
    pass
# output
print(price)

Fixed code:
# input
A,B = map(int, input().split())
# calculate
price = -1
for n in range(10000):
  if int(n * 0.08) == A and int(n * 0.1) == B:
    price = n
    break
  else:
    pass
# output
print(price)
Buggy code:
a, b = map(int, input().split())

if a % 8 == 0:
    a_min = int(a * 12.5)
else:
    a_min = int(a * 12.5) + 1
if (a + 1) % 8 == 0:
    a_max = int((a + 1) * 12.5) - 1
else:
    a_max = int((a + 1) * 12.5)

b_min = b * 10
b_max = (b + 1) * 10 - 1

if a_max < b_min:
    print("-1")
elif a_min <= b_min:
    print(int(b_min))
elif b_max >= a_min:
    print(int(a_min))
else:
    print("-1")

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

if a % 2 == 0:
    a_min = int(a * 12.5)
else:
    a_min = int(a * 12.5) + 1

if (a + 1) % 2 == 0:
    a_max = int((a + 1) * 12.5) - 1
else:
    a_max = int((a + 1) * 12.5)

b_min = b * 10
b_max = (b + 1) * 10 - 1

if a_max < b_min:
    print("-1")
elif a_min <= b_min:
    print(int(b_min))
elif b_max >= a_min:
    print(int(a_min))
else:
    print("-1")
Buggy code:
A,B=map(int,input().split())
 
S=max(12.5*A,10*B)
 
if S%1!=0:
    S=int(S)+1
 
if S<12.5*A+12.5 and S<10*B+10:
    print(S)
else:
    print("-1")

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

S=max(12.5*A,10*B)

if S%1!=0:
    S=S//1+1

if S<12.5*A+12.5 and S<10*B+10:
    print(int(S))
else:
    print("-1")
Buggy code:
#At coder 2020/3/8 C
import math

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

a1=A/0.08
b1=B/0.1

a2=(A+1)/0.08
b2=(B+1)/0.1

af=math.ceil(a1)
ac=math.ceil(a2)
bf=math.ceil(b1)
bc=math.ceil(b2)
if ac<=bf or bc<=af:
    ans=-1
else:
    ans=min(af,bf)

print(ans)

Fixed code:
#At coder 2020/3/8 C
import math

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

a1=A/0.08
b1=B/0.1

a2=(A+1)/0.08
b2=(B+1)/0.1

af=math.ceil(a1)
ac=math.ceil(a2)
bf=math.ceil(b1)
bc=math.ceil(b2)

if ac<=bf or bc<=af:
    ans=-1
else:
    ans=max(af,bf)
#print(af,ac,bf,bc)
print(ans)
Buggy code:
A,B= map(int,input().split())
for i in range(1300):
    if int(i*0.08)==A and int(i*0.1)==B:
        print(int(i*0.08))
        exit()
print(-1)

Fixed code:

A,B= map(int,input().split())
for i in range(1300):
    if int(i*0.08)==A and int(i*0.1)==B:
        print(i)
        exit()
print(-1)
Buggy code:
a, b = map(int,input().split())

for i in range (1251):
  if int(i*0.08)==a and int(i/10)==b:
    print(i)
  
print(-1)
  

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

for i in range (1251):
  if (int(i*0.08)==a) and (int(i/10)==b):
    print(i)
    exit()

print(-1)
Buggy code:
import math

a = list(map(int, input().split()))
b = -1
for i in range(1250):
    x = math.floor(i*0.08)
    y = math.floor(i*0.1)
    if a[0] == x and a[1] == y:
        b = x
        break

print(b)

Fixed code:
import math

a = list(map(int, input().split()))
b = -1
for i in range(1001):
    x = math.floor(i*0.08)
    y = math.floor(i*0.1)
    if a[0] == x and a[1] == y:
        b = i
        break

print(b)
Buggy code:
A, B = map(int, input().split())
flag = 1
for i in range(1,100):
  if int(i*1.08) == A and int(i*1.1) == B:
    print(i)
    flag = 0
    break
if flag:
  print(-1)


Fixed code:
A, B = map(int, input().split())
flag = 1
for i in range(1,10001):
  if int(i*0.08) == A and int(i*0.1) == B:
    print(i)
    flag = 0
    break
if flag:
  print(-1)
Buggy code:
import math

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

A1 = A * 12.5
A2 = (A + 0.9) * 12.5
B1 = B * 10
B2 = (B + 0.9) * 10

if B1 <= A1 and A1 < (B + 1) * 10:
    print(math.floor(A1 + 1))
elif A1 <= B1 and B1 < (A + 1) *12.5 :
    print(math.floor(B1))
else:
    print(-1)

Fixed code:
import math

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

A1 = A * 12.5
A2 = (A + 0.9) * 12.5
B1 = B * 10
B2 = (B + 0.9) * 10

if B1 <= A1 and A1 < (B + 1) * 10:
    print(math.ceil(A1))
elif A1 <= B1 and B1 < (A + 1) *12.5 :
    print(B1)
else:
    print(-1)
Buggy code:
a, b = map(int, input().split())
for i in range(10000):
  if int(i * 0.08) == a and int(i * 0.1) == b:
    print(i)
    exit()
print(=1)

Fixed code:
a, b = map(int, input().split())
for i in range(10000):
  if int(i * 0.08) == a and int(i * 0.1) == b:
    print(i)
    exit()
print(-1)