Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
n, Y = map(int,input().split())
x , y , z , e = '-1' , '-1' , '-1' , 0

for i in range(n+1):
  if e == 1:
    break
  for j in range(n+1):
    if n-i < 0 or e == 1:
      break
    for k in range(n+1):
      if n-i-j < 0 or e == 1:
        break
      if (i + j + k == n) and (10000 * i + 5000 * j + 1000 * k == Y):
        x , y , z , e = str(i) , str(j) , str(k) , 1
        break

print(x + ' ' + y + ' ' + z)

Fixed submission:
# -*- coding: utf-8 -*-

n, Y = map(int,input().split())
x , y , z = '-1' , '-1' , '-1'

def check(num,total):
  for i in range(num+1):
    for j in range(num+1):
      k = num - i - j
      if (k >= 0) and (i + j + k == num) and (10000 * i + 5000 * j + 1000 * k == total):
        x , y , z = str(i) , str(j) , str(k)
        return x + ' ' + y + ' ' + z
res = check(n,Y)
if res is None:
  res = x + ' ' + y + ' ' + z
print(res)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = int(input())
b = int(input())

ttl = 0

for i in range(1,n+1):
  nums = sum(list(map(int,str(i)[:])))
  if nums >= a and nums <= b:
    ttl += i

print(ttl)

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

for i in range(1,n+1):
  nums = sum(list(map(int,str(i)[:])))
  if nums >= a and nums <= b:
    ttl += i

print(ttl)
Buggy python submission (verdict: Runtime Error):
n,k=map(int,input().split())
a=sorted(list(map(int,input().split())))
def groupby():
    global a
    a2=[[a[0],1]]
    for i in range(1,len(a)):
        if a2[-1][0]==a[i]:
            a2[-1][1]+=1
        else:
            a2.append([a[i],1])
    return a2
b=groupby()
b.sort(key=lambda x:x[1],reverse=True)
l=len(b)
ans=0
for i in range(k,l):
    ans+=b[i][1]
print(ans)

Fixed submission:
st = input()
tl = 0
for s in st[:]:
  tl += int(s)
print(tl)

Buggy python submission (verdict: Runtime Error):
n,k=map(int,input().split())
a=sorted(list(map(int,input().split())))
def groupby(src_list):
  dest_list=[[src_list[0],1]]
  for i in range(1,len(src_list)):
    if dest_list[-1][0]==src_list[i]:
      dest_list[-1][1]+=1
    else:
      dest_list.append([src_list[i],1])
  return dest_list
b=groupby(a)
b.sort(key=lambda x:x[1],reverse=True)
l=len(b)
ans=0
for i in range(k,l):
  ans+=b[i][1]
print(ans)

Fixed submission:
st = input()
tl = 0
for s in st[:]:
  tl += int(s)
print(tl)
Buggy python submission (verdict: Runtime Error):
n = int(input())
li = list(map(int,input().split()))
prod = 1
for i in range(n):
	prod *= li[i]

count = 0
while (prod % (2**n)) == 0:
	prod = int(prod / (2**n))
	count += 1
print(count)

Fixed submission:
input()
A = list(map(int, input().split()))
count = 0
while all(a % 2 == 0 for a in A):
    A = [a/2 for a in A]
    count += 1
print(count)

Buggy python submission (verdict: Runtime Error):
import numpy as np
import pandas as pd

a = input()
b = list(input())

Fixed submission:

input()
A = list(map(int,input().split()))
count = 0

while all(a % 2 == 0 for a in A):
  A = [a/2 for a in A]
  count += 1
  
print(count)
Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
x = int(input())

cnt = 0

for h in range(0,c):
  for i in range(0,b):
    for j in range(0,a):
      if (x == (500 * j + 100 * i + 50 * h))
      	cnt = cnt +1

  print(cnt)


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

cnt = 0

for h in range(0,c+1):
  for i in range(0,b+1):
    for j in range(0,a+1):
      if (x == ((500 * j) + (100 * i) + (50 * h))):
      	cnt = cnt +1

print(cnt)

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
x = int(input())

cnt = 0

for h in range(0,c):
  for i in range(0,b):
    for j in range(0,a):
      if (x == (500 * a + 100 * b + 50 * c))
      	cnt = cnt +1

  print(cnt)


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

cnt = 0

for h in range(0,c+1):
  for i in range(0,b+1):
    for j in range(0,a+1):
      if (x == ((500 * j) + (100 * i) + (50 * h))):
      	cnt = cnt +1

print(cnt)
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
if ((a*b) % 2) == 1)
	print("Odd")
else
	print("Even")


Fixed submission:
a, b = map(int, input().split())
if (((a*b) % 2) == 1):
	print("Odd")
else:
	print("Even")

Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
if ((a*b) % 2) == 1
	print("Odd")
else
	print("Even")


Fixed submission:
a, b = map(int, input().split())
if (((a*b) % 2) == 1):
	print("Odd")
else:
	print("Even")
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
"""
Created on Sat Mar 21 13:58:43 2020

@author: 藤原聖士
"""


N=int(input())
A=int(input())
B=int(input())

check=0
checks=0
count=0

for i in range(N):
    checks=0
    Ns=i+1
    while True:
        
        check=Ns%10
        checks+=check
        Ns=int(Ns/10)

        if Ns==0:
            break
    if checks>= A and checks<=B:
        count+=i+1
        #print(i)

print(count)

Fixed submission:
# -*- coding: utf-8 -*-
"""
Created on Sat Mar 21 13:58:43 2020

@author: 藤原聖士
"""

"""
N=int(input())
A=int(input())
B=int(input())
"""

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

check=0
checks=0
count=0

for i in range(N):
    checks=0
    Ns=i+1
    while True:
        
        check=Ns%10
        checks+=check
        Ns=int(Ns/10)

        if Ns==0:
            break
    if checks>= A and checks<=B:
        count+=i+1
        #print(i)

print(count)

Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
"""
Created on Sat Mar 21 13:58:43 2020

@author: 藤原聖士
"""


N=int(input())
A=int(input())
B=int(input())

check=0
checks=0
count=0

for i in range(N):
    checks=0
    Ns=i+1
    while True:
        
        check=Ns%10
        checks+=check
        Ns=int(Ns/10)

        if Ns==0:
            break
    if checks>= A and checks<=B:
        count+=i+1
        print(i)

print(count)

Fixed submission:
# -*- coding: utf-8 -*-
"""
Created on Sat Mar 21 13:58:43 2020

@author: 藤原聖士
"""

"""
N=int(input())
A=int(input())
B=int(input())
"""

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

check=0
checks=0
count=0

for i in range(N):
    checks=0
    Ns=i+1
    while True:
        
        check=Ns%10
        checks+=check
        Ns=int(Ns/10)

        if Ns==0:
            break
    if checks>= A and checks<=B:
        count+=i+1
        #print(i)

print(count)
Buggy python submission (verdict: Runtime Error):
N = int(input())
nums = sorted(list(map(int, input().split())) reverse = True)
print(sum(A[::2]) - sum(B[1::2]))


Fixed submission:
N = int(input())
nums = sorted(list(map(int, input().split())), reverse = True)
print(sum(nums[::2]) - sum(nums[1::2]))

Buggy python submission (verdict: Runtime Error):
N = int(input())
nums = sorted(list(map(int, input().split())) Reverse = True)
print(sum(A[::2]) - sum(B[1::2]))


Fixed submission:
N = int(input())
nums = sorted(list(map(int, input().split())), reverse = True)
print(sum(nums[::2]) - sum(nums[1::2]))

Buggy python submission (verdict: Runtime Error):
N = int(input())
nums = sorted(list(map(int, input().split()))[::-1])
A = 0
B = 0
for n in range(N):
  A = A + nums[2n]
  B = B + nums[2n+1]
print(A - B)


Fixed submission:
N = int(input())
nums = sorted(list(map(int, input().split())), reverse = True)
print(sum(nums[::2]) - sum(nums[1::2]))
Buggy python submission (verdict: Runtime Error):
a, b, c , x = [int(input()) i for range(4)]
n = 0
for i in range(a+1):
  for j in range(b+1):
    for k in range(c+1):
      if i*500 + j*100 + k*50 == x:
        n += 1
print(n)




Fixed submission:
a, b, c, x = [int(input()) for i in range(4)]
n = 0
for i in range(a+1):
  for j in range(b+1):
    for k in range(c+1):
      if i*500 + j*100 + k*50 == x:
        n += 1
print(n)

Buggy python submission (verdict: Runtime Error):
a, b, c , x = (int(input()) i for range(4))
n = 0
for i in range(a+1):
  for j in range(b+1):
    for k in range(c+1):
      if i*500 + j*100 + k*50 == x:
        n += 1
print(n)

Fixed submission:
a, b, c, x = [int(input()) for i in range(4)]
n = 0
for i in range(a+1):
  for j in range(b+1):
    for k in range(c+1):
      if i*500 + j*100 + k*50 == x:
        n += 1
print(n)
Buggy python submission (verdict: Runtime Error):
n=int(input())
for i in range(n):
    t,x,y=map(int,input().split())
    if (x+y)>t or (x+y+t)%2 == 0:
        print("No")
        exit()
print("Yes")


Fixed submission:
a, b = map(int, input().split())
if a*b % 2 == 0:
  print("Even")
else:
  print("Odd")
Buggy python submission (verdict: Runtime Error):
N = int(input())
T, X, Y = 0, 0, 0
count = 0
for i in range(N):
  t, x, y = map(int, input().split())
  dt = t - T
  dist = abs(x - X) + abs(y - Y)
  if dist <= dt and t%2 == (x+y)%:
    count += 1
  T, X, Y = t, x, y
print('Yes' if count == N else 'No')
    
  
  

       

Fixed submission:
N = int(input())
T, X, Y = 0, 0, 0
count = 0
for i in range(N):
  t, x, y = map(int, input().split())
  dt = t - T
  dist = abs(x - X) + abs(y - Y)
  if dist <= dt and t%2 == (x+y)%2:
    count += 1
  T, X, Y = t, x, y
print('Yes' if count == N else 'No')
Buggy python submission (verdict: Runtime Error):
N = int(input())
nums = [input(), for i in range(N)]
print(len(set(nums)))


Fixed submission:
N = int(input())
nums = [input() for i in range(N)]
print(len(set(nums)))
Buggy python submission (verdict: Runtime Error):
N, Y = map(int, input().split())
for i in (N+1):
  for j in (N+1):
    k = N-i-j
    if (Y == 10000*i + 5000*j + 1000*k and K > 0 ):
      print(i, j, f)
    else: 
      print(-1, -1, -1)

Fixed submission:
n, y = map(int, input().split())
for i in range(n + 1):
  for j in range(n + 1 -i):
    if 10000*i + 5000*j + 1000*(n - i -j) == y:
      print(i, j, n - i -j)
      break
  else:
    continue
  break
else:
  print('-1 -1 -1')
Buggy python submission (verdict: Runtime Error):
N, A, B = map(int, input().split())
ans = 0
for i in range(1, N+1):
  sum = 0
  k = i
  while k > 0:
    sum = sum + k % 10
    k = k // 10
  if A =< sum =< B:
    ans = ans + i
print(ans)
  


Fixed submission:
N, A, B = map(int, input().split())
ans = 0
for i in range(1, N+1):
  sum = 0
  k = i
  while k > 0:
    sum = sum + k % 10
    k = k // 10
  if A <= sum <= B:
    ans = ans + i
print(ans)

Buggy python submission (verdict: Runtime Error):
N, A, B = map(int, input().split())
ans = 0
for i in (1, N+1):
  sum = 0
  k = i
  while k > 0:
    sum = sum + k % 10
    k = k // 10
  if A =< sum =< B:
    ans = ans + i
print(ans)
  


Fixed submission:
N, A, B = map(int, input().split())
ans = 0
for i in range(1, N+1):
  sum = 0
  k = i
  while k > 0:
    sum = sum + k % 10
    k = k // 10
  if A <= sum <= B:
    ans = ans + i
print(ans)

Buggy python submission (verdict: Runtime Error):
N, A, B = map(int, input().split())
ans = 0
for i in (1, N+1):
  sum = 0
  k = n
  while k > 0:
    sum = sum + k % 10
    k = k // 10
  if A =< sum =< B:
    ans = ans + n
print(ans)
  

Fixed submission:
N, A, B = map(int, input().split())
ans = 0
for i in range(1, N+1):
  sum = 0
  k = i
  while k > 0:
    sum = sum + k % 10
    k = k // 10
  if A <= sum <= B:
    ans = ans + i
print(ans)
Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input().split())
if a + b + c > 0:
  print(a + b + c)
else:
  print(0)
  
  

Fixed submission:
print(input().count('1'))
Buggy python submission (verdict: Time Limit Exceeded):
N, Y = map(int, input().split())

flag = False
for i in range(N + 1):
    for j in range(N + 1):
        for k in range(N + 1):
            if i + j + k != N:
                continue

            if flag:
                break

            if 10000 * i + 5000 * j + 1000 * k == Y:
                flag = True
                break

        if flag:
            break

    if flag:
        break

if flag != True:
    i = -1
    j = -1
    k = -1

print(i, j, k)

Fixed submission:
N, Y = map(int, input().split())
ans = []
for i in range(N + 1):
    for j in range(N + 1):
        k = N - i - j
        if k < 0:
            break

        if 10000 * i + 5000 * j + 1000 * k == Y:
            ans = [i, j, k]

if ans == []:
    ans = [-1, -1, -1]

print(ans[0], ans[1], ans[2])
Buggy python submission (verdict: Runtime Error):
dic = {}
dic['a'] = int(input())
dic['b'], dic['c'] = map(int, input().split())
dic['s'] = input()

print(dic)

Fixed submission:
a, b = map(int, input().split())
m = a * b
output = 'Even' if m % 2 == 0 else 'Odd'
print(output)
Buggy python submission (verdict: Runtime Error):
bill_count, total_money = map(int, input().split())

def calc(total_money, bill_count):
  x_high_bound = int(total_money / 10000) if int(total_money / 10000) < bill_count else bill_count
  for x in range(x_high_bound + 1):
    hoge = bill_count - x
    if 10000 * x + 5000 * hoge < total_money: continue
    if 10000 * x + 1000 * hoge > total_money: continue
    for y in range(hoge + 1):
      for z in [bill_count - x - y]:
        if 10000 * x + 5000 * y + 1000 * z == total_money:
          return f'{x} {y} {z}'
  return '-1 -1 -1'

print(calc(total_money, bill_count))

Fixed submission:
bill_count, total_money = map(int, input().split())
patterns = [
  (x, y, bill_count - x - y) 
    for x in range(bill_count + 1) 
      for y in range(bill_count - x + 1) 
    if 10000*x + 5000*y + 1000*(bill_count - x - y) == total_money
]
print(" ".join(map(str, patterns[0])) if len(patterns) > 0 else '-1 -1 -1')

Buggy python submission (verdict: Runtime Error):
bill_count, total_money = map(int, input().split())

def calc(total_money, bill_count):
  x_high_bound = int(total_money / 10000) if int(total_money / 10000) < bill_count else bill_count
  for x in range(x_high_bound + 1):
    hoge = bill_count - x
    if 10000 * x + 5000 * hoge < total_money: continue
    if 10000 * x + 1000 * hoge > total_money: continue
    for y in range(hoge + 1):
      for z in [bill_count - x - y]:
        if 10000 * x + 5000 * y + 1000 * z == total_money:
          return f'{x} {y} {z}'
  return '-1 -1 -1'

print(calc(total_money, bill_count))

Fixed submission:
bill_count, total_money = map(int, input().split())
patterns = [
  (x, y, bill_count - x - y) 
    for x in range(bill_count + 1) 
      for y in range(bill_count - x + 1) 
    if 10000*x + 5000*y + 1000*(bill_count - x - y) == total_money
]
print(" ".join(map(str, patterns[0])) if len(patterns) > 0 else '-1 -1 -1')
Buggy python submission (verdict: Runtime Error):
n, min_num, max_num = [int(x) for x in input().split()]
xs = range(1, n + 1)

def digit_sum(x):
  return sum([int(d) for d in str(x)])
answers = [x for x in xs if min_num <= digit_sum(x) <= max_num]

print(sum(answers)) for x in answers

Fixed submission:
n, min_num, max_num = [int(x) for x in input().split()]
xs = range(1, n + 1)

def digit_sum(x):
  return sum([int(d) for d in str(x)])
answers = [x for x in xs if min_num <= digit_sum(x) <= max_num]

print(sum(answers))
Buggy python submission (verdict: Time Limit Exceeded):
N,Y = map(int,input().split())
flag = False
ans = ""
for x in range(N + 1):
  if flag:
    break
  for y in range(N + 1):
    if x + y > N or flag:
      break
    for z in range(N + 1):
      if x + y + z > N or flag:
        break
      if x * 10000 + y * 5000 + z * 1000 == Y and x + y + z == N:
        ans = str(x) + " " + str(y) + " " + str(z)
        flag = True
if flag:
  print(ans)
else:
  print("-1 -1 -1")

Fixed submission:
N,Y = map(int,input().split())
flag = False
ans = ""
for x in range(N + 1):
  if flag:
    break
  for y in range(N + 1):
    if x + y > N or flag:
      break
    if x*10000+y*5000+(N-x-y)*1000 == Y:
      ans = str(x) + " " + str(y) + " " + str(N-x-y)
      flag = True
if flag:
  print(ans)
else:
  print("-1 -1 -1")

Buggy python submission (verdict: Runtime Error):
print(ans)

n, y = map(int, input().split())
for i in range(n + 1):
    for j in range(n - i + 1):
        if i * 10000 + j * 5000 + (n - i - j) * 1000 == y:
            print(i, j, n - i - j)
            exit()
print("-1 -1 -1")


Fixed submission:
n, y = map(int, input().split())
for i in range(n + 1):
    for j in range(n - i + 1):
        if i * 10000 + j * 5000 + (n - i - j) * 1000 == y:
            print(i, j, n - i - j)
            exit()
print("-1 -1 -1")
Buggy python submission (verdict: Runtime Error):
print(input().cont("1"))


Fixed submission:
print(input().count("1"))
Buggy python submission (verdict: Runtime Error):
N = input()
a = sorted(list(map(int,input().split())), reverse=True)

print(sum(a[::2]) - a[1::2] )



Fixed submission:
n = int(input())
a = sorted(list(map(int, input().split())), reverse=True)
print(sum(a[::2]) - sum(a[1::2]))
Buggy python submission (verdict: Runtime Error):
A, B, C, X = map(int, input().split())

count = 0
for a in range(A+1):
  for b in range(B+1):
     for c in range(C+1):
        if a+b+c= X:
          count += 1

print(count)

Fixed submission:
a, b, c, x = map(int, [input() for i in range(4)])
ans = 0
for i in range(a+1):
    for j in range(b+1):
        for k in range(c+1):
            if i * 500 + j * 100 + k * 50 == x:
                ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
n = int(input())
for i in range(n)
  t,x,y=map(int,input().split())
  if (x+y) > t or (x+y+t)%2:
    print("NO")
    exit()
  print("YES")

Fixed submission:
n = int(input())
for i in range(n):
    t,x,y=map(int,input().split())
    if (x + y) > t or (x + y + t) % 2:
        print("No")
        exit()
print("Yes")
Buggy python submission (verdict: Runtime Error):
d = int(input()))
 
d = set(d)
print(len(d))

Fixed submission:
n = int(input())

di = set(map(int, [input() for i in range(n)]))

print(len(di))

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

d = set(d)
print(len(d))

Fixed submission:
n = int(input())

di = set(map(int, [input() for i in range(n)]))

print(len(di))
Buggy python submission (verdict: Runtime Error):
N, Y = map(int, input().split())
 
for x in range(N+1):
  for y in range(N+1-x):
        if x*10000 + y*5000 + (N+1-x-y)*1000 == Y:
           print(x, y, N+1-x-y)
       else:
           print(-1,-1,-1)

Fixed submission:
N, Y = map(int, input().split())
 
for x in range(N+1):
  for y in range(N+1-x):
        if x*10000 + y*5000 + (N-x-y)*1000 == Y:
           print(x, y, N-x-y)
           exit()
 
print("-1 -1 -1")

Buggy python submission (verdict: Runtime Error):
N, Y = map(int, input().split())

for x in range(N+1):
  for y in range(N+1-x):
    for z in range(N+1-y):
        if x*10000 + y*5000 + z*1000 == Y:
           print(x, y, z)
       else:
           print(-1,-1,-1)


Fixed submission:
N, Y = map(int, input().split())
 
for x in range(N+1):
  for y in range(N+1-x):
        if x*10000 + y*5000 + (N-x-y)*1000 == Y:
           print(x, y, N-x-y)
           exit()
 
print("-1 -1 -1")
Buggy python submission (verdict: Runtime Error):
print(input.count('1'))

Fixed submission:
print(input().count("1"))

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

count = 0
if a%2==1:
  count += 1
if b%2 == 1:
  count += 1
if c%2 == 1:
  count +1
 
print(count)

Fixed submission:
print(input().count("1"))
Buggy python submission (verdict: Runtime Error):
N = input()
A = list(map(int,input()))

ans=float("inf")
for i in A:
    ans = min(ans, len(bin(i)) - bin(i).rfind("1") - 1)
print(ans)


Fixed submission:
n = input()
a = list(map(int, input().split()))
ans = float("inf")
for i in a:
    ans = min(ans, len(bin(i)) - bin(i).rfind("1") - 1)
print(round(ans))
Buggy python submission (verdict: Runtime Error):
s=input().replace("eraser","").replace("erase","").replace("dreamer","").replace("dream","")
if s:
  print("NO)
else:
  print("YES")

Fixed submission:
s=input().replace("eraser","").replace("erase","").replace("dreamer","").replace("dream","")
if s:
    print("NO")
else:
    print("YES")

Buggy python submission (verdict: Runtime Error):
s=input().replace("dream","").replace("dreamer","").replace("eraser","").replace("erase","")

if s:
print("NO")
else:
print("YES")



Fixed submission:
s=input().replace("eraser","").replace("erase","").replace("dreamer","").replace("dream","")
if s:
    print("NO")
else:
    print("YES")
Buggy python submission (verdict: Runtime Error):
a_,b_=input().split()
a=(str)(a_)
b=(str)(b_)

if a%2==0:
  print("Even")
elif b%2==0:
  print("Even")
else:
  print("Odd")


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

if a%2==0:
    print("Even")
elif b%2==0:
    print("Even")
else:
    print("Odd")

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

if a%2==0:
  print("Even")
elif b%2==0:
  print("Even")
else:
  print("Odd")


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

if a%2==0:
    print("Even")
elif b%2==0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
a,b=input().split()
if a%2==0:
  print("Even")
  exit(0)
if a%2==0:
  print("Even")
  exit(0)
print("Odd")

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

if a%2==0:
    print("Even")
elif b%2==0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
a,b=input().split()
if not (int)(a)%2==0 and not (int)(b)%2==0:
  print("Odd")
  return
print("Even")

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

if a%2==0:
    print("Even")
elif b%2==0:
    print("Even")
else:
    print("Odd")

Buggy python submission (verdict: Runtime Error):
a,b=input().split()
if not a%2==0 and not b%2==0:
  print("Odd")
  return
print("Even")

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

if a%2==0:
    print("Even")
elif b%2==0:
    print("Even")
else:
    print("Odd")
Buggy python submission (verdict: Runtime Error):
N_,Y_=input().split()
N=(int)(N_)
Y=(int)(Y_)

count = 0
a_ = Y//10000
if a_>N:
    a_ = N
for a in range(a_+1):
    Y_ = Y-a*10000
    N_ = N-a
    b_ = Y_//5000
    if b_>N_ and b_>=0:
        b_ = N_
    for b in range(b_+1):
        Y_ = Y_-b*5000
        N_ = N_-b
        if c_%1000:
            c_ = Y_//1000
            if c_==N_ and c_>=0:
                print((str)(a)+" "+(str)(b)+" "+(str)(c_))
                exit(0)
print("-1 -1 -1")


Fixed submission:
N_,Y_=input().split()
N=(int)(N_)
Y=(int)(Y_)

count = 0
a_ = Y//10000
if a_>N:
    a_ = N
for a in range(a_+1):
    Y_ = Y-a*10000
    N_ = N-a
    b_ = Y_//5000
    if b_>N_ and b_>=0:
        b_ = N_
    for b in range(b_+1):
        Y__ = Y_-b*5000
        N__ = N_-b
        c_ = Y__//1000
        if Y__%1000==0:
            if c_==N__ and c_>=0:
                print((str)(a)+" "+(str)(b)+" "+(str)(c_))
                exit(0)
print("-1 -1 -1")
Buggy python submission (verdict: Runtime Error):
s = input().split()
a = s[0]
b = s[1]

if a % 2 == 0 or b % 2 == 0:
    print("Even")
else:
    print("Odd")


Fixed submission:
s = input().split()
a = int(s[0])
b = int(s[1])

if a % 2 == 0 or b % 2 == 0:
    print("Even")
else:
    print("Odd")