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


def solve():
    n = int(input())
    a = list(map(int, input().split(" ")))
    d = deque()
    for i in range(n):
        d.append(a[i])
        d.reverse()

    for element in list(d):
        print(element, end = " ")


solve()

Fixed submission:
from collections import deque


def solve():
    n = int(input())
    a = list(map(str, input().split(" ")))
    ans = deque()

    i = 0
    if n % 2:
        while i != n:
            if i % 2:
                ans.append(a[i])
            else:
                ans.appendleft(a[i])
            i += 1
    else:
        while i != n:
            if i % 2:
                ans.appendleft(a[i])
            else:
                ans.append(a[i])
            i += 1

    print(" ".join(ans))


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


solve()

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


solve()
Buggy python 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()

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 python 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()

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 python 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()

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 python 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()

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

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


solve()

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


solve()

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

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


solve()
Buggy python submission (verdict: Runtime Error):
import math

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

Fixed submission:
N = int(input())

print(800 * N - (N // 15) * 200)
Buggy python submission (verdict: Runtime Error):
N = int(input())
print(math.factorial(N) % MOD)


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

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

Buggy python submission (verdict: Runtime Error):
import math


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


solve()

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

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

Buggy python submission (verdict: Runtime Error):
import math


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

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

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

Buggy python submission (verdict: Time Limit Exceeded):
INF = float('inf')
MOD = 1000000000 + 7

def solve():
    power = 1
    for i in range(1, int(input()) + 1):
        power *= i

    print(power % MOD)


solve()

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

N = int(input())
print(math.factorial(N) % MOD)
Buggy python 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()

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 python submission (verdict: Time Limit Exceeded):
n = input()
s = 0
for i in n:
  s += int(n)
if s % 9 == 0:
  print('Yes')
else:
  print('No')

Fixed submission:
n = input()
s = 0
for i in range(len(n)):
  s += int(n[i])
if s % 9 == 0:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
l = list(map(int, input().split()))
a = 1
for i in range(n):
  a *= l[i]
if a > 1000000000000000000:
  a = -1
print(a)

Fixed submission:
n = int(input())
l = list(map(int, input().split()))
a = 1
for i in range(n):
  if l[i] == 0:
    a = 0
if a != 0:
  for i in range(n):
    a *= l[i]
    if a > 1000000000000000000:
      a = -1
      break
print(a)
Buggy python submission (verdict: Runtime Error):
n = int(input())
la = []
lb = []
for i in range(n):
  a, b = map(int, input().split())
  la.append(a)
  lb.append(b)
a = statistics.median(la)
b = statistics.median(lb)
if n % 2 == 1:
  print(b - a + 1)
else:
  print((b - a) * 2 - 1)

Fixed submission:
import statistics

n = int(input())
la = []
lb = []
for i in range(n):
  a, b = map(int, input().split())
  la.append(a)
  lb.append(b)
a = statistics.median(la)
b = statistics.median(lb)
if n % 2 == 1:
  print(b - a + 1)
else:
  print(int((b - a) * 2 + 1))
Buggy python 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")

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 python submission (verdict: Time Limit Exceeded):
x = int(input())
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))

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 python 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))

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 python 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))

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 python 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))

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 python submission (verdict: Runtime Error):
k = input()
a, b = map(int, input().split())
ka = a // k
kb = b // k
if b - a >= k - 1:
  print("OK")
elif kb - ka > 0:
  print("OK")
else:
  print("NG")

Fixed submission:
k = int(input())
a, b = map(int, input().split())
ka = a // k
kb = b // k
if b - a >= k - 1:
  print("OK")
elif kb - ka > 0:
  print("OK")
elif a % k == 0 or b % k == 0:
  print("OK")
else:
  print("NG")

Buggy python submission (verdict: Runtime Error):
k = input()
a, b = map(int, input().split())
if (b % k) - (a % k) <= 0 or b - a >= 0:
  print("OK")
else:print("NG")


Fixed submission:
k = int(input())
a, b = map(int, input().split())
ka = a // k
kb = b // k
if b - a >= k - 1:
  print("OK")
elif kb - ka > 0:
  print("OK")
elif a % k == 0 or b % k == 0:
  print("OK")
else:
  print("NG")

Buggy python submission (verdict: Runtime Error):
k = input()
a, b = map(int, input().split())
if b//k - a//k <= 0 or b - a >= 0:
  print("OK")
else:print("NG")

Fixed submission:
k = int(input())
a, b = map(int, input().split())
ka = a // k
kb = b // k
if b - a >= k - 1:
  print("OK")
elif kb - ka > 0:
  print("OK")
elif a % k == 0 or b % k == 0:
  print("OK")
else:
  print("NG")
Buggy python submission (verdict: Runtime Error):
i = 0
x = input()
y = 100
while x >= y:
  y = int(y * 101 /100)
  i += 1
print(i)

Fixed submission:
i = 0
x = int(input())
y = 100
while x > y:
  y = int(y * 101 /100)
  i += 1
print(i)
Buggy python submission (verdict: Time Limit Exceeded):
a, b, n = map(int, input().split())
ans1 = 0
for i in range(n+1):
  ans2 = int(a * i / b) - a * int(i / b)
  ans1 = max(ans1, ans2)
print(ans1)


Fixed submission:
a, b, n = map(int, input().split())
if b > n:
  x = n
else:
  x = b - 1
print(int(a * x / b) - a * int(x / b))

Buggy python submission (verdict: Time Limit Exceeded):
a, b, n = map(int, input().split())
ans1 = 0
for i in range(n+1):
  ans2 = int(a * i / b) - a * int(i / b)
  ans1 = max(ans1, ans2)
print(ans1)

Fixed submission:
a, b, n = map(int, input().split())
if b > n:
  x = n
else:
  x = b - 1
print(int(a * x / b) - a * int(x / b))
Buggy python submission (verdict: Runtime Error):
n, m = map(int, unput().split())
c = 0
if n >= 2:
  c += n*(n-1) /2
if m >= 2:
  c += n*(n-1) /2
print(c)

Fixed submission:
n, m = map(int, input().split())
c = 0
if n >= 2:
  c += n*(n-1) /2
if m >= 2:
  c += m*(m-1) /2
print(int(c))
Buggy python submission (verdict: Time Limit Exceeded):
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 = s + l[2]
  else:
    s = ''.join(list(reversed(s)))
print(s)

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 python 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)

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 python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))

ans = 1
for i in a: ans*=i

if ans > 1e18:
    print(-1)
else:
    print(ans)


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

ans = 1
if (0 in a):
    print(0)
    exit()

for i in a:
    ans*=i
    if ans > 1e18:
        break

if ans > 1e18:
    print(-1)
else:
    print(ans)
Buggy python 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)


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 python submission (verdict: Time Limit Exceeded):
import math

k = int(input())

ans = 0
for i in range(1, k+1):
    for j in range(1, k+1):
        for l in range(1, k+1):
            ans += math.gcd(math.gcd(i,j), l)

print(ans)


Fixed submission:
import math

k = int(input())

ans = 0
for i in range(1, k+1):
    for j in range(1, k+1):
        ij = math.gcd(i,j)
        for l in range(1, k+1):
            ans += math.gcd(ij, l)

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
def gcd(a,b):
    if (b==0):
        return a
    else:
        return gcd(b, a%b)


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

LCM = 1
for i in a:
    LCM = LCM // gcd(LCM,i) * i

ans = 0
for i in a:
    ans += (LCM // i)

ans %= mod
print(ans)


Fixed submission:
import fractions 
mod = 1000000007;
n = int(input())
a = list(map(int, input().split()))

LCM = 1
for i in a:
    LCM = LCM // fractions.gcd(LCM,i) * i

ans = 0
for i in a:
    ans += (LCM // i)

ans %= mod
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
def gcd(a,b):
    if (b==0):
        return a
    else:
        return gcd(b, a%b)


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

LCM = 1
for i in a:
    LCM = LCM // gcd(LCM,i) * i

ans = 0
for i in a:
    ans += (LCM // i)
    ans %= mod

print(ans)


Fixed submission:
import fractions 
mod = 1000000007;
n = int(input())
a = list(map(int, input().split()))

LCM = 1
for i in a:
    LCM = LCM // fractions.gcd(LCM,i) * i

ans = 0
for i in a:
    ans += (LCM // i)

ans %= mod
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
def gcd(a,b):
    if (b==0):
        return a
    else:
        return gcd(b, a%b)


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

LCM = 1
for i in a:
    LCM = LCM // gcd(LCM,i) * i

ans = 0
for i in a:
    ans += (LCM // i)
    ans %= mod

print(ans)


Fixed submission:
import fractions 
mod = 1000000007;
n = int(input())
a = list(map(int, input().split()))

LCM = 1
for i in a:
    LCM = LCM // fractions.gcd(LCM,i) * i

ans = 0
for i in a:
    ans += (LCM // i)

ans %= mod
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = input()

pin = [str(i).zfill(3) for i in range(1000)]

ans = 0
for i in pin:
    c = 0
    for j in s:
        if j == i[c]:
            c += 1
        if c == 3:
            ans += 1
            break
print(ans)


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

pins = [str(i).zfill(3) for i in range(1000)]

ans = 0
for pin in pins:
    index = -1;
    for c in pin:
      index = s.find(c, index+1);
      if (index < 0):
        break;
    if (index > 0):
      ans += 1;
      
print(ans)
Buggy python 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)


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 python 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)

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 python submission (verdict: Time Limit Exceeded):
a=int(input())
b=int((a-1)*a/2)
c=[]
c.append(b)
for i in range(1,int(a/2)):
    if i<a%(i+1):
        c.append(b+(a%(i+1)-i))
print(max(c))

Fixed submission:
a=int(input())
print(a*(a-1)//2)
Buggy python submission (verdict: Runtime Error):
a=set(list(map(input().split())))
print("Yes" if len(a)==2 else "No")

Fixed submission:
x=list(input())
a=x[0]
b=x[1]
c=x[2]
d=x[3]
if a==b and a!=c:
  if c==d:
    print("Yes")
  else:
    print("No")
elif a==c and a!=b:
  if b==d:
    print("Yes")
  else:
    print("No")
elif a==d and a!=b:
  if b==c:
    print("Yes")
  else:
    print("No")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
x=list(input())
a=x[0]
b=x[1]
c=x[2]
d=x[3]
if a==b and a!=c:
  if c==d:
    print(Yes)
  else:
    print(No)
elif a==c and a!=b:
  if b==d:
    print(Yes)
  else:
    print(No)
elif a==d and a!=b:
  if b==c:
    print(Yes)
  else:
    print(No)
else:
  print(No)

Fixed submission:
x=list(input())
a=x[0]
b=x[1]
c=x[2]
d=x[3]
if a==b and a!=c:
  if c==d:
    print("Yes")
  else:
    print("No")
elif a==c and a!=b:
  if b==d:
    print("Yes")
  else:
    print("No")
elif a==d and a!=b:
  if b==c:
    print("Yes")
  else:
    print("No")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
a,b=map(input().split())
print(0 if a<b else 10)

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

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 python submission (verdict: Runtime Error):
s=list(map(int,input()))
for i in range(10):
  s[2]=s[0]*s[2]-s[1]
  print(s[2])


Fixed submission:
x={}
i=list(map(int,input().split()))
for s in range(10):
  x[s]=int((i[2]-(i[1]/(i[0]-1)))*i[0]**(s+1)+(i[1]/(i[0]-1)))
  print(x[s])
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
c=input()
c[b]=c[b].lower()
print(c)

Fixed submission:
a,b=map(int,input().split())
c=list(input())
c[b-1]=c[b-1].lower()
print(*c,sep="")
Buggy python submission (verdict: Runtime Error):
print(int(input()).count(2))

Fixed submission:
print(str(input()).count("2"))
Buggy python submission (verdict: Runtime Error):
a=sorted(list(int,input().split()))
print(a[2]*10+a[0]+a[1])

Fixed submission:
a=sorted(list(map(int,input().split())))
print(a[2]*10+a[0]+a[1])
Buggy python submission (verdict: Runtime Error):
print(input().count("+")-input().count("-"))

Fixed submission:
a=input()
print(a.count("+")-a.count("-"))
Buggy python submission (verdict: Runtime Error):
print(700+int(input()).count("o")*100)

Fixed submission:
print(700+input().count("o")*100)
Buggy python submission (verdict: Runtime Error):
a,b,c,d=map(int,input().split())
l=[a+c,a+d,b+c,b+d]
print(min(l))

Fixed submission:
a,b,c,d=[int(input()) for i in range(4)]
print(min(a,b)+min(c,d))
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
print("Even" if (a*b)%==0 else "Odd")

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

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

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

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

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

Fixed submission:
print("2018"+input()[4:])
Buggy python submission (verdict: Runtime Error):
import math
a,b=map(int,input().split())
print(ceil((a+b)/2))

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

Fixed submission:
a=int(input())
b=int(input())
print(2*b-a)
Buggy python submission (verdict: Runtime Error):
print("Yes" if input()[0]==input()[2] else "No")

Fixed submission:
a=input()
print("Yes" if a[0]==a[2] else "No")
Buggy python submission (verdict: Runtime Error):
a=int(input())
print(800*n-(n//15)*200)

Fixed submission:
a=int(input())
print(800*a-(a//15)*200)
Buggy python submission (verdict: Runtime Error):
a,b,c=map(input().split())
if b=="+":
  print(int(a)+int(c))
else:
  print(int(a)-int(c))

Fixed submission:
(a,b,c) = input().split()
if b=="+":
  print(int(a)+int(c))
else:
  print(int(a)-int(c))
Buggy python submission (verdict: Runtime Error):
print(len(list(set(int,input().split()))))

Fixed submission:
print(len(set(map(int,input().split()))))
Buggy python submission (verdict: Runtime Error):
a=list(input())
sum=0
b=set(a)
for i in range(len(b)):
  if a.count(b[i])%2==0:
    sum+=1
print("Yes" if sum==len(b) else "No")

Fixed submission:
a=list(input())
sum=0
b=list(set(a))
for i in range(len(b)):
  if a.count(b[i])%2==0:
    sum+=1
print("Yes" if sum==len(b) else "No")