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

Fixed submission:
import itertools


def solve():
    N = int(input())
    A = list(map(int, input().split(" ")))
    matrix = [[] for _ in range(N)]
    for i in range(N):
        matrix[i].append(A[i] - 1)
        matrix[i].append(A[i])
        matrix[i].append(A[i] + 1)

    cnt = 0
    for element in list(itertools.product(*matrix)):
        for i in range(N):
            if element[i] % 2 == 0:
                cnt += 1
                break

    print(cnt)


solve()

Buggy submission (verdict: Runtime Error):
import itertools


def solve():
    N = int(input())
    A = list(map(int, input().split(" ")))
    matrix = [[] for _ in range(N)]
    for i in range(N):
        matrix[i].append(A[i] - 1)
        matrix[i].append(A[i])
        matrix[i].append(A[i] + 1)

    cnt = 0
    for element in list(itertools.product(*matrix)):
        for i in range(N):
            if element[i] % 2 == 0:
                cnt += 1
                break

    print(cnt)


 solve()
Problem p03578 (python)

Fixed submission:
def solve():
    while 1:
        try:
            N = int(input())
            D = list(map(int, input().split(" ")))
            M = int(input())
            T = list(map(int, input().split(" ")))
            D_dict = {}
            T_dict = {}
            for d in D:
                if d not in D_dict:
                    D_dict[d] = 1
                else:
                    D_dict[d] += 1

            for t in T:
                if t not in T_dict:
                    T_dict[t] = 1
                else:
                    T_dict[t] += 1

            for key, val in T_dict.items():
                if key not in D_dict:
                    print("NO")
                    raise EndLoop
                else:
                    if val > D_dict[key]:
                        print("NO")
                        raise EndLoop

            print("YES")
            break
        except:
            break


solve()

Buggy submission (verdict: Runtime Error):
#!/usr/bin/python
# -*- coding: utf-8 -*-
import sys
import os
import math
import bisect
import itertools
import numpy as np
from collections import OrderedDict
from bisect import bisect_left, bisect_right, insort_left, insort_right


class EndLoop(Exception):
    pass

def solve():
    while 1:
        try:
            N = int(input())
            D = list(map(int, input().split(" ")))
            M = int(input())
            T = list(map(int, input().split(" ")))
            D_dict = {}
            T_dict = {}
            for d in D:
                if d not in D_dict:
                    D_dict[d] = 1
                else:
                    D_dict[d] += 1

            for t in T:
                if t not in T_dict:
                    T_dict[t] = 1
                else:
                    T_dict[t] += 1

            for key, val in T_dict.items():
                if key not in D_dict:
                    print("NO")
                    raise EndLoop
                else:
                    if val > D_dict[key]:
                        print("NO")
                        raise EndLoop

            print("YES")
            break
        except:
            break


solve()

Buggy submission (verdict: Runtime Error):
def solve():
    while 1:
        N = int(input())
        D = list(map(int, input(" ")))
        M = int(input())
        T = list(map(int, input(" ")))

        for t in T:
            if t not in D:
                print("NO")
                break

        print("YES")
        break


solve()

Buggy submission (verdict: Runtime Error):
def solve():
    while 1:
        N = int(input())
        D = list(map(int, input(" ")))
        M = int(input())
        if N < M:
            print("NO")
            break   
        T = list(map(int, input(" ")))
        
        for t in T:
            if t not in D:
                print("NO")
                break
        
        print("YES")
        break


solve()
Problem p03587 (python)

Fixed submission:
s = list(input())
print(s.count("1"))

Buggy submission (verdict: Runtime Error):
S = list(input())
print(S.count("1")
Problem p03605 (python)

Fixed submission:
def solve(): # 073A- September 9
    n = int(input())
    n_10 = n // 10
    n_1 = n - n_10 * 10

    if n_10 == 9 or n_1 == 9:
        print("Yes")
    else:
        print("No")
        

solve()

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

for i in n:
  if i == 9:
    print("Yes")
    break
    
print("No")
Problem p03612 (python)

Fixed submission:
def swap(a, b):
    tmp = a
    a = b
    b = tmp
    return a, b


def solve(): # 072D- Derangement
    N = int(input())
    p = list(map(int, input().split(" ")))
    p.insert(0, 0)
    cnt = 0

    for i in range(1, N+1):
        if i == p[i] and i != N:
            p[i], p[i+1] = swap(p[i], p[i+1])
            cnt += 1
        elif i == N and i == p[i]:
            p[i-1], p[i] = swap(p[i-1], p[i])
            cnt += 1
        else:
            pass

    print(cnt)
    
    
solve()

Buggy submission (verdict: Runtime Error):
def swap(a, b):
    tmp = a
    a = b
    b = tmp
    return a, b


def solve(): # 072D- Derangement
    N = int(input())
    p = list(map(int, input().split(" ")))
    p.insert(0, 1)
    cnt = 0

    for i in range(1, N+1):
        if i == p[i]:
            p[i], p[i+1] = swap(p[i], p[i+1])
            cnt += 1
            print(p, i)
        elif i == N and i == p[i]:
            p[i-1], p[i] = swap(p[i-1], p[i])
            cnt += 1
            print(p)
        else:
            pass

    print(cnt)
    
    
solve()

Buggy submission (verdict: Runtime Error):
def swap(a, b):
    tmp = a
    a = b
    b = tmp
    return a, b


def solve(): # 072D- Derangement
    N = int(input())
    p = list(map(int, input().split(" ")))
    p.insert(0, 1)
    cnt = 0

    for i in range(1, N+1):
        if i == p[i]:
            p[i], p[i+1] = swap(p[i], p[i+1])
            cnt += 1
        elif i == N:
            p[i-1], p[i] = swap(p[i-1], p[i])
            cnt += 1
        else:
            pass

    print(cnt)
    
    
solve()

Buggy submission (verdict: Runtime Error):
def solve(): # 072D- Derangement
    N = int(input())
    p = list(map(int, input().split(" ")))
    cnt = 0

    for i in range(1, N):
        if i == p[i-1]:
            p[i], p[i+1] = swap(p[i], p[i+1])
            cnt += 1
        elif i == N:
            p[i-1], p[i] = swap(p[i-1], p[i])
            cnt += 1
        else:
            pass

    if cnt == 0:
        print(0)
    else:
        print(cnt + 1)
        
     
solve()

Buggy submission (verdict: Runtime Error):
def swap(a, b):
    tmp = a
    a = b
    b = tmp
    return a, b


def solve(): # 072D- Derangement
    N = int(input())
    p = list(map(int, input().split(" ")))
    cnt = 0

    for i in range(1, N):
        if i == p[i-1]:
            p[i], p[i+1] = swap(p[i], p[i+1])
            cnt += 1
        elif i == N:
            p[i-1], p[i] = swap(p[i-1], p[i])
            cnt += 1
        else:
            pass

    print(cnt + 1)
    

solve()
Problem p03623 (python)

Fixed submission:
def solve(): # 071A - Meal Delivery
    x, A, B = list(map(int, input().split(" ")))
    da = abs(x - A)
    db = abs(x - B)
    if da > db:
        print("B")
    else:
        print("A")


solve()

Buggy submission (verdict: Runtime Error):
def solve(): # 071C - Make a Rectangle
    n = int(input())
    sides = list(map(int, input().split(" ")))
    check_dual = {}
    possible_sides = []

    for i in sides:
        if i in check_dual:
            check_dual[i] += 1
        else:
            check_dual[i] = 1

    tmp_square = 0
    for k, v in check_dual.items():
        if v >= 4 and k > tmp_square:
            tmp_square = k
        elif v == 2 or v == 3:
            possible_sides.append(k)
        else:
            pass

    possible_sides.sort(reverse=True)
    if tmp_square == 0 and len(possible_sides) < 2:
        print(0)
    elif tmp_square != 0 and len(possible_sides) == 0:
        print(tmp_square ** 2)
    elif tmp_square != 0 and len(possible_sides) == 1:
        print(max(tmp_square ** 2, tmp_square * possible_sides[0]))
    else:
        print(max(tmp_square ** 2, possible_sides[0] * possible_sides[1]))


solve()

Buggy submission (verdict: Runtime Error):
def solve(): # 071C - Make a Rectangle
    n = int(input())
    sides = list(map(int, input().split(" ")))
    check_dual = {}
    possible_sides = []

    for i in sides:
        if i in check_dual:
            check_dual[i] += 1
        else:
            check_dual[i] = 1

    tmp_square = 0
    for k, v in check_dual.items():
        if v >= 4 and k > tmp_square:
            tmp_square = k
        elif v == 2 or v == 3:
            possible_sides.append(k)
        else:
            pass

    possible_sides.sort(reverse=True)
    if tmp_square == 0 and len(possible_sides) < 2:
        print(0)
    else:
        print(max(possible_sides[0] * possible_sides[1],
                  tmp_square ** 2))
solve()
Problem p03625 (python)

Fixed submission:
def solve(): # 071C - Make a Rectangle
    n = int(input())
    sides = list(map(int, input().split(" ")))
    check_dual = {}
    possible_sides = []

    for i in sides:
        if i in check_dual:
            check_dual[i] += 1
        else:
            check_dual[i] = 1

    tmp_square = 0
    for k, v in check_dual.items():
        if v >= 4 and k > tmp_square:
            tmp_square = k
            possible_sides.append(k)
        elif v == 2 or v == 3:
            possible_sides.append(k)
        else:
            pass

    possible_sides.sort(reverse=True)
    if tmp_square == 0 and len(possible_sides) < 2:
        print(0)
    elif tmp_square != 0 and len(possible_sides) == 0:
        print(tmp_square ** 2)
    elif tmp_square != 0 and len(possible_sides) == 1:
        print(max(tmp_square ** 2, tmp_square * possible_sides[0]))
    else:
        print(max(tmp_square ** 2, possible_sides[0] * possible_sides[1]))

solve()

Buggy submission (verdict: Runtime Error):
def solve(): # 071C - Make a Rectangle
    n = int(input())
    sides = list(map(int, input().split(" ")))
    check_dual = {}
    possible_sides = []

    for i in sides:
        if i in check_dual:
            check_dual[i] += 1
        else:
            check_dual[i] = 1

    tmp_square = 0
    for k, v in check_dual.items():
        if v >= 4 and k > tmp_square:
            tmp_square = k
        elif v == 2 or v == 3:
            possible_sides.append(k)
        else:
            pass

    possible_sides.sort(reverse=True)
    if tmp_square == 0 and len(possible_sides) < 2:
        print(0)
    else:
        print(max(possible_sides[0] * possible_sides[1],
                  tmp_square ** 2))


solve()

Buggy submission (verdict: Runtime Error):
def solve(): # 071C - Make a Rectangle
    n = int(input())
    sides = list(map(int, input().split(" ")))
    check_dual = {}
    possible_sides = []

    for i in sides:
        if i in check_dual:
            check_dual[i] += 1
        else:
            check_dual[i] = 1

    tmp_square = 0
    for k, v in check_dual.items():
        if v >= 4 and k > tmp_square:
            tmp_square = k
        elif v == 2 or v == 3:
            possible_sides.append(k)
        else:
            pass

    possible_sides.sort(reverse=True)
    if tmp_square == 0 and len(possible_sides) < 2:
        print(0)
    else:
        print(max(possible_sides[0] * possible_sides[1],
                  tmp_square ** 2))


solve()
Problem p03635 (python)

Fixed submission:
def solve(): # 069A - K-City
    n, m = list(map(int, input().split()))
    print((m-1) * (n-1))


solve()

Buggy submission (verdict: Runtime Error):
def solve(): # 069A - K-City
    n, m = int(input())
    print((m-1) * (n-1))


solve()
Problem p03697 (python)

Fixed submission:
def solve():
    a, b = map(int, input().split(" "))
    if a + b >= 10:
        print("error")
    else:
        print(a + b)


solve()

Buggy submission (verdict: Runtime Error):
def solve():
    a, b = map(int, input().split(""))
    if a + b >= 10:
        print("error")
    else:
        print(a + b)


solve()
Problem p03699 (python)

Fixed submission:
def solve():
    n = int(input())
    s = []
    for i in range(n):
        s.append(int(input()))

    s.sort()
    score = sum(s)

    i = 0
    flag = True
    if not score % 10 and n != 1:
        while 1:
            if s[i] % 10:
                score -= s[i]
                break
            i += 1
            if i == n - 1:
                flag = False
                break
    elif not score % 10 and n == 1:
        flag = False

    if flag:
        print(score)
    else:
        print(0)


solve()

Buggy submission (verdict: Runtime Error):
def solve():
    n = int(input())
    s = []
    for i in range(n):
        s.append(int(input()))

    s.sort()
    score = sum(s)

    i = 0
    flag = True
    if not score % 10:
        if n == 1:
            flag = False
        while 1:
            if s[i] % 10:
                score -= s[i]
                break
            i += 1
            if i == n - 1:
                flag = False
                break

    if flag:
        print(score)
    else:
        print(0)


solve()

Buggy submission (verdict: Runtime Error):

def solve():
    n = int(input())
    s = []
    for i in range(n):
        s.append(int(input()))

    s.sort()
    score = sum(s)

    i = 0
    flag = True
    if not score % 10:
        while 1:
            if s[i] % 10:
                score -= s[i]
                break
            i += 1
            if i == n - 1:
                flag = False
                break

    if flag:
        print(score)
    else:
        print(0)


solve()
Problem p03729 (python)

Fixed submission:
def solve():
    A, B, C = list(map(str, input().split(" ")))
    if A[-1] == B[0] and B[-1] == C[0]:
        print("YES")
    else:
        print("NO")


solve()

Buggy submission (verdict: Runtime Error):
def LI(): return [int(x) for x in input().split(" ")]
def LS(): return [str(x) for x in input().split(" ")]
def ItoS(L): return [str(x) for x in L]
def StoI(L): return [int(c) for c in L]


def solve():
    n, t = LI()
    T = LI()
    sentou = [0] * (T[-1] + t + 1)
    
    i = 0
    while i < len(T):
        sentou[T[i]] += 1
        sentou[T[i] + t] -= 1
        i += 1

    j = 1
    while j < len(sentou):
        sentou[j] += sentou[j - 1]
        j += 1

    print(n * t - (sum(sentou) - (sentou.count(1) + len(sentou) - sentou.count(1) - sentou.count(0))))

solve()
Problem p03731 (python)

Fixed submission:
def LI(): return [int(x) for x in input().split(" ")]
def LS(): return [str(x) for x in input().split(" ")]
def ItoS(L): return [str(x) for x in L]
def StoI(L): return [int(c) for c in L]


def solve():
    n, t = LI()
    T = LI()

    ans = 0
    for i in range(len(T) - 1):
        ans += min(t, T[i + 1] - T[i])

    print(ans + t)


solve()

Buggy submission (verdict: Runtime Error):
def LI(): return [int(x) for x in input().split(" ")]
def LS(): return [str(x) for x in input().split(" ")]
def ItoS(L): return [str(x) for x in L]
def StoI(L): return [int(c) for c in L]


def solve():
    n, t = LI()
    T = LI()
    sentou = [0] * (T[-1] + t + 1)
    
    i = 0
    while i < len(T):
        sentou[T[i]] += 1
        sentou[T[i] + t] -= 1
        i += 1

    j = 1
    while j < len(sentou):
        sentou[j] += sentou[j - 1]
        j += 1

    print(n * t - (sum(sentou) - (sentou.count(1) + len(sentou) - sentou.count(1) - sentou.count(0))))

solve()

Buggy submission (verdict: Runtime Error):
def LI(): return [int(x) for x in input().split(" ")]
def LS(): return [str(x) for x in input().split(" ")]
def ItoS(L): return [str(x) for x in L]
def StoI(L): return [int(c) for c in L]


def solve():
    n, t = LI()
    T = LI()
    sentou = [0] * (T[-1] + t + 1)
    
    i = 0
    while i < len(T):
        sentou[T[i]] += 1
        sentou[T[i] + t] -= 1
        i += 1

    j = 1
    while j < len(sentou):
        sentou[j] += sentou[j - 1]
        j += 1

    print(n * t - (sum(sentou) - (sentou.count(1) + len(sentou) - sentou.count(1) - sentou.count(0))))

solve()
Problem p03777 (python)

Fixed submission:
def solve():
    a, b = list(map(str, input().split(" ")))

    if a == b:
        print("H")
    else:
        print("D")


solve()

Buggy submission (verdict: Runtime Error):
from bisect import bisect_left, bisect_right, insort_left, insort_right


def solve():
    x = int(input())
    cumulative_sum = [(k * (k - 1)) // 2 for k in range(1, 46)]
    target = bisect_left(cumulative_sum, x)
    if x in cumulative_sum:
        print(cumulative_sum.index(x))
    else:
        print(target - 2 + (x - cumulative_sum[target - 1] + 1))


solve()

Buggy submission (verdict: Runtime Error):
def solve():
    a, b = list(map(int, input().split(" ")))
    
    if a == b:
        print("H")
    else:
        print("D")


solve()
Problem p03795 (python)

Fixed submission:
N = int(input())

print(800 * N - (N // 15) * 200)

Buggy submission (verdict: Runtime Error):
import math

N = int(input())
print(math.factorial(N) % MOD)
Problem p03796 (python)

Fixed submission:
import math
MOD = 10**9 + 7

N = int(input())
print(math.factorial(N) % MOD)

Buggy submission (verdict: Runtime Error):
N = int(input())
print(math.factorial(N) % MOD)

Buggy submission (verdict: Runtime Error):
import math


def solve():
    N = int(input())
    print(math.factorial(N) % MOD)


solve()

Buggy submission (verdict: Runtime Error):
import math


def solve():
    print(math.factorial(int(input())) % MOD)
    
 
solve()
Problem p03943 (python)

Fixed submission:
def LI(): return [int(x) for x in input().split(" ")]
def LS(): return [str(x) for x in input().split(" ")]
def ItoS(L): return [str(x) for x in L]
def StoI(L): return [int(c) for c in L]


def solve():
    a, b, c = LI()
    if a + b == c or a + c == b or b + c == a:
        print("Yes")
    else:
        print("No")


solve()

Buggy submission (verdict: Runtime Error):
def solve():
    a, b, c = LI()
    if a + b == c or a + c == b or b + c == a:
        print("Yes")
    else:
        print("No")


solve()
Problem p02675 (python)

Fixed submission:
n = int(input()) % 10
if n == 3:
	print("bon")
elif n == 0 or n == 1 or n == 6 or n == 8:
	print("pon")
else:
	print("hon")

Buggy submission (verdict: Runtime Error):
n = input() % 10
if n == 3:
	print("bon")
elif n == 0 or 1 or 6 or 8:
	print("pon")
else:
	print("hon")
Problem p02690 (python)

Fixed submission:
x = int(input())
a = 0
b = 0
if not x == 0:
  for i in range(1000):
    for j in range(-100,1000):
      if i**5 - j**5 == x:
        a = i
        b = j
      if a != 0 or b != 0:
        break
    if a != 0 or b != 0:
        break
    
print(str(a)+" "+str(b))

Buggy submission (verdict: Runtime Error):
if not x == 0:
  for i in range(10000):
    for j in range(-10000,10000):
      if i**5 - j**5 == x:
        a = i
        b = j
    
print(str(a)+" "+str(b))

Buggy submission (verdict: Runtime Error):
x = int(input())
if not x == 0:
  for i in range(100):
    for j in range(-100,100):
      if i**5 - j**5 == x:
        a = i
        b = j
print(str(a)+" "+str(b))

Buggy submission (verdict: Runtime Error):
x = int(input())
for i in range(100):
  for j in range(-100,100):
    if i ^ 5 - j * 5 == x:
      a = i
      b = j
    break
  break
print(str(a)+" "+str(b))
Problem p02694 (python)

Fixed submission:
i = 0
x = int(input())
y = 100
while x > y:
  y = int(y * 101 /100)
  i += 1
print(i)

Buggy submission (verdict: Runtime Error):
i = 0
x = input()
y = 100
while x >= y:
  y = int(y * 101 /100)
  i += 1
print(i)
Problem p02756 (python)

Fixed submission:
s = input()
q = int(input())
s1 = ""
s2 = ""
c = 1
for i in range(q):
  a = input()
  if " " in a:
    l = list(a.split())
    c2 = 3-2*int(l[1])
    if c*c2 == 1:
      s1 = s1 + l[2]
    else:
      s2 = s2 + l[2]
  else:
    c = -c
s = s1[::-1] + s + s2
if c == 1:
  print(s)
else:
  print(s[::-1])

Buggy submission (verdict: Runtime Error):
s = input()
q = int(input())
for i in range(q):
  a = input()
  if " " in a:
    l = list(a.split())
    if l[1] == "1":
      s = l[2] + s
    else:
      s += l[2]
  else:
    s.reverse()
print(s)
Problem p02665 (python)

Fixed submission:
import sys 
sys.setrecursionlimit(2*100000) 

def dfs(i,pre,n,a,ans):
    if (pre*2 < a[i]): return -1
    ans[i] += a[i]
    if (i >= n):
        return a[i]

    pre = pre*2 - a[i]
    u = dfs(i+1,pre,n,a,ans);
    if (u<0 or pre*2 < u): return -1;
    ans[i] += min(pre, u)
    return min(pre, u) + a[i]



n = int(input())
a = list(map(int,input().split()))

if (n == 0):
    if (a[0] == 1):
        print(1)
    else:
        print(-1)
    exit()

ans = [1] + [0]*n
u = dfs(1,1,n,a,ans)
if (a[0] != 0): u = -1

if (u >= 0):
    print(sum(ans))
else:
    print(-1)

Buggy submission (verdict: Runtime Error):
def dfs(i,pre,n,a,ans):
    if (pre*2 < a[i]): return -1
    ans[i] += a[i]
    if (i == n):
        return a[i]

    pre = pre*2 - a[i]
    u = dfs(i+1,pre,n,a,ans);
    if (u<0 or pre*2 < u): return -1;
    ans[i] += min(pre, u)
    return min(pre, u) + a[i]



n = int(input())
a = list(map(int,input().split()))

if (n == 0):
    if (a[0] == 0):
        print(-1)
    else:
        print(1)
    exit()

ans = [1] + [0]*n
u = dfs(1,1,n,a,ans)
if (n!=0 and a[0] != 0): u = -1

if (u >= 0):
    print(sum(ans))
else:
    print(-1)
Problem p03448 (python)

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

ans = 0
for i in range(a+1):
    for j in range(b+1):
        nc = (x - 500*i - 100*j) // 50
        if nc < 0 or c < nc:
            continue
        ans += 1

print(ans)

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

ans = 0
for i in range(a+1):
    for j in range(b+1):
        nc = (500 * i + 100 * j) // 50
        if nc < 0 || c < nc:
            continue
        ans += 1

print(ans)
Problem p03494 (python)

Fixed submission:
n = int(input())
a = list(map(int,input().split()))
ans = 10**9  # テキトーに大きな値入れておく
for i in range(n):
    if a[i] % 2 == 1:
        print(0)
        quit()

    count = 0
    while a[i] % 2 == 0:
      a[i] //= 2
      count += 1
    ans = min(ans, count)

print(ans)

Buggy submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))
ans = 10**9 // テキトーに大きな値入れておく
for i in range(n):
    count = 0
    while a[i] % 2 == 0:
      a[i] //= 2
      count += 1
    ans = min(ans, count)

print(ans)
Problem p02999 (python)

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

Buggy submission (verdict: Runtime Error):
a,b=map(input().split())
print(0 if a<b else 10)
Problem p03035 (python)

Fixed submission:
i=list(map(int,input().split()))
if i[0]>=13:
  print(i[1])
elif 6<=i[0]<=12:
  print(int(i[1]/2))
else :
  print(0)

Buggy submission (verdict: Runtime Error):
a,b=input().split()
if a>=13:
  print(b)
elif 6<=a<=12 :
  print(b/2)
else :
  print(0)
Problem p03192 (python)

Fixed submission:
print(str(input()).count("2"))

Buggy submission (verdict: Runtime Error):
print(int(input()).count(2))
Problem p03369 (python)

Fixed submission:
print(700+input().count("o")*100)

Buggy submission (verdict: Runtime Error):
print(700+int(input()).count("o")*100)
Problem p03399 (python)

Fixed submission:
a,b,c,d=[int(input()) for i in range(4)]
print(min(a,b)+min(c,d))

Buggy submission (verdict: Runtime Error):
a,b,c,d=map(int,input().split())
l=[a+c,a+d,b+c,b+d]
print(min(l))
Problem p03455 (python)

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

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

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

Fixed submission:
print("2018"+input()[4:])

Buggy submission (verdict: Runtime Error):
a=input()
a[3]=8
print(a)

Buggy submission (verdict: Runtime Error):
a=input()
a[3]="8"
print(a)
Problem p03485 (python)

Fixed submission:
import math
a,b=map(int,input().split())
print(math.ceil((a+b)/2))

Buggy submission (verdict: Runtime Error):
import math
a,b=map(int,input().split())
print(ceil((a+b)/2))