qyliang/CodeNanoFix huggingface dataset:
Buggy code:
A,B=map(int,input().split())
if (A/0.08)%1==0.0:
    a1=int(A/0.08)
else:
    a1=int(A/0.08)+1
if (A/0.08)%1!=0.0:
    a2=int((A+1)/0.08)
else:
    a2=int((A+1)/0.08)-1

if (B/0.1)%1==0.0:
    b1=int(B/0.1)
else:
    b1=int(B/0.08)+1
if (B/0.1)%1!=0.0:
    b2=int((B+1)/0.1)
else:
    b2=int((B+1)/0.1)-1

#a=[]
#b=[]
for i in range(a1,a2+1):
    s=i
    a.append(s)
for i in range(b1,b2+1):
    t=i
    b.append(t)
print(a)
print(b)
if max(a)<min(b):
    print(-1)
elif max(b)<min(a):
    print(-1)
elif min(a)>=min(b):
    print(min(a))
else:
    print(min(b))

Fixed code:
A,B=map(int,input().split())
if (A/0.08)%1==0.0:
    a1=int(A/0.08)
else:
    a1=int(A/0.08)+1
if ((A+1)/0.08)%1!=0.0:
    a2=int((A+1)/0.08)
else:
    a2=int((A+1)/0.08)-1

if (B/0.1)%1==0.0:
    b1=int(B/0.1)
else:
    b1=int(B/0.08)+1
if ((B+1)/0.1)%1!=0.0:
    b2=int((B+1)/0.1)
else:
    b2=int((B+1)/0.1)-1

a=[]
b=[]
for i in range(a1,a2+1):
    s=i
    a.append(s)
for i in range(b1,b2+1):
    t=i
    b.append(t)
#print(a)
#print(b)
if max(a)<min(b):
    print(-1)
elif max(b)<min(a):
    print(-1)
elif min(a)>=min(b):
    print(min(a))
else:
    print(min(b))
Buggy code:
import math

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

for i in range(1000):
    if math.floor(i * 0.08) == a and math.floor(i* 0.1) == b:
        print(i)
        break
print(-1)

Fixed code:
import math

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

r = -1
for i in range(1,1251):
    if math.floor(i * 0.08) == a and math.floor(i * 0.1) == b:
        r = i
        break

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

ans = -1
for i in range(10 ** 3 + 1):
  if int(i * 0.08) == A and int(i * 0.1) == B:
    ans = i
    
print(ans)

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

ans = -1
for i in range(10 ** 3 + 1):
  if int(i * 0.08) == A and int(i * 0.1) == B:
    ans = i
    break
    
print(ans)
Buggy code:
import math
import sys
a,b=map(int,input().spliit())
a2=math.ceil(a/0.08)
a3=math.floor((a+1)/0.08)
if a2>a3:
    print("-1")
    sys.exit()
b2=math.ceil(b/0.1)
b3=math.floor((b+1)/0.1)
if b2>b3:
    print("-1")
    sys.exit()
if b2<a2:
    if a2<(b+1)/0.1:
        print(a2)
    else:
        print("-1")
if a2<b2:
    if b2<(a+1)/0.08:
        print(b2)
    else:
        print("-1")
if a2==b2:
    print(a2)


Fixed code:
import math
import sys
a,b=map(int,input().split())
a2=math.ceil(a/0.08)
a3=math.floor((a+1)/0.08)
if a2>a3:
    print("-1")
    sys.exit()
b2=math.ceil(b/0.1)
b3=math.floor((b+1)/0.1)
if b2>b3:
    print("-1")
    sys.exit()
if b2<a2:
    if a2<(b+1)/0.1:
        print(a2)
    else:
        print("-1")
if a2<b2:
    if b2<(a+1)/0.08:
        print(b2)
    else:
        print("-1")
if a2==b2:
    print(a2)
Buggy code:
a, b = map(int, input().split())
amin = -(-a*25//2)
amax = -(-(a+1)*25//2)
bmin = b*10
bmax = bmin + 10
print(amax)
for i in range(amin, amax):
    for j in range(bmin, bmax):
        if i == j:
            print(i)
            exit()
print(-1)


Fixed code:
a, b = map(int, input().split())
amin = -(-a*25//2)
amax = -(-(a+1)*25//2)
bmin = b*10
bmax = bmin + 10
for i in range(amin, amax):
    for j in range(bmin, bmax):
        if i == j:
            print(i)
            exit()
print(-1)
Buggy code:
A, B = [int(_) for _ in input().split()]
aa = [int(i * 0.08) for i in range(1, 100)]
bb = [int(i * 0.1) for i in range(1, 100)]
for i, a, b in zip(range(1, 100), aa, bb):
    if (a, b) == (A, B):
        print(i)
        exit()
print(-1)


Fixed code:
A, B = [int(_) for _ in input().split()]
aa = [int(i * 0.08) for i in range(1, 10000)]
bb = [int(i * 0.1) for i in range(1, 10000)]
for i, a, b in zip(range(1, 10000), aa, bb):
    if (a, b) == (A, B):
        print(i)
        exit()
print(-1)
Buggy code:
A, B = [int(x) for x in input().split()]
ans = 0

ans_a = A // 0.08
ans_b = B // 0.10

for i in range(1, 101):
    if A == int(0.08 * i) and B == int(0.10 * i):
        ans = i
        break

print(ans)

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

ans_a = A // 0.08
ans_b = B // 0.10

for i in range(1, 10100):
    if A == int(0.08 * i) and B == int(0.10 * i):
        ans = i
        print(ans)
        break
if ans == 0:
    print(-1)
Buggy code:
A, B = map(int, input().split())
for i in range(20000):
    if i * 0.08 // 1 == A and i * 0.1 // 1 == B:
        print(i)
        break
print(-1)


Fixed code:
A, B = map(int, input().split())
for i in range(20000):
    if i * 0.08 // 1 == A and i * 0.1 // 1 == B:
        print(i)
        exit()
print(-1)
Buggy code:
ab = list(map(int, input().split())) 
a= ab[0]
b=ab[1]

x=[]

x.append(a/0.08)
x.append((a+1)/0.08)
x.append(b/0.1)
x.append((b+1)/0.1)

print(x)
if x[0]<= x[2] and x[2]<x[1]:
    print(int(x[2]))
elif x[2]<= x[0] and x[0] < x[3]:
    print(int(x[0]))
else:
    print(-1)


Fixed code:
ab = list(map(int, input().split())) 
a= ab[0]
b=ab[1]
 
x=[]
x.append(a/0.08)
x.append((a+1)/0.08)
x.append(b/0.1)
x.append((b+1)/0.1)
if x[0]<= x[2] and x[2]<x[1]:
    print(int(x[2]))
elif x[2]<= x[0] and x[0] < x[3]:
    if x[0]>int(x[0]):
        print(int(x[0])+1)
    else:
        print(int(x[0]))
else:
    print(-1)
Buggy code:
a, b = input().split();
a = int(a);
b = int(b);

for x in range(1,101):
  tax_8 = int(x * 0.08);
  tax_10= int(x * 0.1);
  if tax_8 == a and tax_10 == b:
  	ans = x;
    break;
  elif x == 101:
    ans = -1;
  else:
    pass;
  
print(ans);
  

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

for x in range(1,1001):
  tax_8 = int(x * 0.08);
  tax_10= int(x * 0.1);
  if tax_8 == a and tax_10 == b:
    ans = x;
    break;
  elif x == 100:
    ans = -1;
  else:
    pass;
  
print(ans);
Buggy code:
import sys
input = sys.stdin.readline
A, B = [int(x) for x in input().strip().split()]
for i in range(1, 100):
    if int(i * 0.08) == A and int(i * 0.1) == B:
        print(i)
        exit()
print(-1)

Fixed code:
import sys
input = sys.stdin.readline
A, B = [int(x) for x in input().strip().split()]
for i in range(1, 1001):
    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())
c = 1
while(True):
    if(int(c*0.08)==a and int(c*0.1)==b):
        print(c)
        exit()
    c+=1
    if(c=100000):
        print(-1)
        exit()

Fixed code:
a, b = map(int, input().split())
c = 1
while(True):
    if(int(c*0.08)==a and int(c*0.1)==b):
        print(c)
        exit()
    c+=1
    if(c==100000):
        print(-1)
        exit()
Buggy code:
a,b= map(int, input().split())

x1=-(-a//0.08)
x2=-(-(a+1)//0.08)-1
y1=-(-b//0.10)
y2=-(-(b+1)//0.10)-1
print(x1,x2,y1,y2)
if x1<=y1 and y1<=x2:
    print(int(y1))

elif y1<=x1 and x1<=y2:
    print(int(x1))


else:
    print(-1)


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

x1=-(-a//0.08)
x2=-(-(a+1)//0.08)-1
y1=-(-b//0.10)
y2=-(-(b+1)//0.10)-1

if x1<=y1 and y1<=x2:
    print(int(y1))

elif y1<=x1 and x1<=y2:
    print(int(x1))


else:
    print(-1)
Buggy code:
import math

tax_8, tax_10 = map(int, input().split())

price_8_min = tax_8 / 0.08
price_8_max = (tax_8 + 0.99) / 0.08

price_10_min = tax_10 / 0.1
price_10_max = (tax_10 + 0.99) / 0.1

if price_8_min <= price_10_max or price_10_min <= price_8_max:
    print(math.ceil(max(price_8_min, price_10_min)))
else:
    print('-1')


Fixed code:
import math

tax_8, tax_10 = map(int, input().split())

price_8_min = tax_8 / 0.08
price_8_max = (tax_8 + 0.99) / 0.08

price_10_min = tax_10 / 0.1
price_10_max = (tax_10 + 0.99) / 0.1

if max(price_8_min, price_10_min) <= min(price_8_max, price_10_max):
    print(math.ceil(max(price_8_min, price_10_min)))
else:
    print('-1')
Buggy code:
A, B = map(int, input().split())
C = -(-A//0.08)
D = -(-(A+1)//0.08)
for i in range(C,D):
    if i//10 == B:
        break
        print(i)
else:
    print(-1)

Fixed code:
A, B = map(int, input().split())
C = int(-(-A//0.08))
D = int(-(-(A+1)//0.08))
for i in range(C,D):
    if i//10 == B:
      print(i)
      break
else:
    print(-1)
Buggy code:
a, b = map(int, input().split())

def test(n):
    x = n * 8 // 100
    y = n * 10 // 100
    return (x==a) and (y==b)

answer = -1
for n in range(20000):
    if test(n):
        ans = n
        break
print(ans)

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

def test(n):
    x = n * 8 // 100
    y = n * 10 // 100
    return (x == a) and (y == b)

ans = -1
for n in range(20000):
    if test(n):
        ans = n
        break
print(ans)
Buggy code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
 
A, B = map(int,read().split())

def test(n):
    x = n * 8 // 100
    y = n * 10 // 100
    return (x == A) and (y == B)

answer = -1
for n in range(20000):
    if test(n):
        ans = n
        break
print(ans)

Fixed code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
 
A,B = map(int,read().split())
 
def test(n):
    x = n * 8 // 100
    y = n * 10 // 100
    return (x == A) and (y == B)
 
answer = -1
for n in range(20000):
    if test(n):
        answer = n
        break
print(answer)
Buggy code:
a,b=map(int,input().split())
c=a*100//8
d=(a+1)*100//8
e=b*100//10
f=(b+1)*100//10
for i in range(c-d):
  if a+i<e and a+i>f:
    print(a+i)
    break
else:
  print(-1)

Fixed code:
import math
a,b=map(int,input().split())
c = math.ceil(a*100/8)
d = math.ceil((a+1)*100/8)
e = math.ceil(b*100/10)
f = (b+1)*100//10
for i in range(d-c):
  if c+i>=e and c+i<f:
    print(c+i)
    break
else:
  print(-1)
Buggy code:
import math
N,M = map(int,input().split())
n = math.ceil(N/0.08)
m = int(M/0.1)
print(n,m)
ans = 2000
if int(n*0.1) ==M:
  ans = min(n,ans)
if int(m*0.08) ==N:
  ans =min(m,ans)
  
if int(n*0.1)!=M and int(m*0.08)!=N:
  ans = -1
  
print(ans)

Fixed code:
import math
N,M = map(int,input().split())
n = math.ceil(N/0.08)
m = int(M/0.1)
ans = 2000
if int(n*0.1) ==M:
  ans = min(n,ans)
if int(m*0.08) ==N:
  ans =min(m,ans)
  
if int(n*0.1)!=M and int(m*0.08)!=N:
  ans = -1
  
print(ans)
Buggy code:
A, B = map(int, input(). split())
answer = None
flag = False
for i in range(1001):
  
  if (i*0.08//1 = A) and (i*0.1//1 = B):
    print(i)
    flag = True
    break
if (answer = None):
  print(-1)
    


Fixed code:
A, B = map(int, input(). split())
answer = None
flag = False
for i in range(1, 1009):
  
  if (A == (i*0.08)//1) and (B == (i*0.1)//1):
    answer = i
    print(answer)
    flag = True
   
    if flag:
        break
if answer is None:
  answer = -1
  print(answer)
Buggy code:
A, B = map(int,input().split())

count = 0
for n in range(10000):
    za = n*0.08
    zb = n*0.1
    count += 1
    if A == za and B == zb:
        print(n)
        break


if count == 10000:
    print(-1)



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

count = 0

for n in range(10000):
    za = n*0.08
    zb = n*0.1
    count += 1
    if A == math.floor(za) and B == math.floor(zb):
        print(n)
        break


if count == 10000:
    print(-1)
Buggy code:
import math
text = list(map(int, input().split()))

reply = -1
i = 0
while math.floor(i * 0.08) <= text[0] and math.floor(i * 0.1) <= text[1]:
    print([i, math.floor(i * 0.08), math.floor(i * 0.1)])
    if math.floor(i * 0.08) == text[0] and math.floor(i * 0.1) == text[1]:
        reply = i
        break
    i += 1
print(reply)

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

reply = -1
i = 0
while math.floor(i * 0.08) <= text[0] and math.floor(i * 0.1) <= text[1]:
    if math.floor(i * 0.08) == text[0] and math.floor(i * 0.1) == text[1]:
        reply = i
        break
    i += 1
print(reply)
Buggy code:
import math

s = input()

ss = s.split(" ")

TAX_A = 0.08
TAX_B = 0.1

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



ans = 10000
re = False
for i in range(1000,0,-1):
  tax_a = math.floor( i * TAX_A ) 
  tax_b = math.floor( i * TAX_B )
  if tax_a == A and tax_b == B:
    if i < ans :
      print("update ans:" ,i)
      ans = i
      re = True

if re == True:
  print( ans )
else:
  print(-1)



Fixed code:
import math

s = input()

ss = s.split(" ")

TAX_A = 0.08
TAX_B = 0.1

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

ans = 10000
re = False
for i in range(10000,0,-1):
  tax_a = math.floor( i * TAX_A ) 
  tax_b = math.floor( i * TAX_B )
  if tax_a == A and tax_b == B:
    if i < ans :
      ans = i
      re = True

if re == True:
  print( ans )
else:
  print(-1)
Buggy code:

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

if a%2==0:
  lower1=int(a*100/8)
else:
  lower1=a*(100/8)
  upper1=int((a+1)*100/8)
  if (upper1)-int(lower1)<1:
    print(-1)
    sys.exit()
  else:
    lower1=int(lower1)+1
    if lower1=upper1:
      print(-1)
      sys.exit()
    else:
      pass
  
lower2=(b)*10
upper2=(b+1)*10

lower=max(lower1,lower2)
if lower=uppwer1:
  print(-1)
else:
  print(lower)

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

if a%2==0:
  lower1=int(a*100/8)
  upper1=(a+1)*100/8
  upper1=max(lower1,int(upper1)-1)  
else:
  lower1=a*(100/8)
  upper1=int((a+1)*100/8)
  if (upper1)-int(lower1)<=1:
    print(-1)
    sys.exit()
  else:
    lower1=int(lower1)+1
    if lower1==upper1:
      print(-1)
      sys.exit()
    else:
      pass
  
lower2=(b)*10
upper2=(b+1)*10

lower=max(lower1,lower2)
upper=min(upper1,upper2)
if upper-lower<1:
  print(-1)
else:
  print(lower)
Buggy code:
import sys
# import math
# import decimal
# import queue
# import bisect
# import heapq
# import time
# import itertools
# from fractions import Fraction

mod = int(1e9+7)
INF = 1<<29

def main():
    a,b = map(int,input().split())
    ans = []
    x = int(min(a//0.08,b//0.1))
    y = int(max(a//0.08,b//0.1))
    for i in range(x,y+1):
        if int(i*0.08)==a and int(i*0.1)==b:
            ans.append(i)
    if len(ans):
        print(min(ans))
    else:
        print(-1)
    return

if __name__=='__main__':
    main()


Fixed code:
import sys
# import math
# import decimal
# import queue
# import bisect
# import heapq
# import time
# import itertools
# from fractions import Fraction

mod = int(1e9+7)
INF = 1<<29

def main():
    a,b = map(int,input().split())
    ans = []
    x = int(min(a//0.08,b//0.1))
    y = int(max((a+1)//0.08,b//0.1))
    for i in range(x,y+1):
        if int(i*0.08)==a and int(i*0.1)==b:
            ans.append(i)
    if len(ans):
        print(min(ans))
    else:
        print(-1)
    return

if __name__=='__main__':
    main()
Buggy code:
a,b = map(int,input().split())
ans =-1
for i in range(10000,-1,-1):
  money0 = int(i*0.08)
  money1= int(i*0.1)
  if money0==a and money1==b:
    
print(ans)

Fixed code:
a,b = map(int,input().split())
ans =-1
for i in range(10000,-1,-1):
  money0 = int(i*0.08)
  money1= int(i*0.1)
  if money0==a and money1==b:
    ans = i
print(ans)
Buggy code:
# coding: utf-8
A,B = list(map(int, input().split()))

def lr(A, tax):
    if (100 * A) % tax == 0:
        x1_l = 100 * A // tax
    else:
        x1_l = 100 * A // tax + 1
    if (100 * A + 100) % tax == 0:
        x1_r = (100 * A + 100) // tax - 1
    else:
        x1_r = (100 * A + 100) // tax
    print(x1_l, x1_r)
    return list(range(x1_l, x1_r+1))

list8=lr(A,8)
list10=lr(B,10)
ret = []
for val in list8:
    if val in list10:
        ret.append(val)
if len(ret)==0:
    print(-1)
else:
    print(min(ret))



Fixed code:
# coding: utf-8
A,B = list(map(int, input().split()))

def lr(A, tax):
    if (100 * A) % tax == 0:
        x1_l = 100 * A // tax
    else:
        x1_l = 100 * A // tax + 1
    if (100 * A + 100) % tax == 0:
        x1_r = (100 * A + 100) // tax - 1
    else:
        x1_r = (100 * A + 100) // tax
    return list(range(x1_l, x1_r+1))

list8=lr(A,8)
list10=lr(B,10)
ret = []
for val in list8:
    if val in list10:
        ret.append(val)
if len(ret)==0:
    print(-1)
else:
    print(min(ret))
Buggy code:
    import math
    a,b=map(int,input().split())
    answer=False
    for i in range(1,1009):
        if int(i*0.08)==a and int(i*0.10)==b:
            print(i)
            answer=True
            break
    if not answer:
        print(-1)

Fixed code:
a,b=map(int,input().split())
answer=False
for i in range(1,1009):
    if int(i*0.08)==a and int(i*0.10)==b:
        print(i)
        answer=True
        break
if not answer:
     print("-1")
Buggy code:
a,b=map(int,input().split())
print(a,b)

for i in range(1,1250):
    if int(i*0.08)==a and int(i*0.1)==b:
        print(i)
        break
else:
    print(-1)

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

for i in range(1,1250):
    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 n in range(1000):
    xa = n * 0.08
    xb = n * 0.1
    if a == xa and b == xb:
        print(n)
        exit()
print(-1)

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

for n in range(1500):
    xa = int(n * 0.08)
    xb = int(n * 0.1)
    if a == xa and b == xb:
        print(n)
        exit()
print(-1)
Buggy code:
from sys import stdin

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

min_eight_ex_tax = float(A / 0.08)
max_eight_ex_tax = float((A + 1) / 0.08)
min_ten_ex_tax = float(B / 0.1)
max_ten_ex_tax = float((B + 1) / 0.1)

res = float(-1)
for x in range(min_ten_ex_tax, max_ten_ex_tax, 1):
    if min_eight_ex_tax <= x < max_eight_ex_tax:
        res = float(x)
        break
#print(min_eight_ex_tax, max_eight_ex_tax, min_ten_ex_tax, max_ten_ex_tax)
print(int(res))

Fixed code:
from sys import stdin

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

min_eight_ex_tax = float(A / 0.08)
max_eight_ex_tax = float((A + 1) / 0.08)
min_ten_ex_tax = int(B / 0.1)
max_ten_ex_tax = int((B + 1) / 0.1)

res = float(-1)
for x in range(min_ten_ex_tax, max_ten_ex_tax, 1):
    if min_eight_ex_tax <= x < max_eight_ex_tax:
        res = float(x)
        break
#print(min_eight_ex_tax, max_eight_ex_tax, min_ten_ex_tax, max_ten_ex_tax)
print(int(res))
Buggy code:
import math
a,b=map(int,input().split())
answer=False
for i in range(1,1009):
    if math.floor(i*0.8)==math.floor(b*10):
        print(i)
        answer=True
        break
if not answer:
    print(-1)

Fixed code:
import math
a,b=map(int,input().split())
answer=False
for i in range(1,1009):
    if math.floor(i*0.08)==a and math.floor(i*0.10)==b:
        print(i)
        answer=True
        break
if not answer:
    print(-1)
Buggy code:
from math import ceil,floor

numA,numB = map(int,input().split())
for i in range(10000):
  testA = floor(i * 0.08)
  testB = floor(i * 0.10)
  if testA >= numA and testB >= numB:
    print(i)
    break
else:
  print("-1")

Fixed code:
from math import ceil,floor

numA,numB = map(int,input().split())
for i in range(10000):
  testA = floor(i * 0.08)
  testB = floor(i * 0.10)
  if testA == numA and testB == numB:
    print(i)
    break
else:
  print("-1")
Buggy code:
A, B = list(map(int,input().split()))
list_i = []
for i in range(1000):
    if A <= i * 8 / 100 < A + 1:
        list_i.append(i)
    else:
        pass
            
        
list_j = []
for j in range(1000):
    if B <= j * 10 / 100 < B + 1:
        list_j.append(j)
    else:
        pass
            
    
s_i = set(list_i)
s_j = set(list_j)
list_w = s_j & s_i
if not list_w :
    print(list_i, list_j, -1)   
else:
     print(min(list_w))
    

Fixed code:
A, B = list(map(int,input().split()))
list_i = []
for i in range(1100):
    if A <= i * 8 / 100 < A + 1:
        list_i.append(i)
    else:
        pass
            
        
list_j = []
for j in range(1100):
    if B <= j * 10 / 100 < B + 1:
        list_j.append(j)
    else:
        pass
            
    
s_i = set(list_i)
s_j = set(list_j)
list_w = s_j & s_i
if not list_w :
    print(-1)   
else:
     print(min(list_w))
Buggy code:
taxs = input().split(" ")
 
a = int(taxs[0])
b = int(taxs[1])
 
product_min = int(a / 0.08)
product_max = int((a+1) / 0.08)

for product in range( product_min, product_max ):
	bpred = int(product * 0.1)
	if( bpred == b ):
  		print( product )
        break

print( -1 )

Fixed code:
taxs = input().split(" ")
 
a = int(taxs[0])
b = int(taxs[1])
 
product_min = int(a / 0.08 + 0.5)
product_max = int((a+1) / 0.08)

setflg = 0
for product in range( product_min, product_max ):
  bpred = int(product * 0.1)
  if( bpred == b ):
    print( product )
    setflg=1
    break

if setflg==0:
  print( -1 )
Buggy code:
A, B = map(int, input().split())
x_a = int(A * 100 / 8)
x_b = int(B * 100 / 10)
l = [i for i in range(x_b, x_a + 1)]
print(l)
for n in l:
    if int(n * 0.08) == A and int(n * 0.10) == B:
        print(n)
        break
else:
    print(-1)

Fixed code:
A, B = map(int, input().split())
x_a = int((A-1) * 100 / 8)
x_b = int((B+1) * 100 / 10)
l = [i for i in range(min(x_a, x_b)-1, max(x_a, x_b)+1)]
for n in l:
    if int(n * 0.08) == A and int(n * 0.10) == B:
        print(n)
        break
else:
    print(-1)
Buggy code:
import math

A,B = map(int,input().split())
anser = 0
for i in range(0, 101):
    if i * 0.08 == A:
        if math.floor(i * 0.1) == B:
            anser = i
    else:
        anser = -1

print(anser)

Fixed code:
import math

A,B = map(int,input().split())
anser = 0
for i in range(1, 1100):
    if math.floor(i * 0.08) == A:
        if math.floor(i * 0.1) == B:
            anser = i
            break
    else:
        anser = -1

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

for x in range(10000):
    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(10000):
    if (int(x*0.08)==A and int(x*0.1)==B):
        print(x)
        break
else:
    print("-1")
Buggy code:
# -*- coding: utf-8 -*-
# @Time    : 2020/3/1 19:59
# @Author  : DIRICHLET
# @File    : main.py
a=[]
def myin(fun=int):
    global a
    a=list(map(fun,input().split()))
#myin(int)
a,b=map(int,input().split())
oner=(a+1)/0.08
if a%2==0:
    oner=round((a+1)/2*25)+1
    onel=a//2*25
else:
    oner=(a+1)/2*25
    onel=round(a/2*25)+1
#*25/2
twol=b*10
if oner>twol and (b+1)*10>oner:
    if onel<=twol:
        print(twol)
    else:
        print(onel)
else:
    print(-1)
#print(a)
#[25,37.5) [20,30)
#[19-20) [99-100) 99.5-18.5=81/0.02=4050
#(231.35,243.75] (985,995]
#

Fixed code:
# -*- coding: utf-8 -*-
# @Time    : 2020/3/1 19:59
# @Author  : DIRICHLET
# @File    : main.py
a=[]
def myin(fun=int):
    global a
    a=list(map(fun,input().split()))
#myin(int)
a,b=map(int,input().split())
oner=(a+1)/0.08
if a%2==0:
    oner=a//2*25+13
    onel=a//2*25
else:
    oner=(a+1)/2*25
    onel=(a-1)//2*25+13
#*25/2
twol=b*10
twor=b*10+10
l=[[onel,oner],[twol,twor]]
if l[0][0]>l[1][0]:
    l = [[twol, twor],[onel, oner], ]

if l[1][0]<l[0][1]:
    print(l[1][0])
else:
    print(-1)

#print(a)
#[25,37.5) [20,30)
#[19-20) [99-100) 99.5-18.5=81/0.02=4050
#(231.35,243.75] (985,995]
#
Buggy code:
A, B = [int(i) for i in input().split()]

ans = []

true_A_max = A + 0.999
true_B_max = B + 0.999

X_A = math.floor(A / 0.08)
X_max_A = math.ceil(true_A_max /0.08)
X_B = math.floor(B / 0.1)
X_max_B = math.ceil(true_B_max /0.08)

if X_max_A - X_A >= X_max_B - X_B:
    X_min = X_B
    X_max = X_max_B

else:
    X_min = X_A
    X_max = X_max_A

for X in range(X_min, X_max):
    cal_A = math.floor(X * 0.08)
    cal_B = math.floor(X * 0.1)
    
    if cal_A == A and cal_B == B:
        ans.append(X)
            
if len(ans) > 0:
    print(min(ans))
else:
    print(-1)

Fixed code:
import math

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

ans = []

true_A_max = A + 0.999
true_B_max = B + 0.999

X_A = math.floor(A / 0.08)
X_max_A = math.ceil(true_A_max /0.08)
X_B = math.floor(B / 0.1)
X_max_B = math.ceil(true_B_max /0.08)

if X_max_A - X_A >= X_max_B - X_B:
    X_min = X_B
    X_max = X_max_B

else:
    X_min = X_A
    X_max = X_max_A

for X in range(X_min, X_max):
    cal_A = math.floor(X * 0.08)
    cal_B = math.floor(X * 0.1)
    
    if cal_A == A and cal_B == B:
        ans.append(X)
            
if len(ans) > 0:
    print(min(ans))
else:
    print(-1)
Buggy code:
import sys
a, b = map(int, sys.stdin.readline().split())
i = 0
res = -1
while i <= 1000:
  if int(i*0.08) == int(i*0.1):
    res = i
    break
  i += 1
print(res)

Fixed code:
import sys
a, b = map(int, sys.stdin.readline().split())
i = 0
res = -1
while i <= 1000:
  if int(i*0.08) == a and int(i*0.1) == b:
    res = i
    break
  i += 1
print(res)