Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
#ABC042B
n,l=map(int,input().split())

a=[]
for i in range(n)
    a.append(input())
    
a.sort()

print(''.join(mylist))

Fixed submission:
# 入力
N,L=map(int,input().split())

l=[]
for i in range(N):
  l.append(input())

# ソート
l.sort()

# 出力
print(''.join(l))

Buggy python submission (verdict: Runtime Error):
n,l=(int(x) for x in input().split())
sente1=input()
sente2=input()
sente3=input()
mylist=[sente1,sente2,sente3]
mylist.sort()
a=''.join(mylist)
print(a)

Fixed submission:
# 入力
N,L=map(int,input().split())

l=[]
for i in range(N):
  l.append(input())

# ソート
l.sort()

# 出力
print(''.join(l))

Buggy python submission (verdict: Runtime Error):
l,n=(int(x) for x in input().split())
sente1=input()
sente2=input()
sente3=input()
mylist=[sente1,sente2,sente3]
mylist.sort()
print(''.join(mylist))

Fixed submission:
# 入力
N,L=map(int,input().split())

l=[]
for i in range(N):
  l.append(input())

# ソート
l.sort()

# 出力
print(''.join(l))

Buggy python submission (verdict: Runtime Error):
n,l=(int(x) for x in input().split())
sente1=input()
sente2=input()
sente3=input()
mylist=[sente1,sente2,sente3]
mylist.sort()
print(''.join(mylist))

Fixed submission:
# 入力
N,L=map(int,input().split())

l=[]
for i in range(N):
  l.append(input())

# ソート
l.sort()

# 出力
print(''.join(l))

Buggy python submission (verdict: Runtime Error):
l,n=(int(x) for x in input().split())
sente1=input()
sente2=input()
sente3=input()
mylist=[sente1,sente2,sente3]
mylist.sort()
print(''.join(mylist))

Fixed submission:
# 入力
N,L=map(int,input().split())

l=[]
for i in range(N):
  l.append(input())

# ソート
l.sort()

# 出力
print(''.join(l))

Buggy python submission (verdict: Runtime Error):
#ABC042B
l,n=(int(x) for x in input().split())
sente1=input()
sente2=input()
sente3=input()
mylist=[sente1,sente2,sente3]
mylist.sort()
print(''.join(mylist))

Fixed submission:
# 入力
N,L=map(int,input().split())

l=[]
for i in range(N):
  l.append(input())

# ソート
l.sort()

# 出力
print(''.join(l))
Buggy python submission (verdict: Runtime Error):
#ABC042C
N,K=map(int,input().split())
N=str(N)
N_len=len(N)
a=[]
out=N
for i in range(K):
    a.append(input())
for i2 in range(N_len):    
    for i3 in range(K):
        if N[i2]==a[i3]:
            out += 1
print(out)
    
    

Fixed submission:
# ABC042C
N,K=map(int,input().split())
out=N
N=str(N)
a = list(map(int, input().split()))
while 1<2:
    N1=N
    i=0
    for i in range(len(a)):
        if str(a[i]) in N:
            N=int(N) 
            N+=1
            N=str(N)
    if N1==N:
        break

print(N)
Buggy python submission (verdict: Runtime Error):
H=2
W=3
K=2

masme = [
[".",".","#"],
["#","#","#"]
]

H, W, K =  [int(i) for i in input().split()]

masme = []
for i in range(H):
    masme.append(list(input()))

#print(masme)

h_p = []
for h in range(pow(2,H)):
    h_p.append(str(bin(h))[2:].zfill(H))

#print(h_p)

w_p = []
for w in range(pow(2,W)):
    w_p.append(str(bin(w))[2:].zfill(W))

#print(w_p)

def count(mas):
    ans = 0
    for i in mas:
        for j in i:
            if( j == "#"):
                ans += 1
    return ans

def delete_row(mas, i):
    ilist = list(i)
    #print(ilist)
    ans = []
    for n in range(len(ilist)):
        #print(ilist[n])
        if ilist[n] == "0":
            ans.append(mas[n])
            #print(ans)
    return ans

def delete_column(mas, i):
    ilist = list(i)
    ans = []
    for row in mas:
        #print(row)
        tmp_row=[]
        for n in range(len(ilist)):
            if(ilist[n] == "0"):
                tmp_row.append(row[n])
        #print(tmp_row)
        ans.append(tmp_row)
    return ans

newmas = delete_column(masme, "010")

#print(newmas)

ans_cnt = 0
for h in h_p:
    for w in w_p:
        tmp = delete_row(masme, h)
        tmp2= delete_column(tmp, w)
        cnt = count(tmp2)
        if(cnt == K):
            ans_cnt += 1

print(ans_cnt)

Fixed submission:
H, W, K =  [int(i) for i in input().split()]

masme = []
for i in range(H):
    masme.append(list(input()))

#print(masme)

h_p = []
for h in range(pow(2,H)):
    h_p.append(str(bin(h))[2:].zfill(H))

#print(h_p)

w_p = []
for w in range(pow(2,W)):
    w_p.append(str(bin(w))[2:].zfill(W))

#print(w_p)

def count(mas):
    ans = 0
    for i in mas:
        for j in i:
            if( j == "#"):
                ans += 1
    return ans

def delete_row(mas, i):
    ilist = list(i)
    #print(ilist)
    ans = []
    for n in range(H):
        #print(ilist[n])
        if ilist[n] == "0":
            ans.append(mas[n])
            #print(ans)
    return ans

def delete_column(mas, i):
    ilist = list(i)
    ans = []
    for row in mas:
        #print(row)
        tmp_row=[]
        for n in range(W):
            if(ilist[n] == "0"):
                tmp_row.append(row[n])
        #print(tmp_row)
        ans.append(tmp_row)
    return ans


ans_cnt = 0
for h in h_p:
    for w in w_p:
        tmp = delete_row(masme, h)
        tmp2= delete_column(tmp, w)
        cnt = count(tmp2)
        if(cnt == K):
            ans_cnt += 1

print(ans_cnt)
Buggy python submission (verdict: Time Limit Exceeded):
import sys
input = sys.stdin.readline

n = input()
n_list = [int(i) for i in input().split()]
value = 1
for i in n_list:
    value = value * i


if value > 10**18:
    value = -1
print(value)



Fixed submission:
import sys
input = sys.stdin.readline

n = input()
n_list = sorted([int(i) for i in input().split()])
value = 1
for i in n_list:
    value = value * i
    if value > 10 ** 18:
        value = -1
        break
print(value)

Buggy python submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline

n = input()
n_list = [int(i) for i in input().split()]
value = 1
for i in n_list
    value = value * i


if value > 10**18:
    value = -1
print(value)

Fixed submission:
import sys
input = sys.stdin.readline

n = input()
n_list = sorted([int(i) for i in input().split()])
value = 1
for i in n_list:
    value = value * i
    if value > 10 ** 18:
        value = -1
        break
print(value)

Buggy python submission (verdict: Time Limit Exceeded):
from operator import mul
from functools import reduce

import sys
input = sys.stdin.readline

n = input()
n_list = [int(i) for i in input().split()]
n_value = (reduce(mul, n_list))

if n_value > 10**18:
    n_value = -1
print(n_value)

Fixed submission:
import sys
input = sys.stdin.readline

n = input()
n_list = sorted([int(i) for i in input().split()])
value = 1
for i in n_list:
    value = value * i
    if value > 10 ** 18:
        value = -1
        break
print(value)

Buggy python submission (verdict: Time Limit Exceeded):
from operator import mul
from functools import reduce

import sys
input = sys.stdin.readline

n = input()
n_list = list(map(int, input().split()))
n_value = (reduce(mul, n_list))

if n_value > 10**18:
    n_value = -1
print(n_value)

Fixed submission:
import sys
input = sys.stdin.readline

n = input()
n_list = sorted([int(i) for i in input().split()])
value = 1
for i in n_list:
    value = value * i
    if value > 10 ** 18:
        value = -1
        break
print(value)
Buggy python submission (verdict: Runtime Error):
import sys
import math
input = sys.stdin.readline
n1, n2 = map(int, input().split())

print(math.floor(n1*n2))

Fixed submission:
import sys

input = sys.stdin.readline

value_list = input().split()

A = int(value_list[0])
B = float(value_list[1])

print(A * round(B * 100) // 100)
Buggy python submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline

h1, m1, h2, m2, k = input.split()

h_time = (h2 - h1 -1) * 60
m_time = (60 - m1) + m2

rest_time = (h_time + m_time) - k
print(rest_time)

Fixed submission:
import sys
input = sys.stdin.readline

h1, m1, h2, m2, k = map(int, input().split())

h_time = (h2 - h1 -1) * 60
m_time = (60 - m1) + m2

rest_time = (h_time + m_time) - k
print(rest_time)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int, input().split()))


count = 0
for i in range(len(A) - 2):
    if (A[i] > A[i + 1]) and (A[i + 1] > A[i + 2]):
       count += 1
    elif (A[i + 2] > A[i + 1]) and (A[i + 1] > A[i]):
        count += 1
    else: 
        pass
print(count)

Fixed submission:
import collections

s = input()

if list(collections.Counter(list(s)).values()) == [2, 2]:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
import numpy as np


def taste(N, L):
    all_abs = np.array([np.abs(L + i - 1) for i in range(1, N + 1)])
    all_base = np.array([L + i - 1 for i in range(1, N + 1)])

    return all_abs, all_base

N, L = map(int, input().split())

all_abs, all_base = taste(N, L)

N_1_all = all_base[np.min(all_abs) != all_abs]

re = np.sum(N_1_all)
print(re)


Fixed submission:
s = input()

state = "Good"
for i in range(3):
    if s[i] == s[i + 1]:
        state = "Bad"
        print(state)
        break
if  state == "Good":
    print("Good")
Buggy python submission (verdict: Runtime Error):
import numpy as np


def taste(N, L):
    all_abs = np.array([np.abs(L + i - 1) for i in range(1, N + 1)])
    all_base = np.array([L + i - 1 for i in range(1, N + 1)])

    return all_abs, all_base

N, L = map(int, input().input())

all_abs, all_base = taste(N, L)

N_1_all = all_base[np.min(all_abs) != all_abs]

re = np.sum(N_1_all)
print(re)


Fixed submission:
import numpy as np
 
 
def taste(N, L):
    all_abs = np.array([np.abs(L + i - 1) for i in range(1, N + 1)])
    all_base = np.array([L + i - 1 for i in range(1, N + 1)])
 
    return all_abs, all_base
 
N, L = map(int, input().split())
 
all_abs, all_base = taste(N, L)
 
N_1_all = all_base[np.min(all_abs) != all_abs]
 
re = np.sum(N_1_all)
print(re)

Buggy python submission (verdict: Runtime Error):

import numpy as np

N, L = map(int, input().input())


def taste(N, L):
    all = np.array([np.abs(L + i - 1) for i in range(1, N + 1)])
    return all

tastes = taste(N, L)
import numpy as np

N, L = map(int, input().input())


def taste(N, L):
    all = np.array([np.abs(L + i - 1) for i in range(1, N + 1)])
    return all

tastes = taste(N, L)
all = tastes[np.min(tastes) != tastes]

re = np.sum(all)
print(re)
all = tastes[np.min(tastes) != tastes]

re = np.sum(all)
print(re)

Fixed submission:
import numpy as np
 
 
def taste(N, L):
    all_abs = np.array([np.abs(L + i - 1) for i in range(1, N + 1)])
    all_base = np.array([L + i - 1 for i in range(1, N + 1)])
 
    return all_abs, all_base
 
N, L = map(int, input().split())
 
all_abs, all_base = taste(N, L)
 
N_1_all = all_base[np.min(all_abs) != all_abs]
 
re = np.sum(N_1_all)
print(re)
Buggy python submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline

a, b = input().split()
print("Odd" if (a*b) % 2 == 0 else "Even")

Fixed submission:
import sys
input = sys.stdin.readline

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

Buggy python submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline

a, b = input().split()
"Odd" if (a*b) % 2 == 0 else "Even"

Fixed submission:
import sys
input = sys.stdin.readline

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

list = [map(int, input().split())]
print(sum(list))

Fixed submission:
import sys
input = sys.stdin.readline

print(input().count("1"))
Buggy python submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline

N = input()
B = map(int, input().split())

answer = None
for i in B:
    answer = min(answer, len(bin(i)) - bin(i).rfind("1") - 1)
print(answer)


Fixed submission:
import sys
input = sys.stdin.readline

N = input()
B = map(int, input().split())

answer = float("inf")
for i in B:
    answer = min(answer, len(bin(i)) - bin(i).rfind("1") - 1)
print(answer)
Buggy python submission (verdict: Runtime Error):
N = int(input())
l = [input() for _ in range(N)]
ch = {'AC': 0, 'WA':0, 'TLE':0, 'RE':0}

for key, value in ch.items():
  ch[key] = l.count(key)

for key, value in ch.items():
  print(key + ' x ' + value)

Fixed submission:
N = int(input())
l = [input() for _ in range(N)]
ch = {'AC': 0, 'WA':0, 'TLE':0, 'RE':0}

for key, value in ch.items():
  ch[key] = l.count(key)

for key, value in ch.items():
  print(key + ' x ' + str(value))
Buggy python submission (verdict: Runtime Error):
a = input()
if a >= 'a' && a <='z':
  print('a')
if a >= 'A' && a <='Z':
  print('A')

Fixed submission:
a = input()
if a >= 'a' and a <='z':
  print('a')
if a >= 'A' and a <='Z':
  print('A')
Buggy python submission (verdict: Runtime Error):
A, B, N = map(int, input().split())
f = [int(A*x/B) - (A * int(x/B)) for x in range(N+1)]
print(max(f))

Fixed submission:
K = int(input())
A, B = map(int, input().split())
judge = False
for i in range(A, B+1):
  if i % K == 0:
    print('OK')
    judge = True
    break
if not judge:
  print('NG')

Buggy python submission (verdict: Runtime Error):
K = int(input())
A, B = map(int, input().split())
judge = False
for i in range(A, B+1):
  if i % K == 0:
    print('OK')
    judge = True
    break
if !judge:
  print('NG')

Fixed submission:
K = int(input())
A, B = map(int, input().split())
judge = False
for i in range(A, B+1):
  if i % K == 0:
    print('OK')
    judge = True
    break
if not judge:
  print('NG')
Buggy python submission (verdict: Time Limit Exceeded):
X = int(input())
Y = 100
i = 0
while 1:
  if X == Y:
    print(i)
    break
  Y += Y // 100
  i += 1

Fixed submission:
X = int(input())
Y = 100
i = 0
while 1:
  if X <= Y:
    print(i)
    break
  Y += Y // 100
  i += 1
Buggy python submission (verdict: Runtime Error):
def f(a, b, x):
  return int(a*x/b) - (a*int(x/b))
A, B, N = map(int, input().split())
print(f(A, B, min(B-1, N))

Fixed submission:
def f(a, b, x):
  return int(a*x/b) - (a*int(x/b))
A, B, N = map(int, input().split())
print(f(A, B, min(B-1, N)))

Buggy python submission (verdict: Time Limit Exceeded):
A, B, N = map(int, input().split())
f = [int(A*x/B) - (A * int(x/B)) for x in range(N+1)]
print(max(f))

Fixed submission:
def f(a, b, x):
  return int(a*x/b) - (a*int(x/b))
A, B, N = map(int, input().split())
print(f(A, B, min(B-1, N)))

Buggy python submission (verdict: Runtime Error):
A, B, N = map(int, input().split())
f = [int(A*x/B)-(A * int(x/B)) for x range(N+1)]
print(max(f))

Fixed submission:
def f(a, b, x):
  return int(a*x/b) - (a*int(x/b))
A, B, N = map(int, input().split())
print(f(A, B, min(B-1, N)))

Buggy python submission (verdict: Runtime Error):
A, B, N = map(int, input().split())
f = [int(A*x/B) - (A * int(x/B)) for x range(N+1)]
print(max(f))

Fixed submission:
def f(a, b, x):
  return int(a*x/b) - (a*int(x/b))
A, B, N = map(int, input().split())
print(f(A, B, min(B-1, N)))

Buggy python submission (verdict: Time Limit Exceeded):
A, B, N = map(int, input().split())
max = 0
for x in range(N+1):
  f = int(A*x/B) - (A * int(x/B))
  if f > max:
    max = f
print(max)

Fixed submission:
def f(a, b, x):
  return int(a*x/b) - (a*int(x/b))
A, B, N = map(int, input().split())
print(f(A, B, min(B-1, N)))

Buggy python submission (verdict: Time Limit Exceeded):
A, B, N = map(int, input().split())
max = 0
for x in range(N+1):
  if int(A*x/B) - (A * int(x/B)) > max:
    max = int(A*x/B) - (A * int(x/B))
print(max)

Fixed submission:
def f(a, b, x):
  return int(a*x/b) - (a*int(x/b))
A, B, N = map(int, input().split())
print(f(A, B, min(B-1, N)))
Buggy python submission (verdict: Runtime Error):
N = int(input())
res = 0
for i in range(N+1):
  if i % 3 != 0 && i % 5 != 0:
    res += i
print(res)

Fixed submission:
N = int(input())
res = 0
for i in range(N+1):
  if i % 3 != 0 and i % 5 != 0:
    res += i
print(res)
Buggy python submission (verdict: Runtime Error):
N, K = input().split()
N = int(N)
K = int(K)

array = input().split()
for i in range(len(array)):
    array[i] = int(array[i])

now = 1

history = []
start_number = -1

for i in range(K):
    history.append(now)
    now = array[now - 1]
    if(now in history):
        start_number = now
        break

if not(start_number == -1):
    start_ind = history.index(start_number)
    length = len(history) - start_ind
    mod = (K - start_ind) % length
    now = history[start_ind + mod]

print(now)


Fixed submission:
S = input()
T = input()

flag = True
for i in range(len(S)):
    if(S[i] != T[i]):
        flag = False

if(flag):
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Time Limit Exceeded):
n= int(input())


l=[]

for i in range(n):
    l.append(input())
    l.sort()

ac=l.count('AC')
tle=l.count('TLE')
wa=l.count('WA')
re=l.count('RE')
print('AC x '+ str(ac))
print('WA x '+ str(wa))
print('TLE x '+ str(tle))
print('RE x '+ str(re))








Fixed submission:
n= int(input())

ac=0
wa=0
tle=0
re=0

l=[]

for i in range(n):
    t=input()
    if(t=='AC'):
        ac=ac+1
    elif(t=='WA'):
        wa=wa+1
    elif(t=='TLE'):
        tle=tle+1
    elif(t=='RE'):
        re=re+1
  
print('AC x '+ str(ac))
print('WA x '+ str(wa))
print('TLE x '+ str(tle))
print('RE x '+ str(re))
Buggy python submission (verdict: Runtime Error):
num=int(input())


def num2alpha(num):
    if num<=26:
        return chr(64+num)
    elif num%26==0:
        return num2alpha(num//26-1)+chr(90)
    else:
        return num2alpha(num//26)+chr(64+num%26)

ans=num2alpha(num).lower()

print(ans)

Fixed submission:
str=input()
a=str.isupper()
if a==True:
    print("A")
else:
    print("a")
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
c = list(map(int, input().split()))
ans=1
max =10**18
for i in range(n):
    if ans< max:
        ans=ans*c[i]
        if ans > max:
            ans =-1
    else:
        ans = -1
print(ans)

Fixed submission:
n = int(input())
c = list(map(int, input().split()))
ans=1
max =10**18

if 0 in c:
    ans =0
else:
    for i in range(n):
        if ans< max:
            ans=ans*c[i]
            if ans > max:
                ans =-1
                break
        else:
            ans = -1
            break
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n= int(input())
l=[]

for i in range(n):
    x = input()
    if (x in l)==False:
        l.append(x)
    sorted(l)
print(len(l))
    

Fixed submission:
n= int(input())
l=[]

for i in range(n):
    x=input()
    l.append(x)
    
l2=list(set(l))    
print(len(l2))

Buggy python submission (verdict: Time Limit Exceeded):
n= int(input())
l=[]

for i in range(n):
    x = input()
    if (x in l)==False:
        l.append(x)
print(len(l))
    

Fixed submission:
n= int(input())
l=[]

for i in range(n):
    x=input()
    l.append(x)
    
l2=list(set(l))    
print(len(l2))
Buggy python submission (verdict: Runtime Error):
k=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[k-1])k

Fixed submission:
k=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[k-1])

Buggy python submission (verdict: Runtime Error):
k=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[k+1])

Fixed submission:
k=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[k-1])
Buggy python submission (verdict: Time Limit Exceeded):
n= int(input())
st=list(map(int,input().split()))
#print(st)
for i in range(n):
    list =[[0]*2 for i in range(n)]
    
for j in range(len(list)):
    list[j][0]=j+1
    list[j][1]=st[j]
    
list.sort(key=lambda x: x[1])
#print(list)

for k in range(len(list)):
    print(list[k][0],end=' ')

Fixed submission:
n= int(input())
st=list(map(int,input().split()))
#print(st)
list =[[0]*2 for i in range(n)]
    
for j in range(len(list)):
    list[j][0]=j+1
    list[j][1]=st[j]
    
list.sort(key=lambda x: x[1])
#print(list)

for k in range(len(list)):
    print(list[k][0],end=' ')
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
c = list(map(int,input().split()))
sum = 0
for i in range(0,n,1):
  sum = sum + c[i]
count = 0
vote = (1/(4*b))*sum
for j in c:
  if j>=vote:
    count = count + 1
if count>=b:
  print("Yes")
else:
  print("No")

Fixed submission:
a,b = map(int,input().split())
c = list(map(int,input().split()))
sum = 0
for i in c:
  sum = sum + i
vote = (1/(4*b))*sum
count = 0
for j in c:
  if j>=vote:
    count = count + 1

if count>=b:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = list(map(int,input().split()))
sum = 0
for i in c:
  sum = sum + i
count = 0
vote = (1/(4*b))*sum
for j in c:
  if j>=vote:
    count = count + 1
if count>=b:
  print("Yes")
else:
  print("No")

Fixed submission:
a,b = map(int,input().split())
c = list(map(int,input().split()))
sum = 0
for i in c:
  sum = sum + i
vote = (1/(4*b))*sum
count = 0
for j in c:
  if j>=vote:
    count = count + 1

if count>=b:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = list(map(int,input().split()))
sum = 0
for i in range c:
  sum = sum + i
count = 0
vote = (1/(4*b))*sum
for j in c:
  if j>=vote:
    count = count + 1
if count>=b:
  print("Yes")
else:
  print("No")

Fixed submission:
a,b = map(int,input().split())
c = list(map(int,input().split()))
sum = 0
for i in c:
  sum = sum + i
vote = (1/(4*b))*sum
count = 0
for j in c:
  if j>=vote:
    count = count + 1

if count>=b:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
N = int(input())
A_list = list(map(int, input().split()))
bosses = [0] * N

for i in A_list:
    bosses[i-1] += 1
for boss in bosses:
    print(boss)

Fixed submission:
print(6.283*int(input()))
Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split())
A = sum(list(map(int, input(.split()))))
if A <= n:
    print(n-A)
else:
    print(-1)

Fixed submission:
n, m = map(int, input().split())
A = sum(list(map(int, input().split())))
if A <= n:
    print(n-A)
else:
    print(-1)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A_list = list(map(int, input().split()))
A_set = sorted(set(A_list))

A_output = [0 for i in range(N)]

for i in range(len(A_set)):
    A_output[A_set[i]-1] = A_list.count(A_set[i])
    
for i in range(len(A_output)):
    print(A_output[i])

Fixed submission:
import collections

N = int(input())
A_list = list(map(int, input().split()))
A_collection = collections.Counter(A_list)

for i in range(N):
    print(A_collection[i+1])

Buggy python submission (verdict: Runtime Error):
N = int(input())
A_list = list(map(int, input().split()))
A_set = sorted(set(A_list), reverse=True)
A_output = []
for i in range(len(A_set)):
    A_output[i] =len(A_list) - len(A_list.remove(A_set[i]))
    
print(A_output.reverse)

Fixed submission:
import collections

N = int(input())
A_list = list(map(int, input().split()))
A_collection = collections.Counter(A_list)

for i in range(N):
    print(A_collection[i+1])
Buggy python submission (verdict: Runtime Error):
N = int(input())

print(sum(filter(lambda x : x%3 != 0 or x%5 !=, range(N)))) 



Fixed submission:
N = int(input())

print(sum(filter(lambda x : (x%3 != 0) and (x%5 !=0), range(N+1))))