Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
ls = [x for x in map(int, input().split(' '))]
for x in range(0, n):
    dam = ls.copy()
    del dam[x]
    dam = sorted(dam)
    print(dam[int(len(dam)/ 2)])

Fixed submission:
n = int(input())
ls = [x for x in map(int, input().split(' '))]
dam = sorted(ls.copy())

for x in range(0, n):
    if ls[x] < dam[n // 2]:
        print(dam[n // 2])
    else:
        print(dam[(n // 2) - 1])
Buggy python submission (verdict: Runtime Error):
num = int(input())
dic = { "JPY": 0, "BTC": 0 }
for i in range(0, num):
    val, coin = input().split(' ')
    dic[coin] += float(val)
print(dic["JPY"] + (dic["BTC"] * 380000.0))

def two_colors_card_game():
dic_words = {}
for i in range(0, int(input())):
    word = input()
    if word in dic_words.keys():
        dic_words[word] += 1
    else:
        dic_words[word] = 1

for i in range(0, int(input())):
    word = input()
    if word in dic_words.keys():
        dic_words[word] -= 1
    else:
        dic_words[word] = -1

if (max(dic_words.values()) >= 0):
    print(max(dic_words.values()))
else:
    print(0)

Fixed submission:
dic_words = {}
for i in range(0, int(input())):
    word = input()
    if word in dic_words.keys():
        dic_words[word] += 1
    else:
        dic_words[word] = 1

for i in range(0, int(input())):
    word = input()
    if word in dic_words.keys():
        dic_words[word] -= 1
    else:
        dic_words[word] = -1

if (max(dic_words.values()) >= 0):
    print(max(dic_words.values()))
else:
    print(0)
Buggy python submission (verdict: Runtime Error):
import itertools
N = int(input())
item = []
for i in range(N):
    A = int(input())
    s = []
    for ii in range(A):
        x, y = map(int, input().split())
        s.append((x, y))
        item.append(s)

Ps = itertools.product([0, 1], repeat=N)
ans = 0
for P in Ps:
    right = True
    for i, p in enumerate(P):
        if p == 1:
            for x, y in item[i]:
                if (y == 1 and P[x - 1] == 0) or (y == 0 and P[x - 1] == 1):
                    right = False
    if right:
        ans = max(ans, sum(P))

print(ans)

Fixed submission:
import itertools
N = int(input())
item = []
for i in range(N):
    A = int(input())
    s = []
    for ii in range(A):
        x, y = map(int, input().split())
        s.append((x, y))
    item.append(s)

Ps = itertools.product([0, 1], repeat=N)
ans = 0
for P in Ps:
    right = True
    for i, p in enumerate(P):
        if p == 1:
            for x, y in item[i]:
                if (y == 1 and P[x - 1] == 0) or (y == 0 and P[x - 1] == 1):
                    right = False
    if right:
        ans = max(ans, sum(P))

print(ans)
Buggy python submission (verdict: Runtime Error):
result = 0
for n in range(int(input())):
    result += len(n+1)%2
print(result)

Fixed submission:
result = 0
for n in range(int(input())):
    result += len(str(n+1))%2
print(result)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = [int(input()) for _ in range(N)]
for n in range(N):
    tmp = A.copy()
    tmp.pop(n)
    print(max(tmp))

Fixed submission:
N = int(input())
A = [int(input()) for _ in range(N)]
B=sorted(A,reverse=True)
max=B[0]
sec=B[1]

if max==sec:
    for n in range(N):
        print(max)
else:
    for a in A:
        if a==max:
            print(sec)
        else:
            print(max)
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().sprit())
s = a + b + c
if s > 21:
  print("bust")
else:
  print("win")

Fixed submission:
a,b,c = map(int,input().split())
s = a + b + c
if s > 21:
  print("bust")
else:
  print("win")
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = [2,3,4,5,6,7,8,9]
frag = True

if n<=9:
    print("Yes")
else:
    for i in s:
        if n % i == 0:
            flag = False
            print("Yes")
            break
if flag:
    print("No")

Fixed submission:
n = int(input())
s = [2,3,4,5,6,7,8,9]
flag = True
 
if 1<= n <=9:
    print("Yes")
    flag = False
else:
    for i in s:
        if n % i == 0 and n/i <= 9:
            flag = False
            print("Yes")
            break
if flag:
    print("No")

Buggy python submission (verdict: Runtime Error):
n = int(input())
s = [2,3,4,5,6,7,8,9]
frag = False
 
for i in s:
    if n % i == 0:
        print("Yes")
        flag = True
        break
if not flag:
    print("No")

Fixed submission:
n = int(input())
s = [2,3,4,5,6,7,8,9]
flag = True
 
if 1<= n <=9:
    print("Yes")
    flag = False
else:
    for i in s:
        if n % i == 0 and n/i <= 9:
            flag = False
            print("Yes")
            break
if flag:
    print("No")

Buggy python submission (verdict: Runtime Error):
n = int(input())
s = [2,3,4,5,6,7,8,9]
frag = False

for i in s:
  if n % s[i] == 0:
    print("Yes")
    flag = True
    break
if not flag:
  print("No")

Fixed submission:
n = int(input())
s = [2,3,4,5,6,7,8,9]
flag = True
 
if 1<= n <=9:
    print("Yes")
    flag = False
else:
    for i in s:
        if n % i == 0 and n/i <= 9:
            flag = False
            print("Yes")
            break
if flag:
    print("No")
Buggy python submission (verdict: Runtime Error):
import re

s = input()
k = int(input())

frag = False

def nchars(s, n):
    assert n > 0
    reg = re.compile("(.)\\1{%d,}" % (n - 1))
    while True:
        m = reg.search(s)
        if not m:
            break
        yield m.group(0)
        s = s[m.end():]
        
s_ = list(nchars(s,1))

for i in s_[0]:
  s1 = i
for i in s_[-1]:
  s2 = i

if s1 == s2:
  frag = True

l = [len(i) for i in s_]

c = len(l[0])//2

c1 = 0
c2 = 0

for i in range(len(l)-1):
  if i != len(l)-1:
    c1 += l[i+1]//2
  else:
    if frag:
      c1 += l[i] // 2
    else:
      c2 = (l[0]+l[i])//2
  
if not frag:
  print(c1*k)
else:
  print(c1)

Fixed submission:
import re
 
s = input()
k = int(input())
 
frag = False
 
def nchars(s, n):
    assert n > 0
    reg = re.compile("(.)\\1{%d,}" % (n - 1))
    while True:
        m = reg.search(s)
        if not m:
            break
        yield m.group(0)
        s = s[m.end():]
        
s_ = list(nchars(s,1))
 
for i in s_[0]:
  s1 = i
for i in s_[-1]:
  s2 = i
 
if s1 == s2:
  frag = True
 
l = [len(i) for i in s_]
 
c = l[0]//2
 
c1 = 0
c2 = 0
c3 = 0

for i in range(len(l)):
  if i != len(l)-1:
    c1 += l[i]//2
  else:
    if not frag:
      c1 += l[i] // 2
    else:
      c2 = (l[0]+l[i])//2
      c3 = l[i]//2

if len(l) == 1:
  print((l[0]*k)//2)

elif not frag:
  print(c1*k)
else:
  print(c + (c1-c)*k + c2*(k-1) + c3)
Buggy python submission (verdict: Runtime Error):
n, k = map(int,input().split())
h = list(map(int,input().split()))
c = 0

for i in len(h):
  if h[i] >= K:
    c += 1
  
print(c)

Fixed submission:
n, k = map(int,input().split())
h = list(map(int,input().split()))
c = 0
 
for i in range(n):
  if h[i] >= k:
    c += 1
  
print(c)
Buggy python submission (verdict: Runtime Error):
s = list(input().split())
t = list(input().split())

c = 0

for i in range(3):
  if s[i]==t[i]:
    c += 1

print(c)

Fixed submission:
s = input()
t = input()

c = 0
 
for i, j in zip(s,t):
  if i == j:
    c += 1
 
print(c)
Buggy python submission (verdict: Runtime Error):
n = int(input())
lst = list(range(n))
print(sum(lst))

Fixed submission:
n = int(input())
sum = n * (n - 1) // 2
print(sum)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
sum = 0
for i in range(n):
  sum += i
print(sum)

Fixed submission:
n = int(input())
sum = n * (n - 1) // 2
print(sum)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = [sorted(input()) for i in range(n)]

count = 0

for i in range(n):
  c = s[i]
  for j in range(i+1,n):
    if c == s[j]:
      count += 1
      
print(count) 

Fixed submission:
import collections

n = int(input())
s = []
for i in range(n):
  s_ = sorted(input())
  s.append(s_[0]+s_[1]+s_[2]+s_[3]+s_[4]+s_[5]+s_[6]+s_[7]+s_[8]+s_[9])

c = collections.Counter(s)
count = 0

for i in c:
  if c[i] != 1:
    count += c[i]*(c[i]-1)/2

print(int(count))
Buggy python submission (verdict: Runtime Error):
n = int(input())
A = []
for i in range(n):
  a = int(input())
  A.append(a)
m = max(A)
m2 = sorted(set(A))[-2]
c = A.count(m)

bool = False
if c == 1:
  bool = True

for i in A:
  if bool and i==m:
    print(m2)
  else:
    print(m)

Fixed submission:
n = int(input())
A = []
for i in range(n):
  a = int(input())
  A.append(a)
m = max(A)
c = A.count(m)

if len(set(A)) > 1:
	m2 = sorted(set(A))[-2]

bool = False
if c == 1:
  bool = True

for i in A:
  if bool and i==m:
    print(m2)
  else:
    print(m)

Buggy python submission (verdict: Time Limit Exceeded):
import copy
n = int(input())
A = []
for i in range(n):
  a = int(input())
  A.append(a)
for i in range(n):
  A_ = copy.deepcopy(A)
  A_.pop(i)
  print(max(A_))

Fixed submission:
n = int(input())
A = []
for i in range(n):
  a = int(input())
  A.append(a)
m = max(A)
c = A.count(m)

if len(set(A)) > 1:
	m2 = sorted(set(A))[-2]

bool = False
if c == 1:
  bool = True

for i in A:
  if bool and i==m:
    print(m2)
  else:
    print(m)
Buggy python submission (verdict: Runtime Error):
l, r = map(int, input().split())
x = []

if l =< 2019 =< r:
  print(0)
elif r - l > 2018:
  print(0)
else:
  x = []
  for i in range(l, r):
    for j in range(i+1, r+1):
      m = i * j % 2019
      x.append(m) 
  print(min(x))

Fixed submission:
l, r = map(int, input().split())
x = []

if l <= 2019 <= r:
  print(0)
elif r - l > 2018:
  print(0)
else:
  x = []
  for i in range(l, r):
    for j in range(i+1, r+1):
      m = i * j % 2019
      x.append(m) 
  print(min(x))

Buggy python submission (verdict: Time Limit Exceeded):
l, r = map(int, input().split())
x = []
y = []
 
for i in range(l, r):
  for j in range(i+1, r+1):
    m = i * j % 2019
    x.append(m) 
print(min(x))

Fixed submission:
l, r = map(int, input().split())
x = []

if l <= 2019 <= r:
  print(0)
elif r - l > 2018:
  print(0)
else:
  x = []
  for i in range(l, r):
    for j in range(i+1, r+1):
      m = i * j % 2019
      x.append(m) 
  print(min(x))

Buggy python submission (verdict: Time Limit Exceeded):
l, r = map(int, input().split())
x = []
y = []
 
for i in range(l, r):
  for j in range(i+1, r+1):
    m = i * j % 2019
    x.append(m)
    y.append(i*j)

print(min(x))

Fixed submission:
l, r = map(int, input().split())
x = []

if l <= 2019 <= r:
  print(0)
elif r - l > 2018:
  print(0)
else:
  x = []
  for i in range(l, r):
    for j in range(i+1, r+1):
      m = i * j % 2019
      x.append(m) 
  print(min(x))
Buggy python submission (verdict: Runtime Error):
N = int(input())
num = input().sprit()

count = 0

for i in range(N-3):
  if num[i] < num[i+1] < num[i+2]:
    count += 1
  elif num[i] > num[i+1] > num[i+2]:
    count += 1

print(count)
    

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

count = 0

for i in range(N-2):
  if num[i]>num[i+1]>num[i+2] or num[i]<num[i+1]<num[i+2]:
    count += 1

print(count)
Buggy python submission (verdict: Runtime Error):
n = int(input())
p = list(map(int,input().split()))
p.sort() 
ans = p[n/2] - p[n/2-1]
print(ans)

Fixed submission:
n = int(input())
p = list(map(int,input().split()))
p.sort()
 
ans = p[n//2] - p[n//2-1]
print(ans)

Buggy python submission (verdict: Runtime Error):
n = int(input())
p = list(map(int,input().split()))
ps = p.sort()

ans = ps[n/2] - ps[n/2-1]
print(ans)

Fixed submission:
n = int(input())
p = list(map(int,input().split()))
p.sort()
 
ans = p[n//2] - p[n//2-1]
print(ans)
Buggy python submission (verdict: Runtime Error):
nl=list(map((int,input().split())))
a=[i+nl[1] for i in range(nl[0])]
 
a_sum = sum(a)
abs_ = []
for i in range(nl[0]):
  abs_.append(abs(a_sum - a[i]))
idx=abs_.index(min(abs_))
print(a_sum-a[idx])

Fixed submission:
N, L = map(int, input().split())
 
if L > 0: print(sum([i for i in range(L+1, L+N)]))
elif L+N-1 < 0: print(sum([i for i in range(L, L+N-1)]))
else: print(sum([i for i in range(L, L+N)]))

Buggy python submission (verdict: Runtime Error):
nl=map((int,input().split()))
a=[i+nl[1] for i in range(nl[0])]

a_sum = sum(a)
abs_ = []
for i in range(nl[0]):
  abs_.append(abs(a_sum - a[i]))
idx=abs_.index(min(abs_))
print(a_sum-a[idx])
  

Fixed submission:
N, L = map(int, input().split())
 
if L > 0: print(sum([i for i in range(L+1, L+N)]))
elif L+N-1 < 0: print(sum([i for i in range(L, L+N-1)]))
else: print(sum([i for i in range(L, L+N)]))
Buggy python submission (verdict: Runtime Error):
s = [input()]
f = int(s[0])*10 + int(s[1])
l = int(s[2])*10 + int(s[3])

if 1 <= f <= 12 and 1 <= l <= 12:
  print("AMBIGUOUS")
elif 1 <= f <= 12:
  print("MMYY")
elif 1 <= l <= 12:
  print("YYMM")
else:
  print("NA")


Fixed submission:
s = [int(i) for i in input()]
f = s[0]*10 + s[1]
l = s[2]*10 + s[3]

if 1 <= f <= 12 and 1 <= l <= 12:
  print("AMBIGUOUS")
elif 1 <= f <= 12:
  print("MMYY")
elif 1 <= l <= 12:
  print("YYMM")
else:
  print("NA")
Buggy python submission (verdict: Runtime Error):
n, q = list(map(int, input().split()))
childs = [set() for _ in range(n)]
nodes = [0 for _ in range(n)]
for _ in range(n - 1):
    line = input().split()
    a, b = int(line[0]), int(line[1])
    childs[a - 1].add(b - 1)


def add(i, k):
    global childs
    nodes[i] += k
    for j in childs[i]:
        add(j, k)


for _ in range(q):
    line = input().split()
    i, k = int(line[0]), int(line[1])
    add(i - 1, k)

print(' '.join(map(str, nodes)))

Fixed submission:
n, q = map(int, input().split())
parents = [set() for _ in range(n)]
nodes = [0 for _ in range(n)]

for _ in range(n - 1):
    a, b = map(int, input().split())
    parents[b - 1].add(a - 1)

for _ in range(q):
    i, k = map(int, input().split())
    nodes[i - 1] += k

for i, p in enumerate(parents):
    nodes[i] += sum([nodes[j] for j in p])

print(*nodes)

Buggy python submission (verdict: Runtime Error):
n, q = list(map(int, input().split()))
childs = [set() for _ in range(n)]
nodes = [0 for _ in range(n)]
for _ in range(n - 1):
    line = input().split()
    a, b = int(line[0]), int(line[1])
    childs[a - 1].add(b - 1)


def add(i, k):
    global childs
    nodes[i] += k
    for j in childs[i]:
        add(j, k)


for _ in range(q):
    line = input().split()
    i, k = int(line[0]), int(line[1])
    add(i - 1, k)

print(' '.join(map(str, nodes)))

Fixed submission:
n, q = map(int, input().split())
parents = [set() for _ in range(n)]
nodes = [0 for _ in range(n)]

for _ in range(n - 1):
    a, b = map(int, input().split())
    parents[b - 1].add(a - 1)

for _ in range(q):
    i, k = map(int, input().split())
    nodes[i - 1] += k

for i, p in enumerate(parents):
    nodes[i] += sum([nodes[j] for j in p])

print(*nodes)
Buggy python submission (verdict: Runtime Error):
def Gauss_sum(n):
  return n*(n+1)//2
a,b=map(int,input())
for i in range(999):
  if Gauss_sum(i+1)-a == Gauss_sum(i+2)-b:
    print(Gauss_sum(i+1)-a)
    break

Fixed submission:
def Gauss_sum(n):
  return n*(n+1)//2
a,b=map(int,input().split())
for i in range(999):
  if Gauss_sum(i+1)-a == Gauss_sum(i+2)-b:
    print(Gauss_sum(i+1)-a)
    break
Buggy python submission (verdict: Runtime Error):
A,B,C=map(int,input().split())
even += A%2+B%2+C%2
answer = 0
if even == 1:
  answer = 1
  if A%2:
    A += 1
  if B%2:
    B += 1
  if C%2:
    C += 1
elif even == 2:
  answer = 1
  if not A%2:
    A += 1
  if not B%2:
    B += 1
  if not C%2:
    C += 1
D = sorted([A,B,C])
answer += (D[2]-D[0])//2+(D[2]-D[1])//2

Fixed submission:
A,B,C=map(int,input().split())
odd = A%2+B%2+C%2
answer = 0
if odd == 1:
  answer = 1
  if not A%2:
    A += 1
  if not B%2:
    B += 1
  if not C%2:
    C += 1
elif odd == 2:
  answer = 1
  if A%2:
    A += 1
  if B%2:
    B += 1
  if C%2:
    C += 1
D = sorted([A,B,C])
answer += (D[2]-D[0])//2+(D[2]-D[1])//2
print(answer)
Buggy python submission (verdict: Runtime Error):
N = int(input())
a = list(map(int,input().split())).sort(reverse=True)
answer = 0
for i in range(0,N,2):
  answer += a[i]
for i in range(1,N,2):
  answer -= a[i]
print(answer)

Fixed submission:
N = int(input())
a = list(map(int,input().split()))
a.sort(reverse=True)
answer = 0
for i in range(0,N,2):
  answer += a[i]
for i in range(1,N,2):
  answer -= a[i]
print(answer)
Buggy python submission (verdict: Runtime Error):
A,B,C,D,E,F=map(int,input().split(' '))
water = set()
for a in range(0,F,100*A):
  for b in range(0,F,100*B):
    if a+b <= F:
      water.add(a+b)
    else:
      break
sugars = set()
for c in range(0,F,C):
  for d in range(0,F,D):
    if c+d <= F:
      sugars.add(c+d)
    else:
      break
density = 0
for x in water:
  for y in sugars:
    if x+y != 0 and x+y <= F and E*x >= 100*y and density < y/(x+y):
      density = y/(x+y)
      sugar = y
      content = x+y
print(content,sugar)

Fixed submission:
A,B,C,D,E,F=map(int,input().split(' '))
water = set()
for a in range(0,F,100*A):
  for b in range(0,F,100*B):
    if a+b <= F:
      water.add(a+b)
    else:
      break
sugars = set()
for c in range(0,F,C):
  for d in range(0,F,D):
    if c+d <= F:
      sugars.add(c+d)
    else:
      break
density = 0
sugar = 0
content = 100*A
for x in water:
  for y in sugars:
    if x+y != 0 and x+y <= F and E*x >= 100*y and density < y/(x+y):
      density = y/(x+y)
      sugar = y
      content = x+y
print(content,sugar)
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().pslit(' '))
print(a+b+c-max(a,max(b,c)))

Fixed submission:
a,b,c=map(int,input().split(' '))
print(a+b+c-max(a,max(b,c)))
Buggy python submission (verdict: Runtime Error):
for s in input().split():
  print(upper(s[0]),end='')

Fixed submission:
for s in input().split():
  print(s[0].upper(),end='')
Buggy python submission (verdict: Runtime Error):
A = input()
B = input()
if A.length() > B.length():
  print("GREATER")
elif A.length() < B.length():
  print("LESS")
else:
  for a,b in zip(A,B):
    if a > b:
      print("GREATER")
    elif a < b:
      print("LESS")
print("EQUAL")

Fixed submission:
from sys import exit
A = input()
B = input()
if len(A) > len(B):
  print("GREATER")
elif len(A) < len(B):
  print("LESS")
else:
  for a,b in zip(A,B):
    if a > b:
      print("GREATER")
      exit()
    elif a < b:
      print("LESS")
      exit()
  print("EQUAL")
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int, input(),split())
if a+b+c >= 22:
  print(bust)
else:
  print(win)

Fixed submission:
a,b,c=map(int,input().split())
if a+b+c>=22:
  print("bust")
else:
  print("win")
Buggy python submission (verdict: Runtime Error):
r=int(input)
print(r**2)

Fixed submission:
r=int(input())
print(r**2)
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a>=9 or b>=9 :
  print(-1)
else a<=9 and b<=9 :
  print(a*b)

Fixed submission:
a,b=map(int,input().split())
if a>=10 or b>=10:
  print(-1)
else:
  print(a*b)

Buggy python submission (verdict: Runtime Error):
a,b=map(int, input().split)
if 1<=a<=9 and 1<=b<=9:
  print("a*b")
else:
  print("-1")

Fixed submission:
a,b=map(int,input().split())
if a>=10 or b>=10:
  print(-1)
else:
  print(a*b)

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

Fixed submission:
a,b=map(int,input().split())
if a>=10 or b>=10:
  print(-1)
else:
  print(a*b)

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

Fixed submission:
a,b=map(int,input().split())
if a>=10 or b>=10:
  print(-1)
else:
  print(a*b)

Buggy python submission (verdict: Runtime Error):
a,b = map(int, input().split())
if 1<a,b<9:
  print(a+b)
else:
  print(-1)

Fixed submission:
a,b=map(int,input().split())
if a>=10 or b>=10:
  print(-1)
else:
  print(a*b)

Buggy python submission (verdict: Runtime Error):
a,b =map(int(),input().split())
if a>=10 b>10 :
  print("-1")
else :
  print(a*b)

Fixed submission:
a,b=map(int,input().split())
if a>=10 or b>=10:
  print(-1)
else:
  print(a*b)

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a>9 b>9 
 print("-1")
else :
  print(a*b)

Fixed submission:
a,b=map(int,input().split())
if a>=10 or b>=10:
  print(-1)
else:
  print(a*b)

Buggy python submission (verdict: Runtime Error):
A=int(input())
B=int(input())
if 1<=A<=9, 1<=B<=9:
  print("A*B")
else:
  print("-1")

Fixed submission:
a,b=map(int,input().split())
if a>=10 or b>=10:
  print(-1)
else:
  print(a*b)

Buggy python submission (verdict: Runtime Error):
A, B=int(input())
if 1<=A<=9, 1<=B<=9:
  print("A*B")
else:
  print("-1")

Fixed submission:
a,b=map(int,input().split())
if a>=10 or b>=10:
  print(-1)
else:
  print(a*b)
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input(),split())
if a<=b*2:
  print(0)
else:
  print((a-b*2)*0.5)

Fixed submission:
a,b=map(int,input().split())
if b*2<=a:
  print(a-b*2)
else:
  print(0)

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input(),split())
if a<=b*2:
  print(0)
else:
  print((a-b*2)*0.5)

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

Fixed submission:
N=int(input())
if 1<=N<=9:
  print(N**3)
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if a+b+c >= 22:
   print("bust")
    else:
      print("win")

Fixed submission:
a,b,c=map(int,input().split())
if a+b+c >= 22:
   print("bust")
else:
   print("win")

Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,imput().split())
if a+b+c >= 22
   print("bust")
    else:
      print("win")

Fixed submission:
a,b,c=map(int,input().split())
if a+b+c >= 22:
   print("bust")
else:
   print("win")

Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,imput().split())
if a+b+c >= 22:
   print("bust")
    else:
      print("win")

Fixed submission:
a,b,c=map(int,input().split())
if a+b+c >= 22:
   print("bust")
else:
   print("win")
Buggy python submission (verdict: Runtime Error):
S=input()
if S="SUN":
  print("7")
elif S="MON":
  print("6")
elif S="TUE":
  print("5")
elif S="WED":
  print("4")
elif S="THU":
  print("3")
elif S="FRI":
  print("2")
elif S="SAT":
  print("1")

Fixed submission:
S=input()
if S=="SUN":
  print("7")
elif S=="MON":
  print("6")
elif S=="TUE":
  print("5")
elif S=="WED":
  print("4")
elif S=="THU":
  print("3")
elif S=="FRI":
  print("2")
elif S=="SAT":
  print("1")

Buggy python submission (verdict: Runtime Error):
input(S)
if S="SUN":
  print("7")
elif S="MON":
  print("6")
elif S="TUE":
  print("5")
elif S="WED":
  print("4")
elif S="THU":
  print("3")
elif S="FRI":
  print("2")
elif S="SAT":
  print("1")

Fixed submission:
S=input()
if S=="SUN":
  print("7")
elif S=="MON":
  print("6")
elif S=="TUE":
  print("5")
elif S=="WED":
  print("4")
elif S=="THU":
  print("3")
elif S=="FRI":
  print("2")
elif S=="SAT":
  print("1")

Buggy python submission (verdict: Runtime Error):
input(S)
if S="SUN":
  print(7)
elif S="MON":
  print(6)
elif S="TUE":
  print(5)
elif S="WED":
  print(4)
elif S="THU":
  print(3)
elif S="FRI":
  print(2)
elif S="SAT":
  print(1)

Fixed submission:
S=input()
if S=="SUN":
  print("7")
elif S=="MON":
  print("6")
elif S=="TUE":
  print("5")
elif S=="WED":
  print("4")
elif S=="THU":
  print("3")
elif S=="FRI":
  print("2")
elif S=="SAT":
  print("1")
Buggy python submission (verdict: Runtime Error):
A,B=map(int,input.split())
if 1<=A<=9 and 1<=B<=9:
  print(A*B)
else:
  print("-1")

Fixed submission:
A,B=map(int,input().split())
if 1<=A<=9 and 1<=B<=9:
  print(A*B)
else:
  print("-1")

Buggy python submission (verdict: Runtime Error):
A,B=map(int,input.split())
if 1<=A<=9 and 1<=B<=9:
  print(A*B)
else:
  print"-1"

Fixed submission:
A,B=map(int,input().split())
if 1<=A<=9 and 1<=B<=9:
  print(A*B)
else:
  print("-1")

Buggy python submission (verdict: Runtime Error):
if 1 <= A <= 9  1 <= B <= 9
  print(A*B)
else:
  print("-1")


Fixed submission:
A,B=map(int,input().split())
if 1<=A<=9 and 1<=B<=9:
  print(A*B)
else:
  print("-1")