Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
s = input()
t = input()
result = len([_ for a,b in zip(s,t) if a != b])
print(result)

Fixed submission:
s = input()
t = input()
result = len([a for a,b in zip(s,t) if a != b])
print(result)

Buggy python submission (verdict: Runtime Error):
s = input()
t = input()
result = len([e for a,b in zip(s,t) if a != b])
print(result)

Fixed submission:
s = input()
t = input()
result = len([a for a,b in zip(s,t) if a != b])
print(result)

Buggy python submission (verdict: Runtime Error):
s = input()
t = input()
result = len([e for a,b in zip(s,t) if a != b])
print(result)

Fixed submission:
s = input()
t = input()
result = len([a for a,b in zip(s,t) if a != b])
print(result)

Buggy python submission (verdict: Runtime Error):
s  = input()
t = input()
result = len([e for a,b in zip(s,t) if a != b])
print(result)

Fixed submission:
s = input()
t = input()
result = len([a for a,b in zip(s,t) if a != b])
print(result)

Buggy python submission (verdict: Runtime Error):
s  = input()
t = input()
result = len([e for a,b in zip(s,t) if a != b])
print(result)

Fixed submission:
s = input()
t = input()
result = len([a for a,b in zip(s,t) if a != b])
print(result)

Buggy python submission (verdict: Runtime Error):
s  = input()
t = input()
result = len([a,b for a,b in zip(s,t) if a != b])
print(result)

Fixed submission:
s = input()
t = input()
result = len([a for a,b in zip(s,t) if a != b])
print(result)
Buggy python submission (verdict: Runtime Error):
n = input()
l = [int(e) for e in input().split(" ")]
res = 1
for e in l:
    res = res*e
if res > 1e+18:
    print("-1")
else:
    print(res)

Fixed submission:
a,b = [int(e) for e in input().split(" ")]
print(a*b)
Buggy python submission (verdict: Time Limit Exceeded):
from operator import mul
from functools import reduce
n = input()
tmp = input().split(" ")
l = (int(e) for e in tmp)
res = 1
res = reduce(mul,l)
if res > 1e+18:
    print("-1")
else:
    print(res)

Fixed submission:
from operator import mul
from functools import reduce
n = input()
tmp = input().split(" ")
l = sorted([int(e) for e in tmp])
def solve():
    res = 1
    for e in l:
        res = e*res
        if res > 1e+18:
            print("-1")
            return
    print(res)
solve()

Buggy python submission (verdict: Time Limit Exceeded):
from operator import mul
from functools import reduce
n = input()
tmp = input().split(" ")
l = (int(e) for e in tmp)
res = 1
res = reduce(mul,l)
if res > 1e+18:
    print("-1")
else:
    print(res)

Fixed submission:
from operator import mul
from functools import reduce
n = input()
tmp = input().split(" ")
l = sorted([int(e) for e in tmp])
def solve():
    res = 1
    for e in l:
        res = e*res
        if res > 1e+18:
            print("-1")
            return
    print(res)
solve()

Buggy python submission (verdict: Time Limit Exceeded):
from operator import mul
from functools import reduce
n = input()
l = (int(e) for e in input().split(" "))
res = 1
res = reduce(mul,l)
if res > 1e+18:
    print("-1")
else:
    print(res)

Fixed submission:
from operator import mul
from functools import reduce
n = input()
tmp = input().split(" ")
l = sorted([int(e) for e in tmp])
def solve():
    res = 1
    for e in l:
        res = e*res
        if res > 1e+18:
            print("-1")
            return
    print(res)
solve()

Buggy python submission (verdict: Time Limit Exceeded):
from operator import mul
from functools import reduce
n = input()
l = [int(e) for e in input().split(" ")]
res = 1
res = reduce(mul,l)
if res > 1e+18:
    print("-1")
else:
    print(res)

Fixed submission:
from operator import mul
from functools import reduce
n = input()
tmp = input().split(" ")
l = sorted([int(e) for e in tmp])
def solve():
    res = 1
    for e in l:
        res = e*res
        if res > 1e+18:
            print("-1")
            return
    print(res)
solve()

Buggy python submission (verdict: Time Limit Exceeded):
n = input()
l = [int(e) for e in input().split(" ")]
res = 1
for e in l:
    res = res*e
if res > 1e+18:
    print("-1")
else:
    print(res)

Fixed submission:
from operator import mul
from functools import reduce
n = input()
tmp = input().split(" ")
l = sorted([int(e) for e in tmp])
def solve():
    res = 1
    for e in l:
        res = e*res
        if res > 1e+18:
            print("-1")
            return
    print(res)
solve()
Buggy python submission (verdict: Runtime Error):
n,r = input().split()

if n<10:
	print(r-100*(10-n))
else:
	print(r)

Fixed submission:
n,r = map(int,input().split())
if n < 10:
    print(r+(100*(10-n)))
else:
    print(r)
Buggy python submission (verdict: Runtime Error):
s,t = input().split()
sn,tn = map(int,input().split())
u  = input()

if s == u:
    print((sn-1) + ' '+ tn)
else:
    print(sn + ' ' + (tn-1))

Fixed submission:
s,t = input().split()
sn,tn = map(int,input().split())
u  = input()

if s == u:
    print(str(sn-1) + ' '+ str(tn))
else:
    print(str(sn) + ' ' + str(tn-1))

Buggy python submission (verdict: Runtime Error):
s,t = input().split()
sn,tn = map(int,input().split())
u  = input()

if s == u:
	print((sn-1) ' '+ (tn))
else:
	print(sn + '' + (tn-1))

Fixed submission:
s,t = input().split()
sn,tn = map(int,input().split())
u  = input()

if s == u:
    print(str(sn-1) + ' '+ str(tn))
else:
    print(str(sn) + ' ' + str(tn-1))
Buggy python submission (verdict: Runtime Error):
from math import ceil
a,b = map(int,input().split())

print(ceil(a,b))

Fixed submission:
from math import ceil

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

print(ceil(a/b))
Buggy python submission (verdict: Runtime Error):
b,a = input().split()
print(''.join([a,b].strip())

Fixed submission:
b,a = input().split()
print(''.join([a,b]).strip())
Buggy python submission (verdict: Runtime Error):
a,b = map(int,int().split())
print(0 if b*2>=a else a-b*2)

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

print(0 if b*2>=a else a-b*2)
Buggy python submission (verdict: Runtime Error):
from math import ceil
n= input()
print(ceil(n/2)/n)

Fixed submission:
from math import ceil
n= int(input())
print(ceil(n/2)/n)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = [int(e) for e in input().split()]

ans ='Yes' if max(a)>= sum([e for e in a]-max(a)) else 'No'
print(ans)

Fixed submission:
n = int(input())
a = [int(e) for e in input().split()]

ans ='No' if max(a)>= sum([e for e in a])-max(a) else 'Yes'
print(ans)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = [int(e) for e in input().split()]

print('Yes' if max(a)>= sum([e for e in a]-max(a)) else 'No')

Fixed submission:
n = int(input())
a = [int(e) for e in input().split()]

ans ='No' if max(a)>= sum([e for e in a])-max(a) else 'Yes'
print(ans)
Buggy python submission (verdict: Runtime Error):
n,t=list(input())
ts = list(input())
print(sum([min(t, next - prev) for prev, next in zip(ts, ts[1:])], t))

Fixed submission:
n,t = list(map(int,input().split()))
ts = list(map(int,input().split()))
print(sum([min(t, next - prev) for prev, next in zip(ts, ts[1:])], t))
Buggy python submission (verdict: Runtime Error):
[N,M,K]=map(int,(input().split()))
A=[0]*N
B=[0]*M
A=list(map(int,input().split()))
B=list(map(int,input().split()))



Kc=K
bookc=0

Ai=0
Bi=0

while Kc>0:
    if Ai<N:
        if Bi<M:
            if A[Ai]<=B[Bi] and A[Ai]<=Kc:
                bookc+=1
                Kc-=A[Ai]
                Ai+=1

            elif B[Bi]<=Kc:
                bookc+=1
                Kc-=B[Bi]
                Bi+=1
            else:
                break
        elif A[Ai]<=Kc:
            bookc+=1
            Kc-=A[Ai]
            Ai+=1
        else:
            break
    elif Bi<M:
        if B[Bi]<=Kc:
            bookc+=1
            Kc-=B[Bi]
            Bi+=1
        else:
            break
    if Ai==N and Bi==M:
        break

print(bookc)





    
        

Fixed submission:
a=int(input())
print(a+a**2+a**3)

Buggy python submission (verdict: Runtime Error):
import math
n,m,k = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
a.append(10**10)
b.append(10**10)

if a[0]>k and b[0]>k:
  print(0)
else:
  if sum(a)+sum(b)<=k:
    print(n+m)
  else:
    ans=0
    time=0
    for i in range(n+m):
      ans += 1    
      if a[0]<=b[0]:
        time+=a.pop(0)
      else:
        time+=b.pop(0)
      
      if time>k:
        break
    print(ans-1)

Fixed submission:
a = int(input())

ans = a + a*a + a*a*a
ans = int(ans)

print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input()) 

ans='' 

while N>0:
	N -= 1
	ans += chr(ord('a') + N % 26) 
    N  = N//26
    
print(ans[::-1])


Fixed submission:
N = int(input()) 

ans='' 

while N>0:
	N -= 1
	ans += chr(ord('a') + N % 26) 
	N = N//26
    
print(ans[::-1])

Buggy python submission (verdict: Runtime Error):
N = int(input()) 

ans='' 

while N>0:
	N -= 1
	ans += chr(ord('a') + N % 26) 
    N //= 26
    
print(ans[::-1])


Fixed submission:
N = int(input()) 

ans='' 

while N>0:
	N -= 1
	ans += chr(ord('a') + N % 26) 
	N = N//26
    
print(ans[::-1])

Buggy python submission (verdict: Runtime Error):
N = int(input()) 

ans='' 

while N>0:
	N -= 1
	ans += chr(ord('a') + N % 26) 
    N //= 26
    
print(ans[::-1])

Fixed submission:
N = int(input()) 

ans='' 

while N>0:
	N -= 1
	ans += chr(ord('a') + N % 26) 
	N = N//26
    
print(ans[::-1])
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
ans = 1
c=list(map(int, input().split()))
  
for i in range(n):
  ans *= c[i]

if ans>10**18:
  print(-1)
else:
  print(ans)




Fixed submission:
n = int(input())
ans = 1
c=list(map(int, input().split()))

if 0 in c:
  print(0)
  
else:
  for i in range(n):
    ans *= c[i]
    if ans>10**18:
      print(-1)
      break
    
  if ans<=10**18:
    print(ans)
Buggy python submission (verdict: Runtime Error):
a,b,c,d,e = map(int,input.split())

time = c*60+d-a*60-b

if time>=e:
  print(time-e)
else:
  print(0)

Fixed submission:
a,b,c,d,e = map(int,input().split())

time = c*60+d-a*60-b

if time>=e:
  print(time-e)
else:
  print(0)
Buggy python submission (verdict: Time Limit Exceeded):
a,b,n = map(int,input().split())

x = list()
if n<=b:
  for i in range(n+1):
    y = int(a*i/b) - a*int(i/b)
    x.append(y)
else:
  for i in range(b):
    y = int(a*i/b) - a*int(i/b)
    x.append(y)
x = sorted(x)
print(x[-1])

Fixed submission:
a,b,n=map(int,input().split())
x=min(b-1,n)
print((a*x)//b-a*(x//b))

Buggy python submission (verdict: Runtime Error):
a,b,n = map(int,input().split())

x = list()
if n<=b:
  for i in range(n+1):
    y = int(a*i/b) - a*int(i/b)
    x.append(y)
else:
  for i in range(b):
    y = int(a*i/b) - a*int(i/b)
    x.append(y)
x = sort(x)
print(x[-1])


Fixed submission:
a,b,n=map(int,input().split())
x=min(b-1,n)
print((a*x)//b-a*(x//b))

Buggy python submission (verdict: Time Limit Exceeded):
import bisect
a,b,n = map(int,input().split())

x = list()
if n<=b:
  for i in range(n+1):
    y = int(a*i/b) - a*int(i/b)
    x.insert(bisect.bisect_left(x,y),y)
else:
  for i in range(b):
    y = int(a*i/b) - a*int(i/b)
    x.insert(bisect.bisect_left(x,y),y)

print(x[-1])


Fixed submission:
a,b,n=map(int,input().split())
x=min(b-1,n)
print((a*x)//b-a*(x//b))

Buggy python submission (verdict: Time Limit Exceeded):
import bisect
a,b,n = map(int,input().split())

x = list()
for i in range(n):
  y = int(a*(i+1)/b) - a*int((i+1)/b)
  x.insert(bisect.bisect_left(x,y),y)

print(x[-1])

Fixed submission:
a,b,n=map(int,input().split())
x=min(b-1,n)
print((a*x)//b-a*(x//b))

Buggy python submission (verdict: Runtime Error):
import bisect
a,b,n = map(int,input().split())

x = list()
for i in range(n):
  y = int(a*(i+1)/b) - a*int((i+1)/b)
  x.insert(bisect.bisect_left(x,y))

print(x[-1])


Fixed submission:
a,b,n=map(int,input().split())
x=min(b-1,n)
print((a*x)//b-a*(x//b))

Buggy python submission (verdict: Time Limit Exceeded):
a,b,n = map(int,input().split())

x = list()
for i in range(n):
  y = int(a*(i+1)/b) - a*int((i+1)/b)
  x.append(y)

z = sorted(x)
print(z[-1])

Fixed submission:
a,b,n=map(int,input().split())
x=min(b-1,n)
print((a*x)//b-a*(x//b))
Buggy python submission (verdict: Runtime Error):
s,w = map(int,input().split())

if s<=W:
  print('unsafe')
else:
  print('safe')

Fixed submission:
s,w = map(int,input().split())

if s<=w:
  print('unsafe')
else:
  print('safe')
Buggy python submission (verdict: Runtime Error):
import math
a,b,c,d = map(int,input().split())

a = math.ceil(a//d)
b = math.ceil(b//c)
if = a<=b:
  print('Yes')
else:
  print('No')

Fixed submission:
import math
a,b,c,d = map(int,input().split())

a = math.ceil(a/d)
b = math.ceil(c/b)
if a<b:
  print('No')
else:
  print('Yes')
Buggy python submission (verdict: Runtime Error):
N = input();
  
if N[0] == "7" or N[1] == "7" or N[2] == "7":
    print("Yes");
  else:
    print("No");


Fixed submission:
num = input();

if num[0] == "7" or num[1] == "7" or num[2] == "7" :
  print("Yes");
else:
  print("No");

Buggy python submission (verdict: Runtime Error):
N = input()
  
if N[0] == "7" or N[1] == "7" or N[2] == "7":
    print("Yes")
  else:
    print("No")


Fixed submission:
num = input();

if num[0] == "7" or num[1] == "7" or num[2] == "7" :
  print("Yes");
else:
  print("No");

Buggy python submission (verdict: Runtime Error):
N = input()
  
if N[0] == 7 or N[1] == 7 or N[2] == 7:
    print("Yes")
  else:
    print("No")

Fixed submission:
num = input();

if num[0] == "7" or num[1] == "7" or num[2] == "7" :
  print("Yes");
else:
  print("No");

Buggy python submission (verdict: Runtime Error):
N = input()
 
a = int(N/100)
b = int( (N-a*100)/10 )
c = int(N-a*100-b*10)
 
if( a == 7 or b == 7 or c == 7 ):
    print("Yes")
  else:
    print("No")

Fixed submission:
num = input();

if num[0] == "7" or num[1] == "7" or num[2] == "7" :
  print("Yes");
else:
  print("No");

Buggy python submission (verdict: Runtime Error):
N = input()
 
a = int(N/100)
b = int( (N-a*100)/10 )
c = int(N-a*100-b*10)
 
if a == 7 or b == 7 or c == 7:
    print("Yes")
  else:
    print("No")

Fixed submission:
num = input();

if num[0] == "7" or num[1] == "7" or num[2] == "7" :
  print("Yes");
else:
  print("No");

Buggy python submission (verdict: Runtime Error):
N = input()

a = int(N/100)
b = int( (N-a*100)/10 )
c = int(N-a*100-b*10)

if a == 7 or b == 7 or c == 7
    print("Yes")
  else print("No")
  

Fixed submission:
num = input();

if num[0] == "7" or num[1] == "7" or num[2] == "7" :
  print("Yes");
else:
  print("No");
Buggy python submission (verdict: Runtime Error):
line = input().split

X = line[0]
Y = line[1]
Z = line[2]

print( str(Y) + " " + str(X) + " " + str(Z) )


Fixed submission:
X,Y,Z = map(int,input().split())

print(str(Z) + " " + str(X) + " " + str(Y))

Buggy python submission (verdict: Runtime Error):
line = input().split

X = line[0]
Y = line[1]
Z = line[2]

print( Z + " " + X + " " + Y )


Fixed submission:
X,Y,Z = map(int,input().split())

print(str(Z) + " " + str(X) + " " + str(Y))

Buggy python submission (verdict: Runtime Error):
line = input().split

X = line[0]
Y = line[1]
Z = line[2]

print( str(Y) + " " + str(X) + " " + str(Z) )


Fixed submission:
X,Y,Z = map(int,input().split())

print(str(Z) + " " + str(X) + " " + str(Y))

Buggy python submission (verdict: Runtime Error):
line = input().split

X = line[0]
Y = line[1]
Z = line[2]

print( Y + " " + X + " " + Z )

Fixed submission:
X,Y,Z = map(int,input().split())

print(str(Z) + " " + str(X) + " " + str(Y))
Buggy python submission (verdict: Runtime Error):
N,M = map(int,input().split)

x = int( N*(N-1)/2 + M*(M-1)/2 )

print(x)

Fixed submission:
N,M = map(int,input().split())

x = int( N*(N-1)/2 + M*(M-1)/2 )

print(x)
Buggy python submission (verdict: Runtime Error):
s = str(input())
k = len(s)

cnt=0
for i in range(k):
  if s[i]=!s[int((n+1)/2)-i]:
    cnt+=1
  if s[int((n+3)/2)+i]=!s[int((3*n+3)/2)-i]:
    cnt+=1

if cnt==0:
  print('Yes')
else:
  print('No')


Fixed submission:
s = input()
n = len(s) // 2

if s[:n] == s[-n:]:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
x = str(input())

if x="AAA" or x="BBB":
  print("Yes")
else:
  print("No")
  


Fixed submission:
x = input()

if x[0]==x[1]==x[2]:
  print("No")
else:
  print("Yes")
Buggy python submission (verdict: Runtime Error):
n,a,b = map(int,input().split())

x = n//(a+b)
y = (n-x*(a+b))//a

if y!=0:
  print(a*x+a)
else:
  print(a*x+n-(a+b)*x)

Fixed submission:
n, a, b = map(int, input().split())
quo = n // (a+b)
rem = n % (a+b)
ans = quo*a
if rem == 0:
    print(ans)
elif rem < a:
    print(ans + rem)
else:
    print(ans + a)
Buggy python submission (verdict: Runtime Error):
N = input()

if N%2==0:
  print(N/2)
else:
  print((N+1)/2)

Fixed submission:
n = int(input())

ans = n//2 +n%2

print(ans)
Buggy python submission (verdict: Runtime Error):
s,t = map(int,input().split())
a,b = map(int,input().split())
u =map(int,input().split())

if s==u:
  print( a-1,b)
else:
  print( a,b-1)

Fixed submission:
s,t = map(str,input().split())
a,b = map(int,input().split())
u =input()

if u==s:
  a -=1
else:
  b -=1
  
print(a,b)

Buggy python submission (verdict: Runtime Error):
s,t = map(int,input().split())
a,b = map(int,input().split())
u =map(int,input().split())

if s==u:
  print( str(a-1) +" "+ str(b) )
else:
  print( str(a) +" "+ str(b-1) ) 

Fixed submission:
s,t = map(str,input().split())
a,b = map(int,input().split())
u =input()

if u==s:
  a -=1
else:
  b -=1
  
print(a,b)
Buggy python submission (verdict: Runtime Error):
c = str(input())

alp = abcdefghijklmnopqrstuvwxyz

k=0
while k<25:
  if c == alp[k]:
    print(alp[k+1])
  else:
    k+=1
    

Fixed submission:
c=input()
al='abcdefghijklmnopqrstuvwxyz'
for x in range(26):
    if c==al[x]:
        print(al[x+1])
Buggy python submission (verdict: Runtime Error):
s,t =,map(str,input().split())

x = str(t) + str(s)

print(x)


Fixed submission:
s,t = map(str,input().split())

print(t+s)

Buggy python submission (verdict: Runtime Error):
s,t =,map(str,input().split())

x = t+s

print(x)


Fixed submission:
s,t = map(str,input().split())

print(t+s)
Buggy python submission (verdict: Runtime Error):
a = input()
b = input()

print(6-a-b)


Fixed submission:
a = int(input())
b = int(input())

print(6-a-b)

Buggy python submission (verdict: Runtime Error):
a = input(),b = input()

print(6-a-b)

Fixed submission:
a = int(input())
b = int(input())

print(6-a-b)
Buggy python submission (verdict: Runtime Error):
s = str(input())

days = ['SUN','MON','TUE','WED','THU','FRI','SAT']

k=1
while k<=7:
  if s==days[k]:
    print(k)
  else:
    k+=1
    


Fixed submission:
s = str(input())

days = ['SUN','MON','TUE','WED','THU','FRI','SAT']

print(7-days.index(s))

Buggy python submission (verdict: Runtime Error):
s = str(input())

days = [SUN,MON,TUE,WED,THU,FRI,SAT]

k=1
while k<=7:
  if s==days[k]:
    print(k)
  else:
    k+=1
    

Fixed submission:
s = str(input())

days = ['SUN','MON','TUE','WED','THU','FRI','SAT']

print(7-days.index(s))
Buggy python submission (verdict: Runtime Error):
n = int(input())

if n%2==0:
  print(0.5)
else:
  print((n+1)/2n)


Fixed submission:
n = int(input())

if n%2==0:
  print(1/2)
else:
  print((n+1)/(2*n))

Buggy python submission (verdict: Runtime Error):
n = int(input())

if n%2==0:
  print(1/2)
else:
  print((n+1)/2n)


Fixed submission:
n = int(input())

if n%2==0:
  print(1/2)
else:
  print((n+1)/(2*n))

Buggy python submission (verdict: Runtime Error):
n = int(input())

if n%2==0:
  print(1/2)
else:
  print((n-1)/2n)

Fixed submission:
n = int(input())

if n%2==0:
  print(1/2)
else:
  print((n+1)/(2*n))
Buggy python submission (verdict: Runtime Error):
s = str(input())

w = ['Sunny','Cloudy','Rainy']

print(w[w.index(s)+1])

Fixed submission:
s = str(input())

w = ['Sunny','Cloudy','Rainy']

print(w[( w.index(s)+1) %3] )
Buggy python submission (verdict: Runtime Error):
n = input()

print(n**3)

Fixed submission:
n = int(input())

print(n**3)
Buggy python submission (verdict: Runtime Error):
a = input()
s = input()

if a>=3200:
  print(s)
else:
  print("red")

Fixed submission:
a = int(input())
s = input()

if a>=3200:
  print(s)
else:
  print("red")
Buggy python submission (verdict: Runtime Error):
N = input()
A = input()
B = input()
if ( N*A <= B ):
	print(N*A)
else:
	print(B)


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

print(min(n*a,b))

Buggy python submission (verdict: Runtime Error):
N = input()
A = input()
B = input()
if ( N*A <= B ){
	print(N*A)
}
else print(B)


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

print(min(n*a,b))
Buggy python submission (verdict: Runtime Error):
a,p = map(int,input().split())

print int((3*a+p)/2)

Fixed submission:
a,p = map(int,input().split())

print(int((3*a+p)/2))
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
if a<b:
  print(2*b-1)
elif a=b:
  print(2*a)
else:
  print(2*a-1)

Fixed submission:
a,b = map(int,input().split())
if a<b:
  print(2*b-1)
elif a==b:
  print(2*a)
else:
  print(2*a-1)
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split())

if int(b/a) >= c:
  print(c)
elif:
  print(int(b/a))


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

if b//a >= c:
  print(c)
else:
  print(b//a)

Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split())

if b//a >= c:
  print(c)
elif:
  print(b//a)

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

if b//a >= c:
  print(c)
else:
  print(b//a)
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split())

print(9*max(a+b+c)+a+b+c)

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

print(9*max(a,b,c)+a+b+c)
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split())

a = abs(a-b),b = abs(b-c),c = abs(c-a)

print(a+b+c-max(a,b,c))

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

print(max(a,b,c)-min(a,b,c))
Buggy python submission (verdict: Runtime Error):
A = input()
B = input()
C = input()
D = input()
L = int(A)+int(B)
R = int(C)+int(D)
if L>R:
  print("Left")
elif L == R:
  print("Balanced")
else :
  print("Right")

Fixed submission:
A = input().split(" ")
L = int(A[0])+int(A[1])
R = int(A[2])+int(A[3])
if L>R:
  print("Left")
elif L == R:
  print("Balanced")
else :
  print("Right")

Buggy python submission (verdict: Runtime Error):
A = input()
B = input()
C = input()
D = input()
L = str(A)+str(B)
R = str(C)+str(D)
if L>R:
  print("Left")
elif L == R:
  print("Balanced")
else :
  print("Right")

Fixed submission:
A = input().split(" ")
L = int(A[0])+int(A[1])
R = int(A[2])+int(A[3])
if L>R:
  print("Left")
elif L == R:
  print("Balanced")
else :
  print("Right")

Buggy python submission (verdict: Runtime Error):
A = 10
B= 1
C= 2
D= 3
L = A + B
R = C + D
if L > R:
  print(Left)
elif L == R:
  print(Balanced)
else :
  print(Right)

Fixed submission:
A = input().split(" ")
L = int(A[0])+int(A[1])
R = int(A[2])+int(A[3])
if L>R:
  print("Left")
elif L == R:
  print("Balanced")
else :
  print("Right")
Buggy python submission (verdict: Runtime Error):
import math
num1 = int(input())
num2 = int(input())
X = (num1 + num2)/2
print(math.ceil(X))

Fixed submission:
import math
num =input().split(" ")
#print(num)
X = (int(num[0]) + int(num[1]))/2
print(math.ceil(X))
Buggy python submission (verdict: Runtime Error):
a = input()
print(a + a*a + a*a*a)

Fixed submission:
a = input()
a = int(a)
print(a + a**2 + a**3)

Buggy python submission (verdict: Runtime Error):
a = input()
print(a + a**2 + a**3)

Fixed submission:
a = input()
a = int(a)
print(a + a**2 + a**3)

Buggy python submission (verdict: Runtime Error):
a = input()
print(a + a**2 + a**3)

Fixed submission:
a = input()
a = int(a)
print(a + a**2 + a**3)