Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
import random
import time

t1=time.time()
d=int(input())
c=input()
cl=[int(n) for n in c.split()]
sl=list()
for i in range(d):
    s=input()
    sl=sl+[int(n) for n in s.split()]
tl=[1]*d
sat=0
for i in range(d):
    sat+=sl[i*26+tl[i]-1]

def decr(tl,cl):
    dec=0
    for i in range(26):
        last=[a for a, x in enumerate(tl) if x==i+1]
        if last==list():
            dec+=(d*(d+1)/2)*cl[i]
        else:
            for v in range(len(last)):
                if v!=len(last)-1:    
                    dec+=cl[i]*(last[v+1]-last[v]-1)*(last[v+1]-last[v])/2
                else:
                    dec+=cl[i]*(d-last[v]-1)*(d-last[v])/2
            dec+=cl[i]*(last[0])*(last[0]+1)/2
    return(int(dec))

oldscore=sat
oldans=oldscore-decr(tl,cl)
oldtl=[int(x) for x in tl]
t2=time.time()
while t2-t1<1.9:
    da=random.randint(1,d)
    q=random.randint(1,26)
    cha=sl[(da-1)*26+q-1]-sl[(da-1)*26+tl[da-1]-1]
    tl[da-1]=q
    newscore=oldscore+cha
    newans=newscore-decr(tl,cl)
    if newans<oldans:
        tl=[int(x) for x in oldtl]
    else:
        oldans=newans
        oldtl=[int(x) for x in tl]
        oldscore=newscore
    t2=time.time()
for i in range(d):
    print(tl[i])
        


Fixed submission:
import random

d=int(input())
c=input()
cl=[int(n) for n in c.split()]
sl=list()
for i in range(d):
    s=input()
    sl=sl+[int(n) for n in s.split()]
tl=[1]*d
sat=0
for i in range(d):
    sat+=sl[i*26+tl[i]-1]

def decr(tl,cl):
    dec=0
    for i in range(26):
        last=[a for a, x in enumerate(tl) if x==i+1]
        if last==list():
            dec+=(d*(d+1)/2)*cl[i]
        else:
            for v in range(len(last)):
                if v!=len(last)-1:    
                    dec+=cl[i]*(last[v+1]-last[v]-1)*(last[v+1]-last[v])/2
                else:
                    dec+=cl[i]*(d-last[v]-1)*(d-last[v])/2
            dec+=cl[i]*(last[0])*(last[0]+1)/2
    return(int(dec))

oldscore=sat
oldans=oldscore-decr(tl,cl)
oldtl=[int(x) for x in tl]
for k in range(10000):
    da=random.randint(1,d)
    q=random.randint(1,26)
    cha=sl[(da-1)*26+q-1]-sl[(da-1)*26+tl[da-1]-1]
    tl[da-1]=q
    newscore=oldscore+cha
    newans=oldscore-decr(tl,cl)
    if newans<oldans:
        tl=[int(x) for x in oldtl]
    else:
        oldans=newans
        oldtl=[int(x) for x in tl]
        oldscore=newscore
for i in range(d):
    print(tl[i])
Buggy python submission (verdict: Time Limit Exceeded):
from numba import jit
import math
import numpy

@jit(cache=True)
def aaa(n):
    pl=[0]*(n+1)
    for i in range(1,n+1):
        for l in range (i,n+1,i):
            pl[l]+=1
    return(pl)

n=int(input())
p=numpy.array(list(range(n+1)))
pl=numpy.array(aaa(n))
q=numpy.dot(p,pl)
print(q)

Fixed submission:
import math

def aaa(n):
    pl=[0]*(n+1)
    for i in range(1,n+1):
        for l in range (i,n+1,i):
            pl[l]+=1
    return(pl)

n=int(input())
p=(list(range(n+1)))
q=0
pl=aaa(n)
for i in range(n+1):
  q+=p[i]*pl[i]
print(q)
Buggy python submission (verdict: Runtime Error):
import sys
import numpy
n=int(input())
a=input()
a=a.split()
M=1
m=int(a[n])
Ml=list()
ml=list()
Ml.append(M)
ml.append(m)
Q=0
if int(a[0])>=1:
    print(-1)
    sys.exit()
for i in range(n):
    M=2*M-int(a[i+1])
    if M<0:
        print(-1)
        sys.exit()
    M1=M+int(a[i+1])
    Ml.append(M1)
    m=m+int(a[n-i-1])
    ml.insert(0,m)
numpy.array(Ml)
numpy.array(ml)
Q1=numpy.minimum(Ml,ml)
Q1=sum(Q1)
print(Q1)

Fixed submission:
a=input()
a0=a.split()
h1=int(a0[0])
m1=int(a0[1])
h2=int(a0[2])
m2=int(a0[3])
k=int(a0[4])
t1=60*h1+m1
t2=60*h2+m2
t=t2-t1
print(t-k)
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
l=list()
for i in range(n):
    k=input()
    q=k in l
    if q==False:
        l.append(k)
print(len(l))

Fixed submission:
n=int(input())
l=set()
for i in range(n):
    k=input()
    q=k in l
    if q==False:
        l.add(k)
print(len(l))
Buggy python submission (verdict: Runtime Error):
d,t,s = map(int,input().split())

if t*s >= D:
    prrint("Yes")

else:
    print("No")

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

if t*s >= d:
    print("Yes")

else:
    print("No")
Buggy python submission (verdict: Runtime Error):
al = input()

# ald = [1:a,2:b,3:c,4:d,5:e,6:f,8:g,9:h,10:i,11:j,12:k,13:l,14:m,15:n,16:o,16:p,17:q,18:r,19:s,20:t,21:u,22:v,23:w,24:x,25:y,26:z]

ald = {'a':'b','b':'c','c':'d','d':'e','e':'f','f':'g','g':'h','h':'i','i':'j','j':'k','k':'l','l':'m','m','n','n':'o','o':'p','p':'q','q':'r','r':'s','s':'t','t':'u','u':'v','v':'w','w':'x','x':'y','y':'z'}

if al in ald:
    print(ald[al])

Fixed submission:
alpha = input()

# ald = [1:a,2:b,3:c,4:d,5:e,6:f,8:g,9:h,10:i,11:j,12:k,13:l,14:m,15:n,16:o,16:p,17:q,18:r,19:s,20:t,21:u,22:v,23:w,24:x,25:y,26:z]

ald = {'a':'b','b':'c','c':'d','d':'e','e':'f','f':'g','g':'h','h':'i','i':'j','j':'k','k':'l','l':'m','m':'n','n':'o','o':'p','p':'q','q':'r','r':'s','s':'t','t':'u','u':'v','v':'w',"w":'x','x':'y','y':'z'}


if alpha in ald:
    print(ald[alpha])

Buggy python submission (verdict: Runtime Error):
al = input()

# ald = [1:a,2:b,3:c,4:d,5:e,6:f,8:g,9:h,10:i,11:j,12:k,13:l,14:m,15:n,16:o,16:p,17:q,18:r,19:s,20:t,21:u,22:v,23:w,24:x,25:y,26:z]

ald = [a:b,b:c,c:d,d:e,e:f,f:g,g:h,h:i,i:j,j:k,k:l,l:m,m,n,n:o,o:p,p:q,q:r,r:s,s:t,t:u,u:v,v:w,w:x,x:y,y:z]

if al in ald:
    print(ald[al])

Fixed submission:
alpha = input()

# ald = [1:a,2:b,3:c,4:d,5:e,6:f,8:g,9:h,10:i,11:j,12:k,13:l,14:m,15:n,16:o,16:p,17:q,18:r,19:s,20:t,21:u,22:v,23:w,24:x,25:y,26:z]

ald = {'a':'b','b':'c','c':'d','d':'e','e':'f','f':'g','g':'h','h':'i','i':'j','j':'k','k':'l','l':'m','m':'n','n':'o','o':'p','p':'q','q':'r','r':'s','s':'t','t':'u','u':'v','v':'w',"w":'x','x':'y','y':'z'}


if alpha in ald:
    print(ald[alpha])
Buggy python submission (verdict: Runtime Error):
a,b,c=map(int,input().split())
if b*c>=d:
  print("Yes")
else:
  print("No")

Fixed submission:
a,b,c=map(int,input().split())
if b*c>=a:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Time Limit Exceeded):
n,k=map(int,input().split())
l=list(map(int,input().split()))
t=1
for i in range(k):
	t*=l[i]
j=0
for i in range(k,n):
	f=t//l[j]
	f*=l[i]
	if f>t:
		print("Yes")
	else:
		print("No")
	t=f
	j+=1

Fixed submission:
n,k=map(int,input().split())
l=list(map(int,input().split()))
j=0
for i in range(k,n):

	if l[i]>l[j]:
		print("Yes")
	else:
		print("No")
	j+=1
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
l=list(map(int,input().split()))
ans=1
for i in l:
	ans=ans*i
if ans>pow(10,18):
	ans=-1
print(ans)

Fixed submission:
n=int(input())
l=list(map(int,input().split()))
ans=1
z=pow(10,18)
for i in l:
	ans=ans*i
	if ans>z:
		ans=-1
		break
if 0 in l:
	print(0)
else:
	print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
l=list(map(int,input().split()))
for i in range(n):
	l[i]=[l[i],i+1]
l.sort()
count=0
for i in range(n):
	a=l[i]
	for j in range(i+1,n):
		if abs(a[1]-l[j][1])==a[0]+l[j][0]:
			count+=1
		elif abs(a[1]-l[j][1])>n:
			break
print(count)

Fixed submission:
n=int(input())
l=list(map(int,input().split()))
a={}
b={}
count=0
for i in range(n):
	t=l[i]-(i+1)
	if t in a:
		a[t]+=1
	else:
		a[t]=1
	t=-l[i]-(i+1)
	if t in b:
		b[t]+=1
	else:
		b[t]=1
		# b[t].add(i+1)
for i in a:
	if i in b:
		count+=a[i]*b[i]
print(count)
Buggy python submission (verdict: Time Limit Exceeded):
a,b,n=map(int,input().split())
m=0
if n<b:
	m=(a*n)//b
elif n==b:
	m=max((a*(n-1))//b,(a*n)//b-a*(n//b))
else:
	m=(a*(n-1))//b
	for i in range(b,n+1):
		m=max(m,(a*n)//b-a*(n//b))
print(m)


Fixed submission:
a,b,n=map(int,input().split())
m=0
if n<b:
	m=(a*n)//b
elif n==b:
	m=max((a*(n-1))//b,(a*n)//b-a*(n//b))
else:
	m=max((a*(b-1))//b,(a*n)//b-a*(n//b))
print(m)
Buggy python submission (verdict: Runtime Error):

n,d=map(int,input().split())
cnt = 0
for _ in range(n):
    x,y = map(int,input().split())
    if(sqrt((x**2) + (y**2))<=d):
        cnt +=1 
print(cnt)

Fixed submission:
import math as m
n,d=map(int,input().split())
cnt = 0
for _ in range(n):
    x,y = map(int,input().split())
    if(m.sqrt((x**2) + (y**2))<=d):
        cnt +=1 
print(cnt)
Buggy python submission (verdict: Runtime Error):
a,b,c,k=map(int,input().split())
ans=0

while(1):
    if(b<=a):
        b=b*2
        ans+=1
    else:
        break
while(1):
    if(c<=b):
        c=c*2
        ans+=1
    else:
        break    
        
if(ans > k):
    print('No')
else:
    print('Yes') 

Fixed submission:
a,b,c=map(int,input().split())
k=int(input())

ans=0

while(1):
    if(b<=a):
        b=b*2
        ans+=1
    else:
        break
while(1):
    if(c<=b):
        c=c*2
        ans+=1
    else:
        break    
        
if(ans > k):
    print('No')
else:
    print('Yes')
Buggy python submission (verdict: Runtime Error):
n = input()
#lol=[int(n) for n in input().split()]
print(1000-(n%1000))

Fixed submission:
n = int(input())
if(n%1000 ==0):
    print(0)
else:    
    ans = 1000-(n%1000)
    print(ans)
Buggy python submission (verdict: Runtime Error):
n = input()
lol=[]
for _ in range(n):
    lol.append(input())
print('AC X ',lol.count('AC'))
print('WA X ',lol.count('WA'))
print('TLE X ',lol.count('TLE'))
print('RE X ',lol.count('RE'))

Fixed submission:
n = int(input())
lol=[]
for _ in range(n):
    lol.append(input())
print('AC x ',lol.count('AC'))
print('WA x ',lol.count('WA'))
print('TLE x ',lol.count('TLE'))
print('RE x ',lol.count('RE'))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
lol=[int(n) for n in input().split()]
ans = 0
x=max(lol)
ans += x
lol.remove(x)
n = n-2
if(n%2==0):
    for i in range(int(n/2)):
        ans+=(max(lol)*2)
        lol.remove(max(lol))
    print(ans)
else:
    for i in range(int((n-1)/2)):
        ans+=(max(lol)*2)
        lol.remove(max(lol))
    ans +=max(lol)
    print(ans)
    
    
    


Fixed submission:
n = int(input())
x=n
lol=[int(n) for n in input().split()]

ans = 0
lol.sort()
lol.reverse()
z=lol.copy()
ans +=lol[0]
lol.remove(max(lol))
n=n-2

if(n%2==0):
    for i in range(int(n/2)):
        ans+=(2*lol[i])
    print(ans)
else:
    for i in range(int((n-1)/2)):
        ans+=(2*lol[i])
    ans+=(z[int(x/2)])
    print(ans)
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
lol = [int(n) for n in input().split()]
lol.sort()
print(sum(lol[:k]))

Fixed submission:
a,b = map(int,input().split())
lol = [int(n) for n in input().split()]
lol.sort()
print(sum(lol[:b]))
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
if(b%2!=0):
    print("No")
else:
    z = b//2 
    y = b//4
    if(a>=y and a <=z):
        print('Yes')
    else:
        print('No')


Fixed submission:
lol= [int(n) for n in input().split()]
for i in range(5):
    if(lol[i] == 0):
        print(i+1)
        break
Buggy python submission (verdict: Runtime Error):
a, b = [int(c) for c in input().split(" ")]
S = input()
count = 0
for i in range(1, a):
  for j in range(0, a):
      if (j+i <= a+1):
          subStr = S[j:j+i]
          if (len(subStr) == i):
            if (int(subStr) % b == 0):
                count+=1
if (int(S) % b == 0):
    count+=1
print(count)
    

Fixed submission:
code = input()
if (len(set(list(code))) != 1):
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
from math import ceil, floor
 
a, b = [int(c) for c in input().split(" ")]
A = ceil(a / 0.08)
B = ceil(b/ 0.1)
 
if (A < B):
  if (floor(B * 0.08) == a):
    print(B)
  else:
    print(-1)
elif (B < A):
  if (floor(A*0.1) == b):
    print(A)
  else:
    print(-1)
else:
  print(-1);

Fixed submission:
code = input()
if (len(set(list(code))) != 1):
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
from math import ceil, floor

a, b = [int(c) for c in input()]
A = ceil(a / 0.08)
B = ceil(b/ 0.1)
 
if (A < B):
  if (floor(B * 0.08) == a):
    print(B)
  else:
    print(-1)
elif (B < A):
  if (floor(A*0.1) == b):
    print(A)
  else:
    print(-1)
else:
  print(-1);


Fixed submission:
code = input()
if (len(set(list(code))) != 1):
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
code = input()
return len(set(list(code))) != 1;

Fixed submission:
code = input()
if (len(set(list(code))) != 1):
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
from math import ceil, floor

a, b = [int(c) for c in input()]
A = ceil(a / 0.08)
B = ceil(b/ 0.1)
 
if (A < B):
  if (floor(B * 0.08) == a):
    print(B)
  else:
    print(-1)
elif (B < A):
  if (floor(A*0.1) == b):
    print(A)
  else:
    print(-1)
else:
  print(-1);


Fixed submission:
from math import ceil, floor
 
a, b = [int(c) for c in input().split(" ")]
A = ceil(a / 0.08)
B = ceil(b/ 0.1)
 
if (A < B):
  if (floor(B * 0.08) == a):
    print(B)
  else:
    print(-1)
elif (B < A):
  if (floor(A*0.1) == b):
    print(A)
  else:
    print(-1)
else:
  print(A);

Buggy python submission (verdict: Runtime Error):
from math import ceil, floor

a, b = [int(c) for c in input()]
A = ceil(a / 0.08)
B = ceil(b/ 0.1)
 
if (A < B):
  if (floor(B * 0.08) == a):
    print(B)
  else:
    print(-1)
elif (B < A):
  if (floor(A*0.1) == b):
    print(A)
  else:
    print(-1)
else:
	print(-1);


Fixed submission:
from math import ceil, floor
 
a, b = [int(c) for c in input().split(" ")]
A = ceil(a / 0.08)
B = ceil(b/ 0.1)
 
if (A < B):
  if (floor(B * 0.08) == a):
    print(B)
  else:
    print(-1)
elif (B < A):
  if (floor(A*0.1) == b):
    print(A)
  else:
    print(-1)
else:
  print(A);

Buggy python submission (verdict: Runtime Error):
a,b = [int(c) for c in input()]

A = ceil(a / 0.08)
B = ceil(b/ 0.1)

if (A > B):
  if (floor(B * 0.08) == a):
    print(B);
elif (B > A):
  if (floor(A*0.1) == b):
    print(A);
print(-1);



Fixed submission:
from math import ceil, floor
 
a, b = [int(c) for c in input().split(" ")]
A = ceil(a / 0.08)
B = ceil(b/ 0.1)
 
if (A < B):
  if (floor(B * 0.08) == a):
    print(B)
  else:
    print(-1)
elif (B < A):
  if (floor(A*0.1) == b):
    print(A)
  else:
    print(-1)
else:
  print(A);
Buggy python submission (verdict: Runtime Error):
s=input()
if s[-1]==3:
  print('bon')
elif s[-1] in [0,1,6,8]
  print('pon')
else:
  print('hon')


Fixed submission:
s=input()
if s[-1]=='3':
  print('bon')
elif s[-1] in ['0','1','6','8']:
  print('pon')
else:
  print('hon')

Buggy python submission (verdict: Runtime Error):
s=list(input())
if s[-1]=='3':
  print('bon')
elif s[-1] in [0,1,6,8]
  print('pon')
else:
  print('hon')


Fixed submission:
s=input()
if s[-1]=='3':
  print('bon')
elif s[-1] in ['0','1','6','8']:
  print('pon')
else:
  print('hon')

Buggy python submission (verdict: Runtime Error):
s=int(input())
if s[-1]==2 and s[-1]==4 and s[-1]==5 and s[-1]==7 and s[-1]==9:
    print('hon')
elif s[-1]==0 and s[-1]==1 and s[-1]==6 and s[-1]==8:
    print('pon')
else:
    print('bon')


Fixed submission:
s=input()
if s[-1]=='3':
  print('bon')
elif s[-1] in ['0','1','6','8']:
  print('pon')
else:
  print('hon')

Buggy python submission (verdict: Runtime Error):
s=int(input())
if s[-1]==2 and s[-1]==4 and s[-1]==5 and s[-1]==7 and s[-1]==9:
    print('hon')
elif s[-1]==0 and s[-1]==1 and s[-1]==6 and s[-1]==8
    print('pon')
else:
    print('bon')


Fixed submission:
s=input()
if s[-1]=='3':
  print('bon')
elif s[-1] in ['0','1','6','8']:
  print('pon')
else:
  print('hon')

Buggy python submission (verdict: Runtime Error):
n=int(input())
if s[-1]==2 and s[-1]==4 and s[-1]==5 and s[-1]==7 and s[-1]==9:
    print('hon')
elif s[-1]==0 and s[-1]==1 and s[-1]==6 and s[-1]==8
    print('pon')
else:
    print('bon')


Fixed submission:
s=input()
if s[-1]=='3':
  print('bon')
elif s[-1] in ['0','1','6','8']:
  print('pon')
else:
  print('hon')

Buggy python submission (verdict: Runtime Error):
n=int(input())
if s[-1]=2 and s[-1]=4 and s[-1]=5 and s[-1]=7 and s[-1]=9:
    print('hon')
elif s[-1]=0 and s[-1]=1 and s[-1]=6 and s[-1]=8
    print('pon')
else:
    print('bon')

Fixed submission:
s=input()
if s[-1]=='3':
  print('bon')
elif s[-1] in ['0','1','6','8']:
  print('pon')
else:
  print('hon')
Buggy python submission (verdict: Runtime Error):
k=int(input())
s=input()
if len(s)<=k
    print('s')
else:
  print('s[:k+1]'+'...')
    

Fixed submission:
k=int(input())
s=input()
if int(len(s))<=k:
  print(s)
else:
  print(s[0:k]+'...')
Buggy python submission (verdict: Time Limit Exceeded):
ｋ = int(input())
a,b = map(int,input().split())
n=0
while True:
    n+=k
    if n>=a and n<=b:
        print('OK')
        break
    if n>b:
        print('NG')

Fixed submission:
ｋ = int(input())
a,b = map(int,input().split())
n=0
while True:
    n+=k
    if n>=a and n<=b:
        print('OK')
        break
    if n>b:
        print('NG')
        break

Buggy python submission (verdict: Runtime Error):
ｋ = int(input())
a,b = map(int,input().split())
n=0
while True:
    n+=k
    if n>=a and n=<b:
        print('OK')
        break
    if n>b:
        print('NG')
        
        

Fixed submission:
ｋ = int(input())
a,b = map(int,input().split())
n=0
while True:
    n+=k
    if n>=a and n<=b:
        print('OK')
        break
    if n>b:
        print('NG')
        break
Buggy python submission (verdict: Runtime Error):
s=int(input())
print(int(s*3.14)

Fixed submission:
s=int(input())
print(2*s*3.14)
Buggy python submission (verdict: Runtime Error):
N=int(input())
if N[0]!=7 and N[1]!=7 and N[2]!=7:
    print('No')
else:
    print('Yes')

Fixed submission:
N=input()
if N[0]!='7' and N[1]!='7' and N[2]!='7':
    print('No')
else:
    print('Yes')

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

Fixed submission:
N=input()
if N[0]!='7' and N[1]!='7' and N[2]!='7':
    print('No')
else:
    print('Yes')
Buggy python submission (verdict: Runtime Error):
x,y = map(int,input().split())
A=[int(input())  for i in range(x)]
T=sum(A)
a=0
for i in range(x):
  if A[i]<1/(4*T):
    a+=1
if a>=y:
  print('Yes')
else:
  print('No')


Fixed submission:
x,y = map(int,input().split())
A=list(map(int,input().split()))
T=sum(A)
a=0
for i in range(x):
  if A[i]>=T/(4*y):
    a+=1
if a>=y:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
N,M=map(int,input().split())
s=int(input())
S=sum(s)
if sorted(s)[-1:-M]<S/(4*M):
    print('No')
else:
    print('Yes')


Fixed submission:
x,y = map(int,input().split())
A=list(map(int,input().split()))
T=sum(A)
a=0
for i in range(x):
  if A[i]>=T/(4*y):
    a+=1
if a>=y:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
N,M,s=map(int,input().split())
S=sum(s)
if sorted(s)[-1:-M]<S/(4*M):
    print('No')
else:
    print('Yes')


Fixed submission:
x,y = map(int,input().split())
A=list(map(int,input().split()))
T=sum(A)
a=0
for i in range(x):
  if A[i]>=T/(4*y):
    a+=1
if a>=y:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
N,M,s=map(int,input().split())
S=sum(s)
if sorted(s)[-1:-m]<S/(4*M):
    print('No')
else:
    print('Yes')


Fixed submission:
x,y = map(int,input().split())
A=list(map(int,input().split()))
T=sum(A)
a=0
for i in range(x):
  if A[i]>=T/(4*y):
    a+=1
if a>=y:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):

N,M,s=map(int,input().split())
S=sum(s)
m=sorted(s)[-M]
if m<S/(4*M):
    print('No')
else:
    print('Yes')


Fixed submission:
x,y = map(int,input().split())
A=list(map(int,input().split()))
T=sum(A)
a=0
for i in range(x):
  if A[i]>=T/(4*y):
    a+=1
if a>=y:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
S=input()
if S[2]==s[3] and S[4]==s[5]:
    print('Yes')
else:
    print('No')

Fixed submission:
S=input()
if S[2]==S[3] and S[4]==S[5]:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
n,m=map(int,input().split())
if n==0: 
    print(int(n*(n-1)/2))
elif m==0:
    print(iint(m*(m-1)/2))
else:
    print(int(n*(n-1)/2+m*(m-1)/2))


Fixed submission:
n,m=map(int,input().split())
if n==0: 
    print(int(m*(m-1)/2))
elif m==0:
    print(int(n*(n-1)/2))
else:
    print(int(n*(n-1)/2+m*(m-1)/2))
Buggy python submission (verdict: Runtime Error):
a=input()
if a=='hi' or
   a=='hihi' or
   a=='hihihi' or
    a=='hihihihi' or
    a=='hihihihihi' :    
    print('Yes')
else:
    print('No')
 

Fixed submission:
a=input()
if a=='hi' or a=='hihi' or a=='hihihi' or  a=='hihihihi' or a=='hihihihihi' :    
    print('Yes')
else :
    print('No')
Buggy python submission (verdict: Runtime Error):
import math
N=map(int,input().split())
a=N/2
print(math.ceil(a))


Fixed submission:
import math
N=int(input())
a=N/2
print(math.ceil(a))

Buggy python submission (verdict: Runtime Error):
import math
a=int,input()
print(math.ceil(a//2))


Fixed submission:
import math
N=int(input())
a=N/2
print(math.ceil(a))

Buggy python submission (verdict: Runtime Error):
import math
a=int,input()
print(math.ceil(a/2))

Fixed submission:
import math
N=int(input())
a=N/2
print(math.ceil(a))
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a>9:
  print(b)
else:
  print(b+(100＊(10-a)))

Fixed submission:
a,b=map(int,input().split())
if a>9:
  print(b)
else:
  print(b+(100*(10-a)))

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a>9:
  print(b)
else:
  print(b+(100＊(10-a))

Fixed submission:
a,b=map(int,input().split())
if a>9:
  print(b)
else:
  print(b+(100*(10-a)))

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a>9:
  print(b)
else:
  print(b+(100＊(10-b))

Fixed submission:
a,b=map(int,input().split())
if a>9:
  print(b)
else:
  print(b+(100*(10-a)))

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a>10:
  print(b)
else:
  print(b+(100＊(10-b))

Fixed submission:
a,b=map(int,input().split())
if a>9:
  print(b)
else:
  print(b+(100*(10-a)))

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a>10:
  print(b)
else:
  print(b-(100＊(10-b))

Fixed submission:
a,b=map(int,input().split())
if a>9:
  print(b)
else:
  print(b+(100*(10-a)))

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a>10:
    print('b')
else:
    print(b-(100＊(10-b))

Fixed submission:
a,b=map(int,input().split())
if a>9:
  print(b)
else:
  print(b+(100*(10-a)))

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a>10:
    print('b')
else:
    print(b-(100＊(10-b)

Fixed submission:
a,b=map(int,input().split())
if a>9:
  print(b)
else:
  print(b+(100*(10-a)))

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input().split())
if a>9:
    print('b')
else
    print(b-(100＊(10-b)

Fixed submission:
a,b=map(int,input().split())
if a>9:
  print(b)
else:
  print(b+(100*(10-a)))

Buggy python submission (verdict: Runtime Error):
a,b=int(input().split())
if a>9:
    print('b')
else
    print(b-(100＊(10-b))
          
 


Fixed submission:
a,b=map(int,input().split())
if a>9:
  print(b)
else:
  print(b+(100*(10-a)))

Buggy python submission (verdict: Runtime Error):
a,b=int(input().split())
if a>10:
    print('b')
else
    print(b-(100＊(10-b))
          
 


Fixed submission:
a,b=map(int,input().split())
if a>9:
  print(b)
else:
  print(b+(100*(10-a)))

Buggy python submission (verdict: Runtime Error):
a,b=int(input())
if a>10:
    print('b')
else
    print(b-(100＊(10-b))
          
 

Fixed submission:
a,b=map(int,input().split())
if a>9:
  print(b)
else:
  print(b+(100*(10-a)))