Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
from collections import Counter

def verify_anagrams(first_word, second_word):
  def get_counter(s):
    return Counter(s.upper().replace(' ', ''))
 
  global ana
  if get_counter(first_word) == get_counter(second_word):
    ana = ana + 1

ana = 0
N = int(input())
S = []
for _ in range(N):
  S.append(str(input()))

for i in range(N):
  for j in range(N):
    verify_anagrams(S[i],S[j])

Ans = int((ana - N)/2)
print(Ans)

Fixed submission:
import sys
 
Ans = 0
N = int(input())
S = []
T = []
U = []
for _ in range(N):
  S.append(str(input()))
T = ['a'] * N  
U = ['a'] * N
 
for i in range(N):
  U[i] = ''.join(sorted(S[i]))
 
T = sorted(U)
 
j = 0
while j < N:
  for k in range(1,N):
    if j + k == N - 1:
      if T[j] != T[j + k]:
        Ans = Ans + (k-1) * k / 2
      else:
        Ans = Ans + (k+1) * k / 2
        
      print(int(Ans))
      sys.exit()
      
    if T[j] != T[j + k]:
      Ans = Ans + (k-1) * k / 2
      a = k
      break
  
  j = j + a
  
print(int(Ans))
Buggy python submission (verdict: Runtime Error):
for _ in range(N):
    A.append(int(input()))

sort_A = sorted(A)
max = sort_A[N - 1]
sec = sort_A[N - 2]

count = A.count(max)

if count == 1:
  p = A.index(max)
  
  for i in range(p):
    print(max)
  
  print(sec)
  
  for j in range(p,N - 1):
    print(max)

else:
  for k in range(N):
    print(max)

Fixed submission:
N = int(input())
A = []
for _ in range(N):
    A.append(int(input()))

sort_A = sorted(A)
max = sort_A[N - 1]
sec = sort_A[N - 2]

count = A.count(max)

if count == 1:
  p = A.index(max)
  
  for i in range(p):
    print(max)
  
  print(sec)
  
  for j in range(p,N - 1):
    print(max)

else:
  for k in range(N):
    print(max)
Buggy python submission (verdict: Runtime Error):
N,D = map(int, input().split())

if D == 1:
  print(N * (N-1) // 2)
else:
  A = [0] * D
  count = 0
  sei = 0

  for i in range(0,N):
	  A[i] = list(map(int, input().split()))
    
  for p in range(0,N):
      for q in range(0,N):
          sum = 0
    
          for r in range(0,D):
              sum = sum + (A[p][r]-A[q][r]) ** 2
           
          sum = sum ** 0.5 
          sei = int(sum)
        
          if sum != 0 and sum == sei:
              count = count + 1
      
  print(count // 2)


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

if D == 1:
  print(N * (N-1) // 2)
else:
  A = [0] * N
  count = 0
  sei = 0

  for i in range(0,N):
	  A[i] = list(map(int, input().split()))
    
  for p in range(0,N):
      for q in range(0,N):
          sum = 0
    
          for r in range(0,D):
              sum = sum + (A[p][r]-A[q][r]) ** 2
           
          sum = sum ** 0.5 
          sei = int(sum)
        
          if sum != 0 and sum == sei:
              count = count + 1
      
  print(count // 2)

Buggy python submission (verdict: Runtime Error):
N,D = map(int, input().split())
A = [0] * D
count = 0
sei = 0

for i in range(0,N):
	A[i] = list(map(int, input().split()))
    
for p in range(0,N):
    for q in range(0,N):
        sum = 0
    
        for r in range(0,D):
            sum = sum + (A[p][r]-A[q][r]) ** 2
           
        sum = sum ** 0.5 
        sei = int(sum)
        
        if sum != 0 and sum == sei:
            count = count + 1
      
print(count // 2)

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

if D == 1:
  print(N * (N-1) // 2)
else:
  A = [0] * N
  count = 0
  sei = 0

  for i in range(0,N):
	  A[i] = list(map(int, input().split()))
    
  for p in range(0,N):
      for q in range(0,N):
          sum = 0
    
          for r in range(0,D):
              sum = sum + (A[p][r]-A[q][r]) ** 2
           
          sum = sum ** 0.5 
          sei = int(sum)
        
          if sum != 0 and sum == sei:
              count = count + 1
      
  print(count // 2)
Buggy python submission (verdict: Time Limit Exceeded):
L,R = map(int, input().split())
 
ans = 2019
for i in range(L,R):
  for j in range(i + 1,R + 1):
    aa = i * j
    aaa = aa % 2019
    
    if aaa < ans:
      ans = aaa
    
    if ans == 0:
      break
      
print(ans)

Fixed submission:
L,R = map(int, input().split())

if R - L >= 2019:
  print(0)
else:
  ans = 2019
  for i in range(L,R):
    for j in range(i + 1,R + 1):
      aa = i * j
      aaa = aa % 2019
    
      if aaa < ans:
        ans = aaa
    
      if ans == 0:
        break
      
  print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
L,R = map(int, input().split())

ans = 2019
for i in range(L,R):
  for j in range(i + 1,R + 1):
    aa = i * j
    aaa = aa % 2019
    
    if aaa < ans:
      ans = aaa
      
print(ans)

Fixed submission:
L,R = map(int, input().split())

if R - L >= 2019:
  print(0)
else:
  ans = 2019
  for i in range(L,R):
    for j in range(i + 1,R + 1):
      aa = i * j
      aaa = aa % 2019
    
      if aaa < ans:
        ans = aaa
    
      if ans == 0:
        break
      
  print(ans)
Buggy python submission (verdict: Runtime Error):
a = raw_input().split()
if a[0] < a[1]:
  print('0')
  else:
    print('10')

Fixed submission:
a = input().split()
if a[0] < a[1]:
  print('0')
else:
  print('10')

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

b, c = map(int, input().split())
if b < c:
  print('0')
  else:
    print('10')

Fixed submission:
a = input().split()
if a[0] < a[1]:
  print('0')
else:
  print('10')

Buggy python submission (verdict: Runtime Error):
b, c = map(int, input().split())
if b < c:
  print('0')
  else:
    print('10')


Fixed submission:
a = input().split()
if a[0] < a[1]:
  print('0')
else:
  print('10')
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
a = int(input())
b = input().split()
c = input().split()

for i in range(a):
    b[i] = int(b[i])
    c[i] = int(c[i])

out = "Yes"

def check_max(l, num):
    max_num = 0
    max_i = -1

    l_sorted = sorted(l)
    num_list = [-1] * num
    num_list2 = [-1] * num

    for i in reversed(range(num)):
        for j in range(num):
            if l_sorted[i] == l[j]:
                if num_list[j] == -1:
                    num_list[j] = i+1
                    num_list2[i] = j
                    break

    return (num_list, list(reversed(num_list2)))

def checklist(l1, l2, num):
    result = True
    for i in range(num):
        if l1[i] > l2[i]:
            result = False
            break
    return result 


if out == "Yes":
    swap_num = 0

    num_list_b, num_list_b_index = check_max(b,a)
    num_list_c, num_list_c_index = check_max(c,a)



    for i in range(a-2):
        index1 = num_list_b_index[i]
        index2 = num_list_c_index[i]


        

        if b[index1] <= c[index2]:
            b[index1], b[index2] = b[index2], b[index1]

if not checklist(b, c, a):
    out = "No"
else:
    out = "Yes"

print(out)

Fixed submission:
# -*- coding: utf-8 -*-
a = int(input())

if a % 2 == 0:
    r = a/2 -1
else:
    r = (a-1)/2

print("{}".format(int(r)))
Buggy python submission (verdict: Runtime Error):
a,b,c,d=[int(_) for _ in input().split()]
if a<0 or b<0 or c<0 or d<0:
    print(min(a,b)*max(c,d))
else:
    print(max(a,b)*max(c,d))
5 -4 8 -1

Fixed submission:
a,b,c,d=[int(_) for _ in input().split()]
ans=max(a*c,a*d,b*c,b*d)
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int,input().split()))

s = 0
m=10**9+7
for i in range(n-1):
    ss=0
    for j in range(i+1,n):
        ss+=a[j]
    ss=ss%m
    s+=(a[i]*ss)%m


print(s%m)



Fixed submission:

n = int(input())
mod = 1000000007
a = list(map(int,input().split()))
width = 0
ans = 0
for i in range(n):
    ans = (ans + a[i]*width)  % mod
    width = (width + a[i]) % mod

print(ans)

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

s = 0

for i in range(n-1):
    for j in range(i+1,n):
        s+=a[i]*a[j]

s = s%(10**9+7)

print(s)



Fixed submission:

n = int(input())
mod = 1000000007
a = list(map(int,input().split()))
width = 0
ans = 0
for i in range(n):
    ans = (ans + a[i]*width)  % mod
    width = (width + a[i]) % mod

print(ans)
Buggy python submission (verdict: Runtime Error):
n,n,x=input().strip()

Fixed submission:
import math
n,x,t = map(int,input().split())
print(math.ceil(n/x)*t)
Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split())
print(t+s)

Fixed submission:
s,t = input().split()
print(t+s)
Buggy python submission (verdict: Runtime Error):
xkd = input()

xstr,kstr,dstr = xkd.split()

x = int(xstr)
k = int(kstr)
d = int(dstr)

if x >= k*d:
    print(x-(k*d))
else:
    if x <= -(k*d):
        print(x+(k*d))
    else:
        if x <= 0:
            lxl = -x
        else:
            lxl = x
        if x <= 0:
            now_x = x + (d * (int(lxl / d) + 1))
            left_x = -now_x
            right_x = now_x + d
        else:
            now_x = x - (d * (int(lxl / d) + 1))
            left_x = -(now_x - d)
            right_x = now_x
        now_k = k - int(lxl / d) - 1
        if now_x <= 0:
            if now_k % 2 == 0:
                print(left_x)
            else:
                print(right_x)
        else:
            if now_k % 2 == 0:
                print(right_x)
            else:
                print(left_x)
            
        
        


Fixed submission:
sd = input()
ok = 0
if sd[0] == 'R':
    if sd[1] == 'R':
        if sd[2] == 'R':
            ok = 1
            print(3)
        else:
            ok = 1
            print(2)
    else:
        ok = 1
        print(1)
else:
    if sd[1] == 'R':
        if sd[2] == 'R':
            ok =1 
            print(2)
        else:
            ok = 1
            print(1)
    else:
        if sd[2] == 'R':
            print(1)
            ok = 1
if ok == 0:
    print(0)

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

x,k,d = int(xkd.split())

if x >= k*d:
    print(x-(k*d))
else:
    if x <= -(k*d):
        print(x+(k*d))
    else:
        if x <= 0:
            lxl = -x
        else:
            lxl = x
        if x <= 0:
            now_x = x + (d * (int(lxl / d) + 1))
            left_x = -now_x
            right_x = now_x + d
        else:
            now_x = x - (d * (int(lxl / d) + 1))
            left_x = -(now_x - d)
            right_x = now_x
        now_k = k - int(lxl / d) - 1
        if now_x <= 0:
            if now_k % 2 == 0:
                print(left_x)
            else:
                print(right_x)
        else:
            if now_k % 2 == 0:
                print(right_x)
            else:
                print(left_x)
            
        
        


Fixed submission:
sd = input()
ok = 0
if sd[0] == 'R':
    if sd[1] == 'R':
        if sd[2] == 'R':
            ok = 1
            print(3)
        else:
            ok = 1
            print(2)
    else:
        ok = 1
        print(1)
else:
    if sd[1] == 'R':
        if sd[2] == 'R':
            ok =1 
            print(2)
        else:
            ok = 1
            print(1)
    else:
        if sd[2] == 'R':
            print(1)
            ok = 1
if ok == 0:
    print(0)
Buggy python submission (verdict: Runtime Error):
n = int(input())
l_before = input()

l = l_before.split(' ')
lnum = len(l)


i = 0
j = 0
k = 0

count = 0

for ic in range(lnum):
    for jc in range(lnum-ic-1):
        for kc in range(lnum-ic-jc-1):
            i = ic
            j = ij + ic
            k = ij + ic +ik
            if i + j >= k:
                count = count + 1
            else:
                if i + k >= j:
                    count = count + 1
                else:
                    if k + j >= i:
                        count = count + 1

print(count)


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

l = l_before.split(' ')



i = 0
j = 0
k = 0

count = 0

for ic in range(n):
    for jc in range(n-ic-1):
        for kc in range(n-ic-jc-2):
            i = ic
            j = i + jc + 1
            k = j + kc + 1
            if int(l[i]) != int(l[j]):
                if int(l[j]) != int(l[k]):
                    if int(l[i]) != int(l[k]):
                        if int(l[i]) >= int(l[j]):
                            if int(l[k]) >= int(l[i]):
                                if int(l[k]) < int(l[i]) + int(l[j]):
                                    count = count + 1
                            else:
                                if int(l[i]) < int(l[k]) + int(l[j]):
                                    count = count + 1
                        else:
                            if int(l[k]) > int(l[j]):
                                if int(l[k]) < int(l[i]) + int(l[j]):
                                    count = count + 1
                            else:
                                if int(l[j]) < int(l[k]) + int(l[i]):
                                    count = count + 1

print(count)
Buggy python submission (verdict: Runtime Error):
x,k,d=map(int,input().split())
x=abs(x) 

if x%d==0:
    minNear  = x%d + d
    minFar = x%d
    minTransitionToNear = (x-minNear)/d
else:
    minNear  = x%d
    minFar = x%d - d
    minTransitionToNear = (x-minPlus)/d
    
if k<minTransitionToNear:
    print(x-k*d)
else:
    if (k-minTransitionToNear)%2==0:
        print(minNear)
    else:
        print(minFar)

Fixed submission:
x,k,d=map(int,input().split())
x=abs(x) 

if x%d==0:
    minNear  = x%d + d
    minFar = x%d
    minTransitionToNear = (x-minNear)/d
    #print(minNear)
    #print(minFar)
    #print(minTransitionToNear)
    
else:
    minNear  = x%d
    minFar = x%d - d
    minTransitionToNear = (x-minNear)/d
    #print(minNear)
    #print(minFar)
    #print(minTransitionToNear)
    
if k<minTransitionToNear:
    print(x-k*d)
else:
    if (k-minTransitionToNear)%2==0:
        print(abs(minNear))
    else:
        print(abs(minFar))
Buggy python submission (verdict: Runtime Error):
X,N=map(int,input().split())

if N==0:
    _=input()
    print(X)

Ps=list(map(int,input().split()))

d=0
while 1:
    d+=1
    if X-d not in  Ps:
        print(X-d)
        break
    elif X+d not in Ps:
        print(X+d)
        break

Fixed submission:
X,N=map(int,input().split())
 
if N==0:
    _=input()
    print(X)
    
else:
    Ps=list(map(int,input().split()))
    d=0
    while 1:
        if X-d not in  Ps:
            print(X-d)
            break
        elif X+d not in Ps:
            print(X+d)
            break
        d+=1
Buggy python submission (verdict: Runtime Error):
n=input()
A=eval('*'.join(input().split()))
print(-1 if A>10**18 else A)

Fixed submission:
#169B
N=int(input())
As=list(map(int,input().split()))

if min(As)==0:
    num=0
else:
    num=1
    for i in range(N):
        num *= As[i]
        if num>10**18:
            num=-1
            break

print(num)

Buggy python submission (verdict: Runtime Error):
_=input()
A=eval('*'.join(input().split()))
print(-1 if A>10**18 else A)

Fixed submission:
#169B
N=int(input())
As=list(map(int,input().split()))

if min(As)==0:
    num=0
else:
    num=1
    for i in range(N):
        num *= As[i]
        if num>10**18:
            num=-1
            break

print(num)

Buggy python submission (verdict: Runtime Error):
if min(As)==0:
    num=0
else:
    num=1
    for i in range(N):
        num *= As[i]
        if num>10**18:
            print("breakに突入")
            num=-1
            break

print(num)

Fixed submission:
#169B
N=int(input())
As=list(map(int,input().split()))

if min(As)==0:
    num=0
else:
    num=1
    for i in range(N):
        num *= As[i]
        if num>10**18:
            num=-1
            break

print(num)
Buggy python submission (verdict: Runtime Error):
A,B=map(int,input().split())
if A==B:
    print("Draw")
elif (A>B or A:
    print("Alice")
else:
    print("Bob")

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

for A in range(2):
    if As[A]==1:
        As[A]+=13
        
if As[0]==As[1]:
    print("Draw")
elif As[0]>As[1]:
    print("Alice")
else:
    print("Bob")

Buggy python submission (verdict: Runtime Error):
A,B=map(int,input().split())
if A==B:
    print("Draw")
elif or(A>B,A==1):
    print("Alice")
else:
    print("Bob")

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

for A in range(2):
    if As[A]==1:
        As[A]+=13
        
if As[0]==As[1]:
    print("Draw")
elif As[0]>As[1]:
    print("Alice")
else:
    print("Bob")
Buggy python submission (verdict: Runtime Error):
print("A"+"RB"[int(input())<1200)]+"C")

Fixed submission:
print("A"+"RB"[int(input())<1200]+"C")
Buggy python submission (verdict: Runtime Error):
a,op,b=input()
a=int(a)
b=int(b)

if op=="+":
  print(a+b)
else:
  print(a-b)
  

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

if op=="+":
  print(a+b)
else:
  print(a-b)
Buggy python submission (verdict: Runtime Error):
c=input()
listVowels=["a","e","i","o","u"]
isVowel=c in vowelslist
if isVowel:
    print("vowel")
else:
    print("consonant")

Fixed submission:
c=input()
listVowels=["a","e","i","o","u"]
isVowel=c in listVowels
if isVowel:
    print("vowel")
else:
    print("consonant")

Buggy python submission (verdict: Runtime Error):
c=input()
listVowels=["a","e","i","o","u"]
isVowel=c in vowelslist
if isVowel:
    print("vowel")
else:
    print("consonant")

Fixed submission:
c=input()
listVowels=["a","e","i","o","u"]
isVowel=c in listVowels
if isVowel:
    print("vowel")
else:
    print("consonant")

Buggy python submission (verdict: Runtime Error):
listVowels=["a","e","i","o","u"]
isVowel=input() in vowelslist
if isVowel:
    print("vowel")
else:
    print("consonant")

Fixed submission:
c=input()
listVowels=["a","e","i","o","u"]
isVowel=c in listVowels
if isVowel:
    print("vowel")
else:
    print("consonant")
Buggy python submission (verdict: Runtime Error):
a,b,x=map(int,input().split())
print(len(list(range(a,b+1,x)))-(a==b))

Fixed submission:
a,b,x=map(int,input().split())
print(b//x-a//x+(a%x==0))

Buggy python submission (verdict: Runtime Error):
a,b,x=map(int,input().split())
print(len(list(range(a,b+1,x)))-(a==b))

Fixed submission:
a,b,x=map(int,input().split())
print(b//x-a//x+(a%x==0))

Buggy python submission (verdict: Runtime Error):
a,b,x=map(int,input().split())
print(len(list(range(a,b+1,x)))-(a==b

Fixed submission:
a,b,x=map(int,input().split())
print(b//x-a//x+(a%x==0))
Buggy python submission (verdict: Runtime Error):
N, M = list(map(int, input().split()))

d = {i: [] for i in range(1, N + 1)}
for _ in range(M):
    a, b = list(map(int, input().split()))
    d[a].append(b)
    d[b].append(a)

visited = [False for _ in range(N + 1)]


def visit(x):
    if visited[x]:
        return 0
    visited[x] = True

    z = 1
    for y in d[x]:
        z += visit(y)
    return z


m = 1
for i in range(1, N + 1):
    r = visit(i)
    if m < r:
        m = r

print(m)


Fixed submission:
import sys
sys.setrecursionlimit(10000000)

N, M = list(map(int, input().split()))

d = {i: [] for i in range(1, N + 1)}
for _ in range(M):
    a, b = list(map(int, input().split()))
    d[a].append(b)
    d[b].append(a)

visited = [False for _ in range(N + 1)]


def visit(x):
    if visited[x]:
        return 0
    visited[x] = True

    z = 1
    for y in d[x]:
        z += visit(y)
    return z


m = 1
for i in range(1, N + 1):
    r = visit(i)
    if m < r:
        m = r

print(m)
Buggy python submission (verdict: Runtime Error):
x = int(input())

rs = [i ** 5 for i in range(300)]

for r in rs:
    if (x - r) in rs:
        print(rs.index(r), - rs.index(x - r))
    elif (x + r) in rs:
        print(rs.index(r), rs.index(x - r))
    else:
        continue
    break


Fixed submission:
x = int(input())

rs = [i ** 5 for i in range(300)]

for r in rs:
    if r <= x:
        if x - r in rs:
            print(rs.index(r), - rs.index(x - r))
            break
    if r > x:
        if r - x in rs:
            print(rs.index(r), rs.index(r - x))
            break
Buggy python submission (verdict: Runtime Error):
n = int(input())

if type(n / 9) == int:
  print("Yes")
else:
  print("No")

Fixed submission:
n = input()
t = sum(list(map(int, list(n))))


if int(t / 9) == t / 9:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
for i in range(1, 1 + int(input())):

  match_pattern = []

  for x in range(1, 32):
    for y in range(1, 32):
      for z in range(1, 32):

        if i == (x**2 + y ** 2 + z ** 2 + x * y + y * z + z * x):
          match_pattern.append([x, y, z])
  
  print(len(match_pattern))

Fixed submission:
min, max, b = map(int, input().split())
result = 0
for i in range(min, max + 1):
  if i % b == 0:
    result += 1

print(result)
Buggy python submission (verdict: Runtime Error):
n = int(readline())
a = list(map(int, readline().split()))
max_l = max(a)
ans = 0
for i in range(n):
    if i == 0 and max_l:
        continue
    elif i < max_l:
        ans += 1
    else:
        ans = 0
print(ans)

Fixed submission:
from sys import stdin
readline = stdin.readline
n = int(readline())
a = list(map(int, readline().split()))
x = 0
ans = 0
for i in a:
    if x > i:
        ans += (x-i)
    else:
        x = i
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in a:
    if i == 0 and max(a):
        continue
    elif i < max(a):
        ans += 1

print(ans)

Fixed submission:
from sys import stdin
readline = stdin.readline
n = int(readline())
a = list(map(int, readline().split()))
x = 0
ans = 0
for i in a:
    if x > i:
        ans += (x-i)
    else:
        x = i
print(ans)
Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
x = int(input())
counts = 0
for A in range(a + 1):
    for B in range(b + 1):
        for C in range(c + 1):
            if (500 * a + 100 * b + 50 * c) == X:
                counts += 1
print(counts)

Fixed submission:
a = int(input())
b = int(input())
c = int(input())
x = int(input())
counts = 0
for A in range(a + 1):
    for B in range(b + 1):
        for C in range(c + 1):
            if (500 * A + 100 * B + 50 * C) == x:
                counts += 1
print(counts)
Buggy python submission (verdict: Runtime Error):
a, b = int(input().split())
if a % b == 0:
  print("odd")
else:
  print("even")

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

Buggy python submission (verdict: Runtime Error):
a = 20
b = map(int, input().split())
print("Odd" if a % b == 0)

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

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

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

Buggy python submission (verdict: Runtime Error):
a = 20
b = int(input())
print("even" if a % b == 0 else "odd")

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

Buggy python submission (verdict: Runtime Error):
a = 20
b = int(input())
if a % b == 0:
    print("even")
else:
    print("odd")

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

Buggy python submission (verdict: Runtime Error):
a = 20
b = int(input())
if a % b == 0 and a % b != 0:
    print("even")
else:
    print("odd")

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

Buggy python submission (verdict: Runtime Error):
a = 10
b = int(input())
if a % b == 0:
    print("even")
elif a % b != 0:
    print("odd")

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

Buggy python submission (verdict: Runtime Error):
a = 20
b = int(input)
if a % b == 0:
  print("even")
elif a % b != 0:
  print("odd")

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