Harryxun/GPT-100-sft-dataset huggingface dataset:
Problem p03599 (python)

Fixed submission:
def node(hen, sin):
    if hen == 0 or sin == 0:
        return 0
    return 100 * sin / (hen + sin)


a, b, c, d, e, f = [int(i) for i in input().split()]
node_ans = 0
water_ans = 0
sugar_ans = 0
for A in range(0, f, a * 100):
    for B in range(0, f, b * 100):
        water = A + B
        max_sugar = water * e
        for C in range(0, f, c):
            for D in range(0, f, d):
                sugar = C + D
                if max_sugar < sugar*100 or f < water + sugar or water == 0:
                    break
                elif node_ans <= node(water, sugar):
                    node_ans = node(water, sugar)
                    sugar_ans = sugar
                    water_ans = water

print(water_ans + sugar_ans, sugar_ans)

Buggy submission (verdict: Runtime Error):
def per(a, b):
    if a == 0 or b == 0:
        return 0
    return 100 * b / (a + b)


a, b, c, d, e, f = [int(i) for i in input().split()]
max_sugar = e * f / 100
max_water = f - max_sugar
s = 0
water = set()
check = 0
n = 0
while check <= f:
    while check <= f:
        water.add(check)
        check += b * 100
    check = a*100*n
    n += 1
check = 0
n = 0
sugar_ans = 0
g = 0
for i in water:
    max_sugar = e * i / 100
    while check <= max_sugar and check + i <= f:
        while check <= max_sugar and check + i <= f:
            if g < per(i, check) and i + check <= f:
                sugar_ans = check
                g = per(i, check)
                water_ans = i
            check += d
        check = c * n
        n += 1

print(water_ans + sugar_ans, sugar_ans)

Buggy submission (verdict: Runtime Error):
def per(a, b):
    if a == 0 or b == 0:
        return 0
    return 100 * b / (a + b)


a, b, c, d, e, f = [int(i) for i in input().split()]
max_sugar = e * f / 100
max_water = f - max_sugar
s = 0
water = set()
numa = f // a
numb = f // b
for i in range(numa):
    check = 100 * a * i
    if f < check:
        break
    water.add(check)
    for m in range(numb):
        h = check + 100 * b * m
        if f < h:
            break
        water.add(h)
check = 0
n = 0
sugar_ans = 0
g = 0
for i in water:
    max_sugar = e * i /100
    while check <= max_sugar and check + i <= f:
        while check <= max_sugar and check + i <= f:
            if g < per(i, check) and i + check <= f:
                sugar_ans = check
                g = per(i, check)
                water_ans = i
            check += d
        check = c * n
        n += 1

print(water_ans + sugar_ans, sugar_ans)
Problem p03607 (python)

Fixed submission:
N = int(input())
ans = set()
for i in range(N):
    num = int(input())
    if num in ans:
        ans.remove(num)
    else:
        ans.add(num)
print(len(ans))

Buggy submission (verdict: Runtime Error):
N = int(input())
ans = []
for i in range(N):
    num = int(input())
    check = ans.count(num)
    if check == 0:
        ans.append(num)
    else:
        ans.pop(check)
print(len(ans))

Buggy submission (verdict: Runtime Error):
N = int(input())
ans = []
check = 0
for i in range(N):
    num = int(input())
    for n in range(len(ans)):
        if ans[n] == num:
            check = -1
            break
        else:
            check = n
    if check == -1:
        ans.remove(num)
    else:
        ans.append(num)
print(len(ans))
Problem p03611 (python)

Fixed submission:
def solve():
    N = int(input())
    a = list(map(int, input().split()))
    count = [0]*100000

    for i in a:
        count[i] += 1

    print(max(map(sum,zip(count,count[1:],count[2:]))))


if __name__ == '__main__':
    solve()

Buggy submission (verdict: Runtime Error):
def solve():
    N = int(input())
    a = list(map(int, input().split()))
    ans = 0
    n=0
    check = 0
    checkmm = 0
    checkm = 0
    a.sort()
    for i in a:
        if i == i-1:
            break
        if i-2 in a:
            checkmm = checkm
        else:
            checkmm = 0

        if i-1 in a:
            checkm = check
        else :
            checkm = 0
        check = 0
        while a[n] == i:
            check = check + 1
            n = n+1
            if N==n:
                break


        if ans < check+checkm+checkmm:
            ans = check+checkm+checkmm

    print(ans)


if __name__ == '__main__':
    solve()
Problem p03612 (python)

Fixed submission:
def solve():
    N = int(input())
    p = list(map(int, input().split()))
    count = int(0)
    for i in range(N):
        if p[i] == i+1:
            if i+1 == N:
                p[i], p[i - 1] = p[i - 1], p[i]
                count += 1
            else:
                p[i], p[i+1] = p[i+1], p[i]
                count += 1
    print(count)

if __name__ == '__main__':
    solve()

Buggy submission (verdict: Runtime Error):
def solve():
    N = int(input())
    p = list(map(int, input().split()))
    count = int(0)
    for i in range(N):
        if p[i] == i+1:
            p[i], p[i+1] = p[i+1], p[i]
            count += 1
    print(count)

if __name__ == '__main__':
    solve()

Buggy submission (verdict: Runtime Error):
def solve():
    N = int(input())
    p = list(map(int, input().split()))
    count = int(0)
    for i in range(N):
        if p[i] == i+1:
            p[i], p[i+1] = p[i+1], p[i]
            count += 1
    print(count)

if __name__ == '__main__':
    solve()

Buggy submission (verdict: Runtime Error):
N = int(input())
p = list(map(int,input().split))
count = 0
for i in range(N):
    if p[i] == i:
        p[i],p[i+1] = p[i+1],p[i]
        count += 1
print(count)

Buggy submission (verdict: Runtime Error):
def solve():
    N = int(input())
    p = list(map(int,input().split))
    count = 0
    for i in range(N):
        if p[i] == i:
            p[i],p[i+1] = p[i+1],p[i]
            count += 1
    print(count)

if __name__ == '__main__':
    solve()
Problem p03644 (python)

Fixed submission:
N = int(input())
n = 1
num = 2
while num <= N:
    num = 2**n
    n += 1
print(int(num/2))

Buggy submission (verdict: Runtime Error):
N = int(input())
for i in range(7):
    if 2**i < N:
        ans = 2**i
print(ans)
Problem p03679 (python)

Fixed submission:
x, a, b = [int(i) for i in input().split()]
if b <= a:
    print('delicious')
elif (b-a) <= x:
    print('safe')
else:
    print('dangerous')

Buggy submission (verdict: Runtime Error):
N = int(input())
a = [int(input()) for i in range(N)]
num = a[0]
ans = 0
check = 0
for n in range(1, N):
    num = a[num-1]
    if num-1 == 1:
        ans = n + 1
        check = 1
        break
if check != 1:
    print('-1')
else:
    print(ans)
Problem p03695 (python)

Fixed submission:
N = int(input())
a = [int(i) for i in input().split()]
rank = [0]*9
ans = [0]*2
for i in range(len(a)):
    if a[i] < 400:
        rank[0] = 1
    elif a[i] < 800:
        rank[1] = 1
    elif a[i] < 1200:
        rank[2] = 1
    elif a[i] < 1600:
        rank[3] = 1
    elif a[i] < 2000:
        rank[4] = 1
    elif a[i] < 2400:
        rank[5] = 1
    elif a[i] < 2800:
        rank[6] = 1
    elif a[i] < 3200:
        rank[7] = 1
    else:
        rank[8] += 1
ans[0] = sum(rank)

if sum(rank[:8]) == 0:
    ans[1] = 1
else:
    ans[1] = sum(rank[:8])

[print(ans[i], end=' ') for i in reversed(range(len(ans)))]

Buggy submission (verdict: Runtime Error):
N = int(input())
a = [int(i) for i in input().split()]
rank = [0]*9
ans = [0]*2
for i in range(len(a)):
    if a[i] < 400:
        rank[0] = 1
    elif a[i] < 800:
        rank[1] = 1
    elif a[i] < 1200:
        rank[2] = 1
    elif a[i] < 1600:
        rank[3] = 1
    elif a[i] < 2000:
        rank[4] = 1
    elif a[i] < 2400:
        rank[5] = 1
    elif a[i] < 2800:
        rank[6] = 1
    elif a[i] < 3200:
        rank[7] = 1
    else:
        rank[8] += 1
ans[0] = sum(rank)
if 8 < ans[0]:
    ans[0] = 8
if rank[9] != 0 and (sum(rank[0:8])) == 0:
    ans[1] = 1
else:
    ans[1] = sum(rank[0:8])

[print(ans[i], end=' ') for i in reversed(range(len(ans)))]
Problem p03696 (python)

Fixed submission:
n = int(input())
N = input()
L = 0
R = 0
num = 0
for c in N:
    if c == '(':
        num += 1
    else:
        if num:
            num -= 1
        else:
            L += 1
R = num

print('('*L+N+')'*R)

Buggy submission (verdict: Runtime Error):
n = int(input())
N = input()
L = 0
R = 0
num = 0
while N[num] == ')':
    L += 1
    num += 1
num = n-1
while N[num] == '(':
    R += 1
    num -= 1
a = N.count('(')
b = len(N) - a
c = a - b + L -R
if (c) < 0:
    for i in range(abs(c)):
        N = '(' + N
elif (c) > 0:
    for i in range(abs(c)):
        N = N + ')'
print('('*L+N+')'*R)

Buggy submission (verdict: Runtime Error):
n = int(input())
N = input()
num = 0
while N[num] == ')':
    N = '(' + N
    num += 2
a = N.count('(')
b = len(N)-a
if (a - b) < 0:
    for i in range(b-a):
        N = '(' + N
else:
    for i in range(a-b):
        N = N + ')'

print(N)
Problem p03738 (python)

Fixed submission:
a, b = [int(input()) for i in range(2)]
if a > b:
    print('GREATER')
elif a < b:
    print('LESS')
else:
    print('EQUAL')

Buggy submission (verdict: Runtime Error):
a,b=[int(i) for i in input().split()]
if a>b:
    print('GREATER')
elif a<b:
    print('LESS')
else:
    print('EQUAL')

Buggy submission (verdict: Runtime Error):
a,b=[int(i) for i in input().split()]
if a>b:
    print('GREATER')
elif a<b:
    print('LESS')
else:
    print('EQUAL')
Problem p03815 (python)

Fixed submission:
x = int(input())
if x < 7:
    print(1)
    exit()
elif x % 11 is 0:
    print((x // 11) * 2)
elif x % 11 < 7:
    print((x // 11) * 2 + 1)
else:
    print((x // 11) * 2 + 2)

Buggy submission (verdict: Runtime Error):
N, M = [int(i) for i in input().split()]
road = [list() for i in range(N + 1)]
for i in range(M):
    a, b = [int(i) for i in input().split()]
    road[a].append(b)
    road[b].append(a)


def solve(before, visited, now):
    visited.append(now)
    print(visited)
    if len(visited) is N:
        return 1
    pattern = 0
    for way in road[now]:
        if way is now:
            continue
        if way in visited:
            continue
        pattern += solve(now, visited[:], way)
    return pattern


print(solve(0, [], 1))
Problem p03846 (python)

Fixed submission:
N = int(input())
A = [int(i) for i in input().split()]
mod = 10 ** 9 + 7
A.sort()


def solve(i, num):
    while i < len(A):
        if A[i] == num:
            if A[i + 1] == num:
                i += 2
                num += 2
            else:
                break
        else:
            break
    if i >= len(A):
        print(2 ** (N // 2) % mod)
    else:
        print(0)


if len(A) % 2 is 0:
    solve(0, 1)
else:
    if A[0] is 0:
        solve(1, 2)
    else:
        print(0)

Buggy submission (verdict: Runtime Error):
N = int(input())
A = [int(i) for i in input().split()]
A.sort()
old, check = 0, 0
if len(A) % 2 is 1:
    if A[0] is not 0 or A[1] is not 2:
        print(0)
        exit()
    else:
        for i in range(1, N):
            if old is A[i] and check <= 1:
                check += 1
            elif old + 2 is A[i] and check <= 1:
                old = A[i]
                check = 0
            else:
                print(0)
                exit()

        print(2 ** ((N - 1) // 2))
else:
    old = -1
    for i in range(N):
        if old is A[i] and check <= 1:
            check += 1
        elif old + 2 is A[i] and check <= 1:
            old = A[i]
            check = 0
        else:
            print(0)
            exit()
    print(2 ** (N // 2))
Problem p03231 (python)

Fixed submission:
N,M = map(int,input().split())
S = input()
T = input()
ans = 0
a = 2

if S[0] != T[0]:ans = -1

elif N % M != 0 and M % N != 0:
    if N >= M:
        while True:
            if N * a % M == 0:
                ans = N * a
                b = int(N*a/M)
                for i in range(int(N/b)):
                    if T[a*i] != S[b*i]:
                        ans = -1
                        break
                break
            else:
                a += 1
    elif N < M:
        while True:
            if M * a % N == 0:
                ans = M * a
                b = int(M*a/N)
                for i in range(int(M/b)):
                    if T[b*i] != S[a*i]:
                        ans = -1
                        break
                break
            else:
                a += 1

elif N % M == 0:
    b = int(N/M)
    ans = N
    for i in range(M):
        if T[i] != S[b*i]:
            ans = -1
            break   

elif M % N == 0:
    b = int(M/N)
    ans = M
    for i in range(N):
        if S[i] != T[b*i]:
            ans = -1
            break   

print(ans)

Buggy submission (verdict: Runtime Error):
N,M = map(int,input().split())
S = input()
T = input()
ans = 0
a = 2

if S[0] != T[0]:ans = -1

elif N % M != 0 and M % N != 0:
    if N >= M:
        while True:
            if N * a % M == 0:
                ans = N * a
                b = int(N*a/M)
                for i in range(M):
                    if T[i] != S[b*i]:
                        ans = -1
                        break
                break
            else:
                a += 1
    elif N < M:
        while True:
            if M * a % N == 0:
                ans = M * a
                b = int(M*a/N)
                for i in range(N):
                    if S[i] != T[b*i]:
                        ans = -1
                        break
                break
            else:
                a += 1

elif N % M == 0:
    b = int(N/M)
    ans = N
    for i in range(M):
        if T[i] != S[b*i]:
            ans = -1
            break   

elif M % N == 0:
    b = int(M/N)
    ans = M
    for i in range(N):
        if S[i] != T[b*i]:
            ans = -1
            break   

print(ans)
Problem p03856 (python)

Fixed submission:
T = ["maerd", "remaerd", "esare", "resare"]

s = raw_input()
s = s[::-1]

ans = True
while True:
	if s == "":
		ans = True
		break
	elif s[0] == "m" and len(s) >= len(T[0]) and s[:len(T[0])] == T[0]:
		s = s[len(T[0]):]
	elif s[0] == "r" and len(s) > 2:
		if s[2] == "m" and len(s) >= len(T[1]) and s[:len(T[1])] == T[1]:
			s = s[len(T[1]):]
		elif s[2] == "s" and len(s) >= len(T[3]) and s[:len(T[3])] == T[3]:
			s = s[len(T[3]):]
		else:
			ans = False
			break
	elif s[0] == "e" and len(s) >= len(T[2]) and s[:len(T[2])] == T[2]:
		s = s[len(T[2]):]
	else:
		ans = False
		break

if ans:
	print "YES"
else:
	print "NO"

Buggy submission (verdict: Runtime Error):
#include <bits/stdc++.h>
using namespace std;

typedef pair<int,int> ii;

const int MAXN = 200005;

int N, K, L, u, v, visited[2][MAXN], cnt[2] = {1, 2};
vector<int> adjList[2][MAXN];

map<ii,int> m;

void dfs(int id, int node) {
    if (visited[id][node]) {
        return;
    } else {
        visited[id][node] = cnt[id];

        for (int i = 0; i < adjList[id][node].size(); i++) {
            int neighbor = adjList[id][node][i];

            dfs(id, neighbor);
        }
    }
}

int main() {

    scanf("%d%d%d", &N, &K, &L);
    for (int i = 0; i < K; i++) {
        scanf("%d%d", &u, &v);

        adjList[0][u].push_back(v);
        adjList[0][v].push_back(u);
    }

    for (int i = 0; i < L; i++) {
        scanf("%d%d", &u, &v);

        adjList[1][u].push_back(v);
        adjList[1][v].push_back(u);
    }

    for (int i = 1; i <= N; i++) {
        if (!visited[0][i]) {
            dfs(0, i); cnt[0] += 2;
        }
        if (!visited[1][i]) {
            dfs(1, i); cnt[1] += 2;
        }
    }

    for (int i = 1; i <= N; i++) {
        m[ii(visited[0][i], visited[1][i])]++;
    }

    for (int i = 1; i <= N; i++) {
        cout << m[ii(visited[0][i], visited[1][i])] << " ";
    }

    return 0;
}

Buggy submission (verdict: Runtime Error):
T = ["maerd", "remaerd", "esare", "resare"]

def match(s):
	if s == "":
		return True
	elif s[0] == "m" and len(s) >= len(T[0]) and s[:len(T[0])] == T[0]:
		return match(s[len(T[0]):])
	elif s[0] == "r" and len(s) > 2:
		if s[2] == "m" and len(s) >= len(T[1]) and s[:len(T[1])] == T[1]:
			return match(s[len(T[1]):])
		elif s[2] == "s" and len(s) >= len(T[3]) and s[:len(T[3])] == T[3]:
			return match(s[len(T[3]):])
		else:
			return False
	elif s[0] == "e" and len(s) >= len(T[2]) and s[:len(T[2])] == T[2]:
		return match(s[len(T[2]):])
	else:
		return False

S = raw_input()
S = S[::-1]
if match(S):
	print "YES"
else:
	print "NO"

Buggy submission (verdict: Runtime Error):
T = ["dream", "dreamer", "erase", "eraser"]

def match(s):
	if s == "":
		return True
	else:
		ans = False
		for i in T:
			if len(i) <= len(s) and s[:len(i)] == i:
				ans |= match(s[len(i):])
		return ans

S = raw_input()
if match(S):
	print "YES"
else:
	print "NO"
Problem p03297 (python)

Fixed submission:
def gcd(a, b): 
    if a == 0 :
        return b 
    return gcd(b%a, a)
for _ in range(int(input())):
    a,b,c,d=[int(x) for x in input().split()]
    if a<b:
        print("No")
        continue
    if d<b:
        print("No")
        continue
    if b<=c:
        print("Yes")
        continue
    g=gcd(b,d)
    if c>=b-g+a%g:
        print("Yes")
    else:
        print("No")

Buggy submission (verdict: Runtime Error):
def gcd(a,b):
     
    # Everything divides 0 
    if (a == 0 or b == 0):
        False
    # base case
    if (a == b):
        return a
 
    # a is greater
    if (a > b):
        return gcd(a-b, b)
    return gcd(a, b-a)
for _ in range(int(input())):
    a,b,c,d=[int(x) for x in input().split()]
    if a<b:
        print("No")
        continue
    if d<b:
        print("No")
        continue
    if b<=c:
        print("Yes")
        continue
    g=gcd(b,d)
    if c>=b-g+a%g:
        print("Yes")
    else:
        print("No")

Buggy submission (verdict: Runtime Error):
import math
for _ in range(int(input())):
    a,b,c,d=[int(x) for x in input().split()]
    if a<b:
        print("No")
        continue
    if d<b:
        print("No")
        continue
    if b<=c:
        print("Yes")
        continue
    g=math.gcd(b,d)
    if c>=b-g+a%g:
        print("Yes")
    else:
        print("No")
Problem p03795 (python)

Fixed submission:
meal_fee=800
cash_back=200
cash_back_count=15
N=int(input())
x=N*meal_fee
y=int(N/cash_back_count) * cash_back
print(x-y)

Buggy submission (verdict: Runtime Error):
print((int(input())+int(input()))*int(input())//2)
Problem p03852 (python)

Fixed submission:
print(['vowel','consonant'][not input() in ['a','e','i','o','u']])

Buggy submission (verdict: Runtime Error):
c = input() 
msg = 'vowel' if ((c == 'a') or (c == 'i') or (c == 'u') or (c == 'e') or (c == 'o')) else 'consonant':
print(msg)

Buggy submission (verdict: Runtime Error):
c = input() 

if (c == 'a'): 
elif (c == 'i'):
elif (c == 'u'):
elif (c == 'e'):
elif (c == 'o'): 
    is_vowel = True
else:
    is_vowel = False

if is_vowel:
    print('vowel')
else:
    print('consonant')
Problem p03206 (python)

Fixed submission:
D = input()
D = int(D)

D = 25 - D

print ('Christmas' + ' Eve'* D)

Buggy submission (verdict: Runtime Error):
D = input()
D = int(D)

if D == 25:
  print('Christmas')

else D <= 25:
  D = 25 - D
  print ('Christmas' + D * 'Eve')
Problem p03210 (python)

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

if n==3 or n==5 or n==7:
  print('YES')
  
else:
  print('NO')

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

if n=3 or 5 or 7:
  print('YES')
  
else:
  print('NO')
Problem p03206 (python)

Fixed submission:
D=input()
if D=="22":
  print("Christmas Eve Eve Eve")
elif D=="23":
  print("Christmas Eve Eve")
elif D=="24":
  print("Christmas Eve")
else:
  print("Christmas")

Buggy submission (verdict: Runtime Error):
D=input()
if D=="22":
  print("Christmas Eve Eve Eve")
elif D=="23":
  print(Christmas Eve Eve")
elif D=="24":
  print("Christmas Eve")
else:
  print'"Christmas")

Buggy submission (verdict: Runtime Error):
D=input()
if D="22":
  print("Christmas Eve Eve Eve")
elif D="23":
  print(Christmas Eve Eve")
elif D="24":
  print("Christmas Eve")
else:
  print'"Christmas")
Problem p03455 (python)

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

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

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

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

Fixed submission:
import sys
 
D = int(input())
if D == 22:
  print("Christmas Eve Eve Eve")
if D == 23:
  print("Christmas Eve Eve")
if D == 24:
  print("Christmas Eve")
if D == 25:
  print("Christmas")

Buggy submission (verdict: Runtime Error):
import sys
 
D = int(input())
if D == 22:
  output("Christmas Eve Eve Eve")
if D == 23:
  output("Christmas Eve Eve")
if D == 24:
  output("Christmas Eve")
if D == 25:
  output("Christmas")

Buggy submission (verdict: Runtime Error):
import sys

D = int(input())
if D = 22:
  output("Christmas Eve Eve Eve")
if D = 23:
  output("Christmas Eve Eve")
if D = 24:
  output("Christmas Eve")
if D = 25:
  output("Christmas")
Problem p03206 (python)

Fixed submission:
D = int(input())
print('Christmas'+' Eve'*(25 - D))

Buggy submission (verdict: Runtime Error):
D = int(input())
print('Christmas'+'Eve'*(25 - D)
Problem p03280 (python)

Fixed submission:
A,B=map(int,input().split())
print((A-1)*(B-1))

Buggy submission (verdict: Runtime Error):
A = int(input())
B = int(input())
print(int((A-1)*(B-1)))

Buggy submission (verdict: Runtime Error):
A = int(input())
B = int(input())
print((A-1)*(B-1))
Problem p03399 (python)

Fixed submission:

A=int(input())
B=int(input())
C=int(input())
D=int(input())

if A>B:
	if C>D:
		print(B+D)
	else:
		print(B+C)
else:
	if C>D:
		print(A+D)
	else:
		print(A+C)

Buggy submission (verdict: Runtime Error):
A=int(input())
B=int(input())
C=int(input())
D=int(input())

if A>B:
	if C>D:
		print(B+D)
	else:
		print(B+C)
else:
	if C>D:
		print(A+D)
	else:

print(A+C)
Problem p03206 (python)

Fixed submission:
print('Christmas' + ' Eve' * (25 - int(input())))

Buggy submission (verdict: Runtime Error):
'Christmas' + (25 - D) * ' Eve'

Buggy submission (verdict: Runtime Error):
print(D)
Problem p03455 (python)

Fixed submission:
import operator
import functools
number_list = list(map(int, input().split()))
product = functools.reduce(operator.mul, number_list)
if product % 2 == 0:
    print('Even')
else:
    print('Odd')

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

Fixed submission:
N = int(input())
t = [0] * (N + 1)
x = [0] * (N + 1)
y = [0] * (N + 1)
for i in range(1, N + 1):
    t[i], x[i], y[i] = map(int, input().split())
for i in range(1, N + 1):
    if t[i] - t[i - 1] < abs(x[i] - x[i - 1]) + abs(y[i] - y[i - 1]):
        print('No')
        exit()
    elif t[i] % 2 != (x[i] + y[i]) % 2:
        print('No')
        exit()
print('Yes')

Buggy submission (verdict: Runtime Error):
N = int(input())
x = [0] * (N + 1)
y = [0] * (N + 1)
for i in range(1, N + 1):
    t[i], x[i], y[i] = map(int, input().split())
for i in range(1, N + 1):
    if t[i] - t[i - 1] < abs(x[i] - x[i - 1]) + abs(y[i] - y[i - 1]):
        print('No')
        exit()
    elif t[i] % 2 != (x[i] + y[i]) % 2:
        print('No')
        exit()
print('Yes')

Buggy submission (verdict: Runtime Error):
x = [0] * (N + 1)
y = [0] * (N + 1)
for i in range(1, N + 1):
    t[i], x[i], y[i] = map(int, input().split())
for i in range(1, N + 1):
    if t[i] - t[i - 1] < abs(x[i] - x[i - 1]) + abs(y[i] - y[i - 1]):
        print('No')
        exit()
    elif t[i] % 2 != (x[i] + y[i]) % 2:
        print('No')
        exit()
print('Yes')