Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
a,b = map(int, input().split())
if a*b % 2 == 0
    print("Even")
else
    print("Odd")

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

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

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

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

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

Fixed submission:
a = list(input())
for i in range(3):
    a[i] = int(a[i])
print(a[0]+a[1]+a[2])

Buggy python submission (verdict: Runtime Error):
a,b,c = (int(i) for i in input().split())
print(a+b+c)

Fixed submission:
a = list(input())
for i in range(3):
    a[i] = int(a[i])
print(a[0]+a[1]+a[2])

Buggy python submission (verdict: Runtime Error):
a,b,c = map(int(i) for i in input().split())
print(a+b+c)

Fixed submission:
a = list(input())
for i in range(3):
    a[i] = int(a[i])
print(a[0]+a[1]+a[2])

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

Fixed submission:
a = list(input())
for i in range(3):
    a[i] = int(a[i])
print(a[0]+a[1]+a[2])

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

Fixed submission:
a = list(input())
for i in range(3):
    a[i] = int(a[i])
print(a[0]+a[1]+a[2])

Buggy python submission (verdict: Runtime Error):
def num_2n(i):
    count = 0
    while(i % 2 == 0):
        i = i / 2
        count += 1
    return count



def main():
    num_ans = int(input())
    ans_list = list(map(int, input().split()))
    num_2n_list =[]
    for i in ans_list:
        num_2n_list.append(num_2n(i))
    num_2n_list.sort()
    num_2n_list.reverse()
    print(num_2n_list[0])


if __name__ == '__main__':
    main()


Fixed submission:
def main():
    ans_list = list(str(input().split()))
    print(ans_list.count("1"))


if __name__ == '__main__':
    main()

Buggy python submission (verdict: Runtime Error):
def num_2n(i):
    count = 0
    while(i % 2 == 0):
        i = i / 2
        count += 1
    return count



def main():
    num_ans = int(input())
    ans_list = list(map(int, input().split()))
    num_2n_list =[]
    for i in ans_list:
        num_2n_list.append(num_2n(i))
    num_2n_list.sort()
    num_2n_list.reverse()
    print(num_2n_list)


if __name__ == '__main__':
    main()

Fixed submission:
def main():
    ans_list = list(str(input().split()))
    print(ans_list.count("1"))


if __name__ == '__main__':
    main()
Buggy python submission (verdict: Time Limit Exceeded):
import re


def judge(x, y, listJ):
    count = 0
    for n in range(x, y):
        if n in listJ:
            count += 1
    return count


L1 = input()
L1 = L1.split()
N = int(L1[0])
Q = int(L1[1])
S = input()
k = re.finditer('AC', S)
listJ = []
for each in k:
    listJ.append(each.start()+1)
inputList = []
for i in range(1, Q+1):
    inputList.append(input())
for i in range(0, Q):
    a = inputList[i]
    a = a.split()
    result = judge(int(a[0]), int(a[1]), listJ)
    print(result)

Fixed submission:
N, Q = map(int, input().split())
S = input()
t = [0] * (N+1)
for i in range(0, N):
    if S[i:i+2] == 'AC':
        t[i+1] = t[i] + 1
    else:
        t[i+1] = t[i]
inputList = []
for i in range(1, Q+1):
    inputList.append(input())

for i in range(Q):
    x, y = map(int, inputList[i].split())
    res = t[y-1] - t[x-1]
    print(res)

Buggy python submission (verdict: Time Limit Exceeded):
L1 = input()
L1 = L1.split()
N = int(L1[0])
Q = int(L1[1])
S = input()
inputList = []
for i in range(1, Q+1):
    inputList.append(input())
for i in range(0, Q):
    a = inputList[i]
    a = a.split()
    b = S[int(a[0])-1:int(a[1])]
    c = b.count('AC')
    print(c)


Fixed submission:
N, Q = map(int, input().split())
S = input()
t = [0] * (N+1)
for i in range(0, N):
    if S[i:i+2] == 'AC':
        t[i+1] = t[i] + 1
    else:
        t[i+1] = t[i]
inputList = []
for i in range(1, Q+1):
    inputList.append(input())

for i in range(Q):
    x, y = map(int, inputList[i].split())
    res = t[y-1] - t[x-1]
    print(res)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(raw_input())
L = []
for i in range(N):
  L.append(raw_input())
A = []
B = []
for i in range(N):
    # print(L[i])
    L[i] = L[i].split()
    A.append([int(L[i][0]), int(L[i][1]), i])
    B.append([int(L[i][1]), int(L[i][0]), i])
    L[i].append(i)
A.sort()
B.sort()
used = []
time = 0
resultA = 0
resultB = 0
i = N-1
while i >= 0:
    if time % 2 == 0:
        if A[i][2] not in used:
            resultA += A[i][0]
            used.append(A[i][2])
            time += 1
    else:
        if B[i][2] not in used:
            resultB += B[i][0]
            used.append(B[i][2])
            time += 1
    i -= 1

result = resultA - resultB
# print(used)
print(result)

Fixed submission:
N = int(raw_input())
L = []
for i in range(N):
  L.append(raw_input())
result = []
sumA = 0
sumB = 0
for i in range(N):
    L[i] = L[i].split()
    result.append([int(L[i][0]) + int(L[i][1]), i])
result.sort()
for i in range(N-1, -1, -2):
    index = result[i][1]
    sumA += int(L[index][0])
for i in range(N-2, -1, -2):
    index = result[i][1]
    sumB += int(L[index][1])
result_K = sumA - sumB
print(result_K)
Buggy python submission (verdict: Runtime Error):
N = int(raw_input())
H = raw_input()
H = H.split()
for i, val in enumerate(H):
    H[i] = int(val)
Top = 0
Bottom = len(H)-1
T_PList = [0, Bottom]
count = max(H)
total = 0
Top_L = []
Bot_L = []
current_top = H[0]
current_bot = H[0]
if N <= 2:
    print(count)
else:
    if H[0] > H[1]:
        Top_L.append(H[0])
        current_bot = H[1]
        current_top = [-1]
    elif H[0] < H[1]:
        current_top = H[1]
        current_bot = -1

    for i in range(2,len(H),1):
        if (current_top == H[i-1]) & (H[i]>H[i-1]):
            current_top = H[i]
        elif (current_top == H[i-1]) & (H[i]<H[i-1]):
            Top_L.append(current_top)
            current_bot = H[i]
            current_top = -1
        elif (current_bot == H[i-1]) & (H[i]<H[i-1]):
            current_bot = H[i+1]
        elif (current_bot == H[i-1]) & (H[i]>H[i-1]):
            Bot_L.append(current_bot)
            current_bot = -1
            current_top = H[i]
        # print(current_top)
        # print(current_bot)
    last = len(H)
    if H[last-1] > H[last-2]:
        Top_L.append(H[last-1])
    print(sum(Top_L)-sum(Bot_L))




Fixed submission:
N = int(input())
H = input()
H = H.split()
for i, val in enumerate(H):
    H[i] = int(val)
maxNum = max(H)
counter = 0
for i in range(maxNum):
    for j, val in enumerate(H):
        if H[j] != 0:
            H[j] -= 1
            if j < (N-1):
                if H[j + 1] == 0:
                    counter += 1
            if j == (N - 1):
                counter += 1
    # print(H)
    # print(counter)
print(counter)

Buggy python submission (verdict: Runtime Error):
N = int(raw_input())
H = raw_input()
H = H.split()
for i, val in enumerate(H):
    H[i] = int(val)
Top = 0
Bottom = len(H)-1
T_PList = [0, Bottom]
count = max(H)
total = 0
Top_L = []
Bot_L = []
current_top = H[0]
current_bot = H[0]
if H[0] > H[1]:
    Top_L.append(H[0])
    current_bot = H[1]
    current_top = [-1]
elif H[0] < H[1]:
    current_top = H[1]
    current_bot = -1

for i in range(2,len(H),1):
    if (current_top == H[i-1]) & (H[i]>H[i-1]):
        current_top = H[i]
    elif (current_top == H[i-1]) & (H[i]<H[i-1]):
        Top_L.append(current_top)
        current_bot = H[i]
        current_top = -1
    elif (current_bot == H[i-1]) & (H[i]<H[i-1]):
        current_bot = H[i+1]
    elif (current_bot == H[i-1]) & (H[i]>H[i-1]):
        Bot_L.append(current_bot)
        current_bot = -1
        current_top = H[i]
    # print(current_top)
    # print(current_bot)
last = len(H)
if H[last-1] > H[last-2]:
    Top_L.append(H[last-1])
print(sum(Top_L)-sum(Bot_L))




Fixed submission:
N = int(input())
H = input()
H = H.split()
for i, val in enumerate(H):
    H[i] = int(val)
maxNum = max(H)
counter = 0
for i in range(maxNum):
    for j, val in enumerate(H):
        if H[j] != 0:
            H[j] -= 1
            if j < (N-1):
                if H[j + 1] == 0:
                    counter += 1
            if j == (N - 1):
                counter += 1
    # print(H)
    # print(counter)
print(counter)
Buggy python submission (verdict: Time Limit Exceeded):
L = raw_input()
L = L.split()
count = 0
for i, val in enumerate(L):
    L[i] = int(val)
while (L[0] > 0) | (L[1] > 0):
    if L[2] > 0:
        if L[0] > 0:
            L[0] -= 1
            count += 1
        else:
            L[1] -= 1
            count += 2
        L[2] -= 1
    else:
        L[0] = 0
        L[1] -= 1
        count += 1
if L[2] > 0:
    count += 1
print(count)




Fixed submission:
L = raw_input()
L = L.split()
count = 0
for i, val in enumerate(L):
    L[i] = int(val)
sum = L[0] + L[1]
if sum < L[2]-1:
    count = L[0] + 2*L[1] + 1
else:
    count = L[2] + L[1]
print(count)

Buggy python submission (verdict: Time Limit Exceeded):
L = raw_input()
L = L.split()
count = 0
for i, val in enumerate(L):
    L[i] = int(val)
while (L[0] > 0) | (L[1] > 0):
    if L[2] > 0:
        if L[0] > 0:
            L[0] -= 1
            count += 1
        else:
            L[1] -= 1
            count += 2
        L[2] -= 1
    else:
        L[1] -= 1
        count += 1
if L[2] > 0:
    count += 1
print(count)




Fixed submission:
L = raw_input()
L = L.split()
count = 0
for i, val in enumerate(L):
    L[i] = int(val)
sum = L[0] + L[1]
if sum < L[2]-1:
    count = L[0] + 2*L[1] + 1
else:
    count = L[2] + L[1]
print(count)
Buggy python submission (verdict: Runtime Error):
str = input()

if (str == 'A'):
  print('T')
else if (str == 'T'):
  print('A')
else if (str == 'C'):
  print('G')
else:
  print('C')

  


Fixed submission:
str = input()
 
if str == 'A':
  print('T')
elif str == 'T':
  print('A')
elif str == 'C':
  print('G')
else:
  print('C')
Buggy python submission (verdict: Runtime Error):
n,m=map(int,input().split())
for x in range(n+1):
    for y in range(n+1-x):
        if 10000*x+5000*y+1000*(n-x-y)==m and x+y+(n-x-y)==n:
            print(x,y,(n-x-y))
            exit()
print('-1 -1 -1')

Fixed submission:
_,b,c=map(str,input().split("/"))
print("2018/"+b+"/"+c)
Buggy python submission (verdict: Time Limit Exceeded):
import sys
n,m=map(int,input().split())
for x in range(n+1):
    for y in range(n+1):
        for z in range(n+1):
            if 10000*x+5000*y+1000*z==m and x+y+z==n:
                print(x,y,z)
                sys.exit()
print("-1 -1 -1")

Fixed submission:
n,m=map(int,input().split())
for x in range(n+1):
    for y in range(n+1-x):
        if 10000*x+5000*y+1000*(n-x-y)==m:
            print(x,y,(n-x-y))
            exit()
print('-1 -1 -1')
Buggy python submission (verdict: Runtime Error):
import collections
N,K=map(int,input().split())
c=sorted(collections.Counter(list(map(str,input().split()))).values())
print(sum(c[:-K]))


Fixed submission:
S=input()
num_list=list(S)
sum=0
for s in num_list:
    if s=='1':
        sum+=1
print(sum)
Buggy python submission (verdict: Runtime Error):
inp = input()
if 'a' and 'b' and 'c' in [inp[0],inp[1],inp[2]]: print('Yes')
else print('No')

Fixed submission:
inp = input()
if 'a' in [inp[0],inp[1],inp[2]] and 'b' in [inp[0],inp[1],inp[2]] and 'c' in [inp[0],inp[1],inp[2]]: print('Yes')
else: print('No')
Buggy python submission (verdict: Runtime Error):
import numpy as np
A, B, C = map(int,input().split(' '))

Srt = np.sort([A,B,C])

if np.sum(Srt % 2) == (0 or 3): a = 0
elif np.sum(Srt % 2) == (1 or 2): a = 1

num = a + np.sum(Srt[2] // 2 - (Srt // 2))

print(num)

Fixed submission:
import numpy as np
A, B, C = map(int,input().split(' '))

Srt = np.sort([A,B,C])

if np.sum(Srt % 2) == 0: a = 0; ad = 0;
elif np.sum(Srt % 2) == 1: a = 1; ad = 1;
elif np.sum(Srt % 2) == 2: a = 1; ad = 0;
elif np.sum(Srt % 2) == 3: a = 0; ad = 1;

#num = a + np.sum(Srt[2] // 2 - (Srt // 2))
Add = (Srt + ad) % 2
newSrt = Srt + Add

#print(a)
#print(newSrt)

print(int(a + np.sum((newSrt[2]- newSrt)/2)))
Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np

N = int(input())

inp = map(int,input().split(' '))

A = [int(i) for i in inp]

for j in range(N):
    B = np.hstack(([0],np.delete(A, j),[0]))
    print(int(np.sum(np.abs(np.diff(B,n=1)))))

Fixed submission:
import numpy as np

N = int(input())

inp = map(int,input().split(' '))

A = [0] + [int(i) for i in inp] + [0]
s = np.sum(np.abs(np.diff(A,n=1)))

for j in range(1,N+1):
    df = np.abs(A[j+1]-A[j-1]) - np.abs(A[j]-A[j-1]) - np.abs(A[j+1]-A[j])
    print(int(s+df))

Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np

N = int(input())

inp = map(int,input().split(' '))

A = [int(i) for i in inp]

for i in range(N):
    B = np.hstack(([0],np.delete(A, i),[0]))
    X = [np.abs(B[j] - B[j+1]) for j in range(N)]
    print(int(np.sum(X)))

Fixed submission:
import numpy as np

N = int(input())

inp = map(int,input().split(' '))

A = [0] + [int(i) for i in inp] + [0]
s = np.sum(np.abs(np.diff(A,n=1)))

for j in range(1,N+1):
    df = np.abs(A[j+1]-A[j-1]) - np.abs(A[j]-A[j-1]) - np.abs(A[j+1]-A[j])
    print(int(s+df))

Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np

N = int(input())

inp = map(int,input().split(' '))

A = [int(i) for i in inp]

X = [np.hstack(([0],np.delete(A, i))) for i in range(N)]
Y = [np.hstack((np.delete(A, i),[0])) for i in range(N)]

Ans = [sum(np.abs(X[i]-Y[i])) for i in range(N)]

for i in range(N):
    print(int(Ans[i]))


Fixed submission:
import numpy as np

N = int(input())

inp = map(int,input().split(' '))

A = [0] + [int(i) for i in inp] + [0]
s = np.sum(np.abs(np.diff(A,n=1)))

for j in range(1,N+1):
    df = np.abs(A[j+1]-A[j-1]) - np.abs(A[j]-A[j-1]) - np.abs(A[j+1]-A[j])
    print(int(s+df))

Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np

N = int(input())

inp = map(int,input().split(' '))

A = [int(i) for i in inp]

for i in range(N):
    B = A.copy()
    B = np.delete(B, i)
    X = np.hstack(([0],B))
    Y = np.hstack((B,[0]))
    res = np.abs(X-Y)
    print(int(np.sum(res)))


Fixed submission:
import numpy as np

N = int(input())

inp = map(int,input().split(' '))

A = [0] + [int(i) for i in inp] + [0]
s = np.sum(np.abs(np.diff(A,n=1)))

for j in range(1,N+1):
    df = np.abs(A[j+1]-A[j-1]) - np.abs(A[j]-A[j-1]) - np.abs(A[j+1]-A[j])
    print(int(s+df))
Buggy python submission (verdict: Runtime Error):
if S.startswith('k') and S.endswith('eyence'):
    print('YES')
elif S.startswith('ke') and S.endswith('yence'):
    print('YES')
elif S.startswith('key') and S.endswith('ence'):
    print('YES')
elif S.startswith('keye') and S.endswith('nce'):
    print('YES')
elif S.startswith('keyen') and S.endswith('ce'):
    print('YES')
elif S.startswith('keyenc') and S.endswith('e'):
    print('YES')
elif S == 'keyence':
    print('YES')
else:
    print('NO')

Fixed submission:
S = raw_input()
if S.startswith('k') and S.endswith('eyence'):
    print('YES')
elif S.startswith('ke') and S.endswith('yence'):
    print('YES')
elif S.startswith('key') and S.endswith('ence'):
    print('YES')
elif S.startswith('keye') and S.endswith('nce'):
    print('YES')
elif S.startswith('keyen') and S.endswith('ce'):
    print('YES')
elif S.startswith('keyenc') and S.endswith('e'):
    print('YES')
elif S == 'keyence':
    print('YES')
else:
    print('NO')

Buggy python submission (verdict: Runtime Error):
if S.startswith('k') and S.endswith('eyence'):
    print('YES')
elif S.startswith('ke') and S.endswith('yence'):
    print('YES')
elif S.startswith('key') and S.endswith('ence'):
    print('YES')
elif S.startswith('keye') and S.endswith('nce'):
    print('YES')
elif S.startswith('keyen') and S.endswith('ce'):
    print('YES')
elif S.startswith('keyenc') and S.endswith('e'):
    print('YES')
elif S == 'keyence':
    print('YES')
else:
    print('NO')

Fixed submission:
S = raw_input()
if S.startswith('k') and S.endswith('eyence'):
    print('YES')
elif S.startswith('ke') and S.endswith('yence'):
    print('YES')
elif S.startswith('key') and S.endswith('ence'):
    print('YES')
elif S.startswith('keye') and S.endswith('nce'):
    print('YES')
elif S.startswith('keyen') and S.endswith('ce'):
    print('YES')
elif S.startswith('keyenc') and S.endswith('e'):
    print('YES')
elif S == 'keyence':
    print('YES')
else:
    print('NO')

Buggy python submission (verdict: Runtime Error):
import re
if S.startswith('k') and S.endswith('eyence'):
    print('YES')
elif S.startswith('ke') and S.endswith('yence'):
    print('YES')
elif S.startswith('key') and S.endswith('ence'):
    print('YES')
elif S.startswith('keye') and S.endswith('nce'):
    print('YES')
elif S.startswith('keyen') and S.endswith('ce'):
    print('YES')
elif S.startswith('keyenc') and S.endswith('e'):
    print('YES')
elif S == 'keyence':
    print('YES')
else:
    print('NO')

Fixed submission:
S = raw_input()
if S.startswith('k') and S.endswith('eyence'):
    print('YES')
elif S.startswith('ke') and S.endswith('yence'):
    print('YES')
elif S.startswith('key') and S.endswith('ence'):
    print('YES')
elif S.startswith('keye') and S.endswith('nce'):
    print('YES')
elif S.startswith('keyen') and S.endswith('ce'):
    print('YES')
elif S.startswith('keyenc') and S.endswith('e'):
    print('YES')
elif S == 'keyence':
    print('YES')
else:
    print('NO')
Buggy python submission (verdict: Runtime Error):
#N = raw_input()
#A_list = map(int, raw_input().split())
#B_list = map(int, raw_input().split())
if sum(A_list) < sum(B_list):
    print(-1)
else:
    import numpy as np
    diff = [x - y for (x, y) in zip(A_list, B_list)]
    neg_list = [i for i in diff if i < 0]
    neg_sum = sum(neg_list)
    pos_list = [i for i in diff if i > 0]
    pos_list.sort(reverse=True)
    pos_list = np.cumsum(pos_list).tolist()
    for j,k in enumerate(pos_list):
        if len(neg_list) == 0:
            print(0)
            break
        elif neg_sum + k >= 0:
            print(j+1+len(neg_list))
            break 
        else:
            continue

Fixed submission:
N = raw_input()
A_list = map(int, raw_input().split())
B_list = map(int, raw_input().split())
if sum(A_list) < sum(B_list):
    print(-1)
else:
    import numpy as np
    diff = [x - y for (x, y) in zip(A_list, B_list)]
    neg_list = [i for i in diff if i < 0]
    neg_sum = sum(neg_list)
    pos_list = [i for i in diff if i > 0]
    pos_list.sort(reverse=True)
    pos_list = np.cumsum(pos_list).tolist()
    for j,k in enumerate(pos_list):
        if len(neg_list) == 0:
            print(0)
            break
        elif neg_sum + k >= 0:
            print(j+1+len(neg_list))
            break 
        else:
            continue
Buggy python submission (verdict: Runtime Error):
def prime_factors(n):
    i = 2
    factors = []
    while i * i <= n:
        if n % i:
            i += 1
        else:
            n //= i
            factors.append(i)
    if n > 1:
        factors.append(n)
    return factors

N = int(input())
prime_list = prime_factors(N)

X = 0
Y = 0

if prime_list:
    X = prime_list.pop(0)
    Y = prime_list.pop(-1)
    for L in prime_list:
        if X < Y:
            X = X*L
        else:
            Y = Y*L

if X >= Y:
    print(len(str(X)))
else:
    print(len(str(Y)))

Fixed submission:
n = int(input())
ans = 1e9
for i in range(1,int(n**0.5)+1):
  if n % i == 0:
    ans = min( ans, max( len(str(i)), len(str(n//i)) ) )
print(ans)

Buggy python submission (verdict: Runtime Error):
def prime_factors(n):
    i = 2
    factors = []
    while i * i <= n:
        if n % i:
            i += 1
        else:
            n //= i
            factors.append(i)
    if n > 1:
        factors.append(n)
    return factors

N = int(input())
prime_list = prime_factors(N)
 
X = prime_list.pop(0)
Y = prime_list.pop(-1)
for L in prime_list:
    if X < Y:
        X = X*L
    else:
        Y = Y*L

if X >= Y:
    print(len(str(X)))
else:
    print(len(str(Y)))

Fixed submission:
n = int(input())
ans = 1e9
for i in range(1,int(n**0.5)+1):
  if n % i == 0:
    ans = min( ans, max( len(str(i)), len(str(n//i)) ) )
print(ans)

Buggy python submission (verdict: Runtime Error):
def prime_factors(n):
    i = 2
    factors = []
    while i * i <= n:
        if n % i:
            i += 1
        else:
            n //= i
            factors.append(i)
    if n > 1:
        factors.append(n)
    return factors

N = input()
prime_list = prime_factors(N)

X = prime_list.pop(0)
Y = prime_list.pop(-1)
for L in prime_list:
    if X < Y:
        X = X*L
    else:
        Y = Y*L

if X >= Y:
    print(len(str(X)))
else:
    print(len(str(Y)))

Fixed submission:
n = int(input())
ans = 1e9
for i in range(1,int(n**0.5)+1):
  if n % i == 0:
    ans = min( ans, max( len(str(i)), len(str(n//i)) ) )
print(ans)
Buggy python submission (verdict: Runtime Error):
a, b = input().split(' ')
if int(a) * int(b) % 2 == 0:
    print('Even')
    continue
print('Odd')

Fixed submission:
a, b = input().split(' ')
if int(a) * int(b) % 2 == 0:
    print('Even')
else:
    print('Odd')
Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
N, Q = map(int, raw_input().split())
S = raw_input()
L = np.zeros(Q)
R = np.zeros(Q)
for i in range(Q):
    L[i], R[i] = map(int, raw_input().split())
num = np.zeros(Q)
for i in range(N+1):
    if S[i:i+2] == "AC":
        for j in range(Q):
            if int(L[j]-1) <= i and i < int(R[j]-1):                                                                
                num[j] += 1
for i in num:
    print int(i)


Fixed submission:
import numpy as np
N, Q = map(int, raw_input().split())
S = raw_input()
L = np.zeros(Q)
R = np.zeros(Q)
for i in range(Q):
    L[i], R[i] = map(int, raw_input().split())
num = np.zeros(N)
num_tmp = 0
for i in range(1,N):
    if S[i-1:i+1] == "AC":
        num_tmp += 1
    num[i] = num_tmp
for i in range(Q):
    print int(num[int(R[i]-1)] - num[int(L[i]-1)])

Buggy python submission (verdict: Runtime Error):
import numpy as np
N, Q = map(int, raw_input().split())
S = raw_input()
L = np.zeros(Q)
R = np.zeros(Q)
for i in range(Q):
    L[i], R[i] = map(int, raw_input().split())
num = np.zeros(Q)
for i in range(N):
    if S[i] == "A":
        if S[i+1] == "C":
            for j in range(Q):
                if int(L[j]-1) <= i and i < int(R[j]-1):                                                            
                   num[j] += 1
for i in num:
    print int(i)


Fixed submission:
import numpy as np
N, Q = map(int, raw_input().split())
S = raw_input()
L = np.zeros(Q)
R = np.zeros(Q)
for i in range(Q):
    L[i], R[i] = map(int, raw_input().split())
num = np.zeros(N)
num_tmp = 0
for i in range(1,N):
    if S[i-1:i+1] == "AC":
        num_tmp += 1
    num[i] = num_tmp
for i in range(Q):
    print int(num[int(R[i]-1)] - num[int(L[i]-1)])

Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
N, Q = map(int, raw_input().split())
S = raw_input()
L = np.zeros(Q)
R = np.zeros(Q)
for i in range(Q):
    L[i], R[i] = map(int, raw_input().split())
num = np.zeros(Q)
for i in range(Q):
    for j in range(int(L[i]), int(R[i])):                                                                           
        if S[j-1] == "A":
            if j <= N:
                if S[j] == "C":
                    num[i] += 1
for i in num:
    print int(i)


Fixed submission:
import numpy as np
N, Q = map(int, raw_input().split())
S = raw_input()
L = np.zeros(Q)
R = np.zeros(Q)
for i in range(Q):
    L[i], R[i] = map(int, raw_input().split())
num = np.zeros(N)
num_tmp = 0
for i in range(1,N):
    if S[i-1:i+1] == "AC":
        num_tmp += 1
    num[i] = num_tmp
for i in range(Q):
    print int(num[int(R[i]-1)] - num[int(L[i]-1)])