problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p02718 | n, m = map(int, input().split())
a = list(map(int, input().split()))
x = sum(a)
count = 0
for i in range(n):
if i / a[i] >= 1/4/m:
count += 1
if count >= m:
print('Yes')
else:
print('No') | n, m = map(int, input().split())
a = list(map(int, input().split()))
x = sum(a)
count = 0
for i in range(n):
if a[i]/x >= 1/4/m:
count += 1
if count >= m:
print('Yes')
else:
print('No') | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 482,529 | 482,530 | u277104886 | python |
p02718 | N,M = map(int,input().split())
A = list(map(int,input().split()))
count = 0
for a in A:
if sum(A)/4*M > a:
count += 1
if count >= M:
print('Yes')
else:
print('No') | N,M = map(int,input().split())
A = list(map(int,input().split()))
count = 0
for a in A:
if sum(A)/(4*M) <= a:
count += 1
if count >= M:
print('Yes')
else:
print('No') | [
"control_flow.branch.if.condition.change"
] | 482,531 | 482,532 | u917734688 | python |
p02718 | import os
import heapq
import sys
import math
from collections import defaultdict
from io import BytesIO, IOBase
def check_kth_power(n, k):
while n%k == 0:
n = n/k
if n != 1:
return False
return True
def main():
#for _ in range(int(input())):
n,m=map(int,input().... | import os
import heapq
import sys
import math
from collections import defaultdict
from io import BytesIO, IOBase
def check_kth_power(n, k):
while n%k == 0:
n = n/k
if n != 1:
return False
return True
def main():
#for _ in range(int(input())):
n,m=map(int,input().... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 482,544 | 482,545 | u970369332 | python |
p02718 | import os
import heapq
import sys
import math
from collections import defaultdict
from io import BytesIO, IOBase
def check_kth_power(n, k):
while n%k == 0:
n = n/k
if n != 1:
return False
return True
def main():
#for _ in range(int(input())):
n,m=map(int,input().... | import os
import heapq
import sys
import math
from collections import defaultdict
from io import BytesIO, IOBase
def check_kth_power(n, k):
while n%k == 0:
n = n/k
if n != 1:
return False
return True
def main():
#for _ in range(int(input())):
n,m=map(int,input().... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 482,546 | 482,545 | u970369332 | python |
p02718 | n, m = map(int, input().split())
a = list(map(int, input().split()))
b = sum(a)
c = b / (4*m)
res = 0
for i in a:
if i > c:
res += 1
if res < m:
print('No')
else:
print('Yes') | n, m = map(int, input().split())
a = list(map(int, input().split()))
b = sum(a)
c = b / (4*m)
res = 0
for i in a:
if i >= c:
res += 1
if res < m:
print('No')
else:
print('Yes') | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 482,554 | 482,555 | u583507988 | python |
p02718 | N,M = map(int,input().split())
s = list(map(int,input().split()))
count = 0
al = sum(s)
for i in range(N):
if not(a[i] < s / (4 * M)):
count += 1
if count == M:
print("Yes")
else:
print("No") | N,M = map(int,input().split())
s = list(map(int,input().split()))
count = 0
al = sum(s)
for i in range(N):
if not(s[i] < al / (4 * M)):
count += 1
if count >= M:
print("Yes")
else:
print("No") | [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 482,571 | 482,572 | u425834921 | python |
p02718 | n,m = map(int,input().split())
a = list(map(int,input().split()))
x = max(a)
s = 0
for i in a:
s += i
y = [l for l in a if l >=s]
if len(y) >=m:
print('Yes')
else:
print('No') | n,m = map(int,input().split())
a = list(map(int,input().split()))
x = max(a)
s = 0
for i in a:
s += i
y = [l for l in a if l >=s/4/m]
if len(y) >=m:
print('Yes')
else:
print('No') | [
"assignment.change"
] | 482,577 | 482,578 | u998867748 | python |
p02718 | x = input().split()
a = sorted(list(map(int, input().split())), reverse=True)
n = int(x[0])
m = int(x[1])
goukei = 0
count = 0
for i in a:
goukei += i
for i in a:
if goukei/(4*m) < i:
count += 1
if count >= m:
print('Yes')
else:
print('No') | x = input().split()
a = sorted(list(map(int, input().split())), reverse=True)
n = int(x[0])
m = int(x[1])
goukei = 0
count = 0
for i in a:
goukei += i
for i in a:
if goukei/(4*m) <= i:
count += 1
if count >= m:
print('Yes')
else:
print('No') | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 482,628 | 482,629 | u085530099 | python |
p02718 | N,M = map(int,input().split())
A = list(map(int,input().split()))
total = 0
for i in range(N):
if i >= (sum(A) / (4 * M)):
total = total + 1
if total >= M:
print("Yes")
else:
print('No') | N,M = map(int,input().split())
A = list(map(int,input().split()))
total = 0
for i in A:
if i >= (sum(A) / (4 * M)):
total = total + 1
if total >= M:
print("Yes")
else:
print('No') | [
"control_flow.loop.range.bounds.upper.change",
"call.arguments.change"
] | 482,631 | 482,632 | u465652095 | python |
p02718 | N,M = map(int,input().split())
mono = list(map(int,input().split()))
l =[0] * N
for i in range(N):
if mono[i] >= sum(mono)/4*M:
l[i] = 1
if l.count(1) >= M:
print("Yes")
else:
print("No") | N,M = map(int,input().split())
mono = list(map(int,input().split()))
l =[0] * N
for i in range(N):
if mono[i] >= sum(mono)/(4*M):
l[i] = 1
if l.count(1) >= M:
print("Yes")
else:
print("No") | [
"control_flow.branch.if.condition.change"
] | 482,644 | 482,645 | u802662134 | python |
p02718 | N, M = map(int, input().split())
As = list(map(int, input().split()))
s = sum(As)
bs = [A*4*M < s for A in As]
if bs.count(True) >= M:
print("Yes")
else:
print("No")
| N, M = map(int, input().split())
As = list(map(int, input().split()))
s = sum(As)
bs = [not A*4*M < s for A in As]
if bs.count(True) >= M:
print("Yes")
else:
print("No")
| [] | 482,650 | 482,651 | u792670114 | python |
p02718 | import sys
#import numpy as np
import math
from fractions import Fraction
import itertools
input=sys.stdin.readline
n,m=map(int,input().split())
a=list(map(int ,input().split()))
s=sum(a)
s=int(s/(4*m))
c=0
for i in range(n):
if a[i]>=s:
c+=1
if c>=m:
print("Yes")
else:
print("No") | import sys
#import numpy as np
import math
from fractions import Fraction
import itertools
input=sys.stdin.readline
n,m=map(int,input().split())
a=list(map(int ,input().split()))
s=sum(a)
s=s/(4*m)
c=0
for i in range(n):
if a[i]>=s:
c+=1
if c>=m:
print("Yes")
else:
print("No") | [
"call.remove",
"call.arguments.change"
] | 482,655 | 482,656 | u064434060 | python |
p02718 | n, m = map(int, input().split())
a = list(map(int, input().split()))
count = 0
a.sort(reverse=True)
sum_a = sum(a)
thresh = sum_a * (1/(4*m))
for i in range(m):
if a[i] > thresh:
count += 1
else:
break
if count < m:
print("No")
else:
print('Yes')
| n, m = map(int, input().split())
a = list(map(int, input().split()))
count = 0
a.sort(reverse=True)
sum_a = sum(a)
thresh = sum_a * (1/(4*m))
for i in range(m):
if a[i] >= thresh:
count += 1
else:
break
if count < m:
print("No")
else:
print('Yes')
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 482,660 | 482,661 | u079827881 | python |
p02718 | N, M = map(int, input().split())
a = list(map(int, input().split()))
sums = sum(a)
count = 0
for i in a:
#print(i, sum)
if i > (sums / ( M * 4 )):
count += 1
if count >= M:
print('Yes')
else:
print("No")
| N, M = map(int, input().split())
a = list(map(int, input().split()))
sums = sum(a)
count = 0
for i in a:
#print(i, sum)
if i >= (sums / ( M * 4 )):
count += 1
if count >= M:
print('Yes')
else:
print("No")
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 482,676 | 482,677 | u498575211 | python |
p02718 | (a, b)=list(map(int, input().split()))
k = list(map(int, input().split()))
ksum= sum(k)
k.sort(reverse=True)
#print(k)
p = 'Yes'
for i in range(b):
#print(i)
if k[i] <= ksum/4/b:
p = 'No'
break
print(p) | (a, b)=list(map(int, input().split()))
k = list(map(int, input().split()))
ksum= sum(k)
k.sort(reverse=True)
#print(k)
p = 'Yes'
for i in range(b):
#print(i)
if k[i] < ksum/4/b:
p = 'No'
break
print(p) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 482,678 | 482,679 | u498575211 | python |
p02718 | (a, b)=list(map(int, input().split()))
k = list(map(int, input().split()))
ksum= sum(k)
k.sort(reverse=True)
#print(k)
p = 'Yes'
for i in range(b):
#print(i)
if k[i] <= ksum/4/b:
p = 'No'
break
| (a, b)=list(map(int, input().split()))
k = list(map(int, input().split()))
ksum= sum(k)
k.sort(reverse=True)
#print(k)
p = 'Yes'
for i in range(b):
#print(i)
if k[i] < ksum/4/b:
p = 'No'
break
print(p) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.add"
] | 482,680 | 482,679 | u498575211 | python |
p02718 | N, M = map(int, input().split())
A = list(map(int, input().split()))
total = sum(A)
bodor = total / (4 * M)
cnt = 0
for i in A:
if i > bodor:
cnt += 1
if cnt >= M:
print("Yes")
else:
print("No")
| N, M = map(int, input().split())
A = list(map(int, input().split()))
total = sum(A)
bodor = total / (4 * M)
cnt = 0
for i in A:
if i >= bodor:
cnt += 1
if cnt >= M:
print("Yes")
else:
print("No")
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 482,683 | 482,684 | u910426639 | python |
p02718 | import sys
def ILI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def ISI(): return map(int, sys.stdin.readline().rstrip().split())
n, m = ISI()
l = ILI()
cnt = 0
s = sum(l)
for a in l:
if a > s/(4*m): cnt +=1
if cnt<m:print("No")
else:print("Yes") | import sys
def ILI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def ISI(): return map(int, sys.stdin.readline().rstrip().split())
n, m = ISI()
l = ILI()
cnt = 0
s = sum(l)
for a in l:
if a >= s/(4*m): cnt +=1
if cnt<m:print("No")
else:print("Yes") | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 482,688 | 482,689 | u640603056 | python |
p02718 | N, M = map(int, input().split())
A = list(map(int, input().split()))
total = sum(A) / 4 * M
A.sort(reverse = False)
if A[M-1] >= total:
print('Yes')
else:
print('No') | N, M = map(int, input().split())
A = list(map(int, input().split()))
total = sum(A) / (4 * M)
A.sort(reverse = True)
if A[M-1] >= total:
print('Yes')
else:
print('No') | [
"misc.opposites",
"call.arguments.change",
"call.arguments.keyword_argument.change"
] | 482,704 | 482,705 | u262481526 | python |
p02718 | N,M=map(int, input().split())
A=list(map(int,input().split()))
C=int(sum(A)*1/(4*M))
count=0
for i in A:
if i>=C:
count+=1
if count>=M:
print('Yes')
else:
print('No')
| N,M=map(int, input().split())
A=list(map(int,input().split()))
C=sum(A)/(4*M)
count=0
for i in A:
if i>=C:
count+=1
if count>=M:
print('Yes')
else:
print('No')
| [
"call.remove",
"expression.operation.binary.remove",
"call.arguments.change"
] | 482,715 | 482,716 | u634282234 | python |
p02718 | N,M=map(int, input().split())
A=list(map(int,input().split()))
C=int(sum(A)*1/(4*M))
count=0
for i in A:
if i>C:
count+=1
if count>=M:
print('Yes')
else:
print('No') | N,M=map(int, input().split())
A=list(map(int,input().split()))
C=sum(A)/(4*M)
count=0
for i in A:
if i>=C:
count+=1
if count>=M:
print('Yes')
else:
print('No')
| [
"call.remove",
"expression.operation.binary.remove",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 482,717 | 482,716 | u634282234 | python |
p02718 | N,M=map(int, input().split())
A=list(map(int,input().split()))
C=sum(A)*1/(4*M)
count=0
for i in A:
if i>C:
count+=1
if count>=M:
print('Yes')
else:
print('No')
| N,M=map(int, input().split())
A=list(map(int,input().split()))
C=sum(A)/(4*M)
count=0
for i in A:
if i>=C:
count+=1
if count>=M:
print('Yes')
else:
print('No')
| [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 482,718 | 482,716 | u634282234 | python |
p02718 | N, M = map(int, input().split())
A = list(map(int, input().split()))
S = (sum(A)*1.0) / (4 * M)
count = 0
for i in A:
count += 1 if i >= S else 0
print('Yes' if count > M else 'No') | N, M = map(int, input().split())
A = list(map(int, input().split()))
S = (sum(A)*1.0) / (4 * M)
count = 0
for i in A:
count += 1 if i >= S else 0
print('Yes' if count >= M else 'No') | [
"expression.operator.compare.change",
"call.arguments.change",
"io.output.change"
] | 482,719 | 482,720 | u670397449 | python |
p02718 | import sys
input = sys.stdin.readline
N, M = map(int, input().rstrip().split())
votes = list(map(int, input().rstrip().split()))
ans = []
for i in range(len(votes)):
if votes[i] > sum(votes) / (4*M):
ans.append(votes[i])
if len(ans) >= M:
print('Yes')
else:
print('No')
| import sys
input = sys.stdin.readline
N, M = map(int, input().rstrip().split())
votes = list(map(int, input().rstrip().split()))
ans = []
for i in range(len(votes)):
if votes[i] >= sum(votes) / (4*M):
ans.append(votes[i])
if len(ans) >= M:
print('Yes')
else:
print('No')
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 482,725 | 482,726 | u589047182 | python |
p02718 | from sys import stdin, setrecursionlimit
def main():
input = stdin.buffer.readline
n, m = map(int, input().split())
a = list(map(int, input().split()))
limit = sum(a) / (4 * m)
count = 0
for i in range(n):
if a[i] > limit:
count += 1
if count >= m:
print('Yes')
... | from sys import stdin, setrecursionlimit
def main():
input = stdin.buffer.readline
n, m = map(int, input().split())
a = list(map(int, input().split()))
limit = sum(a) / (4 * m)
count = 0
for i in range(n):
if a[i] >= limit:
count += 1
if count >= m:
print('Yes')... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 482,731 | 482,732 | u390727364 | python |
p02718 | from fractions import Fraction
N,M = map(int,input().split())
A = list(map(int,input().split()))
ans = 0
for i in range(N):
if A[i] > sum(A)*Fraction(1,4*M):
ans += 1
if ans >= M:
print('Yes')
else:
print('No') | from fractions import Fraction
N,M = map(int,input().split())
A = list(map(int,input().split()))
ans = 0
for i in range(N):
if A[i] >= sum(A)*Fraction(1,4*M):
ans += 1
else:
continue
if ans >= M:
print('Yes')
else:
print('No') | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.continue.add"
] | 482,737 | 482,738 | u835322333 | python |
p02718 | N, M = map(int,input().split())
l = list(map(int,input().split()))
T = sum(l)
V = 1/(4*M) * T
S = len(list(filter(lambda x: x>=V, l))) > 0
print( "Yes" if S >= M else "No" )
| N, M = map(int,input().split())
l = list(map(int,input().split()))
T = sum(l)
V = 1/(4*M) * T
S = len(list(filter(lambda x: x>=V, l)) )
print( "Yes" if S >= M else "No" )
| [] | 482,747 | 482,748 | u411302151 | python |
p02718 | n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
c = 0
for i in range(len(a)):
if a[i] >= sum(a) / 4 * m:
c += 1
if c >= m:
print('Yes')
else:
print('No') | n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
c = 0
for i in range(len(a)):
if a[i] >= sum(a) / (4 * m):
c += 1
if c >= m:
print('Yes')
else:
print('No') | [
"control_flow.branch.if.condition.change"
] | 482,753 | 482,754 | u387870994 | python |
p02718 | n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
c = 0
for i in range(len(a)):
if a[i] > sum(a) / 4 * m:
c += 1
if c >= m:
print('Yes')
else:
print('No') | n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
c = 0
for i in range(len(a)):
if a[i] >= sum(a) / (4 * m):
c += 1
if c >= m:
print('Yes')
else:
print('No') | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 482,755 | 482,754 | u387870994 | python |
p02718 | N, M = map(int, input().split())
A = list(map(int, input().split()))
m = 0
for a in A:
if a>=1/(4*M):
m += 1
print('Yes' if m>=M else 'No') | N, M = map(int, input().split())
A = list(map(int, input().split()))
m = 0
for a in A:
if a>=sum(A)/(4*M):
m += 1
print('Yes' if m>=M else 'No') | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.arguments.add"
] | 482,758 | 482,759 | u531599639 | python |
p02718 | m,n=map(int,input().split())
a=list(map(int,input().split()))
b=sum(a)/(4*n)
cnt=0
for i in a:
if i-b>0:
cnt+=1
if cnt>=n:
print("Yes")
else:
print("No") | m,n=map(int,input().split())
a=list(map(int,input().split()))
b=sum(a)/(4*n)
cnt=0
for i in a:
if i-b>=0:
cnt+=1
if cnt>=n:
print("Yes")
else:
print("No") | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 482,768 | 482,769 | u354648318 | python |
p02718 | m,n=map(int,input().split())
a=list(map(int,input().split()))
b=sum(a)//(4*m)
cnt=0
for i in a:
if i-b>0:
cnt+=1
if cnt>=m:
print("Yes")
else:
print("No") | m,n=map(int,input().split())
a=list(map(int,input().split()))
b=sum(a)/(4*n)
cnt=0
for i in a:
if i-b>=0:
cnt+=1
if cnt>=n:
print("Yes")
else:
print("No") | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"identifier.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 482,770 | 482,769 | u354648318 | python |
p02716 | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collection... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collection... | [
"call.arguments.change"
] | 482,809 | 482,810 | u191874006 | python |
p02716 | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collection... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collection... | [
"call.arguments.add"
] | 482,811 | 482,810 | u191874006 | python |
p02716 | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collection... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collection... | [
"expression.operation.binary.add"
] | 482,812 | 482,810 | u191874006 | python |
p02716 | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collection... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collection... | [
"expression.operation.binary.add"
] | 482,812 | 482,813 | u191874006 | python |
p02716 | # coding: utf-8
import sys
from functools import lru_cache
sys.setrecursionlimit(10 ** 9)
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
A = lr()
# 奇数の時と偶数の時、奇数の場合は真ん中を選ぶかどうか
INF = 10 ** 17
@lru_cache(None)
def F(index, n):
if index >= N:
... | # coding: utf-8
import sys
from functools import lru_cache
sys.setrecursionlimit(10 ** 9)
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
A = lr()
INF = 10 ** 17
@lru_cache(None)
def F(index, n):
if index >= N:
return -INF
if N - in... | [
"control_flow.branch.if.condition.change"
] | 482,849 | 482,850 | u600402037 | python |
p02716 | # coding: utf-8
import sys
from functools import lru_cache
sys.setrecursionlimit(10 ** 9)
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
A = lr()
# 奇数の時と偶数の時、奇数の場合は真ん中を選ぶかどうか
INF = 10 ** 17
@lru_cache(None)
def F(index, n):
if index >= N:
... | # coding: utf-8
import sys
from functools import lru_cache
sys.setrecursionlimit(10 ** 9)
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
A = lr()
# 奇数の時と偶数の時、奇数の場合は真ん中を選ぶかどうか
INF = 10 ** 17
@lru_cache(None)
def F(index, n):
if index >= N:
... | [
"control_flow.branch.if.condition.change"
] | 482,849 | 482,851 | u600402037 | python |
p02716 | n=int(input())
a=list(map(int,input().split()))
if n%2==1:
dp=[[0 for j in range(3)] for i in range(n//2)]
dp[0][0]=a[0]
dp[0][1]=a[1]
dp[0][2]=a[2]
for i in range(n//2-1):
dp[i+1][0]=(dp[i][0]+a[2*(i+1)])
dp[i+1][1]=max(dp[i][0],dp[i][1])+a[2*(i+1)+1]
dp[i+1][2]=max(dp[i])+a... | n=int(input())
a=list(map(int,input().split()))
if n%2==1:
dp=[[0 for j in range(3)] for i in range(n//2)]
dp[0][0]=a[0]
dp[0][1]=a[1]
dp[0][2]=a[2]
for i in range(n//2-1):
dp[i+1][0]=(dp[i][0]+a[2*(i+1)])
dp[i+1][1]=max(dp[i][0],dp[i][1])+a[2*(i+1)+1]
dp[i+1][2]=max(dp[i])+a... | [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 482,852 | 482,853 | u223904637 | python |
p02716 |
N = int(input())
aa = list(map(int, input().split()))
if N % 2 == 0:
dp = [[[0, 0] for j in range(2)] for i in range(N)]
for i, a in enumerate(aa):
dp[i][0][1] = dp[i - 1][0][0] + a
dp[i][0][0] = dp[i - 1][0][1]
dp[i][1][0] = max(dp[i - 1][1][1], dp[i - 1][0][0])
dp[i][1][1] ... |
N = int(input())
aa = list(map(int, input().split()))
if N % 2 == 0:
dp = [[[0, 0] for j in range(2)] for i in range(N)]
for i, a in enumerate(aa):
dp[i][0][1] = dp[i - 1][0][0] + a
dp[i][0][0] = dp[i - 1][0][1]
dp[i][1][0] = max(dp[i - 1][1][1], dp[i - 1][0][0])
dp[i][1][1] ... | [
"call.remove",
"call.arguments.change"
] | 482,893 | 482,894 | u333945892 | python |
p02716 | MOD = 10 ** 9 + 7
INF = 10 ** 20
import sys
input = sys.stdin.readline
sys.setrecursionlimit(100000000)
from collections import defaultdict
dy = (-1,0,1,0)
dx = (0,1,0,-1)
def main():
n = int(input())
a = list(map(int,input().split()))
dp = [{(i - 1)//2: -INF, (i + 1)//2: -INF} for i in range(n + 1)]
... | MOD = 10 ** 9 + 7
INF = 10 ** 20
import sys
input = sys.stdin.readline
sys.setrecursionlimit(100000000)
from collections import defaultdict
dy = (-1,0,1,0)
dx = (0,1,0,-1)
def main():
n = int(input())
a = list(map(int,input().split()))
dp = [{(i - 1)//2: -INF, (i + 1)//2: -INF} for i in range(n + 1)]
... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 482,918 | 482,919 | u561231954 | python |
p02718 | n, m = map(int, input().split(" "))
m = int(m)
A = list(map(int, input().split(" ")))
sum = 0
for i in A:
sum += int(i)
s = int(sum / 4 / m)
ans = 0
for i in A:
if int(i) >= s:
ans += 1
if ans >= m:
print('Yes')
else:
print('No')
| n, m = map(int, input().split(" "))
m = int(m)
A = list(map(int, input().split(" ")))
sum = 0
for i in A:
sum += int(i)
s = sum / 4 / m
ans = 0
for i in A:
if int(i) >= s:
ans += 1
if ans >= m:
print('Yes')
else:
print('No')
| [
"call.remove",
"call.arguments.change"
] | 482,931 | 482,932 | u572204849 | python |
p02718 | n,p = map(int,input().split(" "))
l = input().split(" ")
s = 0
for i in l:
m = int(i)
s = s + m
t = s/4*p
c = 0
for i in l:
m = int(i)
if m > t:
c = c + 1
if c >= p:
print("Yes")
else:
print("No") | n,p = map(int,input().split(" "))
l = input().split(" ")
s = 0
for i in l:
m = int(i)
s = s + m
q = s/(4*p)
c = 0
for i in l:
m = int(i)
if m >= q:
c = c + 1
if c >= p:
print("Yes")
else:
print("No")
| [
"assignment.variable.change",
"identifier.change",
"control_flow.loop.for.condition.change"
] | 482,935 | 482,936 | u876169782 | python |
p02718 | n,p = map(int,input().split(" "))
l = input().split(" ")
s = 0
for i in l:
m = int(i)
s = s + m
t = m/4*p
c = 0
for i in l:
m = int(i)
if m > t:
c = c + 1
if c >= p:
print("Yes")
else:
print("No")
| n,p = map(int,input().split(" "))
l = input().split(" ")
s = 0
for i in l:
m = int(i)
s = s + m
q = s/(4*p)
c = 0
for i in l:
m = int(i)
if m >= q:
c = c + 1
if c >= p:
print("Yes")
else:
print("No")
| [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change",
"control_flow.loop.for.condition.change"
] | 482,937 | 482,936 | u876169782 | python |
p02718 | import math
import time
from collections import defaultdict, deque
from sys import stdin, stdout
from bisect import bisect_left, bisect_right
n,m=map(int,stdin.readline().split())
a=list(map(int,stdin.readline().split()))
s=sum(a)
ans=0
for i in a:
if(i<(s/(4*m))):
continue
ans+=1
if(ans>=m):
print(... | import math
import time
from collections import defaultdict, deque
from sys import stdin, stdout
from bisect import bisect_left, bisect_right
n,m=map(int,stdin.readline().split())
a=list(map(int,stdin.readline().split()))
s=sum(a)
ans=0
for i in a:
if(i<(s/(4*m))):
continue
ans+=1
if(ans>=m):
print(... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 482,945 | 482,946 | u021114240 | python |
p02718 | import math
import time
from collections import defaultdict, deque
from sys import stdin, stdout
from bisect import bisect_left, bisect_right
n,m=map(int,stdin.readline().split())
a=list(map(int,stdin.readline().split()))
s=sum(a)
ans=0
for i in a:
if(i<(n/(4*m))):
continue
ans+=1
if(ans>=m):
print(... | import math
import time
from collections import defaultdict, deque
from sys import stdin, stdout
from bisect import bisect_left, bisect_right
n,m=map(int,stdin.readline().split())
a=list(map(int,stdin.readline().split()))
s=sum(a)
ans=0
for i in a:
if(i<(s/(4*m))):
continue
ans+=1
if(ans>=m):
print(... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 482,947 | 482,946 | u021114240 | python |
p02718 | import math
n,m=map(int,input().split())
a=list(map(int,input().split()))
s=sum(a)
t=math.floor(s/4/m)
a.sort()
cnt=0
for i in a:
if i>=t:
cnt+=1
if cnt>=m:
print('Yes')
else:
print('No')
| import math
n,m=map(int,input().split())
a=list(map(int,input().split()))
s=sum(a)
t=math.ceil(s/4/m)
a.sort()
cnt=0
for i in a:
if i>=t:
cnt+=1
if cnt>=m:
print('Yes')
else:
print('No') | [
"misc.opposites",
"assignment.value.change",
"identifier.change"
] | 482,960 | 482,961 | u768256617 | python |
p02718 | N, M = map(int, input().split())
A = list(input().split())
A = list(map(int, A))
#A = list(map(int, input().split()))
A.sort(reverse=True)
if A[M-1] >= sum(A)/4*M:
print('Yes')
else:
print('No') | N, M = map(int, input().split())
A = list(input().split())
A = list(map(int, A))
#A = list(map(int, input().split()))
A.sort(reverse=True)
#print(A)
#print(A[M-1], sum(A), 4*M, sum(A)/(4*M))
if A[M-1] >= sum(A)/(4*M):
print('Yes')
else:
print('No') | [
"control_flow.branch.if.condition.change"
] | 482,964 | 482,965 | u948050032 | python |
p02718 | n, m = map(int, input().split(" "))
a = list(map(int, input().split(" ")))
a.sort(reverse=True)
print(a)
if a[m - 1] < sum(a) /4 / m:
print("No")
else:
print("Yes") | n, m = map(int, input().split(" "))
a = list(map(int, input().split(" ")))
a.sort(reverse=True)
#print(a)
if a[m - 1] < sum(a) /4 / m:
print("No")
else:
print("Yes") | [
"call.remove"
] | 482,966 | 482,967 | u112007848 | python |
p02718 | N,M = map(int, input().split())
A = map(int, input().split())
A.sort(reverse=True)
S = sum(A)
if A[M-1] >= S/(4*M):
print("Yes")
else:
print("No") | N,M = map(int, input().split())
A = list(map(int, input().split()))
A.sort(reverse=True)
S = sum(A)
if A[M-1] >= S/(4*M):
print("Yes")
else:
print("No") | [
"call.add",
"call.arguments.change"
] | 482,974 | 482,975 | u610120522 | python |
p02718 | N, M = map(int, input().split(' '))
A = sorted(tuple(map(int, input().split(' '))), reverse=True)
total = sum(A)
border = total // (2 * M)
for i in range(M):
if A[i] < border:
print('No')
break
else:
print('Yes')
| N, M = map(int, input().split(' '))
A = sorted(tuple(map(int, input().split(' '))), reverse=True)
total = sum(A)
border = total / (4 * M)
for i in range(M):
if A[i] < border:
print('No')
break
else:
print('Yes')
| [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"literal.number.integer.change"
] | 482,990 | 482,991 | u606878291 | python |
p02718 | # coding: utf-8
# Your code here!
#入力Nの全ての並べ方
#print(list(itertools.permutations([1, 2, 3])))
N,M = map(int,input().split())
A = list(map(int,input().split()))
total = sum(A)
count = 0
for i in range(N):
if A[i] > total / 4 / M:
count += 1
if count >= M:
print("Yes")
else:
print("No") | N,M = map(int,input().split())
A = list(map(int,input().split()))
total = sum(A)
count = 0
for i in range(N):
if A[i] >= total / 4 / M:
count += 1
if count >= M:
print("Yes")
else:
print("No") | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 482,994 | 482,995 | u267482423 | python |
p02718 | N, M = map(int, input().split())
A = list(map(int, input().split()))
judge = sum(A) / (4 * M)
L = [i for i in A if i >= judge]
print(L)
if len(L) >= M:
print("Yes")
else:
print("No") | N, M = map(int, input().split())
A = list(map(int, input().split()))
judge = sum(A) / (4 * M)
L = [i for i in A if i >= judge]
if len(L) >= M:
print("Yes")
else:
print("No") | [
"call.remove"
] | 483,000 | 483,001 | u430336181 | python |
p02718 | import sys
sys.setrecursionlimit(10**7)
input = lambda: sys.stdin.readline().strip()
def main():
N,M = map(int,input().split())
A_list = sorted(list(map(int,input().split())),reverse=True)
print("Yes" if A_list[M-1]>sum(A_list)*(1/(4*M)) else "No")
main()
| import sys
sys.setrecursionlimit(10**7)
input = lambda: sys.stdin.readline().strip()
def main():
N,M = map(int,input().split())
A_list = sorted(list(map(int,input().split())),reverse=True)
print("Yes" if A_list[M-1]>=sum(A_list)*(1/(4*M)) else "No")
main()
| [
"expression.operator.compare.change",
"call.arguments.change",
"io.output.change"
] | 483,011 | 483,012 | u334175843 | python |
p02718 | import sys
sys.setrecursionlimit(10**7)
input = lambda: sys.stdin.readline().strip()
def main():
N,M = map(int,input().split())
A_list = sorted(list(map(int,input().split())),reverse=True)
print("Yes" if A_list[M-1]>A_list[0]*(1/(4*M)) else "No")
main()
| import sys
sys.setrecursionlimit(10**7)
input = lambda: sys.stdin.readline().strip()
def main():
N,M = map(int,input().split())
A_list = sorted(list(map(int,input().split())),reverse=True)
print("Yes" if A_list[M-1]>=sum(A_list)*(1/(4*M)) else "No")
main()
| [
"expression.operator.compare.change",
"call.arguments.change",
"io.output.change",
"call.add",
"expression.operation.binary.change"
] | 483,013 | 483,012 | u334175843 | python |
p02718 | N, M = map(int, input().split())
A = list(map(int, input().split()))
A.sort(reverse = True)
if A[M - 1] >=1/4*M:
print('Yes')
else:
print('No') | N, M = map(int, input().split())
A = list(map(int, input().split()))
A.sort(reverse = True)
if A[M - 1] >=sum(A)/(4*M):
print('Yes')
else:
print('No')
| [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"call.arguments.add"
] | 483,030 | 483,031 | u297667660 | python |
p02718 | n, m = map(int, input().split())
a = sorted(map(int, input().split()), reverse=True)
border = sum(a) / (4 * m)
canChoose = a[m-1] >= border
print(canChoose)
print("Yes" if canChoose else "No") | n, m = map(int, input().split())
a = sorted(map(int, input().split()), reverse=True)
border = sum(a) / (4 * m)
canChoose = a[m-1] >= border
print("Yes" if canChoose else "No") | [
"call.remove"
] | 483,034 | 483,035 | u531631168 | python |
p02718 | N,M = map(int, input().split())
A = list(map(int, input().split()))
vote = sum(A)
#print(vote)
count = 0
line = 4*M
line2 = vote/line
#print(line2)
ans = "No"
for i in A:
if (i >= line2):
count += 1
#print(count)
if (count > M):
ans = "Yes"
print(ans) | N,M = map(int, input().split())
A = list(map(int, input().split()))
vote = sum(A)
#print(vote)
count = 0
line = 4*M
line2 = vote/line
#print(line2)
ans = "No"
for i in A:
if (i >= line2):
count += 1
#print(count)
if (count >= M):
ans = "Yes"
print(ans) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 483,073 | 483,074 | u208309047 | python |
p02718 | N, M = map(int, input().split())
A = list(map(int, input().split()))
vote = sum(A)
#print(vote)
count = 0
line = 4*M
line2 = vote//line
ans = "No"
for i in A:
if (i >= line2):
count += 1
#print(count)
if (count > M):
ans = "Yes"
print(ans) | N,M = map(int, input().split())
A = list(map(int, input().split()))
vote = sum(A)
#print(vote)
count = 0
line = 4*M
line2 = vote/line
#print(line2)
ans = "No"
for i in A:
if (i >= line2):
count += 1
#print(count)
if (count >= M):
ans = "Yes"
print(ans) | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 483,075 | 483,074 | u208309047 | python |
p02718 | N, M = map(int, input().split())
A = list(map(int, input().split()))
vote = sum(A)
#print(vote)
count = 0
line = 4*M
line2 = vote//line
ans = "No"
for i in A:
if i >= line2:
count += 1
#print(count)
if (count > M):
ans = "Yes"
print(ans) | N,M = map(int, input().split())
A = list(map(int, input().split()))
vote = sum(A)
#print(vote)
count = 0
line = 4*M
line2 = vote/line
#print(line2)
ans = "No"
for i in A:
if (i >= line2):
count += 1
#print(count)
if (count >= M):
ans = "Yes"
print(ans) | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 483,076 | 483,074 | u208309047 | python |
p02718 | N, M = map(int, input().split())
A = list(map(int, input().split()))
vote = sum(A)
#print(vote)
count = 0
line = 4*M
line2 = vote//line
ans = "No"
for i in A:
if i > line2:
count += 1
#print(count)
if (count > M):
ans = "Yes"
print(ans) | N,M = map(int, input().split())
A = list(map(int, input().split()))
vote = sum(A)
#print(vote)
count = 0
line = 4*M
line2 = vote/line
#print(line2)
ans = "No"
for i in A:
if (i >= line2):
count += 1
#print(count)
if (count >= M):
ans = "Yes"
print(ans) | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"expression.operator.compare.change"
] | 483,077 | 483,074 | u208309047 | python |
p02718 | line1 = input().split()
n = int(line1[0])
m = int(line1[1])
line2 = input().split()
line2 = [int(i) for i in line2]
total = sum(line2)
line2 = sorted(line2)
if line2[m-1] > total / (4 * m):
print("Yes")
else:
print("No") | line1 = input().split()
n = int(line1[0])
m = int(line1[1])
line2 = input().split()
line2 = [int(i) for i in line2]
total = sum(line2)
line2 = sorted(line2, reverse=True)
if line2[m-1] >= total / (4 * m):
print("Yes")
else:
print("No") | [
"call.arguments.add",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 483,078 | 483,079 | u515647766 | python |
p02718 | a = input().split()
n = int(a[0])
m = int(a[1])
b = input().split()
x = [int(i) for i in b]
s = sum(x)
lim =float( s / (m*4))
c = 0
for i in range(0,n):
if(x[i] > lim):
c = c + 1
else:
continue
if(c >= m):
print("Yes")
else:
print("No")
| a = input().split()
n = int(a[0])
m = int(a[1])
b = input().split()
x = [int(i) for i in b]
s = sum(x)
lim = s / (m*4)
c = 0
for i in range(0,n):
if(x[i] >= lim):
c = c + 1
else:
continue
if(c >= m):
print("Yes")
else:
print("No")
| [
"call.remove",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 483,086 | 483,085 | u955691979 | python |
p02718 | a = input().split()
n = int(a[0])
m = int(a[1])
b = input().split()
x = [int(i) for i in b]
s = sum(x)
lim = s / (m*4)
c = 0
for i in range(0,n):
if(x[i] > lim):
c = c + 1
else:
continue
if(c >= n-m):
print("Yes")
else:
print("No")
| a = input().split()
n = int(a[0])
m = int(a[1])
b = input().split()
x = [int(i) for i in b]
s = sum(x)
lim = s / (m*4)
c = 0
for i in range(0,n):
if(x[i] >= lim):
c = c + 1
else:
continue
if(c >= m):
print("Yes")
else:
print("No")
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 483,087 | 483,085 | u955691979 | python |
p02718 | a = input().split()
n = int(a[0])
m = int(a[1])
b = input().split()
x = [int(i) for i in b]
s = sum(x)
lim = s / (m*4)
c = 0
for i in range(0,n):
if(x[i] > lim):
c = c + 1
else:
continue
if(c >= m):
print("Yes")
else:
print("No")
| a = input().split()
n = int(a[0])
m = int(a[1])
b = input().split()
x = [int(i) for i in b]
s = sum(x)
lim = s / (m*4)
c = 0
for i in range(0,n):
if(x[i] >= lim):
c = c + 1
else:
continue
if(c >= m):
print("Yes")
else:
print("No")
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 483,088 | 483,085 | u955691979 | python |
p02718 | a = input().split()
n = int(a[0])
m = int(a[1])
b = input().split()
x = [int(i) for i in b]
s = sum(x)
lim = s * (1/(m*4))
c = 0
for i in range(0,n):
if(x[i] > lim):
c = c + 1
else:
continue
if(c >= m):
print("Yes")
else:
print("No")
| a = input().split()
n = int(a[0])
m = int(a[1])
b = input().split()
x = [int(i) for i in b]
s = sum(x)
lim = s / (m*4)
c = 0
for i in range(0,n):
if(x[i] >= lim):
c = c + 1
else:
continue
if(c >= m):
print("Yes")
else:
print("No")
| [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 483,089 | 483,085 | u955691979 | python |
p02718 | a = 0
N,M = map(int,input().split())
A = list(map(int,input().split()))
for i in range(N):
if A[i]>sum(A)/(4*M):
a+=1
if a>=M:
print("Yes")
else:
print("No") | a = 0
N,M = map(int,input().split())
A = list(map(int,input().split()))
for i in range(N):
if A[i]>=sum(A)/(4*M):
a+=1
if a>=M:
print("Yes")
else:
print("No") | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 483,099 | 483,100 | u161155417 | python |
p02718 | import sys
a = 0
N,M = map(int,input().split())
A = list(map(int,input().split()))
for i in range(N-1):
if A[i]>sum(A)/(4*M):
a+=1
if a>=M:
print("Yes")
else:
print("No") | a = 0
N,M = map(int,input().split())
A = list(map(int,input().split()))
for i in range(N):
if A[i]>=sum(A)/(4*M):
a+=1
if a>=M:
print("Yes")
else:
print("No") | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 483,101 | 483,100 | u161155417 | python |
p02718 | import sys
a = 0
N,M = map(int,input().split())
A = list(map(int,input().split()))
for i in range(N):
if A[i]>sum(A)/(4*M):
a+=1
if a>=M:
print("Yes")
else:
print("No") | a = 0
N,M = map(int,input().split())
A = list(map(int,input().split()))
for i in range(N):
if A[i]>=sum(A)/(4*M):
a+=1
if a>=M:
print("Yes")
else:
print("No") | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 483,102 | 483,100 | u161155417 | python |
p02718 | N, M = map(int, input().split())
votes = [int(i) for i in input().split()]
count = [1 for vote in votes if vote >= sum(votes) * 1 / (4 * M)]
if count >= M:
print('Yes')
else:
print('No') | N, M = map(int, input().split())
votes = [int(i) for i in input().split()]
count = [1 for vote in votes if vote >= sum(votes) * 1 / (4 * M)]
if sum(count) >= M:
print('Yes')
else:
print('No') | [
"control_flow.branch.if.condition.change",
"call.add"
] | 483,103 | 483,104 | u108136854 | python |
p02718 | array = []
for i in range(2):
val = input()
array.append(val.split())
kinds = int(array[0][0])
populars = int(array[0][1])
votes_sum = 0
for vote in array[1]:
votes_sum = votes_sum + int(vote)
winning = votes_sum / (4 * populars)
numbers = 0
for vote in array[1]:
if int(vote) > winning:
num... | array = []
for i in range(2):
val = input()
array.append(val.split())
kinds = int(array[0][0])
populars = int(array[0][1])
votes_sum = 0
for vote in array[1]:
votes_sum = votes_sum + int(vote)
winning = votes_sum / (4 * populars)
numbers = 0
for vote in array[1]:
if int(vote) >= winning:
nu... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 483,116 | 483,117 | u206468988 | python |
p02718 | n,m=map(int,input().split())
a=list(map(int, input().split()))
cnt=0
sou=sum(a)
print(sou)
for i in range(n):
if a[i]>=sou/(4*m):
cnt+=1
print('Yes' if cnt>=m else 'No')
| n,m=map(int,input().split())
a=list(map(int, input().split()))
cnt=0
sou=sum(a)
for i in range(n):
if a[i]>=sou/(4*m):
cnt+=1
print('Yes' if cnt>=m else 'No')
| [
"call.remove"
] | 483,120 | 483,121 | u405660020 | python |
p02718 | n,m=map(int,input().split())
a=list(map(int, input().split()))
cnt=0
sou=sum(a)
for i in range(n):
if a[i]>=int(sou/(4*m)):
cnt+=1
print('Yes' if cnt>=m else 'No')
| n,m=map(int,input().split())
a=list(map(int, input().split()))
cnt=0
sou=sum(a)
for i in range(n):
if a[i]>=sou/(4*m):
cnt+=1
print('Yes' if cnt>=m else 'No')
| [
"control_flow.loop.for.condition.change",
"call.remove",
"control_flow.branch.if.condition.change"
] | 483,122 | 483,121 | u405660020 | python |
p02718 | n,m=map(int,input().split())
a=list(map(int, input().split()))
cnt=0
sou=sum(a)
for i in range(n):
if a[i]>=int(sou//(4*m)):
cnt+=1
print('Yes' if cnt>=m else 'No')
| n,m=map(int,input().split())
a=list(map(int, input().split()))
cnt=0
sou=sum(a)
for i in range(n):
if a[i]>=sou/(4*m):
cnt+=1
print('Yes' if cnt>=m else 'No')
| [
"control_flow.loop.for.condition.change",
"call.remove",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 483,123 | 483,121 | u405660020 | python |
p02718 | n,m=map(int,input().split())
a=list(map(int, input().split()))
cnt=0
sou=sum(a)
for i in range(n):
if a[i]>=(sou//(4*m)):
cnt+=1
print('Yes' if cnt>=m else 'No')
| n,m=map(int,input().split())
a=list(map(int, input().split()))
cnt=0
sou=sum(a)
for i in range(n):
if a[i]>=sou/(4*m):
cnt+=1
print('Yes' if cnt>=m else 'No')
| [
"control_flow.branch.if.condition.change",
"expression.operator.arithmetic.change"
] | 483,124 | 483,121 | u405660020 | python |
p02718 | n,m=map(int,input().split())
l=list(map(int,input().split()))
c=len([i for i in l if i > sum(l)/(4*m)])
print("Yes" if c>=m else "No") | n,m=map(int,input().split())
l=list(map(int,input().split()))
c=len([i for i in l if i >= sum(l)/(4*m)])
print("Yes" if c>=m else "No") | [
"expression.operator.compare.change",
"assignment.value.change",
"call.arguments.change"
] | 483,128 | 483,129 | u875855656 | python |
p02718 | N,M = map(int,input().split())
A = list(map(int,input().split()))
s = sum(A)
p = s/4/M
cnt = 0
for i in range(N):
if A[i] >= p:
cnt += 1
if cnt > M:
print("Yes")
else:
print("No") | N,M = map(int,input().split())
A = list(map(int,input().split()))
s = sum(A)
p = s/4/M
cnt = 0
for i in range(N):
if A[i] >= p:
cnt += 1
if cnt >= M:
print("Yes")
else:
print("No") | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 483,130 | 483,131 | u152334204 | python |
p02718 | N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
cnt = 0
for i in range(N):
if A[i] >= sum(A) // (4 * M):
cnt += 1
if cnt >= M:
print("Yes")
else:
print("No") | N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
cnt = 0
for i in range(N):
if A[i] >= sum(A) / (4 * M):
cnt += 1
if cnt >= M:
print("Yes")
else:
print("No") | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 483,136 | 483,137 | u250734103 | python |
p02718 | N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
cnt = 0
for i in range(N):
if A[i] > sum(A) / (4 * M):
cnt += 1
if cnt >= M:
print("Yes")
else:
print("No") | N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
cnt = 0
for i in range(N):
if A[i] >= sum(A) / (4 * M):
cnt += 1
if cnt >= M:
print("Yes")
else:
print("No") | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 483,138 | 483,137 | u250734103 | python |
p02718 | N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
cnt = 0
for i in range(N):
if A[i] > sum(A) / (4 * M):
cnt += 1
if cnt > M:
print("Yes")
else:
print("No") | N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
cnt = 0
for i in range(N):
if A[i] >= sum(A) / (4 * M):
cnt += 1
if cnt >= M:
print("Yes")
else:
print("No") | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 483,139 | 483,137 | u250734103 | python |
p02718 | n,m = map(int,input().split())
a = list(map(int,input().split()))
sum = 0
for i in range(a):
sum = sum + a[i]
sum_divided = sum/(4*m)
cnt = 0
for i in range(a):
if a[i] >= sum_divided:
cnt = cnt + 1
if cnt >= m:
print('Yes')
else:
print('No') | n,m = map(int,input().split())
a = list(map(int,input().split()))
sum = 0
for i in range(n):
sum = sum + a[i]
sum_divided = sum/(4*m)
cnt = 0
for i in range(n):
if a[i] >= sum_divided:
cnt = cnt + 1
if cnt >= m:
print('Yes')
else:
print('No') | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 483,142 | 483,143 | u704158845 | python |
p02718 | n,m = map(int, input().split())
a = sorted(list(map(int, input().split())), reverse=True)
t = int(sum(a)/(4*m))
for i in range(m):
if a[i] < t:
print("No")
exit()
print("Yes") | n,m = map(int, input().split())
a = sorted(list(map(int, input().split())), reverse=True)
t = sum(a)/(4*m)
for i in range(m):
if a[i] < t:
print("No")
exit()
print("Yes") | [
"call.remove",
"call.arguments.change"
] | 483,149 | 483,150 | u188827677 | python |
p02718 | import numpy as np
N, M = map(int, input().split())
A = np.array(input().split(), dtype=np.int16)
print(["Yes", "No"][(A > A.sum() / (4 * M)).sum() < M])
| import numpy as np
N, M = map(int, input().split())
A = np.array(input().split(), dtype=np.int16)
print(["Yes", "No"][(A >= A.sum() / (4 * M)).sum() < M])
| [
"expression.operator.compare.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"io.output.change"
] | 483,151 | 483,152 | u638282348 | python |
p02718 | N,M=map(int,(input().split()))
A=list(map(int,(input().split())))
count=0
for i in A:
if i >= (sum(A)/4*M):
count+=1
if count>=M:
print('Yes')
else:
print('No') | N,M=map(int,(input().split()))
A=list(map(int,(input().split())))
count=0
for i in A:
if i >= (sum(A)/(4*M)):
count+=1
if count>=M:
print('Yes')
else:
print('No') | [
"control_flow.branch.if.condition.change"
] | 483,153 | 483,154 | u875049118 | python |
p02718 | #! env/bin/local python3
# -*- coding:utf-8 -*-
is_first = True
while True:
try:
if is_first:
n, m = [int(i) for i in input().split()]
is_first = False
else:
arr = [int(i) for i in input().split()]
except EOFError:
break
total_vote = sum(arr)
sorted... | #! env/bin/local python3
# -*- coding:utf-8 -*-
is_first = True
while True:
try:
if is_first:
n, m = [int(i) for i in input().split()]
is_first = False
else:
arr = [int(i) for i in input().split()]
except EOFError:
break
total_vote = sum(arr)
sorted... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 483,162 | 483,163 | u018771977 | python |
p02718 | #! env/bin/local python3
# -*- coding:utf-8 -*-
is_first = True
while True:
try:
if is_first:
n, m = [int(i) for i in input().split()]
is_first = False
else:
arr = [int(i) for i in input().split()]
except EOFError:
break
total_vote = sum(arr)
sorted... | #! env/bin/local python3
# -*- coding:utf-8 -*-
is_first = True
while True:
try:
if is_first:
n, m = [int(i) for i in input().split()]
is_first = False
else:
arr = [int(i) for i in input().split()]
except EOFError:
break
total_vote = sum(arr)
sorted... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 483,164 | 483,163 | u018771977 | python |
p02718 | def readInts():
return list(map(int, input(), split()))
n, m = readInts()
a = readInts()
s = sum(a)
cnt = 0
for i in range(n):
if a[i]*4*m >=s:
cnt +=1
if cnt >= m:
print("Yes")
else:
print("No")
| def readInts():
return list(map(int, input().split()))
n, m = readInts()
a = readInts()
s = sum(a)
cnt = 0
for i in range(n):
if a[i]*4*m >=s:
cnt +=1
if cnt >= m:
print("Yes")
else:
print("No")
| [
"call.arguments.change",
"function.return_value.change"
] | 483,165 | 483,166 | u026545977 | python |
p02718 | import sys
sys.setrecursionlimit(10 ** 6)
# input = sys.stdin.readline ####
int1 = lambda x: int(x) - 1
def II(): return int(input())
def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().spl... | import sys
sys.setrecursionlimit(10 ** 6)
# input = sys.stdin.readline ####
int1 = lambda x: int(x) - 1
def II(): return int(input())
def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().spl... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 483,176 | 483,177 | u564589929 | python |
p02718 | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate
from math import sqrt, ceil, floor
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from math import gcd
import sys
def I(): return... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate
from math import sqrt, ceil, floor
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from math import gcd
import sys
def I(): return... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 483,178 | 483,179 | u279460955 | python |
p02718 | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate
from math import sqrt, ceil, floor
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from math import gcd
import sys
def I(): return... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate
from math import sqrt, ceil, floor
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from math import gcd
import sys
def I(): return... | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 483,180 | 483,179 | u279460955 | python |
p02718 | n, m = map(int, input().split())
a = list(map(int, input().split()))
sum = 0
for i in range(n):
sum += a[i]
border = sum / (4*m)
ans = 0
for i in range(n):
if a[i] > border:
ans += 1
if ans >= m:
print("Yes")
else:
print("No")
| n, m = map(int, input().split())
a = list(map(int, input().split()))
sum = 0
for i in range(n):
sum += a[i]
border = sum / (4*m)
ans = 0
for i in range(n):
if a[i] >= border:
ans += 1
if ans >= m:
print("Yes")
else:
print("No")
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 483,181 | 483,182 | u394040864 | python |
p02718 | n, m = map(int, input().split())
a = list(map(int, input().split()))
sum = 0
for i in range(n):
sum += a[i]
border = sum / (4*m)
ans = 0
for i in range(n):
if float(a[i]) > border:
ans += 1
if ans >= m:
print("Yes")
else:
print("No")
| n, m = map(int, input().split())
a = list(map(int, input().split()))
sum = 0
for i in range(n):
sum += a[i]
border = sum / (4*m)
ans = 0
for i in range(n):
if a[i] >= border:
ans += 1
if ans >= m:
print("Yes")
else:
print("No")
| [
"control_flow.loop.for.condition.change",
"call.remove",
"control_flow.branch.if.condition.change"
] | 483,183 | 483,182 | u394040864 | python |
p02718 | N,M = map(int, input().split())
A = sorted(list (map(int, input() .split() ) ) )
if A[M-1] >= sum(A)/M/4 :
print( 'Yes' )
else :
print( 'No' ) | N,M = map(int, input().split())
A = sorted(list (map(int, input() .split() ) ) )
if A[N-M] >= sum(A)/M/4 :
print( 'Yes' )
else :
print( 'No' ) | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"identifier.replace.add",
"literal.replace.remove"
] | 483,205 | 483,206 | u070379349 | python |
p02718 | N,M = map(int,input().split())
A = list(map(int,input().split()))
s = sum(A)
A = sorted(A, reverse = True)
if A[M-1] >= s//(4*M):
print("Yes")
else:
print("No") | N,M = map(int,input().split())
A = list(map(int,input().split()))
s = sum(A)
A = sorted(A, reverse = True)
if A[M-1] >= s/(4*M):
print("Yes")
else:
print("No") | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 483,207 | 483,208 | u442877951 | python |
p02718 | N,M=map(int,input().split())
a=list(map(int,input().split()))
a=sorted(a, reversed =True)
if sum(a)/(4*M)<=a[M-1]:
print("Yes")
else:
print("No") | N,M=map(int,input().split())
a=list(map(int,input().split()))
a=sorted(a, reverse=True)
if sum(a)/(4*M)<=a[M-1]:
print("Yes")
else:
print("No") | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"call.arguments.keyword_argument.near.change"
] | 483,209 | 483,210 | u646203242 | python |
p02718 | N,M=map(int,input().split())
A=list(map(int,input().split()))
A.sort(reverse=True)
if A[M-1] > sum(A)/(4*M):
print('Yes')
else:
print('No') | N,M=map(int,input().split())
A=list(map(int,input().split()))
A.sort(reverse=True)
if A[M-1] >= sum(A)/(4*M):
print('Yes')
else:
print('No') | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 483,222 | 483,223 | u737718679 | python |
p02718 | n,m=map(int,input().split())
a=list(map(int,input().split()))
s = sum(a)
a.sort()
a.reverse()
for i in range(n):
if i >= m:
print('Yes')
exit()
if a[i]*4*m < s:
print('No')
exit() | n,m=map(int,input().split())
a=list(map(int,input().split()))
s = sum(a)
a.sort()
a.reverse()
for i in range(n):
if i >= m:
print('Yes')
exit()
if a[i]*4*m < s:
print('No')
exit()
print('Yes') | [
"call.add"
] | 483,238 | 483,239 | u566529875 | python |
p02718 | N,M = list(map(int,input().split()))
A = list(map(int,input().split()))
total = sum(A)
selcnt = 0
for a_i in sorted(A):
if a_i < total * (1/(4*M)):
break
selcnt += 1
if selcnt >= M:
print("Yes")
else:
print("No")
| N,M = list(map(int,input().split()))
A = list(map(int,input().split()))
total = sum(A)
selcnt = 0
for a_i in reversed(sorted(A)):
if a_i < total * (1/(4*M)):
break
selcnt += 1
if selcnt >= M:
print("Yes")
else:
print("No")
| [
"call.add",
"call.arguments.change"
] | 483,240 | 483,241 | u676933207 | python |
p02718 | # B - Popular Vote
# https://atcoder.jp/contests/abc161/tasks/abc161_bß
# N 商品の種類数
# M 選択したい商品数
# votes 各商品ごとの投票数
N,M = list(map(int,input().split()))
votes = list(map(int,input().split()))
# 総投票数
total_vote = 0
# 総投票数算出
for vote in votes:
total_vote += vote
# 購入できる商品数
i = 0
for vote in votes:
# 得票数が総投票数の ... | # B - Popular Vote
# https://atcoder.jp/contests/abc161/tasks/abc161_bß
# N 商品の種類数
# M 選択したい商品数
# votes 各商品ごとの投票数
N,M = list(map(int,input().split()))
votes = list(map(int,input().split()))
# 総投票数
total_vote = 0
# 総投票数算出
for vote in votes:
total_vote += vote
# 購入できる商品数
i = 0
for vote in votes:
# 得票数が総投票数の ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 483,242 | 483,243 | u189089176 | python |
p02718 | n, m = map(int, input().split())
A = list(map(int, input().split()))
A.sort(reverse=True)
chk = True
s = sum(A)
for i in range(m):
if A[i] >= s//(4*m):
pass
else:
chk = False
if chk == True:
print('Yes')
else:
print('No') | n, m = map(int, input().split())
A = list(map(int, input().split()))
A.sort(reverse=True)
chk = True
s = sum(A)
for i in range(m):
if A[i] >= s/(4*m):
pass
else:
chk = False
if chk == True:
print('Yes')
else:
print('No') | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 483,250 | 483,251 | u673173160 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.