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 |
|---|---|---|---|---|---|---|---|
p02779
|
n = int(input())
s = set(map(int,input().split()))
print('YNeos'[n!=len(s)::2])
|
n = int(input())
s = set(map(int,input().split()))
print('YNEOS'[n!=len(s)::2])
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,700
| 578,701
|
u410118019
|
python
|
p02779
|
n = int(input())
a = [int(i) for i in input().split()]
a1 = set(a)
if len(a) != len(a1):
print('No')
else:
print('Yes')
|
n = int(input())
a = [int(i) for i in input().split()]
a1 = set(a)
if len(a) != len(a1):
print('NO')
else:
print('YES')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,702
| 578,703
|
u934788990
|
python
|
p02779
|
n=int(input())
a= list(map(int, input().split()))
if len(a)==n:
print("YES")
else:
print("NO")
|
n=int(input())
a= list(map(int, input().split()))
if len(set(a))==n:
print("YES")
else:
print("NO")
|
[
"control_flow.branch.if.condition.change",
"call.add"
] | 578,712
| 578,713
|
u063073794
|
python
|
p02779
|
N = int(input())
A = list(map(int, input().split()))
A = sorted(A)
def solution(N, A):
for i in range(N - 1):
if A[i] == A[i + 1]:
return "No"
return "Yes"
print(solution(N, A))
|
N = int(input())
A = list(map(int, input().split()))
A = sorted(A)
def solution(N, A):
for i in range(N - 1):
if A[i] == A[i + 1]:
return "NO"
return "YES"
print(solution(N, A))
|
[
"literal.string.change",
"literal.string.case.change",
"function.return_value.change"
] | 578,714
| 578,715
|
u390901183
|
python
|
p02779
|
N = int(input())
A = list(map(int, input().split()))
def has_duplicates(seq):
return len(seq) != len(set(seq))
l = A
if has_duplicates(l):
print("No")
else:
print("Yes")
|
N = int(input())
A = list(map(int, input().split()))
def has_duplicates(seq):
return len(seq) != len(set(seq))
l = A
if has_duplicates(l):
print("NO")
else:
print("YES")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,722
| 578,723
|
u579832365
|
python
|
p02779
|
def main(n, a):
if len(set(a)) == n:
print("YES")
else:
print("NO")
if __name__ == "__main__":
n = int(input())
a = list(map(int, input().split()))
map(n, a)
|
def main(n, a):
if len(set(a)) == n:
print("YES")
else:
print("NO")
if __name__ == "__main__":
n = int(input())
a = list(map(int, input().split()))
main(n, a)
|
[
"identifier.change",
"call.function.change"
] | 578,724
| 578,725
|
u977642052
|
python
|
p02779
|
# A = input()
# A = int(input())
# A = map(int, input().split())
# A = list(map(int, input().split()))
# A = [int(input()) for i in range(N)]
#
# c = collections.Counter()
import collections
N = int(input())
A = list(map(int, input().split()))
c = collections.Counter(A)
if c.most_common()[0][1] == 1:
print('Yes')
else:
print('No')
|
# A = input()
# A = int(input())
# A = map(int, input().split())
# A = list(map(int, input().split()))
# A = [int(input()) for i in range(N)]
#
# c = collections.Counter()
import collections
N = int(input())
A = list(map(int, input().split()))
c = collections.Counter(A)
if c.most_common()[0][1] == 1:
print('YES')
else:
print('NO')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,726
| 578,727
|
u671446913
|
python
|
p02779
|
N = int(input())
A = list(map(int, input().split()))
s = set(A)
if len(s) == N:
print("Yes")
else:
print("No")
|
N = int(input())
A = list(map(int, input().split()))
s = set(A)
if len(s) == N:
print("YES")
else:
print("NO")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,730
| 578,731
|
u121192152
|
python
|
p02779
|
def main():
N=int(input())
A=list(map(int, input().split()))
A=sorted(A)
a=A[0]
for i in range(1,N):
if a==A[i]:
print('No')
return
else:
a=A[i]
print('Yes')
return
main()
|
def main():
N=int(input())
A=list(map(int, input().split()))
A=sorted(A)
a=A[0]
for i in range(1,N):
if a==A[i]:
print('NO')
return
else:
a=A[i]
print('YES')
return
main()
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,742
| 578,743
|
u058809975
|
python
|
p02779
|
N = int(input())
A = list(map(int,input().split()))
if len(A) == len(set(A)):
print("Yes")
else:
print("No")
|
N = int(input())
A = list(map(int,input().split()))
if len(A) == len(set(A)):
print("YES")
else:
print("NO")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,750
| 578,751
|
u100277898
|
python
|
p02779
|
n=int(input())
num=[int(i) for i in input().split()]
if len(num)==len(set(num)):
print('Yes')
else:
print('No')
|
n=int(input())
num=[int(i) for i in input().split()]
if len(num)==len(set(num)):
print('YES')
else:
print('NO')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,752
| 578,753
|
u561231954
|
python
|
p02779
|
n=int(input())
l1=list(map(int,input().split()))
l2=list(set(l1))
L2=len(l2)
print('Yes' if n==L2 else 'No')
|
n=int(input())
l1=list(map(int,input().split()))
l2=list(set(l1))
L2=len(l2)
print('YES' if n==L2 else 'NO')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,756
| 578,757
|
u371409687
|
python
|
p02779
|
n = int(input())
a = list(map(int,input().split()))
if(len(a) == len(set(a))):
print('Yes')
else:
print('No')
|
n = int(input())
a = list(map(int,input().split()))
if(len(a) == len(set(a))):
print('YES')
else:
print('NO')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,766
| 578,767
|
u350836088
|
python
|
p02779
|
N = int(input())
A = list(map(int, input().split()))
a = set(A)
if len(A) == len(a):
print("Yes")
else:
print("No")
|
N = int(input())
A = list(map(int, input().split()))
a = set(A)
if len(A) == len(a):
print("YES")
else:
print("NO")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,768
| 578,769
|
u463858127
|
python
|
p02779
|
N = int(input())
A = sorted(map(int,input().split()))
for i in range(len(A)-1):
if A[i]==A[i+1]:
print('No')
exit()
print('Yes')
|
N = int(input())
A = sorted(map(int,input().split()))
for i in range(len(A)-1):
if A[i]==A[i+1]:
print('NO')
exit()
print('YES')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,778
| 578,779
|
u744920373
|
python
|
p02779
|
n = int(input())
lst = list(map(int, input().split()))
def has_duplicates(seq):
return len(seq) != len(set(seq))
if has_duplicates(lst)==True:
print("No")
else:
print("Yes")
|
n = int(input())
lst = list(map(int, input().split()))
def has_duplicates(seq):
return len(seq) != len(set(seq))
if has_duplicates(lst)==True:
print("NO")
else:
print("YES")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 578,784
| 578,785
|
u189326411
|
python
|
p02774
|
import numpy as np
def count_pair(x):
cnt = 0
cnt += (n-np.searchsorted(A, x//A_nega, side='right')).sum()
if x > 0:
cnt += len(A_zero)*n
cnt += np.searchsorted(A, -(-x//A_posi), side='left').sum()
cnt = (cnt-(A**2 < x).sum())//2
return cnt
n, k = map(int, input().split())
* A, = map(int, input().split())
A = np.array(A)
A = np.sort(A)
A_posi = A[A > 0]
A_zero = A[A == 0]
A_nega = A[A < 0]
inf = 10**18+1
l, r = -inf, inf
while r - l > 1:
c = (l + r) // 2
if count_pair(c) < K:
l = c
else:
r = c
print(l)
|
import numpy as np
def count_pair(x):
cnt = 0
cnt += (n-np.searchsorted(A, x//A_nega, side='right')).sum()
if x > 0:
cnt += len(A_zero)*n
cnt += np.searchsorted(A, -(-x//A_posi), side='left').sum()
cnt = (cnt-(A**2 < x).sum())//2
return cnt
n, k = map(int, input().split())
* A, = map(int, input().split())
A = np.array(A)
A = np.sort(A)
A_posi = A[A > 0]
A_zero = A[A == 0]
A_nega = A[A < 0]
inf = 10**18+1
l, r = -inf, inf
while r - l > 1:
c = (l + r) // 2
if count_pair(c) < k:
l = c
else:
r = c
print(l)
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 578,788
| 578,789
|
u997641430
|
python
|
p02774
|
import numpy as np
N, K = map(int, input().split())
A = np.array(list(map(int, input().split())))
A = np.sort(A)
G = A[A > 0]
Z = A[A == 0]
L = A[A < 0]
l, r = 10**18, -10**18
while l-r > 1:
# 「積がm以下になるペアの数」を調べる。
m = (l+r) // 2
# A[A > 0]内から条件を満たすものの数?
Pk = np.searchsorted(A, m//G, side="right").sum()
# A[A < 0]内から条件を満たすものの数?
Nk = (N - np.searchsorted(A, (-m-1)//(-L), side="right")).sum()
# 同じ要素同士の積は重複しているため、条件を満たしていたら減らす
duplicate = np.count_nonzero(A*A < m)
# A[0]内から条件を満たすものの数?
Zk = 0
if m >= 0:
Zk += len(Z) * N
# 条件を満たす要素の数を合わせる
k = Pk + Nk + Zk - duplicate
# 全要素が二重になっている。重複要素を削除
k //= 2
# 条件を満たさないならmを低く、満たすならmを高くする
if k >= K:
l = m
else:
r = m
#lとrが一致すればmが一意に定まる
print(l)
|
import numpy as np
N, K = map(int, input().split())
A = np.array(list(map(int, input().split())))
A = np.sort(A)
G = A[A > 0]
Z = A[A == 0]
L = A[A < 0]
l, r = 10**18, -10**18
while l-r > 1:
# 「積がm以下になるペアの数」を調べる。
m = (l+r) // 2
# A[A > 0]内から条件を満たすものの数?
Pk = np.searchsorted(A, m//G, side="right").sum()
# A[A < 0]内から条件を満たすものの数?
Nk = (N - np.searchsorted(A, (-m-1)//(-L), side="right")).sum()
# 同じ要素同士の積は重複しているため、条件を満たしていたら減らす
duplicate = np.count_nonzero(A*A <= m)
# A[0]内から条件を満たすものの数?
Zk = 0
if m >= 0:
Zk += len(Z) * N
# 条件を満たす要素の数を合わせる
k = Pk + Nk + Zk - duplicate
# 全要素が二重になっている。重複要素を削除
k //= 2
# 条件を満たす要素数kがK個以上ならmを低く、Kより少ないならmを高くする
if k >= K:
l = m
else:
r = m
#lとrが一致すればmが一意に定まる
print(l)
|
[
"expression.operator.compare.change",
"assignment.value.change",
"call.arguments.change"
] | 578,793
| 578,794
|
u875541136
|
python
|
p02774
|
import sys
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7
def comb(n, k):
p, q = 1, 1
for i in range(1, k+1):
p = p * (n-i+1)
q = q * i
return p // q
def binsearch(l, r, f):
while r - l > 1:
c = (r + l) // 2
if f(c):
r = c
else:
l = c
return r
N, K = rl()
A = rl()
pos = 0
neg = 0
zero = 0
Ap = []
An = []
for a in A:
if a > 0:
pos += 1
Ap.append(a)
elif a < 0:
neg += 1
An.append(a)
else:
zero += 1
Ap.sort()
An.sort()
n_pos = comb(pos, 2) + comb(neg, 2)
n_neg = pos * neg
n_zero = zero*(N-zero) + comb(zero, 2)
def num_gt(A, x):
j = len(A) - 1
cnt = 0
for i in range(len(A)):
while i < j and A[i] * A[j] > x:
j -= 1
if i >= j:
break
cnt += max(j - i, 0)
return cnt
def num_gt2(A, B, x):
j = len(B) - 1
cnt = 0
for i in range(len(A)):
while j > 0 and A[i] * B[j] > x:
j -= 1
if j < 0:
break
cnt += max(j+1, 0)
return cnt
def check_plus(x):
cnt = n_neg + n_zero
cnt += num_gt(Ap, x)
cnt += num_gt(list(reversed(An)), x)
return cnt >= K
def check_minus(x):
cnt = num_gt2(Ap, An, x)
return cnt >= K
ans = 0
if K <= n_neg:
l = An[0] * Ap[-1] - 1
r = 0
ans = binsearch(l, r, check_minus)
elif K <= n_neg + n_zero:
ans = 0
else:
l = 0
r = 1
if len(Ap) >= 2:
r = max(r, Ap[-1] * Ap[-2]) + 1
if len(An) >= 2:
r = max(r, An[0] * An[1]) + 1
ans = binsearch(l, r, check_plus)
print(ans)
|
import sys
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7
def comb(n, k):
p, q = 1, 1
for i in range(1, k+1):
p = p * (n-i+1)
q = q * i
return p // q
def binsearch(l, r, f):
while r - l > 1:
c = (r + l) // 2
if f(c):
r = c
else:
l = c
return r
N, K = rl()
A = rl()
pos = 0
neg = 0
zero = 0
Ap = []
An = []
for a in A:
if a > 0:
pos += 1
Ap.append(a)
elif a < 0:
neg += 1
An.append(a)
else:
zero += 1
Ap.sort()
An.sort()
n_pos = comb(pos, 2) + comb(neg, 2)
n_neg = pos * neg
n_zero = zero*(N-zero) + comb(zero, 2)
def num_gt(A, x):
j = len(A) - 1
cnt = 0
for i in range(len(A)):
while i < j and A[i] * A[j] > x:
j -= 1
if i >= j:
break
cnt += max(j - i, 0)
return cnt
def num_gt2(A, B, x):
j = len(B) - 1
cnt = 0
for i in reversed(range(len(A))):
while j >= 0 and A[i] * B[j] > x:
j -= 1
if j < 0:
break
cnt += max(j+1, 0)
return cnt
def check_plus(x):
cnt = n_neg + n_zero
cnt += num_gt(Ap, x)
cnt += num_gt(list(reversed(An)), x)
return cnt >= K
def check_minus(x):
cnt = num_gt2(Ap, An, x)
return cnt >= K
ans = 0
if K <= n_neg:
l = An[0] * Ap[-1] - 1
r = 0
ans = binsearch(l, r, check_minus)
elif K <= n_neg + n_zero:
ans = 0
else:
l = 0
r = 1
if len(Ap) >= 2:
r = max(r, Ap[-1] * Ap[-2]) + 1
if len(An) >= 2:
r = max(r, An[0] * An[1]) + 1
ans = binsearch(l, r, check_plus)
print(ans)
|
[
"call.add",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 578,807
| 578,808
|
u596505843
|
python
|
p02774
|
N,K = map(int,input().split())
A = [int(i) for i in input().split()]
A = sorted(A)
B = []
C = []
D = []
for i in range(len(A)):
if A[i] < 0:
B.append(A[i])
elif A[i] == 0:
C.append(A[i])
else:
D.append(A[i])
b = len(B)
c = len(C)
d = len(D)
def f(n):#積がn以下になる組み合わせの個数
if n <= 0:
i = 0
j = 0
k = 0
while i < b and j < d:
if B[i]*D[j] > n:
j += 1
else:
i += 1
k += d-j
return k
elif n == 0:
return (c*(c-1))//2 + b*c + b*d + c*d
else:
i = 0
j = b-1
k = 0
while i < b and j > -1:
if B[i]*B[j] > n:
i += 1
k += j+1
else:
j -= 1
k = b**2-k
i = 0
j = d-1
while i < d and j > -1:
if D[i]*D[j] <= n:
i += 1
k += j+1
else:
j -= 1
l = 0
for i in range(b):
if B[i]**2 <= n:
l += 1
for i in range(d):
if D[i]**2 <= n:
l += 1
return (k-l)//2 + (c*(c-1))//2 + b*c + b*d + c*d
l = - 10**18
h = 10**18
while l+1 < h:
m = (l+h)//2
if f(m) >= K:
h = m
else:
l = m
print(h)
|
N,K = map(int,input().split())
A = [int(i) for i in input().split()]
A = sorted(A)
B = []
C = []
D = []
for i in range(len(A)):
if A[i] < 0:
B.append(A[i])
elif A[i] == 0:
C.append(A[i])
else:
D.append(A[i])
b = len(B)
c = len(C)
d = len(D)
def f(n):#積がn以下になる組み合わせの個数
if n < 0:
i = 0
j = 0
k = 0
while i < b and j < d:
if B[i]*D[j] > n:
j += 1
else:
i += 1
k += d-j
return k
elif n == 0:
return (c*(c-1))//2 + b*c + b*d + c*d
else:
i = 0
j = b-1
k = 0
while i < b and j > -1:
if B[i]*B[j] > n:
i += 1
k += j+1
else:
j -= 1
k = b**2-k
i = 0
j = d-1
while i < d and j > -1:
if D[i]*D[j] <= n:
i += 1
k += j+1
else:
j -= 1
l = 0
for i in range(b):
if B[i]**2 <= n:
l += 1
for i in range(d):
if D[i]**2 <= n:
l += 1
return (k-l)//2 + (c*(c-1))//2 + b*c + b*d + c*d
l = - 10**18
h = 10**18
while l+1 < h:
m = (l+h)//2
if f(m) >= K:
h = m
else:
l = m
print(h)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 578,817
| 578,818
|
u119148115
|
python
|
p02774
|
N,K = map(int,input().split())
A = [int(i) for i in input().split()]
A = sorted(A)
B = []
C = []
D = []
for i in range(len(A)):
if A[i] < 0:
B.append(A[i])
elif A[i] == 0:
C.append(A[i])
else:
D.append(A[i])
b = len(B)
c = len(C)
d = len(D)
def f(n):
if n <= 0:
i = 0
j = 0
k = 0
while i < b and j < d:
if B[i]*D[j] > n:
j += 1
else:
i += 1
k += d-j
return k
elif n == 0:
return (c*(c-1))//2 + b*c + b*d + c*d
else:
i = 0
j = b-1
k = 0
while i < b and j > -1:
if B[i]*B[j] > n:
i += 1
k += j+1
else:
j -= 1
k = b**2-k
i = 0
j = d-1
while i < d and j > -1:
if D[i]*D[j] <= n:
i += 1
k += j+1
else:
j -= 1
l = 0
for i in range(b):
if B[i]**2 <= n:
l += 1
for i in range(d):
if D[i]**2 <= n:
l += 1
return (k-l)//2 + (c*(c-1))//2 + b*c + b*d + c*d
l = - 10**18
h = 10**18
while l+1 < h:
m = (l+h)//2
if f(m) >= K:
h = m
else:
l = m
print(m)
|
N,K = map(int,input().split())
A = [int(i) for i in input().split()]
A = sorted(A)
B = []
C = []
D = []
for i in range(len(A)):
if A[i] < 0:
B.append(A[i])
elif A[i] == 0:
C.append(A[i])
else:
D.append(A[i])
b = len(B)
c = len(C)
d = len(D)
def f(n):#積がn以下になる組み合わせの個数
if n < 0:
i = 0
j = 0
k = 0
while i < b and j < d:
if B[i]*D[j] > n:
j += 1
else:
i += 1
k += d-j
return k
elif n == 0:
return (c*(c-1))//2 + b*c + b*d + c*d
else:
i = 0
j = b-1
k = 0
while i < b and j > -1:
if B[i]*B[j] > n:
i += 1
k += j+1
else:
j -= 1
k = b**2-k
i = 0
j = d-1
while i < d and j > -1:
if D[i]*D[j] <= n:
i += 1
k += j+1
else:
j -= 1
l = 0
for i in range(b):
if B[i]**2 <= n:
l += 1
for i in range(d):
if D[i]**2 <= n:
l += 1
return (k-l)//2 + (c*(c-1))//2 + b*c + b*d + c*d
l = - 10**18
h = 10**18
while l+1 < h:
m = (l+h)//2
if f(m) >= K:
h = m
else:
l = m
print(h)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 578,820
| 578,818
|
u119148115
|
python
|
p02774
|
import numpy as np
n,k = map(int,input().split())
a = np.array(list(map(int,input().split())))
a.sort()
posi = a[a>0]
zero = a[a==0]
nega = a[a<0]
def cnt(x):
c = 0
if x >= 0:
c += len(zero)*n
c += np.searchsorted(a, x // posi, side = 'right').sum()
c += n-np.searchsorted(a, (- x - 1) // (-nega), side = 'right').sum()
c -= np.count_nonzero(a * a <= x)
return c // 2
l = - 10 ** 18
r = 10 ** 18
while l + 1 < r:
m = (l + r) // 2
if cnt(m) < k:
l = m
else:
r = m
print(r)
|
import numpy as np
n,k = map(int,input().split())
a = np.array(list(map(int,input().split())))
a.sort()
posi = a[a>0]
zero = a[a==0]
nega = a[a<0]
def cnt(x):
c = 0
if x >= 0:
c += len(zero)*n
c += np.searchsorted(a, x // posi, side = 'right').sum()
c += (n-np.searchsorted(a, (- x - 1) // (-nega), side = 'right')).sum()
c -= np.count_nonzero(a * a <= x)
return c // 2
l = - 10 ** 18
r = 10 ** 18
while l + 1 < r:
m = (l + r) // 2
if cnt(m) < k:
l = m
else:
r = m
print(r)
|
[] | 578,821
| 578,822
|
u371409687
|
python
|
p02774
|
import numpy as np
N, K = map(int,input().split())
A = np.array(list(map(int,input().split())))
A.sort()
posi = A[A > 0]
zero = A[A == 0]
nega = A[A < 0]
# 積がx以下の組を求める
def check(x):
count = 0 # 積がx以下の組
if x >= 0:
count += len(zero) * N # zero * N
count += np.searchsorted(A, x // posi, side = 'right').sum() # posi * N
count += np.searchsorted(A, (-x - 1) // (-nega), side = 'right').sum() # nega * N
count -= np.count_nonzero(A * A <= x) # 自分自身との組
return count // 2 #重複を消す
# 二分探索
low = -10 ** 18
high = 10 ** 18
while low + 1 < high:
mid = (low + high) // 2
if check(mid) < K: # OK
low = mid
else: # NG
high = mid
print(high)
|
import numpy as np
N, K = map(int,input().split())
A = np.array(list(map(int,input().split())))
A.sort()
posi = A[A > 0]
zero = A[A == 0]
nega = A[A < 0]
# 積がx以下の組を求める
def check(x):
count = 0 # 積がx以下の組
if x >= 0:
count += len(zero) * N # zero * N
count += np.searchsorted(A, x // posi, side = 'right').sum() # posi * N
count += (N - np.searchsorted(A, (-x - 1) // (-nega), side = 'right')).sum() # nega * N
count -= np.count_nonzero(A * A <= x) # 自分自身との組
return count // 2 #重複を消す
# 二分探索
low = -10 ** 18
high = 10 ** 18
while low + 1 < high:
mid = (low + high) // 2
if check(mid) < K: # OK
low = mid
else: # NG
high = mid
print(high)
|
[] | 578,844
| 578,845
|
u065040863
|
python
|
p02774
|
import numpy as np
N, K = map(int,input().split())
A = np.array(list(map(int,input().split())))
A.sort()
posi = A[A > 0]
zero = A[A == 0]
nega = A[A < 0]
# 積がx以下の組を求める
def check(x):
count = 0 # 積がx以下の組
if x >= 0:
count += len(zero) * N # zero * N
count += np.searchsorted(A, x // posi, side = 'right').sum() # posi * N
count += np.searchsorted(A, (-x - 1) // (-nega), side = 'left').sum() # nega * N
count -= np.count_nonzero(A * A <= x) # 自分自身との組
return count // 2 #重複を消す
# 二分探索
low = -10 ** 18
high = 10 ** 18
while low + 1 < high:
mid = (low + high) // 2
if check(mid) < K: # OK
low = mid
else: # NG
high = mid
print(high)
|
import numpy as np
N, K = map(int,input().split())
A = np.array(list(map(int,input().split())))
A.sort()
posi = A[A > 0]
zero = A[A == 0]
nega = A[A < 0]
# 積がx以下の組を求める
def check(x):
count = 0 # 積がx以下の組
if x >= 0:
count += len(zero) * N # zero * N
count += np.searchsorted(A, x // posi, side = 'right').sum() # posi * N
count += (N - np.searchsorted(A, (-x - 1) // (-nega), side = 'right')).sum() # nega * N
count -= np.count_nonzero(A * A <= x) # 自分自身との組
return count // 2 #重複を消す
# 二分探索
low = -10 ** 18
high = 10 ** 18
while low + 1 < high:
mid = (low + high) // 2
if check(mid) < K: # OK
low = mid
else: # NG
high = mid
print(high)
|
[
"literal.string.change",
"call.arguments.change",
"call.arguments.keyword_argument.change"
] | 578,846
| 578,845
|
u065040863
|
python
|
p02774
|
from bisect import bisect_left, bisect_right
def count(x, li1, li2, p):
cnt = 0
now = len(li2)-1 if p else 0
for ind, i in enumerate(li1):
rng = range(now, -1, -1) if p else range(now, len(li2))
for j in rng:
if p and ind==j:
continue
if i*li2[j]<x:
# print(cnt, ind, j)
cnt += j+1 if p else len(li2)-j
cnt -= 1 if p and ind<j else 0
now = j
break
else:
break
return cnt//2 if p else cnt
def bisect(ok, ng, solve):
while abs(ok-ng)>1:
mid = (ok+ng)//2
if solve(mid):
ok = mid
else:
ng = mid
return ok
def p_solve(x):
tmp = count(x, posi, posi, True)
tmp += count(x, nega[::-1], nega[::-1], True)
# print(x, tmp)
return np*nn+nn*nz+nz*np+nz*(nz-1)//2+tmp < k
def n_solve(x):
return count(x, nega, posi, False) < k
n, k = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
nega = a[:bisect_left(a, 0)]
posi = a[bisect_right(a, 0):]
np = len(posi)
nn = len(nega)
nz = n - np - nn
if k <= np*nn:
ans = bisect(nega[0]*posi[-1]-1, 0, n_solve)
elif k <= np*nn+nn*nz+nz*np+nz*(nz-1)//2:
ans = 0
else:
ma = 0
if len(nega)>1:
ma = nega[-1]*nega[-2]
if len(posi)>1 and ma<posi[-1]*posi[-2]:
ma = posi[-1]*posi[-2]
ans = bisect(1, ma+1, p_solve)
print(ans)
|
from bisect import bisect_left, bisect_right
def count(x, li1, li2, p):
cnt = 0
now = len(li2)-1 if p else 0
for ind, i in enumerate(li1):
rng = range(now, -1, -1) if p else range(now, len(li2))
for j in rng:
if p and ind==j:
continue
if i*li2[j]<x:
# print(cnt, ind, j)
cnt += j+1 if p else len(li2)-j
cnt -= 1 if p and ind<j else 0
now = j
break
else:
break
return cnt//2 if p else cnt
def bisect(ok, ng, solve):
while abs(ok-ng)>1:
mid = (ok+ng)//2
if solve(mid):
ok = mid
else:
ng = mid
return ok
def p_solve(x):
tmp = count(x, posi, posi, True)
tmp += count(x, nega[::-1], nega[::-1], True)
# print(x, tmp)
return np*nn+nn*nz+nz*np+nz*(nz-1)//2+tmp < k
def n_solve(x):
return count(x, nega, posi, False) < k
n, k = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
nega = a[:bisect_left(a, 0)]
posi = a[bisect_right(a, 0):]
np = len(posi)
nn = len(nega)
nz = n - np - nn
if k <= np*nn:
ans = bisect(nega[0]*posi[-1]-1, 0, n_solve)
elif k <= np*nn+nn*nz+nz*np+nz*(nz-1)//2:
ans = 0
else:
ma = 0
if len(nega)>1:
ma = nega[0]*nega[1]
if len(posi)>1 and ma<posi[-1]*posi[-2]:
ma = posi[-1]*posi[-2]
ans = bisect(1, ma+1, p_solve)
print(ans)
|
[
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.unary.remove"
] | 578,870
| 578,871
|
u318127926
|
python
|
p02774
|
from bisect import bisect_left, bisect_right
def count(x, li1, li2, p):
cnt = 0
now = len(li2)-1 if p else 0
for ind, i in enumerate(li1):
rng = range(now, -1, -1) if p else range(now, len(li2))
for j in rng:
if p and ind==j:
continue
if i*li2[j]<x:
# print(cnt, ind, j)
cnt += j+1 if p else len(li2)-j
cnt -= 1 if p and ind<j else 0
now = j
break
else:
break
return cnt//2 if p else cnt
def bisect(ok, ng, solve):
while abs(ok-ng)>1:
mid = (ok+ng)//2
if solve(mid):
ok = mid
else:
ng = mid
return ok
def p_solve(x):
tmp = count(x, posi, posi, True)
tmp += count(x, nega[::-1], nega[::-1], True)
# print(x, tmp)
return np*nn+nn*nz+nz*np+nz*(nz-1)//2+tmp < k
def n_solve(x):
return count(x, nega, posi, False) < k
n, k = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
nega = a[:bisect_left(a, 0)]
posi = a[bisect_right(a, 0):]
np = len(posi)
nn = len(nega)
nz = n - np - nn
if k <= np*nn:
ans = bisect(nega[0]*posi[-1], 0, n_solve)
elif k <= np*nn+nn*nz+nz*np+nz*(nz-1)//2:
ans = 0
else:
ma = 0
if len(nega)>1:
ma = nega[-1]*nega[-2]
if len(posi)>1 and ma<posi[-1]*posi[-2]:
ma = posi[-1]*posi[-2]
ans = bisect(1, ma+1, p_solve)
print(ans)
|
from bisect import bisect_left, bisect_right
def count(x, li1, li2, p):
cnt = 0
now = len(li2)-1 if p else 0
for ind, i in enumerate(li1):
rng = range(now, -1, -1) if p else range(now, len(li2))
for j in rng:
if p and ind==j:
continue
if i*li2[j]<x:
# print(cnt, ind, j)
cnt += j+1 if p else len(li2)-j
cnt -= 1 if p and ind<j else 0
now = j
break
else:
break
return cnt//2 if p else cnt
def bisect(ok, ng, solve):
while abs(ok-ng)>1:
mid = (ok+ng)//2
if solve(mid):
ok = mid
else:
ng = mid
return ok
def p_solve(x):
tmp = count(x, posi, posi, True)
tmp += count(x, nega[::-1], nega[::-1], True)
# print(x, tmp)
return np*nn+nn*nz+nz*np+nz*(nz-1)//2+tmp < k
def n_solve(x):
return count(x, nega, posi, False) < k
n, k = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
nega = a[:bisect_left(a, 0)]
posi = a[bisect_right(a, 0):]
np = len(posi)
nn = len(nega)
nz = n - np - nn
if k <= np*nn:
ans = bisect(nega[0]*posi[-1]-1, 0, n_solve)
elif k <= np*nn+nn*nz+nz*np+nz*(nz-1)//2:
ans = 0
else:
ma = 0
if len(nega)>1:
ma = nega[0]*nega[1]
if len(posi)>1 and ma<posi[-1]*posi[-2]:
ma = posi[-1]*posi[-2]
ans = bisect(1, ma+1, p_solve)
print(ans)
|
[
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.unary.remove"
] | 578,872
| 578,871
|
u318127926
|
python
|
p02780
|
n, k = map(int,input().split())
p = list(map(lambda x:int(x)+1,input().split()))
s = [0]*(n+1)
for i in range(n):
s[i+1] = s[i] + p[i]
res = 0
for i in range(n-k):
res = max(res,s[i+k]-s[i])
print(res/2)
|
n, k = map(int,input().split())
p = list(map(lambda x:int(x)+1,input().split()))
s = [0]*(n+1)
for i in range(n):
s[i+1] = s[i] + p[i]
res = 0
for i in range(n-k+1):
res = max(res,s[i+k]-s[i])
print(res/2)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 578,990
| 578,991
|
u607563136
|
python
|
p02780
|
import bisect, collections, copy, heapq, itertools, math, string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
from collections import defaultdict
from collections import Counter
import bisect
def main():
N, K = MI()
P = LI()
a = sum(P[0:K])
Sums = []
Sum = 0
for i in range(N):
Sum += P[i]
Sums.append(Sum)
ans = [0, 0, 0]
for i in range(K, N):
X = Sums[i] - Sums[i - K]
if X > ans[0]:
ans[0] = X
ans[1] = i - K + 1
ans[2] = i
cnt = 0
for i in range(ans[1], ans[2] + 1):
cnt += (P[i] + 1) / 2
print(cnt)
if __name__ == "__main__":
main()
|
import bisect, collections, copy, heapq, itertools, math, string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
from collections import defaultdict
from collections import Counter
import bisect
def main():
N, K = MI()
P = LI()
a = sum(P[0:K])
Sums = []
Sum = 0
for i in range(N):
Sum += P[i]
Sums.append(Sum)
ans = [a, 0, K - 1]
for i in range(K, N):
X = Sums[i] - Sums[i - K]
if X > ans[0]:
ans[0] = X
ans[1] = i - K + 1
ans[2] = i
cnt = 0
for i in range(ans[1], ans[2] + 1):
cnt += (P[i] + 1) / 2
print(cnt)
if __name__ == "__main__":
main()
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 579,007
| 579,008
|
u364693468
|
python
|
p02780
|
def main():
n, k = map(int, input().split())
p_lst = list(map(int, input().split()))
lst = []
for i in range(n):
lst.append((p_lst[i] + 1) / 2)
tmp_sum = sum(lst[:k])
maximum = tmp_sum
for i in range(n - k):
tmp_sum -= lst[i]
tmp_sum += lst[i + k]
maximum = max(maximum, tmp_sum)
print(maximum)
print(lst)
if __name__ == '__main__':
main()
|
def main():
n, k = map(int, input().split())
p_lst = list(map(int, input().split()))
lst = []
for i in range(n):
lst.append((p_lst[i] + 1) / 2)
tmp_sum = sum(lst[:k])
maximum = tmp_sum
for i in range(n - k):
tmp_sum -= lst[i]
tmp_sum += lst[i + k]
maximum = max(maximum, tmp_sum)
print(maximum)
if __name__ == '__main__':
main()
|
[
"call.remove"
] | 579,017
| 579,018
|
u672316981
|
python
|
p02780
|
n,k=map(int,input().split())
l=list(map(int,input().split()))
for i in range(n):
l[i]+=(l[i]+1)/2
lis=[0]*(n+1)
for i in range(n):
lis[i+1]=lis[i]+l[i]
ans=0
for i in range(n-k+1):
num=lis[i+k]-lis[i]
ans=max(num,ans)
print(ans)
|
n,k=map(int,input().split())
l=list(map(int,input().split()))
for i in range(n):
l[i]=(l[i]+1)/2
lis=[0]*(n+1)
for i in range(n):
lis[i+1]=lis[i]+l[i]
ans=0
for i in range(n-k+1):
num=lis[i+k]-lis[i]
ans=max(num,ans)
print(ans)
|
[
"assignment.value.change"
] | 579,019
| 579,020
|
u999503965
|
python
|
p02780
|
#!/usr/bin/env python3
def main():
def expected_val(limit):
return sum(range(limit + 1)) / limit
N, K = map(int, input().split())
P = [int(x) for x in input().split()]
lst = []
res = 0
for p in P:
res += expected_val(p)
lst.append(res)
ans = 0
for i in range(N - K):
res = lst[i + K] - lst[i]
ans = res if res > ans else ans
print(ans)
if __name__ == '__main__':
main()
|
#!/usr/bin/env python3
def main():
def expected_val(limit):
# return (1 + limit) / 2
return sum(range(limit + 1)) / limit
N, K = map(int, input().split())
P = [int(x) for x in input().split()]
lst = [0]
res = 0
for p in P:
res += expected_val(p)
lst.append(res)
ans = 0
for i in range(N - K + 1):
res = lst[i + K] - lst[i]
ans = res if res > ans else ans
print(ans)
if __name__ == '__main__':
main()
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 579,021
| 579,022
|
u216015528
|
python
|
p02780
|
"""
Created on Mon Sep 7 22:29:36 2020
@author: liang
"""
N, K = map(int, input().split())
P = [1 + (int(p)-1)*0.5 for p in input().split()]
#print(P)
tmp = sum(P[:K])
ans = 0
for i in range(N-K):
tmp += P[K+i] - P[i]
if tmp > ans:
ans = tmp
print(ans)
|
# -*- coding: utf-8 -*-
"""
Created on Mon Sep 7 22:29:36 2020
@author: liang
"""
N, K = map(int, input().split())
P = [1 + (int(p)-1)*0.5 for p in input().split()]
#print(P)
tmp = sum(P[:K])
ans = tmp
for i in range(N-K):
tmp += P[K+i] - P[i]
if tmp > ans:
ans = tmp
print(ans)
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 579,027
| 579,028
|
u628285938
|
python
|
p02780
|
# -*- coding: utf-8 -*-
"""
Created on Mon Sep 7 22:29:36 2020
@author: liang
"""
N, K = map(int, input().split())
P = [1 + (int(p)-1)*0.5 for p in input().split()]
print(P)
tmp = sum(P[:K])
ans = 0
for i in range(N-K):
tmp += P[K+i] - P[i]
if tmp > ans:
ans = tmp
print(ans)
|
# -*- coding: utf-8 -*-
"""
Created on Mon Sep 7 22:29:36 2020
@author: liang
"""
N, K = map(int, input().split())
P = [1 + (int(p)-1)*0.5 for p in input().split()]
#print(P)
tmp = sum(P[:K])
ans = tmp
for i in range(N-K):
tmp += P[K+i] - P[i]
if tmp > ans:
ans = tmp
print(ans)
|
[
"call.remove",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 579,029
| 579,028
|
u628285938
|
python
|
p02780
|
n, k = map(int,input().split())
p = [int(i) for i in input().split()]
psum = [0] * (n - k + 1)
psum[1] = sum(p[i:i+k])
for i in range(1, n - k + 1):
psum[i] = psum[i-1] - p[i-1] + p[i + k - 1]
res = (max(psum)+k) / 2
print(res)
|
n, k = map(int,input().split())
p = [int(i) for i in input().split()]
psum = [0] * (n - k + 1)
psum[0] = sum(p[0:k])
for i in range(1, n - k + 1):
psum[i] = psum[i-1] - p[i-1] + p[i + k - 1]
res = (max(psum)+k) / 2
print(res)
|
[
"literal.number.integer.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.remove"
] | 579,032
| 579,033
|
u072717685
|
python
|
p02780
|
n,k=map(int,input().split())
p=list(map(int,input().split()))
dp=[0]*(n-k+1)
dp[0]=sum(p[:k])
print(p)
for i in range(n-k):
dp[i+1]=dp[i]+p[k+i]-p[i]
print((max(dp)+k)/2)
|
n,k=map(int,input().split())
p=list(map(int,input().split()))
dp=[0]*(n-k+1)
dp[0]=sum(p[:k])
for i in range(n-k):
dp[i+1]=dp[i]+p[k+i]-p[i]
print((max(dp)+k)/2)
|
[
"call.remove"
] | 579,040
| 579,041
|
u322187839
|
python
|
p02780
|
N, K = [int(x) for x in input().split()]
p = [int(x) for x in input().split()]
a = sum(p[:K])
s = sum(p[:K])
for i in range(K, N):
s += p[i] - p[i - K]
a = max(a, s)
print(s)
ans = (a + K) / 2
print(ans)
|
N, K = [int(x) for x in input().split()]
p = [int(x) for x in input().split()]
a = sum(p[:K])
s = sum(p[:K])
for i in range(K, N):
s += p[i] - p[i - K]
a = max(a, s)
ans = (a + K) / 2
print(ans)
|
[
"call.remove"
] | 579,054
| 579,055
|
u202560873
|
python
|
p02780
|
N, K = map(int, input().split())
P = list(map(int, input().split()))
res = 0
P2 = []
for i in P:
P2.append(1 + 0.5 * (i - 1))
num = 0
for i in range(K):
num += P2[i]
res = num
for i in range(1,N-K+1):
temp = num + P2[i+K-1] - P2[i-1]
if temp > num:
res = temp
num = temp
print(res)
|
N, K = map(int, input().split())
P = list(map(int, input().split()))
res = 0
P2 = []
for i in P:
P2.append(0.5 * (i + 1))
num = 0
for i in range(K):
num += P2[i]
res = num
for i in range(1,N-K+1):
temp = num + P2[i+K-1] - P2[i-1]
if temp > res:
res = temp
num = temp
print(res)
|
[
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 579,060
| 579,061
|
u329319441
|
python
|
p02780
|
N, K = map(int,input().split())
p = list(map(int,input().split()))
exp = [(x+1)/2 for x in p]
sums = 0
ls =[]
#print(exp)
for n in range(N):
sums += exp[n]
ls.append(sums)
#print(ls)
ans = 0
for n in range(N-K):
ans_candidate = ls[n+K]-ls[n]
#print(ans_candidate)
if ans < ans_candidate:
ans = ans_candidate
print(ans)
|
N, K = map(int,input().split())
p = list(map(int,input().split()))
exp = [(x+1)/2 for x in p]
sums = 0
ls =[0]
for n in range(N):
sums += exp[n]
ls.append(sums)
ans = 0
for n in range(N-K+1):
ans_candidate = ls[n+K]-ls[n]
if ans < ans_candidate:
ans = ans_candidate
print(ans)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 579,064
| 579,065
|
u760961723
|
python
|
p02780
|
N, K = map(int,input().split())
p = list(map(int,input().split()))
exp = [(x+1)/2 for x in p]
sums = 0
ls =[]
for n in range(N):
sums += exp[n]
ls.append(sums)
ans = 0
for n in range(N-K):
ans_candidate = ls[n+K]-ls[n]
if ans < ans_candidate:
ans = ans_candidate
print(ans)
|
N, K = map(int,input().split())
p = list(map(int,input().split()))
exp = [(x+1)/2 for x in p]
sums = 0
ls =[0]
for n in range(N):
sums += exp[n]
ls.append(sums)
ans = 0
for n in range(N-K+1):
ans_candidate = ls[n+K]-ls[n]
if ans < ans_candidate:
ans = ans_candidate
print(ans)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 579,066
| 579,065
|
u760961723
|
python
|
p02780
|
N,K = map(int,input().split())
cc = list(map(int,input().split()))
dice_sum = sum(cc[:K])
max_dice = dice_sum
for i in range(N-K):
dice_sum = dice_sum + cc[i+K] - cc[i]
max_dice = max(max_dice,dice_sum)
print((max_dice+K)//2)
|
N,K = map(int,input().split())
cc = list(map(int,input().split()))
dice_sum = sum(cc[:K])
max_dice = dice_sum
for i in range(N-K):
dice_sum = dice_sum + cc[i+K] - cc[i]
max_dice = max(max_dice,dice_sum)
print((max_dice+K)/2)
|
[
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 579,067
| 579,068
|
u089925107
|
python
|
p02780
|
N,K = map(int,input().split())
p = list(map(int,input().split()))
l = []
for i in range(N):
l.append(((1+p[i])*p[i]/2)/p[i])
s = [0]*(N+1)
for i in range(1,N+1):
s[i] = l[i-1]+s[i-1]
ans = 0
for i in range(K,len(s)):
ans = max(ans,s[i]-s[i-K])
if N == K:
print(max(l))
else:
print(ans)
|
N,K = map(int,input().split())
p = list(map(int,input().split()))
l = []
for i in range(N):
l.append(((1+p[i])*p[i]/2)/p[i])
s = [0]*(N+1)
for i in range(1,N+1):
s[i] = l[i-1]+s[i-1]
ans = 0
for i in range(K,len(s)):
ans = max(ans,s[i]-s[i-K])
if N == K:
print(max(s))
else:
print(ans)
|
[
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 579,073
| 579,074
|
u848535504
|
python
|
p02780
|
N, K = map(int,input().split())
P = [0]+list(map(int,input().split()))
for i in range(1,N):
p = P[i]
p = (1+p)/2
P[i] = p+P[i-1]
ans = 0
for i in range(N-K+1):
ans = max(ans,P[i+K]-P[i])
print(ans)
|
N, K = map(int,input().split())
P = [0]+list(map(int,input().split()))
for i in range(1,N+1):
p = P[i]
p = (1+p)/2
P[i] = p+P[i-1]
ans = 0
for i in range(N-K+1):
ans = max(ans,P[i+K]-P[i])
print(ans)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 579,077
| 579,078
|
u311488536
|
python
|
p02780
|
N, K = map(int,input().split())
P = [0]+list(map(int,input().split()))
for i in range(1,N):
p = P[i]
p = (1+p)/2
P[i] = p+P[i-1]
ans = 0
for i in range(N-K+1):
ans = max(ans,P[i+K]-P[i])
|
N, K = map(int,input().split())
P = [0]+list(map(int,input().split()))
for i in range(1,N+1):
p = P[i]
p = (1+p)/2
P[i] = p+P[i-1]
ans = 0
for i in range(N-K+1):
ans = max(ans,P[i+K]-P[i])
print(ans)
|
[
"call.add"
] | 579,079
| 579,078
|
u311488536
|
python
|
p02780
|
n,k=map(int,input().split())
a=list(map(int,input().split()))
b=[0]*n
m=0
for i in range(n):
b[i]=(a[i]+1)/2
c=sum(b[:k])
for i in range(n-k):
c-=b[i]
c+=b[k+i]
m=max(m,c)
print(m)
|
n,k=map(int,input().split())
a=list(map(int,input().split()))
b=[0]*n
m=0
for i in range(n):
b[i]=(a[i]+1)/2
c=sum(b[:k])
m=c
for i in range(n-k):
c-=b[i]
c+=b[k+i]
m=max(m,c)
print(m)
|
[
"assignment.add"
] | 579,080
| 579,081
|
u223555291
|
python
|
p02780
|
n, k= map(int,input().split())
ps = list(map(int, input().split()))
s = [0]*(n+1)
for i in range(n):
s[i+1] = s[i] + (ps[i] + 1)/2
tmp=0
for i in range(len(res)-k):
tmp=max(tmp, s[i+k] - s[i])
print("{:.10f}".format(tmp))
|
n, k= map(int,input().split())
ps = list(map(int, input().split()))
s = [0]*(n+1)
for i in range(n):
s[i+1] = s[i] + (ps[i] + 1)/2
tmp=0
for i in range(n-k+1):
tmp=max(tmp, s[i+k] - s[i])
print("{:.10f}".format(tmp))
|
[
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 579,098
| 579,099
|
u990653216
|
python
|
p02780
|
from itertools import accumulate
from decimal import Decimal
n,k=map(int,input().split())
p=list(map(int,input().split()))
l=[]
tmp=0
for i in range(n):
p[i]=Decimal((p[i]+1)/2)
tmp+=p[i]
l.append(tmp)
ans=0
for i in range(k,n):
tmp=l[i]-l[i-k]
if tmp>ans:
ans=tmp
print(Decimal(ans))
|
from itertools import accumulate
from decimal import Decimal
n,k=map(int,input().split())
p=list(map(int,input().split()))
l=[0]
tmp=0
for i in range(n):
p[i]=Decimal((p[i]+1)/2)
tmp+=p[i]
l.append(tmp)
ans=0
for i in range(k,n+1):
tmp=l[i]-l[i-k]
if tmp>ans:
ans=tmp
print(Decimal(ans))
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 579,102
| 579,103
|
u587589241
|
python
|
p02780
|
n,k=map(int,input().split())
p=list(map(int,input().split()))
s=[(i+1)/2 for i in p]
cans=sum(s[:k])
ans=cans
for i in range(n-k):
nans=cans-s[i]+s[i+k]
ans=max(nans,cans)
cans=nans
print(ans)
|
n,k=map(int,input().split())
p=list(map(int,input().split()))
s=[(i+1)/2 for i in p]
cans=sum(s[:k])
ans=cans
for i in range(n-k):
cans=cans-s[i]+s[i+k]
ans=max(ans,cans)
print(ans)
|
[
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"call.arguments.change"
] | 579,109
| 579,110
|
u035453792
|
python
|
p02780
|
N, K = map(int, input().split())
A = list(map(int, input().split()))
for i in range (0, N):
A[i] = (A[i]+1)/2
print(A)
sumK = sum(A[0:K])
L = [sumK]
for i in range (0, N-K):
sumK = sumK + A[K+i] - A[i]
L.append(sumK)
print(max(L))
|
N, K = map(int, input().split())
A = list(map(int, input().split()))
for i in range (0, N):
A[i] = (A[i]+1)/2
sumK = sum(A[0:K])
L = [sumK]
for i in range (0, N-K):
sumK = sumK + A[K+i] - A[i]
L.append(sumK)
print(max(L))
|
[
"call.remove"
] | 579,115
| 579,116
|
u024340351
|
python
|
p02780
|
n, k = map(int, input().split())
p = list(map(int,input().split()))
sum_p =[0]
tmp = 0
for i in p:
tmp += i
sum_p.append(tmp)
max_expect = 0
for i in range(k, n):
tmp = sum_p[i] - sum_p[i - k]
max_expect = max(tmp, max_expect)
ans = (k + max_expect)/2
print(ans)
|
n, k = map(int, input().split())
p = list(map(int,input().split()))
sum_p =[0]
tmp = 0
for i in p:
tmp += i
sum_p.append(tmp)
max_expect = 0
for i in range(k, n+1):
tmp = sum_p[i] - sum_p[i - k]
max_expect = max(tmp, max_expect)
ans = (k + max_expect)/2
print(ans)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 579,131
| 579,132
|
u066551652
|
python
|
p02780
|
n, k = input().split()
m = list(map(int, input().split()))
ans = 0
kazu =[]
kai = []
kazu = [(a+1) /2 for a in m]
kitai = sum(kazu[0:int(k)])
for x in range(int(n) - int(k)):
kitai -= kazu[x]
kitai += kazu[x + int(k)]
if ans < kitai:
ans = kitai
print(ans)
|
n, k = input().split()
m = list(map(int, input().split()))
kazu =[]
kai = []
kazu = [(a+1) /2 for a in m]
kitai = sum(kazu[0:int(k)])
ans = kitai
for x in range(int(n) - int(k)):
kitai -= kazu[x]
kitai += kazu[x + int(k)]
if ans < kitai:
ans = kitai
print(ans)
|
[
"assignment.remove",
"assignment.add"
] | 579,139
| 579,140
|
u930723367
|
python
|
p02780
|
n, k = map(int, input().split())
p = list(map(int, input().split()))
total = sum(p[:k])
ans = total
for i in range(n-k):
total -= p[i]
total += p[i+k]
ans = max(total,ans)
print(ans)
print((ans+k)/2)
|
n, k = map(int, input().split())
p = list(map(int, input().split()))
total = sum(p[:k])
ans = total
for i in range(n-k):
total -= p[i]
total += p[i+k]
ans = max(total,ans)
print((ans+k)/2)
|
[
"call.remove"
] | 579,149
| 579,150
|
u324197506
|
python
|
p02780
|
n, k = map(int, input().split())
ps = list(map(lambda x: int(x) + 1, input().split()))
from collections import deque
q = deque()
tmp = sum(ps[:k])
q.append(tmp)
ps
for i in range(n-k):
print(i)
tmp = tmp - ps[i] + ps[k+i]
q.append(tmp)
q
print(max(q)/2)
|
n, k = map(int, input().split())
ps = list(map(lambda x: int(x) + 1, input().split()))
from collections import deque
q = deque()
tmp = sum(ps[:k])
q.append(tmp)
ps
for i in range(n-k):
tmp = tmp - ps[i] + ps[k+i]
q.append(tmp)
q
print(max(q)/2)
|
[
"call.remove"
] | 579,151
| 579,152
|
u062691227
|
python
|
p02780
|
from itertools import accumulate
n, k = map(int, input().split())
p = list(map(int, input().split()))
max_sum_k = 0
cum_sum = list(accumulate(p))
for i in range(k-1, n):
sum_p = cum_sum[i] - cum_sum[i-k]
if sum_p > max_sum_k:
max_sum_k = sum_p
max_ex = (k + max_sum_k) / 2
print(max_ex)
|
from itertools import accumulate
n, k = map(int, input().split())
p = list(map(int, input().split()))
max_sum_k = 0
cum_sum = [0] + list(accumulate(p))
for i in range(k-1, n + 1):
sum_p = cum_sum[i] - cum_sum[i-k]
if sum_p > max_sum_k:
max_sum_k = sum_p
max_ex = (k + max_sum_k) / 2
print(max_ex)
|
[
"assignment.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 579,157
| 579,158
|
u628335443
|
python
|
p02780
|
N,K=map(int,input().split())
_=input().split()
S=[]
for s in _:
S.append((int(s)+1)/2) #初めから期待値で配列作成
maxsum=sum(S[0:K])
tempsum=maxsum
for i in range(K,N-K):
tempsum=tempsum-S[i]+S[i+K]
if maxsum<tempsum:
maxsum=tempsum
else:
pass
print(maxsum)
|
N,K=map(int,input().split())
_=input().split()
S=[]
for s in _:
S.append((int(s)+1)/2) #初めから期待値で配列作成
maxsum=sum(S[0:K])
tempsum=maxsum
for i in range(N-K):
tempsum=tempsum-S[i]+S[i+K]
if maxsum<tempsum:
maxsum=tempsum
else:
pass
print(maxsum)
|
[
"call.arguments.change"
] | 579,161
| 579,162
|
u674588203
|
python
|
p02780
|
N,K = map(int,input().split())
P = list(map(int,input().split()))
memo = {}
exp = [0]
for p in P:
exp.append(exp[-1]+(1+p)/2)
res = 0
for i in range(K,N):
res = max(res, exp[i]-exp[i-K])
print(res)
|
N,K = map(int,input().split())
P = list(map(int,input().split()))
memo = {}
exp = [0]
for p in P:
exp.append(exp[-1]+(1+p)/2)
res = 0
for i in range(K,N+1):
res = max(res, exp[i]-exp[i-K])
print(res)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 579,169
| 579,170
|
u723711163
|
python
|
p02780
|
n, k = map(int, input().split())
p = list(map(int, input().split()))
kitai = [0] * n
ans = 0
for i in range(n):
kitai[i] += (p[i] + 1) / 2
ruiseki = [0] * (n + 1)
for i in range(1, n + 1):
ruiseki[i] += ruiseki[i - 1] + kitai[i - 1]
for i in range(n - k):
ans = max(ans, ruiseki[k + i] - ruiseki[i])
print(ans)
|
n, k = map(int, input().split())
p = list(map(int, input().split()))
kitai = [0] * n
ans = 0
for i in range(n):
kitai[i] += (p[i] + 1) / 2
ruiseki = [0] * (n + 1)
for i in range(1, n + 1):
ruiseki[i] += ruiseki[i - 1] + kitai[i - 1]
for i in range(n - k + 1):
ans = max(ans, ruiseki[k + i] - ruiseki[i])
print(ans)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 579,171
| 579,172
|
u733774002
|
python
|
p02780
|
N, K = map(int, input().split())
dices = list(map(int, input().split()))
exv = [(e+1)/2 for e in dices]
temp = sum(dices[0:K])
result = temp
for i in range(N-K):
temp -= dices[i]
temp += dices[i+K]
if temp > result:
result = temp
print(result)
|
N, K = map(int, input().split())
dices = list(map(int, input().split()))
exv = [(e+1)/2 for e in dices]
temp = sum(exv[0:K])
result = temp
for i in range(N-K):
temp -= exv[i]
temp += exv[i+K]
if temp > result:
result = temp
print(result)
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 579,186
| 579,187
|
u531599639
|
python
|
p02780
|
N, K = map(int, input().split())
dices = list(map(int, input().split()))
exv = [(e+1)/2 for e in dices]
temp = sum(m[0:K])
result = temp
for i in range(N-K):
temp -= dices[i]
temp += dices[i+K]
if temp > result:
result = temp
print(result)
|
N, K = map(int, input().split())
dices = list(map(int, input().split()))
exv = [(e+1)/2 for e in dices]
temp = sum(exv[0:K])
result = temp
for i in range(N-K):
temp -= exv[i]
temp += exv[i+K]
if temp > result:
result = temp
print(result)
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 579,188
| 579,187
|
u531599639
|
python
|
p02780
|
n,k=map(int,input().split())
p=list(map(int,input().split()))
lst=[0]
sum=0
for i in range(n):
sum+=p[i]
lst.append(sum)
ans=[]
for i in range(n-k+1):
ans.append(lst[i+k]-lst[i])
print(lst,ans,(max(ans)+k)/2)
|
n,k=map(int,input().split())
p=list(map(int,input().split()))
lst=[0]
sum=0
for i in range(n):
sum+=p[i]
lst.append(sum)
ans=[]
for i in range(n-k+1):
ans.append(lst[i+k]-lst[i])
print((max(ans)+k)/2)
|
[
"call.arguments.change"
] | 579,192
| 579,193
|
u474925961
|
python
|
p02780
|
n,k=map(int,input().split())
p=list(map(int,input().split()))
lst=[]
sum=0
for i in range(n):
sum+=p[i]
lst.append(sum)
ans=[]
for i in range(n-k):
ans.append(lst[i+k]-lst[i])
print((max(ans)+k)/2)
|
n,k=map(int,input().split())
p=list(map(int,input().split()))
lst=[0]
sum=0
for i in range(n):
sum+=p[i]
lst.append(sum)
ans=[]
for i in range(n-k+1):
ans.append(lst[i+k]-lst[i])
print((max(ans)+k)/2)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 579,194
| 579,193
|
u474925961
|
python
|
p02780
|
N,K=map(int,input().split())
ls=list(map(int,input().split()))
ls_p=[(ls[i]+1)/2 for i in range(N)]
a=0
for i in range(K):
a+=ls_p[i]
for i in range(N-K):
c=a+ls_p[i+K]-ls_p[i]
b=max([a,c])
a=c
print(b)
|
N,K=map(int,input().split())
ls=list(map(int,input().split()))
ls_p=[(ls[i]+1)/2 for i in range(N)]
a=0
for i in range(K):
a+=ls_p[i]
b=a
for i in range(N-K):
c=a+ls_p[i+K]-ls_p[i]
b=max([b,c])
a=c
print(b)
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 579,195
| 579,196
|
u112629957
|
python
|
p02780
|
N, K = map(int, input().split())
P = list(map(int, input().split()))
ans = 0
E = [(1+p)/2 for p in P]
S = [0]
for i in range(len(E)):
S.append(S[i] + E[i])
print(S)
for j in range(3, len(S)):
ans = max(ans, S[j]-S[j-3])
print(ans)
|
N, K = map(int, input().split())
P = list(map(int, input().split()))
ans = 0
E = [(1+p)/2 for p in P]
S = [0]
for i in range(len(E)):
S.append(S[i] + E[i])
for j in range(K, len(S)):
ans = max(ans, S[j]-S[j-K])
print(ans)
|
[
"call.remove",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 579,199
| 579,200
|
u941644149
|
python
|
p02780
|
n, k = map(int, input().split())
p = list(map(int, input().split()))
exp_list = []
for i in p:
expect = (i+1)/2
exp_list.append(expect)
s = sum(exp_list[0:k])
ans = s
for j in range(n-k):
s -= s[j]
s += s[j+k]
if s > ans :
ans = s
print(ans)
|
n, k = map(int, input().split())
p = list(map(int, input().split()))
exp_list = []
for i in p:
expect = (i+1)/2
exp_list.append(expect)
s = sum(exp_list[0:k])
ans = s
for j in range(n-k):
s -= exp_list[j]
s += exp_list[j+k]
if s > ans :
ans = s
print(ans)
|
[
"identifier.change"
] | 579,206
| 579,207
|
u771167374
|
python
|
p02780
|
def main():
#input
N,K=map(int,input().strip().split())
P=list(map(int,input().strip().split()))
#期待値行列
E=list(map(lambda x:(x+1)*x//2/x,P))
S=[0 for n in range(N-K+1)]
for n in range(K):
S[0]+=E[n]
ans=0
for i in range(1,N-K+1):
S[i]=S[i-1]-E[i-1]+E[i+K-1]
ans=max(ans,S[i])
print(ans)
if __name__=="__main__":
main()
|
def main():
#input
N,K=map(int,input().strip().split())
P=list(map(int,input().strip().split()))
#期待値行列
E=list(map(lambda x:(x+1)*x//2/x,P))
S=[0 for n in range(N-K+1)]
for n in range(K):
S[0]+=E[n]
ans=S[0]
for i in range(1,N-K+1):
S[i]=S[i-1]-E[i-1]+E[i+K-1]
ans=max(ans,S[i])
print(ans)
if __name__=="__main__":
main()
|
[] | 579,229
| 579,230
|
u613920660
|
python
|
p02780
|
n, k = map(int, input().split())
l = list(map(int, input().split()))
l = [(i+1)/2 for i in l]
ls = [0, l[0]]
for i in range(1, n):
ls.append(ls[-1]+l[i])
if n == 1:
print((l[0]+1)/2)
else:
lans = [ls[i+k]-ls[i] for i in range(len(ls)-k)]
print(max(lans))
|
n, k = map(int, input().split())
l = list(map(int, input().split()))
l = [(i+1)/2 for i in l]
ls = [0, l[0]]
for i in range(1, n):
ls.append(ls[-1]+l[i])
if n == 1:
print(l[0])
else:
lans = [ls[i+k]-ls[i] for i in range(len(ls)-k)]
print(max(lans))
|
[
"call.arguments.change",
"expression.operation.binary.remove"
] | 579,231
| 579,232
|
u048176319
|
python
|
p02780
|
import numpy
N, K = map(int, input().split())
p = list(map(int, input().split()))
lis = list()
p = [(i + 1)/2 for i in p ]
numpy.set_printoptions(precision=16)
cumSum = numpy.cumsum(p)
print(p)
cumSum2 = list(cumSum)
cumSum2.insert(0,0)
for i in range(0, N-K+1):
lis.append(cumSum2[K+i] - cumSum2[i])
print('{:.12f}'.format(max(lis)))
|
import numpy
N, K = map(int, input().split())
p = list(map(int, input().split()))
lis = list()
p = [(i + 1)/2 for i in p ]
numpy.set_printoptions(precision=16)
cumSum = numpy.cumsum(p)
cumSum2 = list(cumSum)
cumSum2.insert(0,0)
for i in range(0, N-K+1):
lis.append(cumSum2[K+i] - cumSum2[i])
print('{:.12f}'.format(max(lis)))
|
[
"call.remove"
] | 579,233
| 579,234
|
u382639013
|
python
|
p02780
|
import numpy
N, K = map(int, input().split())
p = list(map(int, input().split()))
lis = list()
p = [(i + 1)/2 for i in p ]
numpy.set_printoptions(precision=16)
cumSum = numpy.cumsum(p)
cumSum2 = list(cumSum)
cumSum2.insert(0,0)
for i in range(0, N-K+1):
lis.append(cumSum2[K+i] - cumSum2[i])
print('{:.12f}'.format(int(max(lis))))
|
import numpy
N, K = map(int, input().split())
p = list(map(int, input().split()))
lis = list()
p = [(i + 1)/2 for i in p ]
numpy.set_printoptions(precision=16)
cumSum = numpy.cumsum(p)
cumSum2 = list(cumSum)
cumSum2.insert(0,0)
for i in range(0, N-K+1):
lis.append(cumSum2[K+i] - cumSum2[i])
print('{:.12f}'.format(max(lis)))
|
[
"call.remove",
"call.arguments.change"
] | 579,235
| 579,234
|
u382639013
|
python
|
p02780
|
import sys
import numpy as np
input = lambda: sys.stdin.readline().rstrip()
def solve():
N, K = map(int, input().split())
p = np.array(list(map(int, input().split())), dtype='f8')
p = (p + 1) / 2
rs = np.zeros(N + 1, dtype='f8')
for i in range(N):
rs[i + 1] = rs[i] + p[i]
ans = 0
for i in range(N - K):
ans = max(ans, rs[i + K] - rs[i])
print(ans)
if __name__ == '__main__':
solve()
|
import sys
import numpy as np
input = lambda: sys.stdin.readline().rstrip()
def solve():
N, K = map(int, input().split())
p = np.array(list(map(int, input().split())), dtype='f8')
p = (p + 1) / 2
rs = np.zeros(N + 1, dtype='f8')
for i in range(N):
rs[i + 1] = rs[i] + p[i]
ans = 0
for i in range(N - K + 1):
ans = max(ans, rs[i + K] - rs[i])
print(ans)
if __name__ == '__main__':
solve()
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 579,236
| 579,237
|
u163783894
|
python
|
p02780
|
n, k = list(map(int, input().split()))
P = list(map(int, input().split()))
E = [0, ]
tot = 0
for i in range(n):
tot += P[i] * (P[i] + 1) / (2 * P[i])
E.append(tot)
ans = 0
for i in range(1, n - k + 1):
ans = max(ans, E[i + k] - E[i])
print(ans)
|
n, k = list(map(int, input().split()))
P = list(map(int, input().split()))
E = [0, ]
tot = 0
for i in range(n):
tot += P[i] * (P[i] + 1) / (2 * P[i])
E.append(tot)
ans = 0
for i in range(n - k + 1):
ans = max(ans, E[i + k] - E[i])
print(ans)
|
[
"call.arguments.change"
] | 579,238
| 579,239
|
u941047297
|
python
|
p02780
|
import sys
def input(): return sys.stdin.readline().strip()
def resolve():
n, k = map(int, input().split())
from itertools import accumulate
A = list(map(int, input().split()))
B = [0] + A
B = list(accumulate(B)) # 累積和を格納したリスト作成
num=0
val=0
# この問題は長さが1-Nの連続部分の和の最大値を出せというものなので以下の通り
for i in range(k, n + 1):
if B[i]-B[i-k+1]>val:
val=B[i]-B[i-k+1]
num=i
ans = 0
for j in A[num-k:num]:
ans += (0.5 * j * (1 + j)) / j
print(ans)
resolve()
|
import sys
def input(): return sys.stdin.readline().strip()
def resolve():
n, k = map(int, input().split())
from itertools import accumulate
A = list(map(int, input().split()))
B = [0] + A
B = list(accumulate(B)) # 累積和を格納したリスト作成
num=0
val=0
# この問題は長さが1-Nの連続部分の和の最大値を出せというものなので以下の通り
for i in range(k, n + 1):
if B[i]-B[i-k]>val:
val=B[i]-B[i-k]
num=i
ans = 0
for j in A[num-k:num]:
ans += (0.5 * j * (1 + j)) / j
print(ans)
resolve()
|
[
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 579,255
| 579,256
|
u057964173
|
python
|
p02780
|
def Csum(a):
b,c=[0],0
for i in range(len(a)):
c+=a[i]
b.append(c)
return b
n,k=map(int,input().split())
p=Csum(list(map(int,input().split())))
ans=0
for i in range(n-k+1):
ans=max(ans,p[i+k]-p[i])
print(ans)
print((ans+k)/2)
|
def Csum(a):
b,c=[0],0
for i in range(len(a)):
c+=a[i]
b.append(c)
return b
n,k=map(int,input().split())
p=Csum(list(map(int,input().split())))
ans=0
for i in range(n-k+1):
ans=max(ans,p[i+k]-p[i])
print((ans+k)/2)
|
[
"call.remove"
] | 579,259
| 579,260
|
u374802266
|
python
|
p02780
|
def Csum(a):
b,c=[0],0
for i in range(len(a)):
c+=a[i]
b.append(c)
return b
n,k=map(int,input().split())
p=Csum(list(map(int,input().split())))
ans=0
for i in range(n-k+1):
ans=max(ans,p[i+k]-p[i])
print(ans//2+1)
|
def Csum(a):
b,c=[0],0
for i in range(len(a)):
c+=a[i]
b.append(c)
return b
n,k=map(int,input().split())
p=Csum(list(map(int,input().split())))
ans=0
for i in range(n-k+1):
ans=max(ans,p[i+k]-p[i])
print((ans+k)/2)
|
[
"call.arguments.change",
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change",
"io.output.change",
"call.arguments.add"
] | 579,261
| 579,260
|
u374802266
|
python
|
p02780
|
n,k=map(int,input().split())
a=list(map(int,input().split()))
rui=[0]
for i in a:
rui.append(rui[-1]+i)
hantei=0
for i in range(1,len(rui)-k):
if hantei<=rui[i+k]-rui[i]:
hantei=rui[i+k]-rui[i]
l=i
r=i+k
ans=0
for i in range(l,r):
ans+=(a[i]+1)/2
print(ans)
|
n,k=map(int,input().split())
a=list(map(int,input().split()))
rui=[0]
for i in a:
rui.append(rui[-1]+i)
hantei=0
for i in range(0,len(rui)-k):
if hantei<=rui[i+k]-rui[i]:
hantei=rui[i+k]-rui[i]
l=i
r=i+k
ans=0
for i in range(l,r):
ans+=(a[i]+1)/2
print(ans)
|
[
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 579,262
| 579,263
|
u017415492
|
python
|
p02780
|
from itertools import accumulate
N, K = list(map(int, input().split()))
C = list(map(int, input().split()))
A=[]
for i in range(N):
A.append((C[i]+1)/2)
B = [0] + A
B = list(accumulate(B))
ans = []
for i in range(N-K+1):
ans.append(B[i+K]-B[i])
print(max(ans))
print(A)
|
from itertools import accumulate
N, K = list(map(int, input().split()))
C = list(map(int, input().split()))
A=[]
for i in range(N):
A.append((C[i]+1)/2)
B = [0] + A
B = list(accumulate(B))
ans = []
for i in range(N-K+1):
ans.append(B[i+K]-B[i])
print(max(ans))
|
[
"call.remove"
] | 579,264
| 579,265
|
u017415492
|
python
|
p02780
|
from itertools import accumulate
N, K = list(map(int, input().split()))
C = list(map(int, input().split()))
A=[]
for i in range(N):
A.append((C[i]+1)/2)
B = [0] + A
B = list(accumulate(B))
ans = []
for i in range(N-K):
ans.append(B[i+K]-B[i])
print(max(ans))
|
from itertools import accumulate
N, K = list(map(int, input().split()))
C = list(map(int, input().split()))
A=[]
for i in range(N):
A.append((C[i]+1)/2)
B = [0] + A
B = list(accumulate(B))
ans = []
for i in range(N-K+1):
ans.append(B[i+K]-B[i])
print(max(ans))
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 579,266
| 579,265
|
u017415492
|
python
|
p02780
|
n, k = map(int, input().split())
P = list(map(int, input().split()))
ans = 0
E = []
for p in P:
E.append(p*(p+1)/(2*p))
cumsumE = [0]
for e in E:
cumsumE.append(cumsumE[-1] + e)
for i in range(1, n+1-k):
ans = max(ans, cumsumE[i+k]-cumsumE[i])
print(ans)
|
n, k = map(int, input().split())
P = list(map(int, input().split()))
ans = 0
E = []
for p in P:
E.append(p*(p+1)/(2*p))
cumsumE = [0]
for e in E:
cumsumE.append(cumsumE[-1] + e)
for i in range(0, n+1-k):
ans = max(ans, cumsumE[i+k]-cumsumE[i])
print(ans)
|
[
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 579,276
| 579,277
|
u353895424
|
python
|
p02780
|
N, K = [int(i) for i in input().split()]
P = [int(i) for i in input().split()]
P2 = [(((P[i]+1)) / 2) for i in range(N)]
# i番目は1~P[i]の値を出す
# P[i]が大きいものからK個選んで期待値を求める
# 幅が最大のところを見つける
s = 0
init = 0
for i in range(K):
s += P2[i]
for i in range(1, N-K+1):
tmp = s - P2[i-1] + P2[i+K-1]
if s < tmp:
s = tmp
init = i
print(s)
|
N, K = [int(i) for i in input().split()]
P = [int(i) for i in input().split()]
P2 = [(((P[i]+1)) / 2) for i in range(N)]
# i番目は1~P[i]の値を出す
# P[i]が大きいものからK個選んで期待値を求める
# 幅が最大のところを見つける
s = 0
init = 0
for i in range(K):
s += P2[i]
tmp = s
for i in range(1, N-K+1):
tmp = tmp - P2[i-1] + P2[i+K-1]
if s < tmp:
s = tmp
init = i
print(s)
|
[
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 579,290
| 579,291
|
u967442619
|
python
|
p02780
|
n,k = map(int,input().split())
P = list(map(int,input().split()))
s=0
for i in range(k):
s += P[i]
ms=0
for i in range(len(P)-k):
s +=(P[i+k]-P[i])
if s>ms :
ms=s
print((ms+k)/2)
|
n,k = map(int,input().split())
P = list(map(int,input().split()))
s=0
for i in range(k):
s += P[i]
ms=s
for i in range(len(P)-k):
s +=(P[i+k]-P[i])
if s>ms :
ms=s
print( (ms+k)/2)
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 579,292
| 579,293
|
u707030679
|
python
|
p02780
|
N,K=map(int,input().split())
P=list(map(int,input().split()))
L=[]
M=[0]
c=0
m=0
x=0
for i in range(200100):
c+=i
L.append(c)
for i in P:
m+=L[i]/i
M.append(m)
if N!=K:
for i in range(N-K):
x=max(M[K+i]-M[i],x)
else:
x=M[K]-M[0]
print(x)
|
N,K=map(int,input().split())
P=list(map(int,input().split()))
L=[]
M=[0]
c=0
m=0
x=0
for i in range(200100):
c+=i
L.append(c)
for i in P:
m+=L[i]/i
M.append(m)
if N!=K:
for i in range(N-K+1):
x=max(M[K+i]-M[i],x)
else:
x=M[K]-M[0]
print(x)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 579,294
| 579,295
|
u854962015
|
python
|
p02780
|
N,K = map(int,input().split())
A = list(map(int,input().split()))
wa = [0] * (N+1)
for i in range(N):
wa[i+1] = wa[i] + (A[i]+1)/2
Max = 0
for i in range(N-K):
Max = max(Max,wa[K+i+1]-wa[i+1])
print(Max)
|
N,K = map(int,input().split())
A = list(map(int,input().split()))
wa = [0] * (N+1)
for i in range(N):
wa[i+1] = wa[i] + (A[i]+1)/2
Max = 0
for i in range(N-K+1):
Max = max(Max,wa[K+i]-wa[i])
print(Max)
|
[
"expression.operation.binary.remove"
] | 579,296
| 579,297
|
u756195685
|
python
|
p02780
|
N, K, *P = map(int, open(0).read().split())
A = [0]
for i in range(1, 1001):
A.append(A[-1] + i)
B = [0] + [A[i] / i for i in range(1, 1001)]
Q = [B[p] for p in P]
ans = [sum(Q[:K])]
for i in range(N - K - 1):
ans.append(ans[-1] - Q[i] + Q[i + K + 1])
print(max(ans))
|
N, K, *P = map(int, open(0).read().split())
A = [0]
for i in range(1, 1001):
A.append(A[-1] + i)
B = [0] + [A[i] / i for i in range(1, 1001)]
Q = [B[p] for p in P]
ans = [sum(Q[:K])]
for i in range(N - K):
ans.append(ans[-1] - Q[i] + Q[i + K])
print(max(ans))
|
[
"expression.operation.binary.remove"
] | 579,300
| 579,301
|
u057109575
|
python
|
p02780
|
N, K = map(int, input().split())
P = list(map(int, input().split()))
pos = 0
m = sum(P[0:K])
for i in range(1,N):
if i+K > N:
break
n = m - P[i-1] + P[K-1+i]
if n > m:
pos = i
m = n
print((sum(P[pos:pos+K]) + K) / 2)
|
N, K = map(int, input().split())
P = list(map(int, input().split()))
pos = 0
n = m = sum(P[0:K])
for i in range(1,N):
if i+K > N:
break
n = n - P[i-1] + P[K-1+i]
if n > m:
pos = i
m = n
print((sum(P[pos:pos+K]) + K) / 2)
|
[
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 579,302
| 579,303
|
u323859575
|
python
|
p02780
|
#!/usr/bin/env python3
def calcExpectedValue(prob):
return (prob+1)/2
def solve(n,k,p):
expLst = [calcExpectedValue(prob) for prob in p]
cum = [0]*(n+1)
for i in range(n):
cum[i+1] = cum[i] + expLst[i]
ans = 0
i = 0
while i+k < n:
ans = max(ans,cum[i+k]-cum[i])
i += 1
return ans
def main():
N,K = map(int,input().split())
p = list(map(int,input().split()))
print(solve(N,K,p))
return
if __name__ == '__main__':
main()
|
#!/usr/bin/env python3
def calcExpectedValue(prob):
return (prob+1)/2
def solve(n,k,p):
expLst = [calcExpectedValue(prob) for prob in p]
cum = [0]*(n+1)
for i in range(n):
cum[i+1] = cum[i] + expLst[i]
ans = 0
i = 0
while i+k <= n:
ans = max(ans,cum[i+k]-cum[i])
i += 1
return ans
def main():
N,K = map(int,input().split())
p = list(map(int,input().split()))
print(solve(N,K,p))
return
if __name__ == '__main__':
main()
|
[
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 579,326
| 579,327
|
u425762225
|
python
|
p02780
|
n, k = map( int, input().split() )
p = list( map( int, input().split() ) )
sum_k = sum( p[ : k ] )
max_sum_k = 0
for i in range( k, n ):
sum_k += p[ i ] - p[ i - k ]
if sum_k > max_sum_k:
max_sum_k = sum_k
print( ( max_sum_k + k ) / 2 )
|
n, k = map( int, input().split() )
p = list( map( int, input().split() ) )
sum_k = sum( p[ : k ] )
max_sum_k = sum_k
for i in range( k, n ):
sum_k += p[ i ] - p[ i - k ]
if sum_k > max_sum_k:
max_sum_k = sum_k
print( ( max_sum_k + k ) / 2 )
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 579,345
| 579,346
|
u836004075
|
python
|
p02780
|
from itertools import accumulate
N, K = list(map(int, input().split()))
P = list(map(lambda x: int(x) + 1, input().split()))
P_cumsum = list(accumulate(P))
print(max([P_cumsum[i+K]-P_cumsum[i] for i in range(N-K)])/2)
|
from itertools import accumulate
N, K = list(map(int, input().split()))
P = list(map(lambda x: int(x) + 1, input().split()))
P_cumsum = [0] + list(accumulate(P))
print(max([P_cumsum[i+K]-P_cumsum[i] for i in range(N-K+1)])/2)
|
[
"assignment.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 579,361
| 579,362
|
u633255271
|
python
|
p02780
|
n, k = map(int, input().split())
def kitai(x):
return (1+int(x))/2
p = list(map(kitai, input().split()))
pre = psum = sum(p[0:k])
for i in range(n):
if i+k > n:
break
pre = pre - p[i-1] + p[i+k-1]
psum = max(psum, pre)
print(psum)
|
n, k = map(int, input().split())
def kitai(x):
return (1+int(x))/2
p = list(map(kitai, input().split()))
pre = psum = sum(p[0:k])
for i in range(1, n):
if i+k > n:
break
pre = pre - p[i-1] + p[i+k-1]
psum = max(psum, pre)
print(psum)
|
[
"call.arguments.add"
] | 579,363
| 579,364
|
u088552457
|
python
|
p02780
|
n, k = map(int, input().split())
p = list(map(int, input().split()))
for i in range(n):
p[i] = (p[i] + 1) / 2
ans = sum(p[:k])
pre = sum(p[:k])
print(p)
for j in range(k, n):
pre = pre + p[j]- p[j - k]
ans = max(ans, pre)
print(ans)
|
n, k = map(int, input().split())
p = list(map(int, input().split()))
for i in range(n):
p[i] = (p[i] + 1) / 2
ans = sum(p[:k])
pre = sum(p[:k])
for j in range(k, n):
pre = pre + p[j]- p[j - k]
ans = max(ans, pre)
print(ans)
|
[
"call.remove"
] | 579,369
| 579,370
|
u051928503
|
python
|
p02780
|
N, K = map(int, input().split(' '))
P = tuple(map(int, input().split(' ')))
values = [0]
for p in P:
values.append(values[-1] + (p * (p + 1) // 2 / p))
ans = 0
for i in range(K, N):
ans = max(ans, values[i + 1] - values[i - K + 1])
print(ans)
|
N, K = map(int, input().split(' '))
P = tuple(map(int, input().split(' ')))
values = [0]
for p in P:
values.append(values[-1] + (p * (p + 1) // 2 / p))
ans = 0
for i in range(K, N + 1):
ans = max(ans, values[i] - values[i - K])
print(ans)
|
[
"expression.operation.binary.remove"
] | 579,371
| 579,372
|
u606878291
|
python
|
p02780
|
a,b=map(int, input().split())
c=list(map(int, input().split()))
l =[]
ans = 0
def abc(n):
return (n+1)/2
cb = list(map(abc,c))
s = sum(cb[:b])
l.append(s)
for i in range(b,a+1):
s = s - cb[i-b] + cb[b]
l.append(s)
L = sorted(l)
print(L[-1])
|
a,b=map(int, input().split())
c=list(map(int, input().split()))
l =[]
ans = 0
def abc(n):
return (n+1)/2
cb = list(map(abc,c))
s = sum(cb[:b])
l.append(s)
for i in range(b,a):
s = s - cb[i-b] + cb[i]
l.append(s)
L = sorted(l)
print(L[-1])
|
[
"expression.operation.binary.remove",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 579,377
| 579,378
|
u814271993
|
python
|
p02780
|
N, K = map(int, input().split())
p = list(map(int, input().split()))
ans = [sum(p[:K])]
for i in range(N-K):
ans.append(ans[-1]-p[i]+p[i+k])
print(max(ans)/2+K/2)
|
N, K = map(int, input().split())
p = list(map(int, input().split()))
ans = [sum(p[:K])]
for i in range(N-K):
ans.append(ans[-1]-p[i]+p[i+K])
print(max(ans)/2+K/2)
|
[
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 579,387
| 579,388
|
u829416877
|
python
|
p02780
|
import sys
from itertools import accumulate
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
n, k = rm()
a = [(i+1)/2 for i in rl()]
a = list(accumulate(a))
ans = 0
for i in range(n-k):
ans = max(ans, a[i+k] - a[i])
print(ans)
|
import sys
from itertools import accumulate
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
n, k = rm()
a = [(i+1)/2 for i in rl()]
a = [0] + list(accumulate(a))
ans = 0
for i in range(n-k+1):
ans = max(ans, a[i+k] - a[i])
print(ans)
|
[
"assignment.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 579,391
| 579,392
|
u823885866
|
python
|
p02780
|
N, K = map(int, input().split())
p = list(map(int, input().split()))
a = 0
for i in range(N - K + 1):
if i == 0:
f = i
b = sum(p[0:K])
else:
b = a - p[i-1] + p[i + K - 1]
if b > a:
a = b
f = i
ans = 0
for j in range(K):
ans += (p[f + j] + 1) / 2
print(ans)
|
N, K = map(int, input().split())
p = list(map(int, input().split()))
a = 0
for i in range(N - K + 1):
if i == 0:
b = sum(p[0:K])
else:
b = b - p[i-1] + p[i + K - 1]
if b > a:
a = b
f = i
ans = 0
for j in range(K):
ans += (p[f + j] + 1) / 2
print(ans)
|
[
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 579,407
| 579,408
|
u241159583
|
python
|
p02780
|
#python3
def f(x):
return (x+1)/2
def main():
n, k = map(int, input().split())
fp = [f(int(i)) for i in input().split()]
n = len(fp)
v = sum(fp[0:k])
i = 0
ans = 0
while i+k <= n-1:
v = v-fp[i]+fp[i+k]
ans = max(ans, v)
i+=1
a = "{0:.12f}".format(ans)
print(a)
main()
|
#python3
def f(x):
return (x+1)/2
def main():
n, k = map(int, input().split())
fp = [f(int(i)) for i in input().split()]
n = len(fp)
v = sum(fp[0:k])
i = 0
ans = v
while i+k <= n-1:
v = v-fp[i]+fp[i+k]
ans = max(ans, v)
i+=1
a = "{0:.12f}".format(ans)
print(a)
main()
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 579,422
| 579,423
|
u775681539
|
python
|
p02780
|
N,K=map(int,input().split())
p=list(map(int,input().split()))
S=sum(p[:K])
T=0
for i in range(N-K):
S=S-p[i]+p[i+K]
T=max(T,S)
print((T+K)/2)
|
N,K=map(int,input().split())
p=list(map(int,input().split()))
S=sum(p[:K])
T=S
for i in range(N-K):
S=S-p[i]+p[i+K]
T=max(T,S)
print((T+K)/2)
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 579,424
| 579,425
|
u507456172
|
python
|
p02780
|
n,k = map(int,input().split())
a = list(map(int,input().split()))
awk = 0
aix = k
for i in range(k):
awk += a[i]
#print(a[i])
#print('--')
a_max = awk
for i in range(k,n):
#print(a[i],i-k)
awk = awk + a[i] - a[i-k]
if a_max < awk:
a_max = awk
aix = i
#print('===')
ans = 0.0
for i in range(aix-k+1,aix+1 ):
#print(a[i],( 1 + a[i] ) / 2.0)
ans += ( 1 + a[i] ) / 2.0
print(ans)
|
n,k = map(int,input().split())
a = list(map(int,input().split()))
awk = 0
aix = k - 1
for i in range(k):
awk += a[i]
a_max = awk
for i in range(k,n):
awk = awk + a[i] - a[i-k]
if a_max < awk:
a_max = awk
aix = i
ans = 0.0
#print('aix={}'.format(aix))
for i in range(aix-k+1,aix+1 ):
#print(a[i])
ans += ( 1 + a[i] ) / 2.0
print(ans)
|
[
"assignment.change"
] | 579,430
| 579,431
|
u094158322
|
python
|
p02780
|
#154d
n, k = map(int, input().split())
p_list = list(map(int, input().split()))
e_list = [(1 + p) / 2 for p in p_list]
max_v = sum(e_list[:k])
ret = max_v
#print(e_list, e_list[:k])
for i in range(n - k):
calc = ret - e_list[i] + e_list[i + k]
max_v = max(ret, calc)
ret = calc
# print(ret, e_list[i], e_list[i + k], calc)
print(max_v)
|
#154d
n, k = map(int, input().split())
p_list = list(map(int, input().split()))
e_list = [(1 + p) / 2 for p in p_list]
max_v = sum(e_list[:k])
ret = max_v
#print(e_list, e_list[:k])
for i in range(n - k):
calc = ret - e_list[i] + e_list[i + k]
max_v = max(max_v, calc)
ret = calc
#print(ret, e_list[i], e_list[i + k], calc)
print(max_v)
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 579,432
| 579,433
|
u123849536
|
python
|
p02780
|
#154d
n, k = map(int, input().split())
p_list = list(map(int, input().split()))
e_list = [(1 + p) / 2 for p in p_list]
max_v = sum(e_list[:k])
ret = max_v
for i in range(n - k):
calc = ret - e_list[i] + e_list[i + k]
max_v = max(ret, calc)
ret = calc
print(max_v)
|
#154d
n, k = map(int, input().split())
p_list = list(map(int, input().split()))
e_list = [(1 + p) / 2 for p in p_list]
max_v = sum(e_list[:k])
ret = max_v
#print(e_list, e_list[:k])
for i in range(n - k):
calc = ret - e_list[i] + e_list[i + k]
max_v = max(max_v, calc)
ret = calc
#print(ret, e_list[i], e_list[i + k], calc)
print(max_v)
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 579,434
| 579,433
|
u123849536
|
python
|
p02780
|
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
n,k = nm()
p = nl()
def exp(num):
ret = (1+num)/2
return ret
mx=0
pp = list(map(exp,p))
pd = [0]*(n+1)
for i in range(1,n):
pd[i] = pd[i-1] + pp[i]
for i in range(n-k+1):
mx = max(pd[i+k]-pd[i],mx)
print(mx)
|
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
n,k = nm()
p = nl()
def exp(num):
ret = (1+num)/2
return ret
mx=0
pp = list(map(exp,p))
pd = [0]*(n+1)
for i in range(1,n+1):
pd[i] = pd[i-1] + pp[i-1]
for i in range(n-k+1):
mx = max(pd[i+k]-pd[i],mx)
print(mx)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add",
"assignment.change"
] | 579,445
| 579,446
|
u963915126
|
python
|
p02780
|
n,k=map(int,input().split())
p=list(map(int,input().split()))
f=lambda x:0.5*(x+1)
pp=list(map(f,p))
t=[0]*(n+1)
for i in range(n):
t[i+1]=t[i]+pp[i]
for i in range(n-k+1):
ans=max(ans,t[i+k]-t[i])
print(ans)
|
n,k=map(int,input().split())
p=list(map(int,input().split()))
f=lambda x:0.5*(x+1)
pp=list(map(f,p))
t=[0]*(n+1)
for i in range(n):
t[i+1]=t[i]+pp[i]
ans=0
for i in range(n-k+1):
ans=max(ans,t[i+k]-t[i])
print(ans)
|
[
"assignment.add"
] | 579,451
| 579,452
|
u614162316
|
python
|
p02780
|
import sys
input = sys.stdin.readline
def main():
N, K = map(int, input().split())
p = list(map(int, input().split()))
answer = sum(p[0:K])
r = answer
for i in range(N-K):
answer = answer - p[i] + p[i+K]
print(answer)
r = max(r, answer)
print((r+K)/2)
if __name__ == '__main__':
main()
|
import sys
input = sys.stdin.readline
def main():
N, K = map(int, input().split())
p = list(map(int, input().split()))
answer = sum(p[0:K])
r = answer
for i in range(N-K):
answer = answer - p[i] + p[i+K]
r = max(r, answer)
print((r+K)/2)
if __name__ == '__main__':
main()
|
[
"call.remove"
] | 579,453
| 579,454
|
u061566631
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.