Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = int(input())
b = int(input())
if n == 1:
    print('Hello World')
else:
    print(a + b)

Fixed submission:
n = int(input())
if n == 1:
    print('Hello World')
else:
    a = int(input())
    b = int(input())
    print(a + b)
Buggy python submission (verdict: Runtime Error):
R = int(input())
if R < 1200:
    print('ABC')
elif <2800:
    print('ARC')
else:
    print('AGC')

Fixed submission:
R = int(input())
if R < 1200:
    print('ABC')
elif R < 2800:
    print('ARC')
else:
    print('AGC')
Buggy python submission (verdict: Runtime Error):
s = input()
n == 0
for i in 4:
    if s[i-1] == '+':
        n += 1
    else:
        n -= 1
print(n)      

Fixed submission:
s = input()
n = s.count('+')
print(2*n - 4)
Buggy python submission (verdict: Runtime Error):
s = input()
for a in s and b in s and c in s:
    print('Yes')
else:
    print('No')

Fixed submission:
s = input()
if s.count('a') == 1 and s.count('b') == 1:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
# coding=utf-8
N=int(input())
a=list(map(int,input().split()))
a.sort(reverse=True)  
alice=a[::2]　　
bob=a[1::2]　　　
print(sum(alice)-sum(bob))


Fixed submission:
#coding=utf-8
N = int(input())
A = list(map(int,input().split()))
A.sort(reverse=True)
Alice = A[::2]
Bob = A[1::2]
print(sum(Alice) - sum(Bob))
Buggy python submission (verdict: Runtime Error):
n = input()
for 9 in n:
    print('Yes')
else:
    print('No')

Fixed submission:
n = input()
if n[0] == '9' or n[1] == '9':
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
n = input()
if 9 in n:
    print('Yes')
else:
    print('No')

Fixed submission:
n = input()
if n[0] == '9' or n[1] == '9':
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
n = int(input())
if 9 in n:
    print('Yes')
else:
    print('No')

Fixed submission:
n = input()
if n[0] == '9' or n[1] == '9':
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
n = int(input())
if n[0] == n[-1]:
    print('Yes')
else:
    print('No')

Fixed submission:
n = input()
if n[0] == n[-1]:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
n = int(input())
if str(n[0]) = str(n[2]):
    print('Yes')
else:
    print('No')

Fixed submission:
n = input()
if n[0] == n[-1]:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
n = int(input())
if str(n[0]) == str(n[2]):
    print('Yes')
else:
    print('No')

Fixed submission:
n = input()
if n[0] == n[-1]:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
n = int(input())
if n[0] == n[2]:
    print('Yes')
else:
    print('No')

Fixed submission:
n = input()
if n[0] == n[-1]:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
r,g,b = map(int,input().split())
n == r*100 + g*10 + b
if n % 4 == 0:
    print('YES')
else:
    print('NO')

Fixed submission:
r,g,b = map(int,input().split())
n = r*100 + g*10 + b
if n % 4 == 0:
    print('YES')
else:
    print('NO')

Buggy python submission (verdict: Runtime Error):
r,g,b = map(int,input().split())
n == r*100 + g*10 + b
if n % 4 = 0:
    print('YES')
else:
    print('NO')

Fixed submission:
r,g,b = map(int,input().split())
n = r*100 + g*10 + b
if n % 4 == 0:
    print('YES')
else:
    print('NO')
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
if a,b ==[4,6,9,11]:
    print('Yes')
elif a,b ==[1,3,5,7,8,10,12]:
    print('Yes')
else:
    print('No')

Fixed submission:
x,y = map(int,input().split())
a =[4,6,9,11]
b = [1,3,5,7,8,10,12]
if (x in a and y in a) or (x in b and y in b):
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
a,b = map(str,input().split())
if a == D and b == D:
    print('H')
elif a == H and b == H:
    print('H')
else:
    print('D')

Fixed submission:
a,b = map(str,input().split())
if a == 'D' and b == 'D':
    print('H')
elif a == 'H' and b == 'H':
    print('H')
else:
    print('D')

Buggy python submission (verdict: Runtime Error):
a,b = input().split()
if a == D and b == D:
    print('H')
elif a == H and b == H:
    print('H')
else:
    print('D')

Fixed submission:
a,b = map(str,input().split())
if a == 'D' and b == 'D':
    print('H')
elif a == 'H' and b == 'H':
    print('H')
else:
    print('D')

Buggy python submission (verdict: Runtime Error):
a = input().split()
if a[0] == D and a[1] == D:
    print('H')
elif a[0] == H and a[1] == H:
    print('H')
else:
    print('D')

Fixed submission:
a,b = map(str,input().split())
if a == 'D' and b == 'D':
    print('H')
elif a == 'H' and b == 'H':
    print('H')
else:
    print('D')

Buggy python submission (verdict: Runtime Error):
a = input().split()
if a[0] == D and a[1] == D:
    print(H)
elif a[0] == H and a[1] == H:
    print(H)
else:
    print(D)

Fixed submission:
a,b = map(str,input().split())
if a == 'D' and b == 'D':
    print('H')
elif a == 'H' and b == 'H':
    print('H')
else:
    print('D')
Buggy python submission (verdict: Runtime Error):
n = input().split()
if n[1] == '+':
    print(int(n[0]+n[2]))
else:
    print(int(n[0]-n[2]))

Fixed submission:
n = input().split()
if n[1] == '+':
    print(int(n[0])+int(n[2]))
else:
    print(int(n[0])-int(n[2]))

Buggy python submission (verdict: Runtime Error):
n = input().split()
if n[2] == '+':
    print(int(n[0]+n[4]))
else:
    print(int(n[0]-n[4]))

Fixed submission:
n = input().split()
if n[1] == '+':
    print(int(n[0])+int(n[2]))
else:
    print(int(n[0])-int(n[2]))

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

Fixed submission:
n = input().split()
if n[1] == '+':
    print(int(n[0])+int(n[2]))
else:
    print(int(n[0])-int(n[2]))
Buggy python submission (verdict: Runtime Error):
N = int(input())
T = list(map(int,input().split()))
M = int(input())
P,X = [list(map(int,input().split())) for _ in range(M)]
all = sum(T)
print(all - T[P-1] + X)


Fixed submission:
N = int(input())
T = list(map(int,input().split()))
M = int(input())
all = sum(T)
for i in range(M):
   P,X = list(map(int,input().split()))
   print(all - T[P-1] + X)
Buggy python submission (verdict: Runtime Error):
c = input()
if c == a:
    print('vowel')
elif c == e:
    print('vowel')
elif c == i:
    print('vowel')
elif c == o:
    print('vowel')
elif c == u:
    print('vowel')
else:
    print('consonant')
    

Fixed submission:
c = input()
d =['a', 'e', 'i', 'o', 'u']

if c in d:
    print('vowel')
else:
    print('consonant')

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

Fixed submission:
c = input()
d =['a', 'e', 'i', 'o', 'u']

if c in d:
    print('vowel')
else:
    print('consonant')

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

Fixed submission:
c = input()
d =['a', 'e', 'i', 'o', 'u']

if c in d:
    print('vowel')
else:
    print('consonant')

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

Fixed submission:
c = input()
d =['a', 'e', 'i', 'o', 'u']

if c in d:
    print('vowel')
else:
    print('consonant')
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
if a=5 and b=5 and c=7:
    print('YES')
elif a=5 and b=7 and c=5:
    print('YES')
elif a=7 and b=5 and c=5:
    print('YES')
else:
    print('NO')

Fixed submission:
a,b,c = map(int,input().split())
if a==5 and b==5 and c==7:
    print('YES')
elif a==5 and b==7 and c==5:
    print('YES')
elif a==7 and b==5 and c==5:
    print('YES')
else:
    print('NO')
Buggy python submission (verdict: Time Limit Exceeded):
import math
n= int(input())

l = list(map(int,input().split()))
ans = 1
if 0 in l:
  print(0)
else:
  for i in range(n):
    ans *= l[i]
  print(ans if ans <= 10**18 else -1)


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

l = list(map(int,input().split()))
l.sort(reverse = True)

ans = 1
if 0 in l:
  print(0)
else:
  for i in range(n):
    ans *= l[i]
#    print(ans)
    if ans > 10**18:
      break
  print(ans if ans <= 10**18 else -1)
Buggy python submission (verdict: Runtime Error):
import math
a,b,h,m = map(int,input().split())
ans = 0
ang = 0

if 6*m == 30*h+0.5*m:
  ans = 1
elif abs(6*m - 30*h+0.5*m) == 180:
  ans = 7
  ang = 180
elif 6*m > 30*h+0.5*m:
  ang = 6*m - 30*h+0.5*m
  ans = sqrt(a**2+b**2-2*a*b*math.cos(ang))
else:
  ang = 30*h+0.5*m + (360 - 6*m)
  if ang > 360:
    ang -= 360
  ans = math.sqrt(a**2+b**2-2*a*b*math.cos(math.radians(ang)))
print(ans)

Fixed submission:
import math
a,b,h,m = map(int,input().split())
ans = 0
ang = 0
tan = 30*h+0.5*m
cho = 6*m
ang = abs(cho-tan)
#print(tan,cho,ang)

ans = math.sqrt(a**2+b**2-2*a*b*math.cos(math.radians(ang)))
print(ans)
Buggy python submission (verdict: Runtime Error):
n = input()
print("Yes" if s.count("7") >= 1 else "No")


Fixed submission:
n = input()
print("Yes" if n.count("7") >= 1 else "No")
Buggy python submission (verdict: Time Limit Exceeded):
import math
from functools import reduce

def gcd(*numbers):
    return reduce(math.gcd, numbers)

def gcd_list(numbers):
    return reduce(math.gcd, numbers)


n = int(input())
ans = 0
t = 0
import math
for i in range(1,n+1):
  for j in range(1,n+1):
#    t = math.gcd(i,j)
    for k in range(1,n+1):
      ans += gcd_list([i,j,k])
print(ans)


Fixed submission:
n = int(input())
ans = 0
t = 0
import math
for i in range(1,n+1):
  for j in range(1,n+1):
    t = math.gcd(i,j)
    for k in range(1,n+1):
      ans += math.gcd(t,k)
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
ans = 0
t = 0
import fractions
for i in range(1,n+1):
  for j in range(1,n+1):
    t = fractions.gcd(i,j)
    for k in range(1,n+1):
      ans += fractions.gcd(t,k)
print(ans)

Fixed submission:
n = int(input())
ans = 0
t = 0
import math
for i in range(1,n+1):
  for j in range(1,n+1):
    t = math.gcd(i,j)
    for k in range(1,n+1):
      ans += math.gcd(t,k)
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
l = list(map(int,input().split()))
ans = 0
d = {}
if len(l) == len(set(l)):
  for i in range(len(l)):
    print(0)
else:
  for s in l:
    if s not in d:
      d[s] = 1
    else:
      d[s] += 1
  for i in range(n):
    ans = 0
    for j,k in d.items():
      if l[i] == j and k >= 2:
        ans += (k-1)*(k-2)//2
      else:
        ans += k*(k-1)//2
    print(ans)

Fixed submission:
n = int(input())
l = list(map(int,input().split()))
ans = 0
ansl = 0
d = {}
if len(l) == len(set(l)):
  for i in range(len(l)):
    print(0)
else:
  for s in l:
    if s not in d:
      d[s] = 1
    else:
      d[s] += 1
  for j,k in d.items():
    ans += k*(k-1)//2
  ansl = ans
  for i in range(n):
    ans = ansl
    x = d[l[i]]
    ans -= x - 1
    print(ans)
Buggy python submission (verdict: Runtime Error):
n = int(input())
l = (1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51)
print(l[n+1])

Fixed submission:
n = int(input())
l = (1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51)
print(l[n-1])
Buggy python submission (verdict: Time Limit Exceeded):
a,b = map(int, input().split())
l = [(int(i)+1)/2 for i in input().split()]

ll = []

for i in range(a-b+1):
  ll += [sum(l[i:i+b])]

ll.sort()
print(ll[-1])

Fixed submission:
a,b = map(int, input().split())
l = [(int(i)+1)/2 for i in input().split()]

temp = sum(l[:b])
max = temp
for i in range(b,a):
  temp = temp + l[i] - l[i-b]
  if max < temp:
    max = temp
    
print(max)

Buggy python submission (verdict: Time Limit Exceeded):
a,b = map(int, input().split())
l = list(map(int, input().split()))
max = 0
e = 0
temp = 0
pr = []
ll = []

for x in l:
  pr += [(x+1)/2]

for i in range(a-b+1):
  ll += [sum(pr[i:i+b])]
ll.sort()
print(ll[-1])



Fixed submission:
a,b = map(int, input().split())
l = [(int(i)+1)/2 for i in input().split()]

temp = sum(l[:b])
max = temp
for i in range(b,a):
  temp = temp + l[i] - l[i-b]
  if max < temp:
    max = temp
    
print(max)

Buggy python submission (verdict: Time Limit Exceeded):
a,b = map(int, input().split())
l = list(map(int, input().split()))
max = 0
e = 0
temp = 0
pr = []
ll = []

for i in range(a-b+1):
  pr.append(sum(l[i:i+b]))

for j in range(len(pr)):
  if max < pr[j]:
    temp = j
    max = pr[j]

ll = [l[i] for i in range(temp, temp+b)]

for x in ll:
  e += (x+1)/2

print(e)

Fixed submission:
a,b = map(int, input().split())
l = [(int(i)+1)/2 for i in input().split()]

temp = sum(l[:b])
max = temp
for i in range(b,a):
  temp = temp + l[i] - l[i-b]
  if max < temp:
    max = temp
    
print(max)

Buggy python submission (verdict: Time Limit Exceeded):
a,b = map(int, input().split())
l = list(map(int, input().split()))
max = 0
e = 0
temp = 0
pr = []

for i in range(a-b+1):
  temp = sum(l[i:i+b])
  if temp >= max:
    max = temp
    pr = l[i:i+b]

for j in pr:
  e += (j+1) / 2 
  
print(e)


Fixed submission:
a,b = map(int, input().split())
l = [(int(i)+1)/2 for i in input().split()]

temp = sum(l[:b])
max = temp
for i in range(b,a):
  temp = temp + l[i] - l[i-b]
  if max < temp:
    max = temp
    
print(max)

Buggy python submission (verdict: Time Limit Exceeded):
a,b = map(int, input().split())
l = list(map(int, input().split()))
max = 0
e = 0
temp = 0
pr = []

for i in range(a-b+1):
  temp = sum(l[i:i+b])
  if temp >= max:
    max = temp
    pr = l[i:i+b]

for j in pr:
  for k in range(1,j+1):
    e += k*(1/j)
  
print(e)


Fixed submission:
a,b = map(int, input().split())
l = [(int(i)+1)/2 for i in input().split()]

temp = sum(l[:b])
max = temp
for i in range(b,a):
  temp = temp + l[i] - l[i-b]
  if max < temp:
    max = temp
    
print(max)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
List = list(map(int, input().split()))
count = 0

for i in range(n):
  if List[i] <= min(List[0:i+1:]):
    count += 1
print(count)

Fixed submission:
n = int(input())
List = list(map(int, input().split()))
count = 1
min = List[0]

for i in range(n):
  if min > List[i]:
    min =List[i]
    count += 1
print(count)

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

for i in range(n):
  L2 = List[0:i+1:]
  if List[i] <= min(L2):
    count += 1
print(count)

Fixed submission:
n = int(input())
List = list(map(int, input().split()))
count = 1
min = List[0]

for i in range(n):
  if min > List[i]:
    min =List[i]
    count += 1
print(count)

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

L2 = []

for i in range(n):
  L2.append(List[i])
  if List[i] <= min(L2):
    count += 1
print(count)

Fixed submission:
n = int(input())
List = list(map(int, input().split()))
count = 1
min = List[0]

for i in range(n):
  if min > List[i]:
    min =List[i]
    count += 1
print(count)

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

for i in range(n):
  for j in range(i+1):
    if List[i] > List[j]:
      break
    if i == j:
      count += 1
print(count)

Fixed submission:
n = int(input())
List = list(map(int, input().split()))
count = 1
min = List[0]

for i in range(n):
  if min > List[i]:
    min =List[i]
    count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
a,b = int(input())
print(a*b if a < 10 and b < 10 else -1)

Fixed submission:
a,b = map(int,input().split())
print(a*b if a < 10 and b < 10 else -1)
Buggy python submission (verdict: Time Limit Exceeded):
import itertools
n = int(input())
l = list(map(int,input().split()))
cnt = 0

for x,y,z in itertools.combinations(l,3):
  lt = sorted([x,y,z])
  if lt[2] < lt[0] + lt[1]:
    cnt += 1
print(cnt)

Fixed submission:
import bisect
n = int(input())
l = sorted(list(map(int,input().split())))
cnt = 0

for i in range(n):
  for j in range(1+i,n):
    a,b = l[i],l[j]
    cnt += bisect.bisect_left(l,a+b)-(j+1)
    
print(cnt)

Buggy python submission (verdict: Time Limit Exceeded):
import itertools
n = int(input())
l = list(map(int,input().split()))
cnt = 0

for x,y,z in itertools.combinations(l,3):
  if x+y >z and y+z >x and z+x >y:
    cnt += 1
print(cnt)

Fixed submission:
import bisect
n = int(input())
l = sorted(list(map(int,input().split())))
cnt = 0

for i in range(n):
  for j in range(1+i,n):
    a,b = l[i],l[j]
    cnt += bisect.bisect_left(l,a+b)-(j+1)
    
print(cnt)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
l = list(map(int,input().split()))
ans = ''

for i in range(n):
  ans += str(l.index(i+1) + 1) + ' '
print(ans)

Fixed submission:
n = int(input())
l = list(map(int,input().split()))
ans = [0] * n

for i in range(n):
  ans[l[i]-1] = i + 1
print(*ans)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
l = list(map(int,input().split()))
ans = [0]*n

for i in range(n):
  ans[i] = l.index(i+1) + 1
print(*ans)

Fixed submission:
n = int(input())
l = list(map(int,input().split()))
ans = [0] * n

for i in range(n):
  ans[l[i]-1] = i + 1
print(*ans)
Buggy python submission (verdict: Runtime Error):
s = input()
t = input()
cnt = 0
for i,j in s,t:
  if i == j:
    cnt += 1
print(cnt)

Fixed submission:
s = input()
t = input()
cnt = 0
for i in range(3):
  if s[i] == t[i]:
    cnt += 1
print(cnt)
Buggy python submission (verdict: Runtime Error):
n = int(input())
l = list(map(int, input().split()))

sum = 0

for i in range(i):
  sum += 1/l[i]
print(1/sum)

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

sum = 0

for i in range(n):
  sum += 1/l[i]
print(1/sum)
Buggy python submission (verdict: Time Limit Exceeded):
import itertools
n = int(input())
l = [input() for i in range(n)]
cnt = 0

for x,y in itertools.combinations(l,2):
  
  lx = sorted(x)
  ly = sorted(y)
  if lx == ly:
    cnt += 1

print(cnt)

Fixed submission:
import itertools
n = int(input())
l = ["".join(sorted(input())) for i in range(n)]
d = {}
cnt = 0

for i in range(n):
  if l[i] not in d:
    d[l[i]] = 1
  else:
    cnt += d[l[i]]
    d[l[i]] += 1

print(cnt)
Buggy python submission (verdict: Runtime Error):
from math import factorial

def a(n,k):
  return factorial(n)//factorial(k)//factorial(n-k)

n,k = map(int,input().split())
mod = 10**9 + 7

for i in range(k):
  print(a(n-k+1,i+1)*a(k-1,i)%mod)



Fixed submission:
from math import factorial

def comb(a,b):
    return factorial(a) // factorial(b) // factorial(abs(a-b))

n, k = map(int, input().split())
for i in range(k):
    print(comb(k-1, i) * comb(n-k+1, i+1) % 1000000007)

Buggy python submission (verdict: Runtime Error):
from math import factorial
n,k = map(int,input().split())
mod = 10**9 + 7

def a(n,k):
  return factorial(n)//factorial(k)//factorial(n-k)

for i in range(k):
  print(a(n-k+1,i+1)*a(k-1,i)%mod)

Fixed submission:
from math import factorial

def comb(a,b):
    return factorial(a) // factorial(b) // factorial(abs(a-b))

n, k = map(int, input().split())
for i in range(k):
    print(comb(k-1, i) * comb(n-k+1, i+1) % 1000000007)
Buggy python submission (verdict: Runtime Error):
a, b = map(int,input())
ma = max(2*a-1, a+b, 2*b-1)
print(ma)

Fixed submission:
a, b = map(int,input().split())
ma = max(2*a-1, a+b, 2*b-1)
print(ma)
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
cnt = 0
for i in range(min(a,b),-1):
  if a%i == 0 and b%i == 0:
    cnt += 1
    if cnt == c:
      break
print(i)

Fixed submission:
a,b,c = map(int,input().split())
cnt = 0
ans = 0

s = min(a,b)
for i in range(s,0,-1):
#  print("i:" + str(i))
  if a%i == 0 and b%i == 0:
    cnt += 1
    if cnt == c:
      ans = i
      break
print(ans)
Buggy python submission (verdict: Runtime Error):
n = int(input())
l = sprted(list(map(int, input().split())))
if l[-1] * 2 < sum(l):
  print("Yes")
else:
  print("No")

Fixed submission:
n = int(input())
l = sorted(list(map(int, input().split())))
if l[-1] * 2 < sum(l):
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
n = int(input())
s = "Christmas"

a = 25 - n
  s += " Eve" * a

print(s)

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

a = 25 - n
s += " Eve" * a

print(s)
Buggy python submission (verdict: Runtime Error):
s = input()
ans = 1000
n = 0
for i in range(0:len(s)-2):
  n = int(s[i] + s[i+1] + s[i+2])
  ans = min(ans,abs(n-753))
print(ans)

Fixed submission:
s = input()
ans = 1000
n = 0
for i in range(0,len(s)-2):
  n = int(s[i] + s[i+1] + s[i+2])
  ans = min(ans,abs(n-753))
print(ans)
Buggy python submission (verdict: Runtime Error):
n = int(input)
if n == 1:
  print("Hello World")
else:
  a = int(input())
  b = int(input())
  print(a+b)
  

Fixed submission:
n = int(input())
if n == 1:
  print("Hello World")
else:
  a = int(input())
  b = int(input())
  print(a+b)
Buggy python submission (verdict: Runtime Error):
a = input()
s = list(a)
n = 0

for i in s:
  n += int(i)

print("Yes" if int(a)%n == 0 else "No")


Fixed submission:
s = input()
print(s.count("+") - s.count("-"))
Buggy python submission (verdict: Runtime Error):
s = list(input())
n = 0

for i in s:
  n += int(s)

print("Yes" if int(s)%n == 0 else "No")

Fixed submission:
a = input()
s = list(a)
n = 0

for i in s:
  n += int(i)

print("Yes" if int(a)%n == 0 else "No")
Buggy python submission (verdict: Time Limit Exceeded):
import statistics
from collections import deque

d = deque()

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

#print(d)

for i in range(a):
  b = d.pop(0)
  print(statistics.median(d))
  d.append(b)
#  print(d)

Fixed submission:
import copy

a = int(input())
l = list(map(int, input().split()))
l2 = sorted(copy.deepcopy(l))

#print(l2)

for i in l:
  if i < l2[a//2]:
    print(l2[a//2])
  else:
    print(l2[a//2 - 1])

Buggy python submission (verdict: Time Limit Exceeded):
import statistics

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

for i in range(a):
  b = l.pop(0)
  print(statistics.median(l))
  l.append(b)


Fixed submission:
import copy

a = int(input())
l = list(map(int, input().split()))
l2 = sorted(copy.deepcopy(l))

#print(l2)

for i in l:
  if i < l2[a//2]:
    print(l2[a//2])
  else:
    print(l2[a//2 - 1])
Buggy python submission (verdict: Runtime Error):
a,b,c,d = map(int,input().split())
print("Left" if a+b>c+d else "Right" if a+b<c+d else "Balanced
")

Fixed submission:
a,b,c,d = map(int,input().split())
print("Left" if a+b>c+d else "Right" if a+b<c+d else "Balanced")
Buggy python submission (verdict: Runtime Error):
n = int(input())
l = list(map(int, input().split()))
dic = {}
count = 0

for i in range(n):
  dic.setdefault(l[i],0)
  dic[l[i]] += 1
#print(dic)
for x,y in dic.items():
  if x <= y:
    count += y - x
  else:
    count += y
print(count)


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

Buggy python submission (verdict: Runtime Error):
n = int(input())
l = list(map(int, input().split()))
L = list(set(l))
count = 0
for x in L:
  if l.count(x) == x:
    continue
  elif l.count(x) > x:
    count += l.count(x) - x
  else:
    count += l.count(x)
print(count)

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