Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
V = (a+b)/2
if (a+b)%2==0:
    print(int(V)
else:
    v =int((a + b)/2 + (1 - ((a + b)/2 - int((a + b)/2))))
    print(v)


Fixed submission:
a, b = map(int, input().split())
V = (a+b)/2
if (a+b)%2==0:
    print(int(V))
else:
    v =int((a + b)/2 + (1 - ((a + b)/2 - int((a + b)/2))))
    print(v)
Buggy python submission (verdict: Runtime Error):
N = input()
S = len(N)
f = 0
if int(N)==0:
    print("No")
else:
    for i in range(S) :
        f = f + int(N[i])

if int(N)%f==0:
    print("Yes")
else:
    print("No")


Fixed submission:
N, A, B = map(int, input().split())

NA = N * A
if NA > B:
    print(B)
else:
    print(NA)

Buggy python submission (verdict: Runtime Error):
N = input()
S = len(N)
sen = int(N) / 1000
hyaku =( int(N) - sen*1000 ) / 100
zyuu = (int(N) - sen*1000- hyaku*100) / 10
iti = int(N) - sen*1000- hyaku*100- zyuu*10

f = sen + hyaku + zyuu + iti

if int(N)%f==0:
    print("Yes")
else:
    print("No")


Fixed submission:
N, A, B = map(int, input().split())

NA = N * A
if NA > B:
    print(B)
else:
    print(NA)
Buggy python submission (verdict: Runtime Error):
X = int(input())
t = int(input())

if X-t>0:
    print(X-t)
else:
    print(0)


Fixed submission:
X ,t=map(int,input().split())

if X-t>0:
    print(X-t)
else:
    print(0)

Buggy python submission (verdict: Runtime Error):
X = int(input())
t = int(input())

print(max(X - t, 0))


Fixed submission:
X ,t=map(int,input().split())

if X-t>0:
    print(X-t)
else:
    print(0)
Buggy python submission (verdict: Runtime Error):

length = raw_input()
nums = raw_input().split(" ")

numdict = {}
for i, num in enumerate(nums):
	if num not in dic:
		dic[num] = 1
	else:
		dic[num]++

ret = 0
for k,v in numdict.iteritems():
	if k > v:
		 += k - v 
	else:
		ret += v - k

print(ret)

Fixed submission:
length = input()
nums = input().split(" ")

numdict = {}
for i, num in enumerate(nums):
	if num not in numdict:
		numdict[str(num)] = 1
	else:
		numdict[str(num)] += 1

ret = 0
for k,v in numdict.items():
	if int(k) > int(v):
		ret += int(v) 
	else:
		ret += int(v) - int(k)

print(ret)
Buggy python submission (verdict: Runtime Error):
inputArr = input().split(" ")
X =  inputArr[0]
t =  inputArr[1]
remain_sand = int(X - t)
if remain_sand > 0 :
  print(remain_sand)
else :
  print(0)

Fixed submission:
inputArr = input().split(" ")
X =  inputArr[0]
t =  inputArr[1]
remain_sand = int(X) - int(t)
if remain_sand > 0 :
  print(remain_sand)
else :
  print(0)
Buggy python submission (verdict: Time Limit Exceeded):
def main():
    N = int(input())
    A = list(map(int, input().split(" ")))
    B = list(map(int, input().split(" ")))
    C = list(map(int, input().split(" ")))

    A.sort()
    B.sort()
    C.sort()

    cnt = 0
    for a in A:
        for b in B:
            if a >= b:
                continue
            for c in C:
                if b >= c:
                    continue
                cnt += 1
    print(cnt) 

if __name__ == '__main__':
    main()

Fixed submission:
#!/usr/bin/env python

import bisect

def main():
    N = int(input())
    A = list(map(int, input().split(" ")))
    B = list(map(int, input().split(" ")))
    C = list(map(int, input().split(" ")))

    A.sort()
    B.sort()
    C.sort()

    cnt = 0
    for b in B:
        a_index = bisect.bisect_left(A, b)
        c_index = bisect.bisect_right(C, b)
        cnt += a_index * (N - c_index)
    print(cnt)

if __name__ == '__main__':
    main()
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = []
ans = 0
for i in range(n):
    a.append(int(input()))
set_a = set(a)
for i in set_a:
    ans += a.count(i) % 2
print(ans)

Fixed submission:
a = list(input())
if "9" in a:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = []
ans = 0
for i in range(n):
    a.append(int(input()))
set_a = set(a)
for i in set_a:
    ans += a.count(i) % 2
print(ans)

Fixed submission:
n = int(input())
evole = set()
ans = 0
for i in range(n):
    var = int(input())
    if var in evole:
        evole.remove(var)
        ans -= 1
    else:
        evole.add(var)
        ans += 1
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = []
ans = 0
for i in range(n):
    a.append(int(input()))
set_a = set(a)
for i in set_a:
    ans += a.count(i) % 2
print(ans)

Fixed submission:
n = int(input())
evole = set()
ans = 0
for i in range(n):
    var = int(input())
    if var in evole:
        evole.remove(var)
        ans -= 1
    else:
        evole.add(var)
        ans += 1
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = []
for i in range(n):
    num = int(input())
    if num not in a:
        a.append(num)
    else:
        a.remove(num)
print(len(a))

Fixed submission:
n = int(input())
evole = set()
ans = 0
for i in range(n):
    var = int(input())
    if var in evole:
        evole.remove(var)
        ans -= 1
    else:
        evole.add(var)
        ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
import string
s = list(input())
a = list(string.ascii_lowercase)
l = []
s.sort()
if s == a:
    print("None")
else:
    for index, i in enumerate(a):
        if i not in s:
            l.append(i)
    print(min(l))

Fixed submission:
import string
s = list(input())
a = list(string.ascii_lowercase)
l = []
for index, i in enumerate(a):
    if i not in s:
        print(i)
        break
else:
    print(None)

Buggy python submission (verdict: Runtime Error):
import string
s = list(input())
a = list(string.ascii_lowercase)
l = []
s.sort()
if s == a:
    print("None")
else:
    for index, i in enumerate(a):
        if i not in s:
            l.append(i)
    print(min(l))

Fixed submission:
import string
s = list(input())
a = list(string.ascii_lowercase)
l = []
for index, i in enumerate(a):
    if i not in s:
        print(i)
        break
else:
    print(None)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
l = list(map(int, input().split()))
arr = []
ans = []
ans = []
cnt = []
already = []
for index, i in enumerate(l):
    if l.count(i) >= 2:
        arr.append(i)
if len(arr) == 0:
    print(0)
else:
    for i in arr:
        if i not in already:
            already.append(i)
            cnt.append(arr.count(i))
    for i in range(len(already)):
        for j in range(i, len(already)):
            if i == j and cnt[i] >= 4:
                ans.append(already[i] ** 2)
            elif i != j:
                ans.append(already[i] * already[j])
    print(max(ans))

Fixed submission:
n = int(input())
a = list(map(int , input().split()))
ans = []
a.sort()
a.reverse()
f = 0
cnt = 1
when = 0
for i in a:
    if i == f:
        cnt += 1
        if cnt >= 2:
            ans.append(i)
            cnt = 0
            when += 1
    else:
        f = i
        cnt = 1
    if when == 2:
        break
if len(ans) != 0:
    print(ans[0] * ans[1])
else:
    print(0)
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input())
print("Possible" if (a+b)%3==0 or a%3==0 or b%3==0 else "Impossible")

Fixed submission:
a, b = map(int, input().split())
print("Possible" if (a+b)%3==0 or a%3==0 or b%3==0 else "Impossible")
Buggy python submission (verdict: Time Limit Exceeded):
N, T = map(int, input().split(' '))
A = list(map(int, input().split(' ')))

submax = 0
total = 0
for i in range(N):
    for j in range(i+1,N):
        sub = A[j]-A[i]
        if sub == submax:
            total += 1
        if sub > submax:
            total = 1
            submax = sub

print(total)


Fixed submission:
N, T = map(int, input().split(' '))
A = list(map(int, input().split(' ')))

submax = 0
amin=A[0]
total = 0
for i in range(N):
    if A[i] < amin:
        amin = A[i]
    sub = A[i]-amin
    if sub == submax:
        total += 1
    if sub > submax:
        total = 1
        submax = sub

print(total)
Buggy python submission (verdict: Runtime Error):
b = list(map(int, input().split()))
a = str(b)
ans = 0
if (a[1] == '1'):
    ans = ans+1
if (a[2] == '1'):
    ans = ans+1
if (a[3] == '1'):
    ans = ans+1
print(ans)

Fixed submission:
a= input()
ans = 0
if (a[0] == '1'):
    ans = ans+1
if (a[1] == '1'):
    ans = ans+1
if (a[2] == '1'):
    ans = ans+1
print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
a = []
a.append(list(map(int, input().split())))

ans=0
while True:
    for i in range(N):
        if(a[i]%2 == 1):
            break:
    ans = ans+1

    for i in range(N):
        a[i] = a[i]/2

print(ans)
        

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

ans=0
flag=0
while True:
    for i in range(N):
        if(a[i]%2 == 1):
            flag=1
    if flag == 1:
        break
    ans = ans+1

    for i in range(N):
        a[i] = a[i]/2

print(ans)
Buggy python submission (verdict: Runtime Error):
a = list(input())
count = 0
for i in a:
  if a[i] == 1: count += 1
print(count)

Fixed submission:
a = list(input())
count = 0
for i in a:
    if i == "1": count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
x=int(input())
y=int(input())
Print(x*x-y)

Fixed submission:
x=int(input())
y=int(input())
print(x**2-y)
Buggy python submission (verdict: Runtime Error):
s1, s2, s3 = map(int,input().split())
list = [s1,s2,s3]
a = list.count(1)
print(a)


Fixed submission:
print(input().count("1"))

Buggy python submission (verdict: Runtime Error):
s1, s2, s3 = map(int,input().split())
list = [s1,s2,s3]
a = list.count(1)
print(a)

Fixed submission:
print(input().count("1"))

Buggy python submission (verdict: Runtime Error):
s1 s2 s3 = map(int,input().split())
list = [s1,s2,s3]
print(list.count[1])

Fixed submission:
print(input().count("1"))

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

Fixed submission:
# 番号入力
s = int(input())
# 百の位
a = s//100
# 十の位
b = (s%100)//10
# 一の位
c = s%10
# 1の数を出力
n = a + b + c
print(n)

Buggy python submission (verdict: Runtime Error):
s1, s2, s3 = map(int, input().split())
count = 0
if s1 == 1:
  count++
if s2 == 1:
  count++
if s3 == 1:
  count++
print(count)

Fixed submission:
s = input()
count = 0


if s[0] == '1':
  count += 1
  
if s[1] == '1':
  count += 1
  
if s[2] == '1':
  count += 1
  
print(count)

Buggy python submission (verdict: Runtime Error):
s1, s2, s3 = input().split()
count = 0
if s1 == 1:
  count++
if s2 == 1:
  count++
if s3 == 1:
  count++
print(count)


Fixed submission:
s = input()
count = 0


if s[0] == '1':
  count += 1
  
if s[1] == '1':
  count += 1
  
if s[2] == '1':
  count += 1
  
print(count)

Buggy python submission (verdict: Runtime Error):
S=input()
print(s.count('1'))

Fixed submission:
s=input()
print(s.count('1'))
Buggy python submission (verdict: Runtime Error):
N, A = int(input().split())
B = N * N - A
print(B)

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

Buggy python submission (verdict: Runtime Error):
N, A = map(int, input().split())
B = N * N - A
print(B)

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

Buggy python submission (verdict: Runtime Error):
N,A = map(int, input().split())
B = N * N - A
print(B)

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

Buggy python submission (verdict: Runtime Error):
N,A = int(input().split())
B = N * N - A
print(B)

Fixed submission:
# N,A = map(int, input().split())
N = int(input())
A = int(input())
B = N * N - A
print(B)
Buggy python submission (verdict: Runtime Error):
A,B = map(int, input().split())
print('Possible' if 0 in (A % 3 or B % 3 or (A + B) % 3) else 'Impossible')

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

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

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

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

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

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

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

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

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

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

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

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

Fixed submission:
A,B = map(int, input().split())
print('Possible' if (A % 3 == 0) or (B % 3 == 0) or ((A + B) % 3 == 0) else 'Impossible')
Buggy python submission (verdict: Runtime Error):
# a, b = map(int, input().split())
a = input()
b = input()

if b is 'H':
  print('H') if a is 'H' else print('D')
else:
  print('D') if a is 'H' else print('H')

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

Buggy python submission (verdict: Runtime Error):
# a, b = map(int, input().split())
a = input()
b = input()

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

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

Buggy python submission (verdict: Runtime Error):
# a, b = map(int, input().split())
a = int(input())
b = int(input())

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

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

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

Fixed submission:
a, b = input().split()
print('H') if a == b else print('D')
Buggy python submission (verdict: Runtime Error):
N = input()
x = N * 800
y = N / 15 * 200
print(x - y)

Fixed submission:
N = int(input())
print(N * 800 - N //15 * 200)

Buggy python submission (verdict: Runtime Error):
x = 800 * N
y = N / 15 * 200
price = x - y
print(price)

Fixed submission:
N = int(input())
print(N * 800 - N //15 * 200)
Buggy python submission (verdict: Runtime Error):
# A,B,C,D = int(input()) for i in range(4)
A = int(input())
B = int(input())
C = int(input())
D = int(input())
AB = A * B
CD = C * D

if AB > CD:
  print(AB)
elif CD > AB:
  print(CD)
else:
  print(AB)


Fixed submission:
A,B,C,D = map(int, input().split())
print(max(A*B,C*D))

Buggy python submission (verdict: Runtime Error):
# A,B,C,D = int(input()) for i in range(4)
A = int(input())
B = int(input())
C = int(input())
D = int(input())
AB = A * B
CD = C * D

if AB == CD:
  print(AB)
else:
  print(AB) if AB > CD else print(CD)


Fixed submission:
A,B,C,D = map(int, input().split())
print(max(A*B,C*D))

Buggy python submission (verdict: Runtime Error):
A,B,C,D = int(input()) for i in range(4)
AB = A * B
CD = C * D

if AB == CD:
  print(AB)
else:
  print(AB) if AB > CD else print(CD)

Fixed submission:
A,B,C,D = map(int, input().split())
print(max(A*B,C*D))
Buggy python submission (verdict: Runtime Error):
print(list(set(int(input().split()))))

Fixed submission:
print(len(set(input().split())))

Buggy python submission (verdict: Runtime Error):
colors = []

for i in range(3):
  colors.append(int(input()))
unique_colors = list(set(colors))
print(len(unique_colors))

Fixed submission:
print(len(set(input().split())))
Buggy python submission (verdict: Runtime Error):
N,K,X,Y=map(int, input().split())

result = 0
if N > K:
  result = K * X + (N - K) * Y
else:
  result = N * X

print(result)


Fixed submission:
N = int(input())
K = int(input())
X = int(input())
Y = int(input())
if(N<=K):
  print(X*N)
else:
  print(X*K+(N-K)*Y)

Buggy python submission (verdict: Runtime Error):
N,K,X,Y = map(int,input().split())

result = 0
if N > K:
  result = K * X + (N - K) * Y
else:
  result = N * X

print(result)


Fixed submission:
N = int(input())
K = int(input())
X = int(input())
Y = int(input())
if(N<=K):
  print(X*N)
else:
  print(X*K+(N-K)*Y)

Buggy python submission (verdict: Runtime Error):
N,K,X,Y = map(int, input().split())

result = 0
if N > K:
  result = K * X + (N - K) * Y
else:
  result = N * X

print(result)


Fixed submission:
N = int(input())
K = int(input())
X = int(input())
Y = int(input())
if(N<=K):
  print(X*N)
else:
  print(X*K+(N-K)*Y)

Buggy python submission (verdict: Runtime Error):
N,K,X,Y = map(int, input().split())

result = 0
if N > K:
  result = K * X + (N - K) * Y
else:
  result = N * X

print(result)

Fixed submission:
N = int(input())
K = int(input())
X = int(input())
Y = int(input())
if(N<=K):
  print(X*N)
else:
  print(X*K+(N-K)*Y)

Buggy python submission (verdict: Runtime Error):
N,K,X,Y = map(int, input().split())
if(N<=K):
  print(X*N)
else:
  print(X*K+(N-K)*Y)


Fixed submission:
N = int(input())
K = int(input())
X = int(input())
Y = int(input())
if(N<=K):
  print(X*N)
else:
  print(X*K+(N-K)*Y)

Buggy python submission (verdict: Runtime Error):
n,k,x,y = map(int, input().split)
print((k * x) + ((n - k) * y))

Fixed submission:
N = int(input())
K = int(input())
X = int(input())
Y = int(input())
if(N<=K):
  print(X*N)
else:
  print(X*K+(N-K)*Y)
Buggy python submission (verdict: Runtime Error):
N = int(input())
result = 0
for i in (N+1):
  result += i
print(result)

Fixed submission:
N = int(input())
cnt = 0
for i in range(N+1):
    cnt += i
print(cnt)

Buggy python submission (verdict: Runtime Error):
n = int(input())
for i in range(n+1):
  num += i
print(num)

Fixed submission:
N = int(input())
cnt = 0
for i in range(N+1):
    cnt += i
print(cnt)

Buggy python submission (verdict: Runtime Error):
n = int(input())
for n in range(n+1):
  num += n
print(num)


Fixed submission:
N = int(input())
cnt = 0
for i in range(N+1):
    cnt += i
print(cnt)
Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-

a, b, c = map(int, raw_input().split())

print str(a+b+c) 

Fixed submission:
print(input().count("1"))
Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
# 整数の入力
s, c = map(int, raw_input().split())
ans = 0
if c > s*2:
    ans += s
    c -= s*2
    ans += (c/4)
else:
    while(0 < s and 1 < c):
        s -= 1
        c -= 2
        ans += 1
    if 0 < c:
        ans += c/4
print ans

Fixed submission:
# -*- coding: utf-8 -*-
# 整数の入力
s, c = map(int, raw_input().split())
ans = 0
a = min(s,c/2)
s -= a
c -= a*2
ans = a + (c/4) 
print ans
Buggy python submission (verdict: Runtime Error):
n = input()
houses = map(lambda x: int(x), raw_input().split())
houses = sorted(list(set(houses)))
print houses[-1] - houses[0]

Fixed submission:
r,g,b=tuple(map(lambda x: int(x), raw_input().split()))
ans = "YES" if (100*r+10*g+b) % 4 == 0 else "NO"
print ans
Buggy python submission (verdict: Runtime Error):
n = input()
houses = raw_input().split()
houses = sorted(list(set(houses)))

print houses[-1] - houses[0]

Fixed submission:
n = input()
houses = map(lambda x: int(x), raw_input().split())
houses = sorted(list(set(houses)))
print houses[-1] - houses[0]
Buggy python submission (verdict: Runtime Error):
n = input()
fx = 0
for i in range(len(n)):
  fx += n[i]
if int(n)%fx == 0:
  print('Yes')
else:
  print('No')

Fixed submission:
n = input()
fx = 0
for i in range(len(n)):
  fx += int(n[i])
if int(n)%fx == 0:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
s = input()
count = 0
for x in s:
    if x == "1" 
        count += 1
print(count)

Fixed submission:
s = input()
count = 0
for i in range(6):
    if s[i] == "1":
        count += 1
print(count)
Buggy python submission (verdict: Time Limit Exceeded):
abc = input().split()
a = int(abc[0])
b = int(abc[1])
c = int(abc[2])
d = int(abc[3])
e = int(abc[4])
f = int(abc[5])

x = []
y = []
pair = []
con = []


for i in range(f):
    for j in range(f):
        canx = ((a*i)+(b*j))*100
        if canx<=f:
            x.append(canx)

if x == []:
    print('x is empty')
            
for i in range(f):
    for j in range(f):
        cany = (c*i)+(d*j)
        if cany<=f:
            y.append(cany)
            
if y == []:
    print('y is empty')
            
for i in x:
    for j in y:
        if i+j<=f:
            if i!=0:
                if 100*j/i<=e:
                    pair.append([i, j])

if pair == []:
    print('pair is empty')

for i in pair:
    if sum(i)!=0:
        con.append(i[1]/sum(i))
    
if con == []:
    print('con is empty')
    
ans = pair[con.index(max(con))]
print(sum(ans), ans[1])

Fixed submission:
abc = input().split()
a = int(abc[0])
b = int(abc[1])
c = int(abc[2])
d = int(abc[3])
e = int(abc[4])
f = int(abc[5])

x = []
y = []
pair = []
con = []


for i in range(int((f/100)+1)):
    for j in range(int((f/100)+1)):
        canx = ((a*i)+(b*j))*100
        if canx<=f:
            x.append(canx)

if x == []:
    print('x is empty')
            
for i in range(f):
    for j in range(f):
        cany = (c*i)+(d*j)
        if cany<=f:
            y.append(cany)
            
if y == []:
    print('y is empty')
            
for i in x:
    for j in y:
        if i+j<=f:
            if i!=0:
                if 100*j/i<=e:
                    pair.append([i, j])

if pair == []:
    print('pair is empty')

for i in pair:
    if sum(i)!=0:
        con.append(i[1]/sum(i))
    
if con == []:
    print('con is empty')
    
ans = pair[con.index(max(con))]
print(sum(ans), ans[1])
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = []
for i in range(N):
    Ai = int(input())
    if Ai in A:
        A.remove(Ai)
    elif not Ai in A:
        A.append(Ai)

print(len(A))

Fixed submission:
N = int(input())
A = []
for i in range(N):
    A.append(int(input()))
sortedA = sorted(A)

count = 1
oddA = []
for i in range(len(sortedA)):
    if i+1==len(sortedA):
        if count%2==1:
            oddA.append(sortedA[i])
        count = 1
    else:
        if sortedA[i]==sortedA[i+1]:
            count += 1
        else:
            if count%2==1:
                oddA.append(sortedA[i])
            count = 1

print(len(oddA))
Buggy python submission (verdict: Runtime Error):
testSNs = raw_input().split()
SCORE=int(0)
for x in range(testSNs[0]):
    if not testSNs[x]%10 is 0:
        SCORE += testSNs[x]
    else:
        continue
print(SCORE)

Fixed submission:
x = list(map(int, input().split()))
if x[0]+x[1]<10:
    print(x[0]+x[1])
else:
    print('error')
Buggy python submission (verdict: Runtime Error):
if input()== 'a':
    print('vowel')
elif input()=='i':
    print('vowel')
elif input()=='u':
    print('vowel')
elif input()=='e':
    print('vowel')
elif input()=='o':
    print('vowel')
else:
    print('consonant')

Fixed submission:
c = {input()}
vowels = {'a', 'i', 'u', 'e', 'o'}
if c < vowels:
    print('vowel')
else:
    print('consonant')

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

Fixed submission:
c = {input()}
vowels = {'a', 'i', 'u', 'e', 'o'}
if c < vowels:
    print('vowel')
else:
    print('consonant')