Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
string = list(int(input()))

if string[0] + string[1] + string[2] == 0:
  print(0)
elif string[0] + string[1] + string[2] == 1:
  print(1)
else:
  print(2)


Fixed submission:
a, b, c = map(int, input())
k = 0
for i in a, b, c:
  if i == 1:
      k += 1
  else:
      pass
print(k)

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

if '1' * 1 in a, b, c:
  print('1')
elif '1' * 2 in a, b, c:
  print('2')
else:
  print('3')

Fixed submission:
a, b, c = map(int, input())
k = 0
for i in a, b, c:
  if i == 1:
      k += 1
  else:
      pass
print(k)
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=input().split()
a2=[int(z) for z in a]
count=0
while True:
  sub=0
  for i in range(n):
    if a2[i]%2!=0:
      break
    else:
      sub+=1
  if sub==n:
    ount+=1
    a2=[int(a2[d]/2) for d in range(n)]
  else:
    break
print(count)

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

cnt = 0
while True:
  li_yojo = [a % 2 for a in lis]
  if li_yojo.count(0) != N:
    break
  else:
    lis = [ a / 2 for a in lis ]
    cnt += 1
print(cnt)
Buggy python submission (verdict: Runtime Error):
h = [2,4,5,7,9]
p = [0,1,6,8]
b = [3]

n = input()

n = n % 10

if n in h:
  print 'hon'
elif n in p:
  print 'pon'
elif n in b:
  print 'bon'

Fixed submission:
h = [2,4,5,7,9]
p = [0,1,6,8]
b = [3]

n = int(input())

n = n % 10

if n in h:
  print('hon')
elif n in p:
  print('pon')
elif n in b:
  print('bon')
Buggy python submission (verdict: Runtime Error):
import math
import numpy as np
a, b, h, m = input().split()
x = a**2 + b**2 -(2*a*b*cos(((m-5*h)/60)*math.pi))
x = np.sqrt(x)
print(x)

Fixed submission:
import math
s = input().split()
a = int(s[0])
b = int(s[1])
h = int(s[2])
m = int(s[3])
th = 30*h + m/2
tm = 6*m
#print(j)
j = math.cos(math.radians(abs(th-tm)))
#print(j)
x = a**2 + b**2 -(2*a*b*j)
x = math.sqrt(x)
print(x)
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = input()

count = 0
for i in range(n):
  if s[i] == "A":
    if s[i+1] == "B":
      if s[i+2] == "C":
        count += 1
print(count)

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

count = 0
for i in range(n-2):
  if s[i] == "A":
    if s[i+1] == "B":
      if s[i+2] == "C":
      	count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
import itertools

n = int(input())
p_list = tuple(map(int, input().split()))
q_list = tuple(map(int, input().split()))

seq = [i for i in range(1,n+1)]
seq_list = list(itertools.permutations(seq))
sorted_seq = sorted(seq_list)

for i in range(1, len(sorted_seq)):
  if p_list == sorted_seq[i]:
    a = i
  if q_list == sorted_seq[i]:
    b = i
print(abs(a - b))

Fixed submission:
import itertools

n = int(input())
p_list = tuple(map(int, input().split()))
q_list = tuple(map(int, input().split()))

seq = [i for i in range(1,n+1)]
seq_list = list(itertools.permutations(seq))
sorted_seq = sorted(seq_list)

for i in range(len(sorted_seq)):
  if p_list == sorted_seq[i]:
    a = i
  if q_list == sorted_seq[i]:
    b = i
print(abs(a - b))

Buggy python submission (verdict: Runtime Error):
import itertools

n = int(input())
p_list = tuple(map(int, input().split()))
q_list = tuple(map(int, input().split()))

seq = [i for i in range(1,n+1)]
seq_list = list(itertools.permutations(seq))
sorted_seq = sorted(seq_list)

for i in range(1, len(sorted_seq)):
  if p_list == sorted_seq[i]:
    a = i
    print(a)
  if q_list == sorted_seq[i]:
    b = i
    print(b)
print(abs(a - b))

Fixed submission:
import itertools

n = int(input())
p_list = tuple(map(int, input().split()))
q_list = tuple(map(int, input().split()))

seq = [i for i in range(1,n+1)]
seq_list = list(itertools.permutations(seq))
sorted_seq = sorted(seq_list)

for i in range(len(sorted_seq)):
  if p_list == sorted_seq[i]:
    a = i
  if q_list == sorted_seq[i]:
    b = i
print(abs(a - b))
Buggy python submission (verdict: Runtime Error):
a, b, k = input().split()
a = int(a)
b = int(b)
k = int(k)
for i in range(k):
  if a >= 1:
    a -= 1
  elif b >= 1:
    b -= 1
  else:
    continue
    
print("{} {}".format(a, b))

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

print("{}{}".format(t, s))
Buggy python submission (verdict: Runtime Error):
W, H, x, y = map(int, input().split())

one =  W * (H-y)
two = x * H
three = 0
same = 0
if x==0 and y==0:
  three = (W*H)/2
if x==W and y==H:
  three = (W*H)/2
if x==0 and y==H:
  three = (W*H)/2
if x==W and y==0:
  three = (W*H)/2

if W == H:
  if x==y:
    three = (W*H)/2
  elif x==(W+1)-y:
    three = (W*H)/2
  

if x == W/2 and y == H/2:
  same = 1

print(max(one, two, three), same)



Fixed submission:
x, a = map(int, input().split())
if x < a:
  print(0)
else:
  print(10)
Buggy python submission (verdict: Runtime Error):
W, H, x, y = map(int, input().split())
if x == W/2 and y == H/2:
  same = 1
print(W*H/2, same)

Fixed submission:
W, H, x, y = map(int, input().split())
same=0
if x == W/2 and y == H/2:
  same = 1
print(W*H/2, same)
Buggy python submission (verdict: Runtime Error):
n = int(input())

if n in (2,4,5,7,9):
    yomi = 'hon'
if n in (0,1,6,8):
    yomi = 'pon'
if n == (3):
    yomi = 'bon'

print(yomi)

Fixed submission:
n = int(input())

n = n % 10

if n in (2,4,5,7,9):
    yomi = 'hon'
if n in (0,1,6,8):
    yomi = 'pon'
if n == 3:
    yomi = 'bon'

print(yomi)

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

if n in (2,4,5,7,9):
    yomi = 'hon'
if n in (0,1,6,8):
    yomi = 'pon'
if n == (3):
    yomi = 'bon'

print(yomi)

Fixed submission:
n = int(input())

n = n % 10

if n in (2,4,5,7,9):
    yomi = 'hon'
if n in (0,1,6,8):
    yomi = 'pon'
if n == 3:
    yomi = 'bon'

print(yomi)

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

if len(s) >= k:
    s = s[0:k]

print(s)

Fixed submission:
n = int(input())

n = n % 10

if n in (2,4,5,7,9):
    yomi = 'hon'
if n in (0,1,6,8):
    yomi = 'pon'
if n == 3:
    yomi = 'bon'

print(yomi)

Buggy python submission (verdict: Runtime Error):
N=int(input())
num = n[-1]
num1 = num[-1]
if num1 == '3':
    print('bon')
elif num1 == '0' or num1 == '1' or num1 == '6' or num1 == '8':
    print('pon')
else:
    print('hon')

Fixed submission:
N = input()
num1 = N[-1]
if num1 == '3':
    print('bon')
elif num1 == '0' or num1 == '1' or num1 == '6' or num1 == '8':
    print('pon')
else:
    print('hon')

Buggy python submission (verdict: Runtime Error):
def atcoder():
    i = input()
    mod = i % 10
    if i == 3
        str="bon"
    else if i == 0 || i == 1 || i == 6 || i == 8
        str="pon"
    else 
        str="hon"
    print(str)
atcoder()

Fixed submission:
def atcoder():
    i = int(input())
    mod = i % 10
    if mod == 3:
        str="bon"
    elif mod == 0 or mod == 1 or mod == 6 or mod == 8:
        str="pon"
    else:
        str="hon"
    print(str)
atcoder()
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
p = list(map(int, input().split()))
count = 0
for i in range(1, n+1):
    s = min(p[:i])
    if (s == p[i-1]):
        count += 1
print(count)

Fixed submission:
n = int(input())
p = list(map(int, input().split()))
count = 0
s = p[0]
for i in range(1, n+1):
    s = min(s, p[i-1])
    if (s == p[i-1]):
        count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
from sympy import nextprime

x = int(input())
print(nextprime(x-1))

Fixed submission:
import math
def get_primenumber(number):
    prime_list = []
    search_list = list(range(2,10**6+1))
    while True:
      if search_list[0] > math.sqrt(number):
        prime_list.extend(search_list)
        break
      else:
        head_num = search_list[0]
        prime_list.append(head_num)
        search_list.pop(0)
        search_list = [num for num in search_list if num % head_num != 0]
    return prime_list

x = int(input())
h = get_primenumber(x)
for i in h:
    if i >= x:
        print(i)
        exit()
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
ans = [0] * n
for i in a:
    ans[i - 1] = a.index(i) + 1
for i in ans:
    print(i,end=" ")


Fixed submission:
n = int(input())
a = list(map(int, input().split()))
ans = [0] * n
count = 1
for i in a:
    ans[i - 1] = count
    count+=1
for i in ans:
    print(i,end=" ")

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
for i in range(n):
    print(a.index(i + 1) + 1, end=" ")


Fixed submission:
n = int(input())
a = list(map(int, input().split()))
ans = [0] * n
count = 1
for i in a:
    ans[i - 1] = count
    count+=1
for i in ans:
    print(i,end=" ")
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = []
ans = 0
for i in range(n):
    s_str = list(input())
    s_str.sort()
    u="".join(s_str)
    s+=[u]
for i in range(n):
    for j in range(i + 1, n):
        if s[i] == s[j]:
            ans+=1
print(ans)


Fixed submission:
import collections
n = int(input())
s = []
ans = 0
for i in range(n):
    s_str = list(input())
    s_str.sort()
    u="".join(s_str)
    s+=[u]
c = collections.Counter(s)
for i in c.values():
    if i > 1:
        p=0
        for o in range(i):
            p += o
        ans+=p
print(ans)
Buggy python submission (verdict: Runtime Error):
n = list(map(int, input()))
if len(n) == 6:
        print(90909)
elif len(n) == 5:
        num = n[0] * 10000 + n[1] * 1000 + n[2] * 100 + n[3] * 10 + n[4]
        ptint((num - 10000) + 1 + 900 + 9)
elif len(n) == 4:
        num = n[0] * 1000 + n[1] * 100 + n[2] * 10 + n[3] * 1
        print(909)
elif len(n) == 3:
        num = n[0] * 100 + n[1] * 10 + n[2] * 1
        print((num - 100) + 1 + 9)
elif len(n) == 2:
        num = n[0] * 10 + n[1] * 1
        print(9)
else:
        print(n)

Fixed submission:
n = list(map(int, input()))
if len(n) == 6:
        print(90909)
elif len(n) == 5:
        num = n[0] * 10000 + n[1] * 1000 + n[2] * 100 + n[3] * 10 + n[4]
        print((num - 10000) + 1 + 900 + 9)
elif len(n) == 4:
        print(909)
elif len(n) == 3:
        num = n[0] * 100 + n[1] * 10 + n[2] * 1
        print((num - 100) + 1 + 9)
elif len(n) == 2:
        print(9)
else:
        num=n[0]*1
        print(num)
Buggy python submission (verdict: Runtime Error):
n,a,b=int(input().split())
print(min(n*a,b))

Fixed submission:
n,a,b=map(int,input().split())
print(min(n*a,b))
Buggy python submission (verdict: Runtime Error):
from math import gcd
a,b,c,d=map(int,input().split())
f=b//c - (a-1)//c
g=b//d - (a-1)//d
k=c*d//gcd(c,d)
h=f+g-(b//k-(a-1)//k)
print((b+1-a)-h)

Fixed submission:
from fractions import gcd
a,b,c,d=map(int,input().split())
f=b//c - (a-1)//c
g=b//d - (a-1)//d
k=c*d//gcd(c,d)
h=f+g-(b//k-(a-1)//k)
print((b+1-a)-h)

Buggy python submission (verdict: Runtime Error):
from math import gcd
a,b,c,d=map(int,input().split())
f=b//c - (a-1)//c
g=b//d - (a-1)//d
k=c*d//gcd(c,d)
h=f+g-(b//k-(a-1)//k)
print(b-a)

Fixed submission:
from fractions import gcd
a,b,c,d=map(int,input().split())
f=b//c - (a-1)//c
g=b//d - (a-1)//d
k=c*d//gcd(c,d)
h=f+g-(b//k-(a-1)//k)
print((b+1-a)-h)
Buggy python submission (verdict: Runtime Error):
n=int(input())
o=[]
for i in range(n):
    x,y=map(int,input().split())
    o.append([x,y])
o.sort()
p2=[]
q2=[]
c=[]
if n==1:
    print(1)
else:
    for i in range(n):
        for j in range(i+1,n):
            p2=o[j][0]-o[i][0]
            q2=o[j][1]-o[i][1]
            c.append(str(p2)+" "+str(q2))
    r=defaultdict(int)
    for f in c:
        r[f]+=1
    p=list(r.values())
    q=max(p)
    print(n-q)

Fixed submission:
from collections import defaultdict
n=int(input())
o=[]
for i in range(n):
    x,y=map(int,input().split())
    o.append([x,y])
o.sort()
p2=[]
q2=[]
c=[]
if n==1:
    print(1)
else:
    for i in range(n):
        for j in range(i+1,n):
            p2=o[j][0]-o[i][0]
            q2=o[j][1]-o[i][1]
            c.append(str(p2)+" "+str(q2))
    r=defaultdict(int)
    for f in c:
        r[f]+=1
    p=list(r.values())
    q=max(p)
    print(n-q)

Buggy python submission (verdict: Runtime Error):
n=int(input())
o=[]
for i in range(n):
    x,y=map(int,input().split())
    o.append([x,y])
p2=[]
q2=[]
for i in range(1,n):
    p2+=[int(o[i][0]-o[i-1][0])]
    q2+=[int(o[i][1]-o[i-1][1])]
p1=[int(s) for s in p2]
q1=[int(s) for s in q2]
p1=[abs(s) for s in p1]
q1=[abs(s) for s in q1]
p=min(map(int,p1))
q=min(map(int,q1))
ans=0
a=0
for i in range(n):
    for u in range(n):
        if i==u:
            break
        pd=o[i][0]-o[u][0]
        qd=o[i][1]-o[u][1]
        if pd==p and qd==q:
            a+=1
print(n-a)

Fixed submission:
from collections import defaultdict
n=int(input())
o=[]
for i in range(n):
    x,y=map(int,input().split())
    o.append([x,y])
o.sort()
p2=[]
q2=[]
c=[]
if n==1:
    print(1)
else:
    for i in range(n):
        for j in range(i+1,n):
            p2=o[j][0]-o[i][0]
            q2=o[j][1]-o[i][1]
            c.append(str(p2)+" "+str(q2))
    r=defaultdict(int)
    for f in c:
        r[f]+=1
    p=list(r.values())
    q=max(p)
    print(n-q)

Buggy python submission (verdict: Runtime Error):
n=int(input())
o=[]
for i in range(n):
    x,y=map(int,input().split())
    o.append([x,y])
p1=[]
q1=[]
for i in range(1,n):
    p1+=[o[i][0]-o[i-1][0]]
    q1+=[o[i][1]-o[i-1][1]]
p=abs(min(map(int,p1)))
q=abs(min(map(int,q1)))
ans=0
a=0
for i in range(n):
    for u in range(n):
        if i==u:
            break
        pd=o[i][0]-o[u][0]
        qd=o[i][1]-o[u][1]
        if pd==p and qd==q:
            a+=1
print(n-a)

Fixed submission:
from collections import defaultdict
n=int(input())
o=[]
for i in range(n):
    x,y=map(int,input().split())
    o.append([x,y])
o.sort()
p2=[]
q2=[]
c=[]
if n==1:
    print(1)
else:
    for i in range(n):
        for j in range(i+1,n):
            p2=o[j][0]-o[i][0]
            q2=o[j][1]-o[i][1]
            c.append(str(p2)+" "+str(q2))
    r=defaultdict(int)
    for f in c:
        r[f]+=1
    p=list(r.values())
    q=max(p)
    print(n-q)
Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split())
ans = [1] * (n + 1)
for i in a:
    ans[i] = 0
for i in range(2, n + 1):
    if ans[i]:
        ans[i] = ans[i - 1] + ans[i - 2]
    if ans[i] >= 1000000007:
        ans[i] = ans[i] % 1000000007
print(ans[-1])

Fixed submission:
n, m = map(int, input().split())
a = [int(input()) for i in range(m)]
ans = [1] * (n + 1)
for i in a:
    ans[i] = 0
for i in range(2, n + 1):
    if ans[i]:
        ans[i] = ans[i - 1] + ans[i - 2]
    if ans[i] >= 1000000007:
        ans[i] = ans[i] % 1000000007
print(ans[-1])
Buggy python submission (verdict: Runtime Error):
n = int(input())
f = []
s = []
p = []
for i in range(n):
    f += [list(map(str, input().split(" ")))]
    s += [f[i][0]]
    p += [int(f[i][1])]
print(p)
s.sort()
p.sort(reverse=True)
print(p)
ans = [0] * n
count = 0
for i in s:
    for j in p:
        if [i, str(j)] in f:
            ans[count] = f.index([i, str(j)]) + 1
            p[p.index(j)] = 0
            s[s.index(i)] = 0
            count += 1

for i in range(n):
    print(ans[i])


Fixed submission:
n = int(input())
sr = []
ans = [0]*n
for _ in range(n):
    s,r = input().split()
    sr += [[str(s), int(r)]]
se = sorted(sr, key=lambda x: (x[0], -x[1]))
for i in range(n):
    ans[i] = sr.index(se[i])+1
for i in range(n):
    print(ans[i])
Buggy python submission (verdict: Time Limit Exceeded):
a,b,c,d=list(map(int,input().split()))
e=[a,b,c]
w,r,t=e[0],e[1],e[2]
u=0
for i in range(d//a+1):
    y=d-(a*i)
    for o in range(y+1):
        x=y-(b*o)
        if y==0 or x==0 or x%c==0 and x>=0:
            u+=1
print(u)

Fixed submission:
a,b,c,d=list(map(int,input().split()))
e=[a,b,c]
w,r,t=e[0],e[1],e[2]
u=0
for i in range(d//a+1):
    y=d-(a*i)
    for o in range(y+1):
        x=y-(b*o)
        if x%c==0 and x>=0:
            u+=1
print(u)
Buggy python submission (verdict: Runtime Error):
a=list(input().split())
b=int(a[0])
c=int(a[1])
if b>c:
  print(b+(b-1))
elif c>b:
  print(c+(c-1))
elif b=c:
  print(2*b)

Fixed submission:
q=list(input().split())
a=int(q[0])
b=int(q[1])
for i in range(2):
  if a>=b:
    if i==0:
      r=a
    else:
      v=a
    a=a-1
  else:
    if i==0:
      r=b
    else:
      v=b
    b=b-1
g=int(r+v)
print(g)
Buggy python submission (verdict: Time Limit Exceeded):
h=0
a=list(input())
for i in range(1,len(a)):
  r=int(a[i])
  if int(a[i-1])==r:
    if r==0:
      b=1
    else:
      b=0
    a.pop(i)
    a.insert(i,b)
    h+=1
print(h)

Fixed submission:
a = list(input())
s = a[0]
count = 0
if s == "0":
    for i in range(1, len(a)):
        if int(a[i]) != i % 2:
            count += 1
elif s == "1":
    for i in range(1, len(a)):
        if int(a[i]) != (i + 1) % 2:
            count += 1
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
h=0
a=list(input())
for i in range(1,len(a)):
  if int(a[i-1])==int(a[i]):
    if int(a[i])==0:
      b=1
    else:
      b=0
    a.pop(i)
    a.insert(i,b)
    h+=1
print(h)

Fixed submission:
a = list(input())
s = a[0]
count = 0
if s == "0":
    for i in range(1, len(a)):
        if int(a[i]) != i % 2:
            count += 1
elif s == "1":
    for i in range(1, len(a)):
        if int(a[i]) != (i + 1) % 2:
            count += 1
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
h=0
a=list(input())
if len(a)==1:
  print(0)
else:
  for i in range(1,len(a)):
    if int(a[i-1])==int(a[i]):
      if int(a[i])==0:
        b=1
      else:
        b=0
      a.pop(i)
      a.insert(i,b)
      h+=1
  print(h)

Fixed submission:
a = list(input())
s = a[0]
count = 0
if s == "0":
    for i in range(1, len(a)):
        if int(a[i]) != i % 2:
            count += 1
elif s == "1":
    for i in range(1, len(a)):
        if int(a[i]) != (i + 1) % 2:
            count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
a=input()
if a=="A":
  print(T)
elif a!="A":
  print(A)
elif a=="C":
  print(G)
else:
  print(C)


Fixed submission:
a=input()
if a=="A":
  print("T")
elif a=="T":
  print("A")
elif a=="C":
  print("G")
else:
  print("C")

Buggy python submission (verdict: Runtime Error):
a=input()
if a == A:
  print(T)
elif a == T:
  print(A)
elif a == C:
  print(G)
else:
  print(C)


Fixed submission:
a=input()
if a=="A":
  print("T")
elif a=="T":
  print("A")
elif a=="C":
  print("G")
else:
  print("C")

Buggy python submission (verdict: Runtime Error):
a=input()
if a==A:
  print(T)
elif a==T:
  print(A)
elif a==C:
  print(G)
else:
  print(C)


Fixed submission:
a=input()
if a=="A":
  print("T")
elif a=="T":
  print("A")
elif a=="C":
  print("G")
else:
  print("C")

Buggy python submission (verdict: Runtime Error):
a=input()
if a=A:
  print(T)
elif a=T:
  print(A)
elif a=C:
  print(G)
elif a=G:
  print(C)

Fixed submission:
a=input()
if a=="A":
  print("T")
elif a=="T":
  print("A")
elif a=="C":
  print("G")
else:
  print("C")

Buggy python submission (verdict: Runtime Error):
a=input()
if a=A:
  print(T)
elif a=T:
  print(A)
elif a=C:
  print(G)
else:
  print(C)

Fixed submission:
a=input()
if a=="A":
  print("T")
elif a=="T":
  print("A")
elif a=="C":
  print("G")
else:
  print("C")
Buggy python submission (verdict: Runtime Error):
a=list(input().split())
b=list(input(),split())
c=int(a[0])
d=int(a[1])
e=int(b[0])
f=int(b[1])
g=c*d-d*e-c*f+e*f
print(g)

Fixed submission:
a=list(input().split())
b=list(input().split())
c=int(a[0])
d=int(a[1])
e=int(b[0])
f=int(b[1])
g=c*d-d*e-c*f+e*f
print(g)
Buggy python submission (verdict: Runtime Error):
a=list(input().split())
b=a[0]
c=a[1]
d=a[2]
e=c/b
if e>d:
  print(d)
elif d>e:
  print(e)


Fixed submission:
a=list(input().split())
b=int(a[0])
c=int(a[1])
d=int(a[2])
e=int(c/b)
if e>=d:
  print(d)
elif d>e:
  print(e)

Buggy python submission (verdict: Runtime Error):
a=list(input())
b=a[0]
c=a[1]
d=a[2]
e=c/b
if e>d:
  print(d)
elif d>e:
  print(e)


Fixed submission:
a=list(input().split())
b=int(a[0])
c=int(a[1])
d=int(a[2])
e=int(c/b)
if e>=d:
  print(d)
elif d>e:
  print(e)

Buggy python submission (verdict: Runtime Error):
a=list(input())
b=a(0)
c=a(1)
d=a(2)
e=c/b
if e>d:
  print(d)
elif d>e:
  print(e)


Fixed submission:
a=list(input().split())
b=int(a[0])
c=int(a[1])
d=int(a[2])
e=int(c/b)
if e>=d:
  print(d)
elif d>e:
  print(e)

Buggy python submission (verdict: Runtime Error):
a=[input()]
b=a(0)
c=a(1)
d=a(2)
e=c/b
if e>>d:
  print(d)
elif d>>e:
  print(e)


Fixed submission:
a=list(input().split())
b=int(a[0])
c=int(a[1])
d=int(a[2])
e=int(c/b)
if e>=d:
  print(d)
elif d>e:
  print(e)

Buggy python submission (verdict: Runtime Error):
a=[input()]
b=a(0)
c=a(1)
d=a(2)
e=c/b
if e>d:
  print(d)
elif d>e:
  print(e)

Fixed submission:
a=list(input().split())
b=int(a[0])
c=int(a[1])
d=int(a[2])
e=int(c/b)
if e>=d:
  print(d)
elif d>e:
  print(e)
Buggy python submission (verdict: Runtime Error):
a=list(input().split())
b=int(a[0])
c=int(a[1])
if a%b==0:
  print(b+c)
else:
  print(c-b)

Fixed submission:
a=list(input().split())
b=int(a[0])
c=int(a[1])
if c%b==0:
  print(b+c)
else:
  print(c-b)
Buggy python submission (verdict: Runtime Error):
a,b,c=list(input().split())
A=int(a*b/2)
ptint(A)


Fixed submission:
a=list(input().split())
b=int(a[0])
c=int(a[1])
d=int(c*b/2)
print(d)

Buggy python submission (verdict: Runtime Error):
a,b,c=list(input().split())
A=int(a)*int(b)/2
ptint(A)


Fixed submission:
a=list(input().split())
b=int(a[0])
c=int(a[1])
d=int(c*b/2)
print(d)

Buggy python submission (verdict: Runtime Error):
a,b,c=list(input().split())
AB=int(a)
BC=int(b)
ptint(int(AB*BC/2))

Fixed submission:
a=list(input().split())
b=int(a[0])
c=int(a[1])
d=int(c*b/2)
print(d)
Buggy python submission (verdict: Runtime Error):
a=list(inout().split())
b=int(int(a[0])+int(a[1])/2)
print(b)


Fixed submission:
a=list(input().split())
X=int(a[0])
Y=int(a[1])
z=int(X+Y/2)
print(z)

Buggy python submission (verdict: Runtime Error):
a=list(inout().split())
b=int(a[0])+int(a[1])/2
print(b)

Fixed submission:
a=list(input().split())
X=int(a[0])
Y=int(a[1])
z=int(X+Y/2)
print(z)
Buggy python submission (verdict: Runtime Error):
N=int(input())
ta=list(input().split())
T=int(ta[0])
A=int(ta[1])
Hi=int(list(input().split()))
print(min(abs(A-t))for i in t=T-Hi[i]*0.006)

Fixed submission:
n = int(input())
t, a = map(int, input().split())
h = list(map(int, input().split()))

d = 1000000000000
ans_count = 1
for i in range(n):
    ans = t - h[i] * 0.006
    if d > abs(a - ans):
        d = abs(a-ans)
        ans_count = i+1
print(ans_count)
Buggy python submission (verdict: Runtime Error):
N,T=map(int,list(input().split()))
c=1001
for i in range(N):
  ct,tc=map(int,list(input().split()))
  if T>=tc and c>=ct:
    c=ct
  if c==1001:
    c="TLE"
print(c)

Fixed submission:
N,T=map(int,list(input().split()))
c=1001
for i in range(N):
  ct,tc=map(int,list(input().split()))
  if T>=tc and c>=ct:
    c=ct
if c==1001:
  c="TLE"
print(c)
Buggy python submission (verdict: Runtime Error):
a=str(input())
b=int(a[0])
c=int(a[1])
d=int(a[2])
if b==1:
  b="9"
elif b==9:
  b="1"
if c==1:
  c="9"
elif c==9:
  c="1"
if d==1:
  d="9"
elif d==9:
  d=="1"
e=int(b+c+d)
print(e)

Fixed submission:
a=int(input())
print(1110-a)

Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,list(input(),split()))
if a==1:
  a=9
elif a==9:
  a=1
if b==1:
  b=9
elif b==9:
  b=1
if c==1:
  c=9
elif c==9:
  c==1
print({}{}{}.format(a,b,c))

Fixed submission:
a=int(input())
print(1110-a)
Buggy python submission (verdict: Runtime Error):
a=list(input().split())
b=int([0])
c=int([1])
if (b*c)%2==0:
  print("Yes")
else:
  print("No")

Fixed submission:
a=list(input().split())
b=int(a[0])
c=int(a[1])
d=int(b*c)
if d%2==1:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))
print(max(a)-min)

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
print(max(a)-min(a))