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

Fixed submission:
kazu = int(input())
numbers_list = list(map(int, input().split()))
count = 0
seisu = 0
while True:
    for index in range(kazu):
        if numbers_list[index] % 2 != 0:
            seisu = 1
            break
        else:
            numbers_list[index] = numbers_list[index] / 2
    if seisu == 1:
        break
    count += 1
print(count)

Buggy submission (verdict: Runtime Error):
kazu = int(input())
numbers_list = list(map(int, input().split()))
count = 0
seisu = 0
while True:
    for index in range(kazu):
        if numbers_list[index] % 2 != 0:
            seisu = 1
            break
        else:
            numbers_list[index] = numbers_list / 2
    if seisu == 1:
        break
    count += 1
print(count)

Buggy submission (verdict: Runtime Error):
kazu = int(input())
numbers_list = list(map(int, input().split()))
count = 0
seisu = 0
while True:
    for index in range(kazu):
        if numbers_list(index) % 2 == 0:
            numbers_list[inedx] = numbers_list[index] / 2
            count += 1
        else:
            seisu = 1
            break
    if seisu == 1:
        break
print(count)
Problem p03206 (python)

Fixed submission:
def christmasday():
    D = int(input())
    if D == 22:
        print("Christmas Eve Eve Eve")
    elif D == 23:
        print("Christmas Eve Eve")
    elif D == 24:
        print("Christmas Eve")
    elif D == 25:
        print("Christmas")
christmasday()

Buggy submission (verdict: Runtime Error):
print("22から25までの数値を入力して下さい")
D = int(input())

if D == 22:
    print("Christmas Eve Eve Eve")
    break
elif D == 23:
    print("Christmas Eve Eve")
    break
elif D == 24:
    print("Christmas Eve")
    break
elif D == 25:
    print("Christmas")
    break
else:
    print("22から25までの数値を入力して下さい")
    D = int(input())

Buggy submission (verdict: Runtime Error):
def christmasday():
    print("22から25までの数値を入力して下さい")
    number = int(input())

    if number == 22:
        print("Christmas Eve Eve Eve")
        break
    elif number == 23:
        print("Christmas Eve Eve")
        break
    elif number == 24:
        print("Christmas Eve")
        break
    elif number == 25:
        print("Christmas")
        break
    else:
        print("22から25までの数値を入力して下さい")
        number = int(input())
christmasday()
Problem p03351 (python)

Fixed submission:
a, b, c, d = input().split(" ")
a = int(a)
b = int(b)
c = int(c)
d = int(d)
if abs(a - c) <= d or (abs(a - b) <= d and abs(b - c) <= d):
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
a, b, c, d = input().split(" ")
print(abs(a - c) >= d) || (abs(a - b) >= d && abs(b - c) >= d))

Buggy submission (verdict: Runtime Error):
a, b, c, d = input().split(" ")
print(abs(a - c) >= d || (abs(a - b) >= d && abs(b - c) >= d))

Buggy submission (verdict: Runtime Error):
a, b, c, d = input().split(" ")
return abs(a - c) >= d || (abs(a - b) >= d && abs(b - c) >= d)
Problem p03759 (python)

Fixed submission:
numbers = list(map(int, input().split(' ')))
if numbers[2] - numbers[1] == numbers[1] - numbers[0]:
    print('YES')
else:
    print('NO')

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

for _a, _b in zip(a, b):
    print(_a, _b, sep='', end='')
if len(a) > len(b):
    print(a[-1])

Buggy submission (verdict: Runtime Error):
numbers = map(int, input().split(' '))
if numbers[2] - numbers[1] == numbers[1] - numbers[0]:
    print('YES')
else:
    print('NO')
Problem p03206 (python)

Fixed submission:
i = input()

c = abs(int(i) - 25)

s = "Christmas"

for _ in range(c):
    s += " Eve"

print(s)

Buggy submission (verdict: Runtime Error):
import math

i = input()

c = abs(i - 25)

s = "Christmas"

for _ in range(c)
	s += " Eve"

print(s)
Problem p03262 (python)

Fixed submission:
def gcd(a, b):
	while b:
		a, b = b, a % b
	return a


N,X=map(int,input().split(" "))
xl=list(map(int,input().split(" ")))
xl.append(X)
xl=sorted(xl)

xx=[xl[i+1]-xl[i] for i in range(len(xl)-1)]

ans=max(xx)
for i in range(len(xx)):
    ans=gcd(ans,xx[i])

print(ans)

Buggy submission (verdict: Runtime Error):
import math
N,X=map(int,input().split(" "))
xl=list(map(int,input().split(" ")))
xl.append(X)
xl=sorted(xl)
xx=[xl[i+1]-xl[i] for i in range(len(xl)-1)]
ans=max(xx)
for i in range(len(xx)):
    ans=math.gcd(ans,xx[i])

print(ans)

Buggy submission (verdict: Runtime Error):
import math

N,X=map(int,input().split(" "))
xl=list(map(int,input().split(" ")))
xl.append(X)
xl=sorted(xl)

xy=[xl[i+1]-xl[i] for i in range(len(xl)-1)]

ans=max(xy)
for i in range(len(xy)):
    ans=math.gcd(ans,xy[i])

print(ans)

Buggy submission (verdict: Runtime Error):
import math

N,X=map(int,input().split(" "))
xl=list(map(int,input().split(" ")))
xl.append(X)
xl=sorted(xl)

xy=[xl[i+1]-xl[i] for i in range(len(xl)-1)]

ans=max(xy)
for i in range(len(xy)):
    ans=math.gcd(ans,xy[i])

print(ans)
Problem p03274 (python)

Fixed submission:
N,K=map(int,input().split(" "))
X=sorted(list(map(int,input().split(" "))))

ans=0
for i in range(N-K+1):
    tans=abs(X[i]-X[i+K-1])+abs(X[i])

    if i==0 or ans>tans:
        ans=tans

for i in range(N-K+1):
    tans=abs(X[i]-X[i+K-1])+abs(X[i+K-1])

    if ans>tans:
        ans=tans

print(ans)

Buggy submission (verdict: Runtime Error):
N,K=map(int,input().split(" "))
X=sorted(list(map(int,input().split(" "))))

ans=0
for i in range(N-K+1):
    tans=abs(X[i]-X[i+K])+abs(X[i])

    if i==0 or ans>tans:
        ans=tans
    
print(ans)
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((A-1)*(B-1))
Problem p03289 (python)

Fixed submission:
S=input()

cc=0
nc=0
for i in range(2,len(S)-1):
    if S[i]=='C' and S[i].islower()==False:
        cc+=1
        nc=i

if cc==1 and not nc==0:
    p1=True
else:
    p1=False

if S[0]=='A' and S[0].islower()==False:
    p2=True
else:
    p2=False

bc=0
for i in range(len(S)):
    if i==0 or i==nc:
        pass
    else:
        if S[i].islower()==False:
            bc+=1

if p1==True and p2==True and bc==0:
    print('AC')

else:
    print('WA')

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

cc=0
nc=0
for i in range(2,len(S)-1):
    if S[i]=='C':
        cc+=1
        nc=i

if cc==1:
    p1=True

if S[0]=='A':
    p2=True

bc=0
for i in range(len(S)):
    if i==0 or i==nc:
        pass
    else:
        if S[i].islower()==False:
            bc+=1

if p1==True and p2==True and bc==0:
    print('AC')

else:
    print('WA')

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

cc=0
for i in range(2,len(S)-2):
    if S[i]=='C':
        cc+=1
        nc=i-1

if cc==1:
    p1=True

if S[0]=='A':
    p2=True

bc=0
for i in range(len(S)):
    if i==0 or i==nc:
        pass
    else:
        if S[i].islower()==False:
            bc+=1

if p1==True and p2==True and bc==0:
    print('AC')

else:
    print('WA')

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

cc=0
for i in range(2,len(S)-1):
    if S[i]=='C' and S[i].islower()==False:
        cc+=1
        nc=i

if cc==1:
    p1=True

if S[0]=='A' and S[0].islower()==False:
    p2=True

bc=0
for i in range(len(S)):
    if i==0 or i==nc:
        pass
    else:
        if S[i].islower()==False:
            bc+=1

if p1==True and p2==True and bc==0:
    print('AC')

else:
    print('WA')

Buggy submission (verdict: Runtime Error):
S=input()
if S[0]=='A' and S[0].islower():
    p1=True

countc=0
for i in range(2,len(S)-2):
    if S[i]=='C' and S[i].islower():
        countc+=1
        nc=i
        
if countc==1:
    p2=True

if p1==True and p2==True:
    b=0
    for i in range(len(S)):
        if i==0 or i==nc:
            pass
        else:
            if S[i].islower()==False:
                b+=1

if p1==True and p2==True and b==0:
    print('AC')        
else:
    print('WA')

Buggy submission (verdict: Runtime Error):
S=input()
if S[0]=='A' and S[0].islower():
    p1=True

countc=0
for i in range(2,len(S)-1):
    if S[i]=='C' and S[i].islower():
        countc+=1
        nc=i
        
if countc==1:
    p2=True

if p1==True and p2==True:
    b=0
    for i in range(len(S)):
        if i==0 or i==nc:
            pass
        else:
            if S[i].islower()==False:
                b+=1

if b==0:
    print('AC')        
else:
    print('WA')
Problem p03337 (python)

Fixed submission:
a, b = map(int, input().split())
print(max([a+b, a-b, a*b]))

Buggy submission (verdict: Runtime Error):
n = int(input())
s = input()
result = []

for i in range(n):
    count = 0
    for j in range(n):
        if (i < j) and (s[j] == "E"):
            count += 1
        elif (i > j) and (s[j] == "W"):
            count += 1
    result.append(count)

pprint(min(result))
Problem p03339 (python)

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

tmp = 0
for i in range(1, n):
    if s[i] == "E":
        tmp += 1
count = tmp

for i in range(1, n):
    if s[i-1] == "W":
        tmp += 1
    if s[i] == "E":
        tmp -= 1
    count = min(count, tmp)
print(count)

Buggy submission (verdict: Runtime Error):
n = int(input())
s = input()
result = []
 
for i in range(n):
    count = 0
    for j in range(n):
        if (i < j) and (s[j] == "E"):
            count += 1
        elif (i > j) and (s[j] == "W"):
            count += 1
    result.append(count)
 
pprint(min(result))
Problem p03543 (python)

Fixed submission:
n = input()

if (n[0] == n[1]) and (n[1] == n[2]):
  print('Yes')
elif (n[1] == n[2]) and (n[2] == n[3]):
  print('Yes')
else:
  print('No')

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

if (n[0] == n[1]) and (n[1] == n[2]):
  print('Yes')
elif (n[1] == n[2]) and (n[2] == n[4]):
  print('Yes')
else:
  print('No')

Buggy submission (verdict: Runtime Error):
n = int(input())
if n[0] == n[1] and n[1] == n[2]:
  print('Yes')
elif n[1] == n[2] and n[2] == n[3]:
  print('Yes')
else:
  print('No')
Problem p03545 (python)

Fixed submission:
n = input()
a = int(n[0])
b = int(n[1])
c = int(n[2])
d = int(n[3])

if a+b+c+d == 7:
    print('{}+{}+{}+{}=7'.format(a, b, c, d))
elif a+b+c-d == 7:
    print('{}+{}+{}-{}=7'.format(a, b, c, d))
elif a+b-c+d == 7:
    print('{}+{}-{}+{}=7'.format(a, b, c, d))
elif a+b-c-d == 7:
    print('{}+{}-{}-{}=7'.format(a, b, c, d))
elif a-b+c+d == 7:
    print('{}-{}+{}+{}=7'.format(a, b, c, d))
elif a-b+c-d == 7:
    print('{}-{}+{}-{}=7'.format(a, b, c, d))
elif a-b-c+d == 7:
    print('{}-{}-{}+{}=7'.format(a, b, c, d))
elif a-b-c-d == 7:
    print('{}-{}-{}-{}=7'.format(a, b, c, d))

Buggy submission (verdict: Runtime Error):
n = input()
a = int(n[0])
b = int(n[1])
c = int(n[2])
d = int(n[3])

if a+b+c+d == 7:
    print('{}+{}+{}+{}=7'.format(a, b, c, d))
elif a+b+c-d == 7:
    print(('{}+{}+{}-{}=7'.format(a, b, c, d))
elif a+b-c+d == 7:
    print('{}+{}-{}+{}=7'.format(a, b, c, d))
elif a+b-c-d == 7:
    print('{}+{}-{}-{}=7'.format(a, b, c, d))
elif a-b+c+d == 7:
    print('{}-{}+{}+{}=7'.format(a, b, c, d))
elif a-b+c-d == 7:
    print('{}-{}+{}-{}=7'.format(a, b, c, d))
elif a-b-c+d == 7:
    print('{}-{}-{}+{}=7'.format(a, b, c, d))
elif a-b-c-d == 7:
    print('{}-{}-{}-{}=7'.format(a, b, c, d))
Problem p03206 (python)

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

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

Fixed submission:
l = input().split()
X = int(l[0])
Y = int(l[1])
x = int(X + Y/2)
print(x)

Buggy submission (verdict: Runtime Error):
l= input().split
X = int(l[0])
Y = int(l[1])
x = X + Y/2
print(x)
Problem p03369 (python)

Fixed submission:
S = input()
ans = 700
for i in S:
  if i == "o":
    ans += 100
  if i == "x":
    ans += 0
print(ans)

Buggy submission (verdict: Runtime Error):
S = input()
ans = 700
for i in range S:
  if i == "o":
    ans += 100
  if i == "x":
    ans += 0
print(ans)

Buggy submission (verdict: Runtime Error):
S = input()
for i in S:
  if i == "o":
    ans += 100
  if i == "x":
    ans += 0
print(ans)

Buggy submission (verdict: Runtime Error):
S = input()
for i in range S:
  if i == "o":
    ans += 100
  if i == "x":
    ans += 0
print(ans)

Buggy submission (verdict: Runtime Error):
S = input()
for i in range S:
  if i == "o":
    ans += 100
  else:
    ans += 0
print(ans)
Problem p03399 (python)

Fixed submission:
A = int(input())
B = int(input())
C = int(input())
D = int(input())
ans = min(A,B) + min(C,D)
print(ans)

Buggy submission (verdict: Runtime Error):
A,B,C,D = map(int,input().split())
ans = min(A,B) + min(C, D)
print(ans)
Problem p03407 (python)

Fixed submission:
A,B,C = map(int,input().split())
if A + B >= C:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
A,B,C = map(int,input().split())
if A + 2B <= C:
  print("Yes")
else:
  print("No")
Problem p03433 (python)

Fixed submission:
N = int(input())
A = int(input())
if (N % 500) <= A:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
N = input()
A = input()
if (N % 500) <= A:
  print("Yes")
else:
  print("No")
Problem p03485 (python)

Fixed submission:
a,b = map(int,input().split())
average = int((a + b) / 2)
if (a + b) % 2 == 0:
  print(average)
else:
  print(average + 1)

Buggy submission (verdict: Runtime Error):
a,b = int(input())
average = (a + b) / 2
if (a + b) % 2 == 0:
  print(ans)
else:
  print(ans + 1)
Problem p03547 (python)

Fixed submission:
X,Y = input().split()
if X > Y :
  print(">")
elif X < Y:
  print("<")
else:
  print("=")

Buggy submission (verdict: Runtime Error):
X,Y = input.split()
if X > Y :
  print(">")
elif X < Y:
  print("<")
else:
  print("=")

Buggy submission (verdict: Runtime Error):
X,Y = input()
A = 11
B = 12
C = 13
D = 14
E = 15
F = 16
if X > Y:
  print >
elif X = Y:
  print =
else:
  print <
Problem p03563 (python)

Fixed submission:
R = int(input())
G = int(input())
ans = 2 * G - R
print(ans)

Buggy submission (verdict: Runtime Error):
R = int.input()
G = int.input()
ans = 2 * G - R
print(ans)
Problem p03609 (python)

Fixed submission:
X,t = map(int,input().split())
snd = X - t
if X > t:
  print(snd)
else:
  print(0)

Buggy submission (verdict: Runtime Error):
X,t = map(int,input.split())
snd = X - t
if X > t:
  print(snd)
else:
  print(0)
Problem p03635 (python)

Fixed submission:
n,m = map(int,input().split())
ans = (n - 1) * (m - 1)
print(ans)

Buggy submission (verdict: Runtime Error):
n,m = int(input())
ans = (n - 1) * (m - 1)
print(ans)
Problem p03657 (python)

Fixed submission:
A,B = map(int,input().split())
if A % 3 == 0 or B % 3 == 0 or (A + B) % 3 == 0:
  print("Possible")
else:
  print("Impossible")

Buggy submission (verdict: Runtime Error):
A,B = map(int,input().split())
if A % 3 == 0 or B % 3 == 0or A + B % 3 == 0:
  print("Possible")
else:
  print("Impossible")
Problem p03671 (python)

Fixed submission:
a = list(map(int,input().split()))
a.sort()
print(a[0] + a[1])

Buggy submission (verdict: Runtime Error):
a = list(map(int,input()split())
a.sort()
print(a[0] + a[1])
Problem p03671 (python)

Fixed submission:
lines = list(input().split())
a = int(lines[0])
b = int(lines[1])
c = int(lines[2])
sum_list = [a+b, a+c, b+c]
print(min(sum_list))

Buggy submission (verdict: Runtime Error):
lines = list(str.split())
a = int(lines[0])
b = int(lines[1])
c = int(lines[2])
sum_list = [a+b, a+c, b+c]
print(min(sum_list))
Problem p03555 (python)

Fixed submission:
A = list(input())
B = list(input())

if (A[0] == B[2] and A[1] == B[1] and A[2] == B[0]):
    print('YES')
else:
    print('NO')

Buggy submission (verdict: Runtime Error):
import bisect

N = int(input())
A = list(map(int, input(). split()))
B = list(map(int, input(). split()))
C = list(map(int, input(). split()))

ans = 0

for b in B:
   ans += (bisect.bisect_left(A,b)) *(N - bisect.bisect_right(C,b))

print(ans)
Problem p03280 (python)

Fixed submission:
i = input()
A = i.split(" ")[0]
B = i.split(" ")[1]
print((int(A)-1)*(int(B)-1))

Buggy submission (verdict: Runtime Error):
n = int(input())
if n < 105:
    print(0)
else:
    print(1)

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

Fixed submission:
N, T = map(int, input().split())
l = []
for i in range(N):
    c, t = map(int, input().split())
    if T >= t:
        l.append(c)
if len(l) == 0:
    print('TLE')
else:
    print(min(l))

Buggy submission (verdict: Runtime Error):
N, T = map(int, input().split())
l = []
for i in range(N):
    c, t = map(int, input().split())
    if T >= t:
        l.append(c)
print(min(l))
Problem p03555 (python)

Fixed submission:
c1 = input()
c2 = input()

if c1 == c2[::-1]:
    print('YES')
else:
    print('NO')

Buggy submission (verdict: Runtime Error):
C11,C12,C13 = map(str,input().split())
C21,C22,C23 = map(str,input().split())

if C11 == C23 and C12 == C22 and C13 == C21:
    print('YES')
else:
    print('NO')
Problem p03219 (python)

Fixed submission:
X, Y =(int(i) for i in input().split())
print(int(X+Y/2))

Buggy submission (verdict: Runtime Error):
X, Y =(int(i),for i in input().split())
print(X+(Y/2))
Problem p03238 (python)

Fixed submission:
N = int(input())
if N == 1:
	print("Hello World")
else:
	A = int(input())
	B = int(input())
	print(A + B)

Buggy submission (verdict: Runtime Error):
N = int(input())
if N == 1:
	print("Hello World")
else:
	A = int(input())
	B = int(input())
	print(A + B)
N = int(input())
if N == 1:
	print("Hello World")
else:
	A = int(input())
	B = int(input())
	print(A + B)
Problem p03206 (python)

Fixed submission:
#! /usr/bin/env python3
# -*- coding: utf-8 -*-


d = input()

if d == "22":
    print("Christmas Eve Eve Eve")
elif d == "23":
    print("Christmas Eve Eve")
elif d == "24":
    print("Christmas Eve")
elif d == "25":
    print("Christmas")

Buggy submission (verdict: Runtime Error):
#! /usr/bin/env python3
# -*- coding: utf-8 -*-


nnk = input().split(" ")
n = int(nnk[0])
k = int(nnk[1])

hs = [int(input()) for l in range(n)]
hs.sort()

hmmm = []
for l in range(n-k+1):
    hmmm.append(hs[k+l-1] - hs[l])

hmmm.sort()
print(hmmm[0])

Buggy submission (verdict: Runtime Error):
nnk = list(map(lambda x: int(x), input().split(" ")))
n = nnk[0]
k = nnk[1]

hs = [int(input()) for l in range(n)]
hs.sort()

hmmm = []
for l in range(n-k+1):
    hmmm.append(hs[k+l-1] - hs[l])

hmmm.sort()
print(hmmm[0])

Buggy submission (verdict: Runtime Error):
#! /usr/bin/env python3
# -*- coding: utf-8 -*-


nnk = list(map(lambda x: int(x), input().split(" ")))
n = nnk[0]
k = nnk[1]

hs = [int(input()) for l in range(n)]
hs.sort()

num = n - k + 1

hmmm = []
for l in range(num):
    hmmm.append(hs[k+l-1] - hs[l])

hmmm.sort()
print(hmmm[0])
Problem p03738 (python)

Fixed submission:
A = int(input())
B = int(input())
if A > B:
    print('GREATER')
elif A < B:
    print('LESS')
else:
    print('EQUAL')

Buggy submission (verdict: Runtime Error):
A = int(input())
B = int(input())
if len(A) > len(B):
    print('GREATER')
elif len(A) < len(B):
    print('LESS')
elif A == B:
    print('EQUAL')
else:
    a = [int(i) for i in str(A)]
    b = [int(j) for j in str(B)]
    for i in range(len(A)):
        if A[i] > B[i]:
            print('GREATER')
            break
        elif A[i] < B[i]:
            print('LESS')
            break
Problem p03485 (python)

Fixed submission:
# coding: utf-8
import math

a,b = map(int,raw_input().split())
print -(-(a+b)//2)

Buggy submission (verdict: Runtime Error):
# coding: utf-8
s = raw_input().split()[0]
t = raw_input().split()[0]

s1 = list(s)
t1 = list(t)

s1.sort
t1.sort(reverse=True)

if s1<t1:
  print 'Yes'
else:
  print 'No'
Problem p03493 (python)

Fixed submission:
# -*- coding: utf-8 -*-
s = map(int, list(raw_input())) #入力した時にリストでSを配列
print sum(s) #s[0]~s[N]までの合計を出す

Buggy submission (verdict: Runtime Error):
s = map(int, list(raw_input())) #入力した時にリストでSを配列
print sum(s) #s[0]~s[N]までの合計を出す
Problem p03814 (python)

Fixed submission:
s =map(str,(raw_input()))
a = 0
z = 0
for i in range(len(s)):
  if s[i]=='A':
    a = i
    break
for i in range(len(s)):
  if s[-i-1]=='Z':
    z=len(s)-i-1
    break
print z-a+1

Buggy submission (verdict: Runtime Error):
s =map(str,(raw_input()))
flg = 0
for i in range(len(s)):
  if flg==0 and s[i]=='A':
    flg += 1
  elif flg!=0 and s[i]=='Z':
    flg+=1
    if s[i+1] == 'Z':
      flg+=1
    break
  elif flg!=0:
    flg+=1
print flg
Problem p03238 (python)

Fixed submission:

n = int(input())
if n ==1:
    print("Hello World")
else:
    a = int(input())
    b = int(input())
    print(a+b)

Buggy submission (verdict: Runtime Error):

n = int(input())
if n ==1:
    print("Hello World")
elif n==2:
    a, b = map(int, input().split())
    print(a+b)

Buggy submission (verdict: Runtime Error):
n = int(input())
if n ==1:
    print("Hello World")
else:
    a, b = map(int, input().split())
    print(a+b)

Buggy submission (verdict: Runtime Error):
n = int(input())
if n ==1:
    print("Hello World")
else:
    a, b = map(int, input().split())
    print(a+b)

Buggy submission (verdict: Runtime Error):
n = in(input())
if n ==1:
    print("Hello World")
else:
    a, b = map(int, input().split())
    print(a+b)
Problem p03239 (python)

Fixed submission:
n, t = map(int, input().split())
costs=[]
time = []
for i in range(n):
    new_cost, new_time = map(int, input().split())
    if new_time<=t:
        costs.append(new_cost)
        time.append(new_time)
    else:
        continue
if costs ==[]:
    print('TLE')
else:
    print(min(costs))

Buggy submission (verdict: Runtime Error):
n, t = map(int, input().split())
costs=[]
time = []
for i in range(n):
    new_cost, new_time = map(int, input().split())
    if new_time<t:
        costs.append(new_cost)
        time.append(new_time)
    else:
        continue
print(min(costs))
Problem p03695 (python)

Fixed submission:
n = input()
a = map(int, raw_input().split())
color = [0 for _ in range(9)]
for item in a:
    i = item / 400
    i = min(i, 8)
    color[i] += 1

ans = 0
for num in color[0:8]:
    if num != 0:
        ans += 1

min_ans = max(ans, 1)
max_ans = ans + color[8]
#max_ans = min(max_ans, 8)

print min_ans, max_ans

Buggy submission (verdict: Runtime Error):
n = input()
a = map(int, raw_input().split())
color = [0 for _ in range(9)]
for item in a:
    i = item / 400
    i = max(i, 8)
    color[i] += 1

ans = 0
for num in color[0:8]:
    if num != 0:
        ans += 1

min_ans = max(ans, 1)
max_ans = ans + color[8]
max_ans = min(max_ans, 9)

print min_ans, max_ans

Buggy submission (verdict: Runtime Error):
n = input()
a = map(int, raw_input().split())
color = [0 for _ in range(9)]
for item in a:
    i = item / 400
    color[i] += 1

ans = 0
for num in color[0:8]:
    if num != 0:
        ans += 1

min_ans = ans
max_ans = ans + color[8]
max_ans = max(min(max_ans, 9), 1)

print min_ans, max_ans
Problem p03813 (python)

Fixed submission:
n = input()
if n >= 1200:
    print "ARC"
else:
    print "ABC"

Buggy submission (verdict: Runtime Error):
n = input()
if n > = 1200:
    print "ARC"
else:
    print "ABC"
Problem p03844 (python)

Fixed submission:
a, b, c = map(str, raw_input().split())
a = int(a)
c = int(c)
if b == "+":
    print a + c
else:
    print a - c

Buggy submission (verdict: Runtime Error):
a, b, c = map(str, raw_input().split(","))
a = int(a)
c = int(c)
if b == "+":
    print a + c
else:
    print a - c
Problem p03210 (python)

Fixed submission:
x = int(input())
if x==3 or x==5 or x==7:print("YES")
else:print("NO")

Buggy submission (verdict: Runtime Error):
X = int(input())
if X==3 or X==5 or X==6:print("YES")
  else:print("NO")
Problem p03240 (python)

Fixed submission:
i = lambda: list(map(int, input().split()))
N, = i()
M = [i() for j in range(N)]
k = -1
for k in range(len(M)):
    if M[k][2] > 0:
        break
for Cx in range(101):
    for Cy in range(101):
        H = abs(M[k][0] - Cx) + abs(M[k][1] - Cy) + M[k][2]
        if all([False for d in M if d[2] != max(H - abs(d[0] - Cx) - abs(d[1] - Cy), 0)]):
            print(Cx, Cy, H)
            break

Buggy submission (verdict: Runtime Error):
i = lambda: list(map(int, input().split()))
N, = i()
M = [i() for j in range(N)]
H = 0
for k in range(101):
    if M[i][2] != 0:
        H = abs(M[0][0] - Cx) + abs(M[0][1] - Cy) + M[0][2]
        break
for Cx in range(101):
    for Cy in range(101):
        if all([False for d in M if H != abs(d[0] - Cx) + abs(d[1] - Cy) + d[2]]):
            print(Cx, Cy, H)