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 9
values |
|---|---|---|---|---|---|---|---|
p02780
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
sum_tmp = sum(a[:k])
sum_max = sum_tmp
for i in range(3,len(a)):
sum_tmp += a[i] - a[i-k]
if sum_tmp > sum_max:
sum_max = sum_tmp
print((sum_max + k)/2)
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
sum_tmp = sum(a[:k])
sum_max = sum_tmp
for i in range(k,len(a)):
sum_tmp += a[i] - a[i-k]
if sum_tmp > sum_max:
sum_max = sum_tmp
print((sum_max + k)/2)
|
[
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 580,065
| 580,066
|
u303739137
|
python
|
p02780
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
sum_tmp = sum(a[:3])
sum_max = sum_tmp
for i in range(3,len(a)):
sum_tmp += a[i] - a[i-k]
if sum_tmp > sum_max:
sum_max = sum_tmp
print((sum_max + k)/2)
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
sum_tmp = sum(a[:k])
sum_max = sum_tmp
for i in range(k,len(a)):
sum_tmp += a[i] - a[i-k]
if sum_tmp > sum_max:
sum_max = sum_tmp
print((sum_max + k)/2)
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 580,067
| 580,066
|
u303739137
|
python
|
p02780
|
n, k = map(int, input().split())
p = map(int, input().split())
p_e = [0] + [ (x + 1) * 0.5 for x in p]
p_p = [0]
for i in range(1, n+1):
p_p.append(p_p[i-1] + p_e[i])
e_sum = [p_p[i] - p_p[i - k] for i in range(k+1, n+1)]
print(max(e_sum))
|
n, k = map(int, input().split())
p = map(int, input().split())
p_e = [0] + [ (x + 1) * 0.5 for x in p]
p_p = [0]
for i in range(1, n+1):
p_p.append(p_p[i-1] + p_e[i])
e_sum = [p_p[i] - p_p[i - k] for i in range(k, n+1)]
print(max(e_sum))
|
[
"expression.operation.binary.remove"
] | 580,068
| 580,069
|
u846101221
|
python
|
p02780
|
N, K = map(int, input().split())
P = list(map(int, input().split()))
m = [(e + 1) / 2 for e in range(N)]
t = sum(m[0:K])
ans = t
for i in range(N - K):
t -= m[i]
t += m[i + K]
if t > ans:
ans = t
print(ans)
|
N, K = map(int, input().split())
P = list(map(int, input().split()))
m = [(e + 1) / 2 for e in P]
t = sum(m[0:K])
ans = t
for i in range(N - K):
t -= m[i]
t += m[i + K]
if t > ans:
ans = t
print(ans)
|
[
"assignment.value.change",
"control_flow.loop.range.bounds.upper.change",
"call.arguments.change"
] | 580,095
| 580,096
|
u845847173
|
python
|
p02780
|
if __name__ == '__main__':
n, k = list(map(int, input().split(" ")))
p = list(map(int, input().split(" ")))
d = deque([0])
for i in range(n):
d.append(d[i] + p[i])
# print(d)
max_sum = 0
rangeN = n - k + 1
for i in range(rangeN):
max_sum = max(max_sum, d[i + k] - d[i])
# print(max_sum)
# r_array = [sum(p[i:i + k]) for i in range(rangeN)]
print((max_sum / 2) + (k * 0.5))
|
from collections import deque
if __name__ == '__main__':
n, k = list(map(int, input().split(" ")))
p = list(map(int, input().split(" ")))
d = deque([0])
for i in range(n):
d.append(d[i] + p[i])
# print(d)
max_sum = 0
rangeN = n - k + 1
for i in range(rangeN):
max_sum = max(max_sum, d[i + k] - d[i])
# print(max_sum)
# r_array = [sum(p[i:i + k]) for i in range(rangeN)]
print((max_sum / 2) + (k * 0.5))
|
[] | 580,108
| 580,109
|
u644224332
|
python
|
p02780
|
n,k=map(int,input().split())
a=list(map(int,input().split()))
b=[0]
for i in range(n):
b.append(b[-1]+a[i])
max=0
for j in range(k,len(b)+1):
if max<b[j]-b[j-k]:
max=b[j]-b[j-k]
print((max+k)/2)
|
n,k=map(int,input().split())
a=list(map(int,input().split()))
b=[0]
for i in range(n):
b.append(b[-1]+a[i])
max=0
for j in range(k,len(b)):
if max<b[j]-b[j-k]:
max=b[j]-b[j-k]
print((max+k)/2)
|
[
"expression.operation.binary.remove"
] | 580,116
| 580,117
|
u116233709
|
python
|
p02780
|
n,k=map(int,input().split())
a=list(map(int,input().split()))
b=[a[0]]
for i in range(1,n):
b.append(b[-1]+a[i])
max=0
for j in range(k,len(b)):
if max<b[j]-b[j-k]:
max=b[j]-b[j-k]
print((max+k)/2)
|
n,k=map(int,input().split())
a=list(map(int,input().split()))
b=[0]
for i in range(n):
b.append(b[-1]+a[i])
max=0
for j in range(k,len(b)):
if max<b[j]-b[j-k]:
max=b[j]-b[j-k]
print((max+k)/2)
|
[
"call.arguments.change"
] | 580,118
| 580,117
|
u116233709
|
python
|
p02780
|
N, K = map(int,input().split())
p = list(map(int,input().split()))
S = [0]
a = 0
sum1 = 0
sumMax = 0
for i in range(N):
a += p[i]
S.append(a)
for i in range(N-K+1):
sum1 = S[i+K] - S[i]
print(sum1)
if(sumMax < sum1):
sumMax = sum1
result = 0.5*K + 0.5*(sumMax)
print(result)
|
N, K = map(int,input().split())
p = list(map(int,input().split()))
S = [0]
a = 0
sum1 = 0
sumMax = 0
for i in range(N):
a += p[i]
S.append(a)
for i in range(N-K+1):
sum1 = S[i+K] - S[i]
if(sumMax < sum1):
sumMax = sum1
result = 0.5*K + 0.5*(sumMax)
print(result)
|
[
"call.remove"
] | 580,131
| 580,132
|
u557282438
|
python
|
p02780
|
N, K = map(int,input().split())
p = list(map(int,input().split()))
S = []
a = 0
sum1 = 0
sumMax = 0
for i in range(N):
a += p[i]
S.append(a)
for i in range(N-K):
sum1 = S[i+K] - S[i]
if(sumMax < sum1):
sumMax = sum1
result = 0.5*K + 0.5*(sumMax)
print(result)
|
N, K = map(int,input().split())
p = list(map(int,input().split()))
S = [0]
a = 0
sum1 = 0
sumMax = 0
for i in range(N):
a += p[i]
S.append(a)
for i in range(N-K+1):
sum1 = S[i+K] - S[i]
if(sumMax < sum1):
sumMax = sum1
result = 0.5*K + 0.5*(sumMax)
print(result)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 580,133
| 580,132
|
u557282438
|
python
|
p02780
|
n,k=map(int,input().split())
p=list(map(int,input().split()))
s=[0]*(n+1)
for i in range(n):
x=p[i]
s[i+1]=(x+1)/2+s[i]
ans=0
for i in range(k+1,n+1):
ans=max(ans,s[i]-s[i-k])
print(ans)
|
n,k=map(int,input().split())
p=list(map(int,input().split()))
s=[0]*(n+1)
for i in range(n):
x=p[i]
s[i+1]=(x+1)/2+s[i]
ans=0
for i in range(k,n+1):
ans=max(ans,s[i]-s[i-k])
print(ans)
|
[
"expression.operation.binary.remove"
] | 580,158
| 580,159
|
u366959492
|
python
|
p02780
|
n,k=map(int,input().split())
P=list(map(int,input().split()))
for i in range(n):
P[i]=0.5*(P[i]+1)
x=sum(P[:k])
s=[x]
for i in range(1,n-k):
x=x-P[i-1]+P[i+k]
s.append(x)
print(max(s))
|
n,k=map(int,input().split())
P=list(map(int,input().split()))
for i in range(n):
P[i]=0.5*(P[i]+1)
x=sum(P[:k])
s=[x]
for i in range(1,n-k+1):
x=x-P[i-1]+P[i+k-1]
s.append(x)
print(max(s))
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add",
"assignment.change"
] | 580,164
| 580,165
|
u210827208
|
python
|
p02780
|
n, k = [int(elem) for elem in input().split()]
ps = [int(elem) for elem in input().split()]
sum_max = 0
for i in range(k - 1, n):
if i == k - 1:
sum_now = sum(ps[:i + 1])
else:
sum_now = sum_now + ps[i] - ps[i - k]
print(sum_now)
sum_max = max(sum_max, sum_now)
print(float(sum_max + k) / 2)
|
n, k = [int(elem) for elem in input().split()]
ps = [int(elem) for elem in input().split()]
sum_max = 0
for i in range(k - 1, n):
if i == k - 1:
sum_now = sum(ps[:i + 1])
else:
sum_now = sum_now + ps[i] - ps[i - k]
sum_max = max(sum_max, sum_now)
print(float(sum_max + k) / 2)
|
[
"call.remove"
] | 580,171
| 580,172
|
u047197186
|
python
|
p02780
|
N, K=map(int,input().split())
P=list(map(int,input().split()))
Sum=[0]* (N + 1)
for i in range(1,N):
Sum[i+1]=Sum[i]+(P[i]+1)/2.0
Ans=0
for i in range(N-K+1):
Ans=max(Ans,Sum[i+K]-Sum[i])
print(Ans)
|
N, K=map(int,input().split())
P=list(map(int,input().split()))
Sum=[0]* (N + 1)
for i in range(N):
Sum[i+1]=Sum[i]+(P[i]+1)/2.0
Ans=0
for i in range(N-K+1):
Ans=max(Ans,Sum[i+K]-Sum[i])
print(Ans)
|
[
"call.arguments.change"
] | 580,179
| 580,180
|
u442855260
|
python
|
p02780
|
N, K=map(int,input().split())
P=list(map(int,input().split()))
Sum=[0]* (N + 1)
for i in range(1,N-1):
Sum[i+1]=Sum[i]+(P[i]+1)/2.0
Ans=0
for i in range(N-K+1):
Ans=max(Ans,Sum[i+K]-Sum[i])
print(Ans)
|
N, K=map(int,input().split())
P=list(map(int,input().split()))
Sum=[0]* (N + 1)
for i in range(N):
Sum[i+1]=Sum[i]+(P[i]+1)/2.0
Ans=0
for i in range(N-K+1):
Ans=max(Ans,Sum[i+K]-Sum[i])
print(Ans)
|
[
"call.arguments.change",
"expression.operation.binary.remove"
] | 580,181
| 580,180
|
u442855260
|
python
|
p02780
|
n,k = map(int,input().split())
d = map(lambda x: (int(x) + 1) / 2, input().split())
ret = sum(d[:k])
tmp = ret
for i in range(k,n):
tmp = tmp + d[i] - d[i-k]
ret = max(ret,tmp)
print(ret)
|
n,k = map(int,input().split())
d = list(map(lambda x: (int(x) + 1) / 2, input().split()))
ret = sum(d[:k])
tmp = ret
for i in range(k,n):
tmp = tmp + d[i] - d[i-k]
ret = max(ret,tmp)
print(ret)
|
[
"call.add",
"call.arguments.change"
] | 580,204
| 580,205
|
u743272507
|
python
|
p02780
|
n, k = map(int, input().split())
p = list(map(int, input().split()))
tmp = sum(p[:k])
ans = [tmp]
if n == k:
ans_mae = ans[0].sum()
print((ans_mae+k)/2)
else:
for i in range(1,n-k+1):
tmp = tmp - p[i-1] + p[i+k-1]
ans.append(tmp)
print((max(ans)+k)/2)
|
n, k = map(int, input().split())
p = list(map(int, input().split()))
tmp = sum(p[:k])
ans = [tmp]
if n == k:
ans_mae = ans[0]
print((ans_mae+k)/2)
else:
for i in range(1,n-k+1):
tmp = tmp - p[i-1] + p[i+k-1]
ans.append(tmp)
print((max(ans)+k)/2)
|
[
"call.remove"
] | 580,212
| 580,213
|
u214561383
|
python
|
p02780
|
def main():
x,y = map(int,input().split())
p = list(map(int,input().split()))
bigNumber = 0
number = sum(p[0:y])
for i in range(x-y):
number = number - p[i] + p[i+y]
if number > bigNumber:
bigNumber = number
print((bigNumber + y) / 2)
main()
|
def main():
x,y = map(int,input().split())
p = list(map(int,input().split()))
number = sum(p[0:y])
bigNumber = number
for i in range(x-y):
number = number - p[i] + p[i+y]
if number > bigNumber:
bigNumber = number
print((bigNumber + y) / 2)
main()
|
[
"assignment.remove",
"assignment.add"
] | 580,240
| 580,241
|
u619084943
|
python
|
p02780
|
import collections
def get_input_line():
return list(map(int, input().split()))
n, k = get_input_line()
p_list = get_input_line()
def calc_dice_score(p):
return 0.5*(p+1)
def calc_score(score_list):
return sum(score_list)
dice_scores = [0] * n
max_score = 0
tmp_score = 0
for i in range(k):
dice_scores[i] = 0.5*(p_list[i]+1)
tmp_score += dice_scores[i]
max_score = tmp_score
for i in range(n- k + 1):
dice_scores[i+k-1] = 0.5*(p_list[i+k-1]+1)
tmp_score -= dice_scores[i]
tmp_score += dice_scores[i+k-1]
max_score = max(max_score, tmp_score)
print(max_score)
|
import collections
def get_input_line():
return list(map(int, input().split()))
n, k = get_input_line()
p_list = get_input_line()
def calc_dice_score(p):
return 0.5*(p+1)
def calc_score(score_list):
return sum(score_list)
dice_scores = [0] * n
max_score = 0
tmp_score = 0
for i in range(k):
dice_scores[i] = 0.5*(p_list[i]+1)
tmp_score += dice_scores[i]
max_score = tmp_score
for i in range(1, n- k + 1):
dice_scores[i+k-1] = 0.5*(p_list[i+k-1]+1)
tmp_score -= dice_scores[i-1]
tmp_score += dice_scores[i+k-1]
max_score = max(max_score, tmp_score)
print(max_score)
|
[
"call.arguments.add"
] | 580,247
| 580,248
|
u369752439
|
python
|
p02780
|
import collections
def get_input_line():
return list(map(int, input().split()))
n, k = get_input_line()
p_list = get_input_line()
def calc_dice_score(p):
return 0.5*(p+1)
def calc_score(score_list):
return sum(score_list)
dice_scores = [0] * n
max_score = 0
tmp_score = 0
for i in range(k):
dice_scores[i] = 0.5*(p_list[i]+1)
tmp_score += dice_scores[i]
max_score = tmp_score
for i in range(1, n- k + 1):
dice_scores[i+k-1] = 0.5*(p_list[i+k-1]+1)
tmp_score -= dice_scores[i]
tmp_score += dice_scores[i+k-1]
max_score = max(max_score, tmp_score)
print(max_score)
|
import collections
def get_input_line():
return list(map(int, input().split()))
n, k = get_input_line()
p_list = get_input_line()
def calc_dice_score(p):
return 0.5*(p+1)
def calc_score(score_list):
return sum(score_list)
dice_scores = [0] * n
max_score = 0
tmp_score = 0
for i in range(k):
dice_scores[i] = 0.5*(p_list[i]+1)
tmp_score += dice_scores[i]
max_score = tmp_score
for i in range(1, n- k + 1):
dice_scores[i+k-1] = 0.5*(p_list[i+k-1]+1)
tmp_score -= dice_scores[i-1]
tmp_score += dice_scores[i+k-1]
max_score = max(max_score, tmp_score)
print(max_score)
|
[
"expression.operation.binary.add"
] | 580,249
| 580,248
|
u369752439
|
python
|
p02780
|
N, K = map(int, input().split())
L = list(map(int, input().split()))
E = [(v+1)/2 for v in L]
tmp = sum(E[:K])
ans = tmp
for l, p in zip(E[K:], E):
tmp = tmp-l+p
ans = max(ans, tmp)
print(ans)
|
N, K = map(int, input().split())
L = list(map(int, input().split()))
E = [(v+1)/2 for v in L]
tmp = sum(E[:K])
ans = tmp
for l, p in zip(E[K:], E):
tmp = tmp+l-p
ans = max(ans, tmp)
print(ans)
|
[
"expression.operation.binary.remove"
] | 580,250
| 580,251
|
u375616706
|
python
|
p02780
|
n, k = map(int, input().split(" "))
dices_e = [float((e+1)/2) for e in list(map(int, input().split(" ")))]
e = max_e = sum(dices_e[:k+1])
for i in range(1, n-k+1):
e = e - dices_e[i-1] + dices_e[i+k-1]
if e>max_e:
max_e = e
print(max_e)
|
n, k = map(int, input().split(" "))
dices_e = [float((e+1)/2) for e in list(map(int, input().split(" ")))]
e = max_e = sum(dices_e[:k])
for i in range(1, n-k+1):
e = e - dices_e[i-1] + dices_e[i+k-1]
if e>max_e:
max_e = e
print(max_e)
|
[
"expression.operation.binary.remove"
] | 580,260
| 580,261
|
u915879510
|
python
|
p02780
|
import itertools
n, k = list(map(int, input().split()))
p = list(map(int, input().split()))
pa = list(itertools.accumulate(p))
m = 0
for i in range(n-k):
s = pa[i+k] - pa[i]
if s > m:
m = s
print((m+k)/2)
|
import itertools
n, k = list(map(int, input().split()))
p = list(map(int, input().split()))
pa = list(itertools.accumulate([0] + p))
m = 0
for i in range(n-k+1):
s = pa[i+k] - pa[i]
if s > m:
m = s
print((m+k)/2)
|
[
"assignment.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 580,262
| 580,263
|
u765270691
|
python
|
p02780
|
from itertools import accumulate
n, k = map(int, input().split())
p = list(map(int, input().split()))
pp = [0] + list(accumulate(p))
m = 0
for i in range(n - k + 1):
m = max(m,pp[i + k] - pp[i - 1])
print((m+k)/2)
|
from itertools import accumulate
n, k = map(int, input().split())
p = list(map(int, input().split()))
pp = [0] + list(accumulate(p))
m = 0
for i in range(n - k + 1):
m = max(m,pp[i + k] - pp[i])
print((m+k)/2)
|
[
"expression.operation.binary.remove"
] | 580,270
| 580,271
|
u328510800
|
python
|
p02780
|
# -*- coding: utf-8 -*-
"""
Created on Wed Feb 12 16:38:08 2020
@author: matsui
"""
N,K=map(int,input().split())
p=[int(num) for num in input().split()]
dp=[]
S=0
for i in range(N):
S+=(p[i]+1)/2
dp.append(S)
M=0
for i in range(N-K):
if dp[i+K]-dp[i] > M: M=dp[i+K]-dp[i]
print(M)
|
# -*- coding: utf-8 -*-
"""
Created on Wed Feb 12 16:38:08 2020
@author: matsui
"""
N,K=map(int,input().split())
p=[int(num) for num in input().split()]
dp=[0]
S=0
for i in range(N):
S+=(p[i]+1)/2
dp.append(S)
M=0
for i in range(N-K+1):
#print(i+K,i)
if dp[i+K]-dp[i] > M: M=dp[i+K]-dp[i]
print(M)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 580,279
| 580,280
|
u159723084
|
python
|
p02780
|
n, k = map(int, input().split())
P = list(map(int, input().split()))
total = sum(P[:k])
start = 0
for i in range(0, n - k):
tmp = total - P[i] + P[i + k]
if total < tmp:
total = tmp
start = i + 1
ret = 0
for i in range(start, start + k):
ret += (P[i] + 1) / 2
print(ret)
|
n, k = map(int, input().split())
P = list(map(int, input().split()))
total = sum(P[:k])
tmp = total
start = 0
for i in range(0, n - k):
tmp = tmp - P[i] + P[i + k]
if total < tmp:
total = tmp
start = i + 1
ret = 0
for i in range(start, start + k):
ret += (P[i] + 1) / 2
print(ret)
|
[
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 580,289
| 580,290
|
u170183831
|
python
|
p02780
|
n,k = tuple(map(int,input().split()))
N = list(map(int,input().split()))
s = sum(N[0:k])
m = sum(N[0:k])
for i in range(0,n-k):
s = s-N[i]+N[i+k]
m = max(m,s)
print((s+k)/2)
|
n,k = tuple(map(int,input().split()))
N = list(map(int,input().split()))
s = sum(N[0:k])
m = sum(N[0:k])
for i in range(0,n-k):
s = s-N[i]+N[i+k]
m = max(m,s)
print((m+k)/2)
|
[
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 580,309
| 580,310
|
u270825463
|
python
|
p02780
|
N,K = list(map(int,input().split()))
S = list(map(int,input().split()))
result = [(sum(S[:K])+K)/2]
for i in range(N-K-1):
result.append(result[-1]+S[i+K]/2-S[i]/2)
print(max(result))
|
N,K = list(map(int,input().split()))
S = list(map(int,input().split()))
result = [(sum(S[:K])+K)/2]
for i in range(N-K):
result.append(result[-1]+S[i+K]/2-S[i]/2)
print(max(result))
|
[
"expression.operation.binary.remove"
] | 580,321
| 580,322
|
u904804404
|
python
|
p02780
|
#!/usr/bin/env python3
import numpy as np
n, k = map(int, input().split())
p = list(map(int, input().split()))
exps = []
for i in range(n):
#exps.append(sum(list(range(1, p[i]+1)))/p[i])
exps.append((1+p[i])/2)
exps = np.array(exps)
cumexps = exps.cumsum()
np.insert(cumexps, 0, 0)
#print(exps)
#print(cumexps)
ans = -1
for i in range(n-k):
tmp = -cumexps[i] + cumexps[i+k]
if ans <= tmp:
ans = tmp
print(ans)
|
#!/usr/bin/env python3
import numpy as np
n, k = map(int, input().split())
p = list(map(int, input().split()))
exps = []
for i in range(n):
#exps.append(sum(list(range(1, p[i]+1)))/p[i])
exps.append((1+p[i])/2)
exps = np.array(exps)
cumexps = exps.cumsum()
cumexps = np.insert(cumexps, 0, 0)
#print(exps)
#print(cumexps)
ans = -1
for i in range(n-k+1):
tmp = -cumexps[i] + cumexps[i+k]
if ans <= tmp:
ans = tmp
print(ans)
|
[
"assignment.add",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 580,323
| 580,324
|
u998741086
|
python
|
p02780
|
n, k = map(int, input().split())
p = [(int(i)+1.0)/2.0 for i in input().split()]
ans = 0
tmp = sum(p[:k])
for i in range(k,n):
tmp += p[i]-p[i-k]
ans = max(ans, tmp)
print('{:.12f}'.format(ans))
|
n, k = map(int, input().split())
p = [(int(i)+1.0)/2.0 for i in input().split()]
ans = tmp = sum(p[:k])
for i in range(k,n):
tmp += p[i]-p[i-k]
ans = max(ans, tmp)
print('{:.12f}'.format(ans))
|
[] | 580,331
| 580,332
|
u185037583
|
python
|
p02780
|
n, k = map(int, input().split())
p = [(int(i)+1.0)/2.0 for i in input().split()]
ans = 0
tmp = p[:k]
for i in range(k,n):
tmp += p[i]-p[i-k]
ans = max(ans, tmp)
print('{:.12f}'.format(ans))
|
n, k = map(int, input().split())
p = [(int(i)+1.0)/2.0 for i in input().split()]
ans = tmp = sum(p[:k])
for i in range(k,n):
tmp += p[i]-p[i-k]
ans = max(ans, tmp)
print('{:.12f}'.format(ans))
|
[
"call.add",
"call.arguments.change"
] | 580,333
| 580,332
|
u185037583
|
python
|
p02780
|
n,k=map(int, input().split())
p=[(int(i)+1.0)/2.0 for i in input().split()]
ans=0
for i in range(k):ans+=p[i]
tmp1=ans
for i in range(k, n-k+1):
tmp2 = (tmp1- p[i-k])+p[i]
ans = max(ans, tmp2)
tmp1=tmp2
print('{:.12f}'.format(ans))
|
n, k = map(int, input().split())
p = [(int(i)+1.0)/2.0 for i in input().split()]
ans = 0
for i in range(k):
ans += p[i]
tmp1 = ans
for i in range(k, n):
tmp2 = (tmp1 - p[i-k])+p[i]
ans = max(ans, tmp2)
tmp1 = tmp2
print('{:.12f}'.format(ans))
|
[
"expression.operation.binary.remove"
] | 580,334
| 580,335
|
u185037583
|
python
|
p02780
|
def main(N,K,p):
sumi = 0
ruiseki = [0] * (N+1)
for i in range(N):
ruiseki[i+1] = ruiseki[i] + p[i]
for j in range(K):
sumi = max(sumi, (ruiseki[j+K]-ruiseki[j]))
return (sumi + K) /2
N,K = map(int,input().split())
p = list(map(int,input().split()))
print(main(N,K,p))
|
def main(N,K,p):
sumi = 0
ruiseki = [0] * (N+1)
for i in range(N):
ruiseki[i+1] = ruiseki[i] + p[i]
for j in range(N-K+1):
sumi = max(sumi, (ruiseki[j+K]-ruiseki[j]))
return (sumi + K) / 2
N,K = map(int,input().split())
p = list(map(int,input().split()))
print(main(N,K,p))
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 580,361
| 580,362
|
u579699847
|
python
|
p02780
|
n, k = map(int, input().split())
p = list(map(int,input().split()))
s = [0] * (n-k+1)
s_0 = sum(p[0:k])
s[0] = s_0
for i in range(n-k):
s[i+1] = s_0 + p[k+i] - p[i]
print((k+max(s))/2)
|
n, k = map(int, input().split())
p = list(map(int,input().split()))
s = [0] * (n-k+1)
s_0 = sum(p[0:k])
s[0] = s_0
for i in range(n-k):
s[i+1] = s[i] + p[k+i] - p[i]
print((k+max(s))/2)
|
[
"assignment.value.change",
"expression.operation.binary.change"
] | 580,365
| 580,366
|
u183657342
|
python
|
p02780
|
n, k = map(int, input().split())
p_list = list(map(lambda x: (float(x) + 1) / 2, input().split()))
S_i = [0]
for i in range(n):
S_i.append(S_i[i] + p_list[i])
# print(S_i)
result_max = 0
for j in range(3, n+1):
cad_max = S_i[j] - S_i[j-k]
result_max = max(cad_max, result_max)
print(result_max)
|
n, k = map(int, input().split())
p_list = list(map(lambda x: (float(x) + 1) / 2, input().split()))
S_i = [0]
for i in range(n):
S_i.append(S_i[i] + p_list[i])
# print(S_i)
result_max = 0
for j in range(k, n+1):
cad_max = S_i[j] - S_i[j-k]
result_max = max(cad_max, result_max)
print(result_max)
|
[
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 580,371
| 580,372
|
u152554456
|
python
|
p02780
|
N, K = map(int,input().split())
list_p = [int(x) for x in input().split()]
total = sum(list_p[0:K])
max = total
for i in range(0,N-K+1) :
total = total - list_p[i] + list_p[i+K-1]
if total > max :
max = total
print((max+K)/2)
|
N, K = map(int,input().split())
list_p = [int(x) for x in input().split()]
total = sum(list_p[0:K])
max = total
for i in range(0,N-K) :
total = total - list_p[i] + list_p[i+K]
if total > max :
max = total
print((max+K)/2)
|
[
"expression.operation.binary.remove"
] | 580,387
| 580,388
|
u721970149
|
python
|
p02780
|
def calc(x):
return (x+1)/2
n, k = map(int, input().split())
p = list(map(calc,(map(int, input().split()))))
_ans = sum(p[0:k])
ans = _ans
for x in range(n-k+1):
_ans = _ans - p[x] + p[k]
ans = max(ans, _ans)
print(ans)
|
def calc(x):
return (x+1)/2
n, k = map(int, input().split())
p = list(map(calc,(map(int, input().split()))))
_ans = sum(p[0:k])
ans = _ans
for x in range(n-k):
# print(x, x + k)
_ans = _ans - p[x] + p[x + k]
ans = max(ans, _ans)
print(ans)
|
[
"expression.operation.binary.remove"
] | 580,391
| 580,392
|
u072949274
|
python
|
p02780
|
N,K = list(map(int, input().split()))
p = list(map(int, input().split()))
p2 = [p[i]*0.5 + 0.5 for i in range(N)]
size = N + 1
cusum = [0] * size
max = 0
for i in range(1,N):
cusum[i] = cusum[i-1] + p2[i]
for i in range(N-K+1):
tmp = cusum[i+K] - cusum[i]
if max < tmp:
max = tmp
print(max)
|
N,K = list(map(int, input().split()))
p = list(map(int, input().split()))
p2 = [p[i]*0.5 + 0.5 for i in range(N)]
size = N + 1
cusum = [0] * size
max = 0
for i in range(N):
cusum[i+1] = cusum[i] + p2[i]
for i in range(N-K+1):
tmp = cusum[i+K] - cusum[i]
if max < tmp:
max = tmp
print(max)
|
[
"call.arguments.change",
"expression.operation.binary.remove"
] | 580,412
| 580,413
|
u387029158
|
python
|
p02780
|
n, k = list(map(int, input().split()))
p = list(map(int, input().split()))
s = sum(p[:k])
m = s
for i in range(n-k):
print(i)
s = s-p[i]+p[i+k]
if m < s:
m = s
print((m+k)/2)
|
n, k = list(map(int, input().split()))
p = list(map(int, input().split()))
s = sum(p[:k])
m = s
for i in range(n-k):
s = s-p[i]+p[i+k]
if m < s:
m = s
print((m+k)/2)
|
[
"call.remove"
] | 580,414
| 580,415
|
u846652026
|
python
|
p02780
|
n,k=map(int,input().split())
p=list(map(int,input().split()))
an=0
an2=0
t=0
for i in range(n):
if i<k:
an+=((p[i]+1)/2)
an2=an
else:
t=((p[i-k]+1)/2)
if an+((p[i]+1)/2)-t>an:
an2=an+((p[i]+1)/2)-t
an=an+((p[i]+1)/2)-t
print(an2)
|
n,k=map(int,input().split())
p=list(map(int,input().split()))
an=0
an2=0
t=0
for i in range(n):
if i<k:
an+=((p[i]+1)/2)
an2=an
else:
t=((p[i-k]+1)/2)
if an+((p[i]+1)/2)-t>an2:
an2=an+((p[i]+1)/2)-t
an=an+((p[i]+1)/2)-t
print(an2)
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 580,420
| 580,421
|
u959225525
|
python
|
p02780
|
n,m = list(map(int,input().split()))
lis = list(map(int,input().split()))
total = 0
for i in range(m):
total += lis[i]/2 + 0.5
ans = total
for k in range(m,n):
total -= lis[k-4]/2 - lis[k]/2
ans = max(ans,total)
print(ans)
|
n,m = list(map(int,input().split()))
lis = list(map(int,input().split()))
total = 0
for i in range(m):
total += lis[i] * 0.5 + 0.5
ans = total
for k in range(m,n):
total -= lis[k-m]/2 - lis[k]/2
ans = max(ans,total)
print(ans)
|
[
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 580,442
| 580,443
|
u368579103
|
python
|
p02780
|
n,m = list(map(int,input().split()))
lis = list(map(int,input().split()))
total = 0
for i in range(m):
total += lis[i] * 0.5 + 0.5
ans = total
for k in range(m,n):
total -= lis[k-4]/2 - lis[k]/2
ans = max(ans,total)
print(ans)
|
n,m = list(map(int,input().split()))
lis = list(map(int,input().split()))
total = 0
for i in range(m):
total += lis[i] * 0.5 + 0.5
ans = total
for k in range(m,n):
total -= lis[k-m]/2 - lis[k]/2
ans = max(ans,total)
print(ans)
|
[
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 580,444
| 580,443
|
u368579103
|
python
|
p02780
|
N, K = map(int, input().split())
P = list(map(int, input().split()))
max = 0
S = 0
for i in range(len(P)):
S += P[i]
if i < K:
pass
else:
S -= P[i-K]
if max < S:
max = S
print((max+K)/2)
|
N, K = map(int, input().split())
P = list(map(int, input().split()))
max = 0
S = 0
for i in range(len(P)):
S += P[i]
if i-K < 0:
pass
else:
S -= P[i-K]
if max < S:
max = S
print((max+K)/2)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 580,447
| 580,448
|
u309039873
|
python
|
p02780
|
n, k = map(int, input().split())
p = list(map(int, input().split()))
kitaiti = [0 for _ in range(n)]
ruisekiwa = [0 for _ in range(n)]
r = k - 1
max = 0
ans_list = []
for i in range(n):
kitaiti[i] = (p[i]+1) / 2
if i == 0:
ruisekiwa[0] = kitaiti[0]
else:
ruisekiwa[i] = ruisekiwa[i-1] + kitaiti[i]
if i == r:
now = ruisekiwa[i]
elif i > r:
now = ruisekiwa[i] - ruisekiwa[i-r-1]
if now > max:
max = now
print(max)
|
n, k = map(int, input().split())
p = list(map(int, input().split()))
kitaiti = [0 for _ in range(n)]
ruisekiwa = [0 for _ in range(n)]
r = k - 1
max = 0
now = 0
ans_list = []
for i in range(n):
kitaiti[i] = (p[i]+1) / 2
if i == 0:
ruisekiwa[0] = kitaiti[0]
else:
ruisekiwa[i] = ruisekiwa[i-1] + kitaiti[i]
if i == r:
now = ruisekiwa[i]
elif i > r:
now = ruisekiwa[i] - ruisekiwa[i-r-1]
if now > max:
max = now
print(max)
|
[
"assignment.add"
] | 580,451
| 580,452
|
u281610856
|
python
|
p02780
|
n, k = map(int, input().split())
p_list = list(map(int, input().split()))
ans = 0
for i in range(n):
p_list[i] = (1 + p_list[i]) / 2
wa = sum(p_list[0:k])
for j in range(n-k):
wa = wa + p_list[j+k] - p_list[j]
ans = max(ans, wa)
print(ans)
|
n, k = map(int, input().split())
p_list = list(map(int, input().split()))
for i in range(n):
p_list[i] = (1 + p_list[i]) / 2
wa = sum(p_list[0:k])
ans = wa
for j in range(n-k):
wa = wa + p_list[j+k] - p_list[j]
ans = max(ans, wa)
print(ans)
|
[
"assignment.remove",
"assignment.add"
] | 580,453
| 580,454
|
u429319815
|
python
|
p02780
|
import itertools
N, K = [int(n) for n in input().split()]
P = [(int(n)+1)/2 for n in input().split()]
S = [E for E in itertools.accumulate(P)]
ans = 0
for j in range(N-K):
e = S[j+K]-S[j]
if ans < e:
ans = e
print(ans)
|
import itertools
N, K = [int(n) for n in input().split()]
P = [(int(n)+1)/2 for n in input().split()]
S = [0]+[E for E in itertools.accumulate(P)]
ans = 0
for j in range(N-K+1):
e = S[j+K]-S[j]
if ans < e:
ans = e
print(ans)
|
[
"assignment.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 580,455
| 580,456
|
u761087127
|
python
|
p02780
|
n, k = map(int, input().split())
p = list(map(int, input().split()))
m = sum(p[0: k])
sump = m
for i in range(1, n-k+1):
sump = sump - p[i-1] + p[i+k-1]
print(sump)
if m < sump:
m = sump
ans = (m + k) / 2
print(ans)
|
n, k = map(int, input().split())
p = list(map(int, input().split()))
m = sum(p[0: k])
sump = m
for i in range(1, n-k+1):
sump = sump - p[i-1] + p[i+k-1]
if m < sump:
m = sump
ans = (m + k) / 2
print(ans)
|
[
"call.remove"
] | 580,478
| 580,479
|
u518386853
|
python
|
p02780
|
n,k = map(int,input().split())
p = list(map(int,input().split()))
sum_acc = [0]
tmp = 0
for i in range(n):
tmp += (1 + p[i]) / 2
sum_acc.append(tmp)
print(sum_acc)
ans = 0
for j in range(k, n + 1):
ans = max(sum_acc[j] - sum_acc[j - k], ans)
print(ans)
|
n,k = map(int,input().split())
p = list(map(int,input().split()))
sum_acc = [0]
tmp = 0
for i in range(n):
tmp += (1 + p[i]) / 2
sum_acc.append(tmp)
ans = 0
for j in range(k, n + 1):
ans = max(sum_acc[j] - sum_acc[j - k], ans)
print(ans)
|
[
"call.remove"
] | 580,486
| 580,487
|
u750838232
|
python
|
p02780
|
n,k=map(int,input().split())
p=list(map(int,input().split()))
a=0
pp=[0]
for i in p:
a+=i
pp.append(a)
a=0
for i in range(k,n-k+1):
a=max(a,pp[i]-pp[i-k])
print(a/2+k/2)
|
n,k=map(int,input().split())
p=list(map(int,input().split()))
a=0
pp=[0]
for i in p:
a+=i
pp.append(a)
a=0
for i in range(k,n+1):
a=max(a,pp[i]-pp[i-k])
print(a/2+k/2)
|
[
"expression.operation.binary.remove"
] | 580,493
| 580,494
|
u344959886
|
python
|
p02780
|
s = list(map(int, input().split()))
n=s[0]
k=s[1]
s = list(map(int, input().split()))
ep=[]
for i in s:
ep.append((1+i)/2)
s={}
s[k-1]=0
for i in range(k):
s[k-1]+=ep[i]
for i in range(k-1,n-1):
print(i)
s[i+1]=s[i]+ep[i+1]-ep[i-k+1]
print(max(s.values()))
|
s = list(map(int, input().split()))
n=s[0]
k=s[1]
s = list(map(int, input().split()))
ep=[]
for i in s:
ep.append((1+i)/2)
s={}
s[k-1]=0
for i in range(k):
s[k-1]+=ep[i]
for i in range(k-1,n-1):
s[i+1]=s[i]+ep[i+1]-ep[i-k+1]
print(max(s.values()))
|
[
"call.remove"
] | 580,495
| 580,496
|
u245960901
|
python
|
p02780
|
n, k = map(int, input().split())
p = list(map(int, input().split()))
dp = [0] * n
for i in range(n):
dp[i] = p[i] / 2 + 0.5
m = sum(dp[0:k])
max = m
for i in range(1,n-k + 1):
m = m - p[i-1] + p[i+k-2]
if m > max:
max = m
print(max)
|
n, k = map(int, input().split())
p = list(map(int, input().split()))
dp = [0] * n
for i in range(n):
dp[i] = p[i] / 2 + 0.5
m = sum(dp[0:k])
max = m
for i in range(1,n-k + 1):
m = m - dp[i-1] + dp[i+k-1]
if m > max:
max = m
print(max)
|
[
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"literal.number.integer.change",
"variable_access.subscript.index.change"
] | 580,505
| 580,506
|
u762275701
|
python
|
p02780
|
n, k = map(int, input().split())
p = list(map(int, input().split()))
dp = [0] * n
for i in range(n):
dp[i] = p[i] / 2 + 0.5
m = sum(dp[:k])
max = m
for i in range(1,n-k + 1):
m = m - p[i-1] + p[i+k-1]
if m > max:
max = m
print(max)
|
n, k = map(int, input().split())
p = list(map(int, input().split()))
dp = [0] * n
for i in range(n):
dp[i] = p[i] / 2 + 0.5
m = sum(dp[0:k])
max = m
for i in range(1,n-k + 1):
m = m - dp[i-1] + dp[i+k-1]
if m > max:
max = m
print(max)
|
[
"call.arguments.change",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 580,507
| 580,506
|
u762275701
|
python
|
p02780
|
N,K = map(int,input().split())
p = list(map(int, input().split()))
s = sum(p[0:K])
s_max = s
for i in range(N-K-1):
s = s -p[i] + p[i+K+1]
if s_max < s:
s_max = s
print((s_max+K)/2)
|
N,K = map(int,input().split())
p = list(map(int, input().split()))
s = sum(p[0:K])
s_max = s
for i in range(N-K):
s = s -p[i] + p[i+K]
if s_max < s:
s_max = s
print((s_max+K)/2)
|
[
"expression.operation.binary.remove"
] | 580,515
| 580,516
|
u539969758
|
python
|
p02780
|
n, k = map(int, input().strip().split())
p = list(map(int, input().strip().split()))
def calc_exp(n):
exp=1+(n-1)*0.5
return exp
tmp=sum(p[:k])
mx=tmp
for i in range(1,n-k+1):
# tmp=sum(p[i:i+k])
tmp-=p[i-1]
tmp+=p[i+k-1]
if mx<tmp:
ind=i
mx=tmp
ans=0
for i in range(k):
ans+=1+(p[ind+i]-1)*0.5
print(ans)
|
n, k = map(int, input().strip().split())
p = list(map(int, input().strip().split()))
def calc_exp(n):
exp=1+(n-1)*0.5
return exp
tmp=sum(p[:k])
mx=tmp
ind=0
for i in range(1,n-k+1):
# tmp=sum(p[i:i+k])
tmp-=p[i-1]
tmp+=p[i+k-1]
if mx<tmp:
ind=i
mx=tmp
ans=0
for i in range(k):
ans+=1+(p[ind+i]-1)*0.5
print(ans)
|
[
"assignment.add"
] | 580,519
| 580,520
|
u970133396
|
python
|
p02780
|
N, K = map(int, input().split())
p = list(map(int, input().split()))
fac = [0] * 1010
fac[0] = 1
if (N >= 1):
for i in range(1, 1010): fac[i] = i + 1 + fac[i - 1]
# 期待値
#print(p, fac[:max(p)])
exp = [0] * 1010
for i in range(N):
exp[i] = fac[p[i] - 1] / p[i]
#print(exp)
Ans = 0
ans = [0] * N
ans[0] = sum(exp[:K])
for i in range(1, N - K + 1):
if(i + K == N + 1): break
ans[i] = ans[i - 1] - exp[i - 1] + exp[i + K - 1]
#print(ans[i])
#print(exp[i: i + K])
print(max(ans))
|
N, K = map(int, input().split())
p = list(map(int, input().split()))
fac = [0] * 735477
fac[0] = 1
if (N >= 1):
for i in range(1, 1010): fac[i] = i + 1 + fac[i - 1]
# 期待値
#print(p, fac[:max(p)])
exp = [0] * 735477
for i in range(N):
exp[i] = fac[p[i] - 1] / p[i]
# print(exp)
Ans = 0
ans = [0] * 735477
ans[0] = sum(exp[:K])
for i in range(1, N - K + 1):
if(i + K == N + 1): break
ans[i] = ans[i - 1] - exp[i - 1] + exp[i + K - 1]
# print(ans[i])
#print(exp[i: i + K])
print(max(ans))
|
[
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"identifier.replace.remove",
"literal.replace.add"
] | 580,561
| 580,560
|
u329706129
|
python
|
p02780
|
N,K = list(map(int, input().split()))
p = list(map(int, input().split()))
maxstart = 0
maxval = 0
nowval = 0
for i in range(K):
nowval += p[i]
maxval = nowval
for i in range(N-K-1):
nowval -= p[i]
nowval += p[i+K]
if nowval > maxval:
maxval = nowval
maxstart = i+1
ans = 0
for i in range(K):
ans += (p[i+maxstart] + 1)
print(ans/2)
|
N,K = list(map(int, input().split()))
p = list(map(int, input().split()))
maxstart = 0
maxval = 0
nowval = 0
for i in range(K):
nowval += p[i]
maxval = nowval
for i in range(N-K):
nowval -= p[i]
nowval += p[i+K]
if nowval > maxval:
maxval = nowval
maxstart = i+1
ans = 0
for i in range(K):
ans += (p[i+maxstart] + 1)
print(ans/2)
|
[
"expression.operation.binary.remove"
] | 580,564
| 580,565
|
u447679353
|
python
|
p02780
|
N,K = list(map(int, input().split()))
p = list(map(int, input().split()))
maxstart = 0
maxval = 0
nowval = 0
for i in range(K):
nowval += p[i]
maxval = nowval
for i in range(N-K-1):
nowval -= p[i]
nowval += p[i+K]
if nowval > maxval:
maxval = nowval
maxstart = i+1
ans = 0
for i in range(K):
ans += (p[i+maxstart] + 1)/2
print(ans)
|
N,K = list(map(int, input().split()))
p = list(map(int, input().split()))
maxstart = 0
maxval = 0
nowval = 0
for i in range(K):
nowval += p[i]
maxval = nowval
for i in range(N-K):
nowval -= p[i]
nowval += p[i+K]
if nowval > maxval:
maxval = nowval
maxstart = i+1
ans = 0
for i in range(K):
ans += (p[i+maxstart] + 1)
print(ans/2)
|
[
"expression.operation.binary.remove"
] | 580,566
| 580,565
|
u447679353
|
python
|
p02780
|
n, k = map(int,input().split())
p = list(map(int,input().split()))
counter_li = []
first = 0
for i in range(k):
first+=p[i]
counter_li.append(first)
for i in range(1,len(p)-k):
counter_li.append(counter_li[i-1]+ p[i+k-1] - p[i-1])
print(max(counter_li)/2+k/2)
|
n, k = map(int,input().split())
p = list(map(int,input().split()))
counter_li = []
first = 0
for i in range(k):
first+=p[i]
counter_li.append(first)
for i in range(1,len(p)-k+1):
counter_li.append(counter_li[i-1]+ p[i+k-1] - p[i-1])
print(max(counter_li)/2+k/2)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 580,584
| 580,585
|
u053035261
|
python
|
p02780
|
n, k = map(int, input().split())
p_i = list(map(int,input().split()))
answer = 0
sum = 0
for x in range(n - k + 1):
if x <= k - 1:
sum += p_i[x]
if x == k - 1: answer = sum
else:
sum += p_i[x] - p_i[x - k]
answer = max(answer, sum)
print((answer + k) / 2)
|
n, k = map(int, input().split())
p_i = list(map(int,input().split()))
answer = 0
sum = 0
for x in range(n):
if x <= k - 1:
sum += p_i[x]
if x == k - 1: answer = sum
else:
sum += p_i[x] - p_i[x - k]
answer = max(answer, sum)
print((answer + k) / 2)
|
[
"expression.operation.binary.remove"
] | 580,590
| 580,591
|
u556610039
|
python
|
p02780
|
n,k=map(int,input().split())
p=list(map(int,input().split()))
ans=[sum(p[0:k])]
for i in range(1,n-k):
ans.append(ans[i-1]+p[i+k-1]-p[i-1])
max_value=max(ans)
max_index=ans.index(max_value)
total=0
for i in p[max_index:max_index+k]:
total+=(i+1)/2
print(total)
|
n,k=map(int,input().split())
p=list(map(int,input().split()))
ans=[sum(p[0:k])]
for i in range(1,n-k+1):
ans.append(ans[i-1]+p[i+k-1]-p[i-1])
max_value=max(ans)
max_index=ans.index(max_value)
total=0
for i in p[max_index:max_index+k]:
total+=(i+1)/2
print(total)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 580,598
| 580,599
|
u763380276
|
python
|
p02780
|
n, k = map(int, input().split())
p = list(map(int, input().split()))
px = [(1 + p[i])/2 for i in range(n)]
ans = sum(px[0: 0 + k])
bef = sum(px[0: 0 + k])
for i in range(i, n - k + 1):
bef = bef-px[i-1]+px[i+k-1]
ans = max(ans, bef)
print(ans)
|
n, k = map(int, input().split())
p = list(map(int, input().split()))
px = [(1 + p[i])/2 for i in range(n)]
ans = sum(px[0: 0 + k])
bef = sum(px[0: 0 + k])
for i in range(1, n - k + 1):
bef = bef-px[i-1]+px[i+k-1]
ans = max(ans, bef)
print(ans)
|
[
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change"
] | 580,607
| 580,608
|
u693933222
|
python
|
p02780
|
n, k = map(int, input().split())
p = list(map(int, input().split()))
px = [(1 + p[i])/2 for i in range(n)]
ans = sum(px[i: i + k])
bef = sum(px[i: i + k])
for i in range(i, n - k + 1):
bef = bef-px[i-1]+px[i+k-1]
ans = max(ans, bef)
print(ans)
|
n, k = map(int, input().split())
p = list(map(int, input().split()))
px = [(1 + p[i])/2 for i in range(n)]
ans = sum(px[0: 0 + k])
bef = sum(px[0: 0 + k])
for i in range(1, n - k + 1):
bef = bef-px[i-1]+px[i+k-1]
ans = max(ans, bef)
print(ans)
|
[
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.lower.change"
] | 580,609
| 580,608
|
u693933222
|
python
|
p02780
|
n,k = map(int, input().split())
ps = list(map(int, input().split()))
tmp = sum(ps[:k])
max_ps = tmp
start = 0
for i in range(1,n-k):
tmp = tmp-ps[i-1]+ps[i+k-1]
if tmp >= max_ps:
max_ps = tmp
start = i
print(sum([(i*(i+1))/ (2*i) for i in ps[start:start+k]]))
|
n,k = map(int, input().split())
ps = list(map(int, input().split()))
tmp = sum(ps[:k])
max_ps = tmp
start = 0
for i in range(1,n-k+1):
tmp = tmp-ps[i-1]+ps[i+k-1]
if tmp >= max_ps:
max_ps = tmp
start = i
print(sum([(i*(i+1))/ (2*i) for i in ps[start:start+k]]))
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 580,612
| 580,613
|
u230621983
|
python
|
p02780
|
n, k = map(int, input().strip().split())
p = list(map(int, input().strip().split()))
e = []
for i in range(n):
a = p[i] * (p[i] + 1) / 2
e.append(a/p[i])
ans = sum(e[0:k])
s = ans
print(e)
for i in range(k,n):
aaa = s + e[i] - e[i-k]
if ans < aaa:
ans = aaa
s = aaa
print(ans)
|
n, k = map(int, input().strip().split())
p = list(map(int, input().strip().split()))
e = []
for i in range(n):
a = p[i] * (p[i] + 1) / 2
e.append(a/p[i])
ans = sum(e[0:k])
s = ans
for i in range(k,n):
aaa = s + e[i] - e[i-k]
if ans < aaa:
ans = aaa
s = aaa
print(ans)
|
[
"call.remove"
] | 580,616
| 580,617
|
u071513718
|
python
|
p02780
|
def main():
N,K = map(int, input().split())
A = list(map(int,input().split()))
P=[0]*N
for i in range(N):
P[i]=(A[i]+1)/2
max=0
check=0
#for j in range(K):
# check +=P[j]
check = sum(P[0:K])
#print(check)
for i in range(K,N):
check = check+P[i]-P[i-K]
#print(i)
#print(check)
if check > max:
max=check
print(max)
main()
|
def main():
N,K = map(int, input().split())
A = list(map(int,input().split()))
P=[0]*N
for i in range(N):
P[i]=(A[i]+1)/2
max=0
check=0
#for j in range(K):
# check +=P[j]
check = sum(P[0:K])
max=check
#print(check)
for i in range(K,N):
check = check+P[i]-P[i-K]
#print(i)
#print(check)
if check > max:
max=check
print(max)
main()
|
[
"assignment.add"
] | 580,625
| 580,626
|
u682563287
|
python
|
p02780
|
import numpy as np
N,K = map(int,input().split())
q = list(map(int,input().split()))
q = np.array(q)
p = (q + 1) /2
p = p.tolist()
mx = sum(p[:K])
for i in range(0,N-K):
a = mx - p[i] + p[i+K]
if a > mx:
mx = a
print(mx)
|
import numpy as np
N,K = map(int,input().split())
q = list(map(int,input().split()))
q = np.array(q)
p = (q + 1) /2
p = p.tolist()
a = sum(p[:K])
mx = a
for i in range(0,N-K):
a = a - p[i] + p[i+K]
if a > mx:
mx = a
print(mx)
|
[
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 580,638
| 580,637
|
u493555013
|
python
|
p02780
|
n,k = map(int, input().split())
p = list(map(int, input().split()))
ans = 0
for i in range(n-k+1):
if i==0:
t=sum(p[0:k])
else:
t=t-p[i-1]+p[i+k-1]
ans=max(ans,ts)
print((ans+k)/2)
|
n,k = map(int, input().split())
p = list(map(int, input().split()))
ans = 0
for i in range(n-k+1):
if i==0:
t=sum(p[0:k])
else:
t=t-p[i-1]+p[i+k-1]
ans=max(ans,t)
print((ans+k)/2)
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 580,639
| 580,640
|
u441599836
|
python
|
p02780
|
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
sum = 0
ans = 0
be = 0
for i in range(a[0]):
sum += (1 + b[i])/2
if i > a[1]-1:
sum -= (1 + b[i-a[1]])/2
if ans < sum:
ans = sum
print(ans)
|
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
sum = 0
ans = 0
for i in range(a[0]):
sum += (1 + b[i])/2
if i > a[1]-1:
sum -= (1 + b[i-a[1]])/2
if ans < sum:
ans = sum
print(ans)
|
[
"assignment.remove"
] | 580,643
| 580,644
|
u801009312
|
python
|
p02780
|
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = 0
A = 0
for j in range(a[1]):
A = A + b[j]
c = A
d = 0
ans = 0
if a[0] == a[1]:
for l in range(a[0]):
ans=ans + (b[l] + 1)/2
else:
for i in range(a[1],a[0]):
B = A - b[(i-a[1])] + b[i]
if B > c:
d = i - a[1] + 1
c = B
A = B
for k in range(a[1]):
ans =ans + ((b[d+k] + 1)/2)
print(ans)
|
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = 0
A = 0
for j in range(a[1]):
A = A + b[j]
c = A
d = 0
ans = 0
if a[0] == a[1]:
for l in range(a[0]):
ans=ans +((b[l] + 1)/2)
else:
for i in range(a[1],a[0]):
B = A - b[(i-a[1])] + b[i]
if B > c:
d = i - a[1] + 1
c = B
A = B
for k in range(a[1]):
ans =ans + ((b[d+k] + 1)/2)
print(ans)
|
[] | 580,647
| 580,648
|
u470618774
|
python
|
p02780
|
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = 0
A = 0
for j in range(a[1]):
A = A + b[j]
c = A
d = 0
ans = 0
if a[0] == a[1]:
for l in range(a[0]):
ans=ans + (b[l] + 1)/2
else:
for i in range(a[1],a[0]):
B = A - b[(i-a[1])] + b[i]
if B > c:
d = i - a[1] + 1
A = B
for k in range(a[1]):
ans =ans + ((b[d+k] + 1)/2)
print(ans)
|
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = 0
A = 0
for j in range(a[1]):
A = A + b[j]
c = A
d = 0
ans = 0
if a[0] == a[1]:
for l in range(a[0]):
ans=ans +((b[l] + 1)/2)
else:
for i in range(a[1],a[0]):
B = A - b[(i-a[1])] + b[i]
if B > c:
d = i - a[1] + 1
c = B
A = B
for k in range(a[1]):
ans =ans + ((b[d+k] + 1)/2)
print(ans)
|
[
"assignment.add"
] | 580,649
| 580,648
|
u470618774
|
python
|
p02780
|
a,b = map(int, input().split())
l = [(int(i)+1)/2 for i in input().split()]
st = sum(l[:b])
temp = st
max = 0
for i in range(b,a):
temp = temp + l[i] - l[i-b]
if max < temp:
max = temp
print(max)
|
a,b = map(int, input().split())
l = [(int(i)+1)/2 for i in input().split()]
temp = sum(l[:b])
max = temp
for i in range(b,a):
temp = temp + l[i] - l[i-b]
if max < temp:
max = temp
print(max)
|
[
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 580,652
| 580,653
|
u427984570
|
python
|
p02780
|
a,b = map(int, input().split())
l = [(int(i)+1)/2 for i in input().split()]
st = sum(l[:b])
temp = st
max = 0
for i in range(b,a):
temp = temp + l[i] - l[i-b]
if max <= temp:
max = temp
print(max)
|
a,b = map(int, input().split())
l = [(int(i)+1)/2 for i in input().split()]
temp = sum(l[:b])
max = temp
for i in range(b,a):
temp = temp + l[i] - l[i-b]
if max < temp:
max = temp
print(max)
|
[
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 580,654
| 580,653
|
u427984570
|
python
|
p02780
|
N,K = list(map(int, input().split()))
p = list(map(int, input().split()))
max_l = 0
Max_l = p[0:K]
S = [0]
s=0
for j in range(N):
s += p[j]
S.append(s)
for i in range(N-K+1):
m = S[K+i]-S[i]
if m > max_l:
max_l = m
print((max_l+K)//2)
|
N,K = list(map(int, input().split()))
p = list(map(int, input().split()))
max_l = 0
Max_l = p[0:K]
S = [0]
s=0
for j in range(N):
s += p[j]
S.append(s)
for i in range(N-K+1):
m = S[K+i]-S[i]
if m > max_l:
max_l = m
print((max_l+K)/2)
|
[
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 580,659
| 580,660
|
u231189826
|
python
|
p02780
|
N, K = map(int, input().split())
P = list(map(int, input().split()))
memo = sum(P[:K])
ans = -1
for i in range(K, N):
memo = memo - P[i-K] + P[i]
ans = max(ans, memo)
print(K-1+((ans-K+1) - 0.5*((ans-K+1)-1)))
|
N, K = map(int, input().split())
P = list(map(int, input().split()))
memo = sum(P[:K])
ans = memo
for i in range(K, N):
memo = memo - P[i-K] + P[i]
ans = max(ans, memo)
print(K-1+((ans-K+1) - 0.5*((ans-K+1)-1)))
|
[
"assignment.value.change",
"expression.operation.unary.remove"
] | 580,688
| 580,689
|
u670133596
|
python
|
p02780
|
n,k = map(int,input().split())
p = list(map(int,input().split()))
c=0
x=0
m=sum(p[0:k])
z=m
for i in range(1,n-k+1):
z=z-p[i-1]+p[i+k-1]
if m<z:
x=i
#print(x)
for i in range(x,x+k):
c+=((p[i]*(p[i]+1))/2)/p[i]
print(c)
|
n,k = map(int,input().split())
p = list(map(int,input().split()))
c=0
x=0
m=sum(p[0:k])
z=m
for i in range(1,n-k+1):
# print(z,p[i-1],p[i+k-1])
z=z-p[i-1]+p[i+k-1]
# print(m,z)
if m<z:
m=z
x=i
#print(x)
for i in range(x,x+k):
# print(p[i])
c+=((p[i]*(p[i]+1))/2)/p[i]
print(c)
|
[
"assignment.add"
] | 580,696
| 580,697
|
u866374539
|
python
|
p02780
|
N,K = map(int, input().split())
P=input().split()
P = [int(p) for p in P]
maxv=0
expv=0
for i in range(K):
expv+=P[i]
for i in range(N-K):
expv=expv-P[i]+P[i+K]
maxv=max(maxv,expv)
print("{:.20f}".format((maxv+K)/2))
|
N,K = map(int, input().split())
P=input().split()
P = [int(p) for p in P]
maxv=0
expv=0
for i in range(K):
expv+=P[i]
maxv=expv
for i in range(N-K):
expv=expv-P[i]+P[i+K]
maxv=max(maxv,expv)
print("{:.20f}".format((maxv+K)/2))
|
[
"assignment.add"
] | 580,708
| 580,709
|
u233159251
|
python
|
p02780
|
N,K = map(int, input().split())
P=input().split()
P = [int(p) for p in P]
maxv=0
expv=0
for i in range(K):
expv+=P[i]
for i in range(N-K):
expv=expv-P[i]+P[i+K]
maxv=max(maxv,expv)
print("{:.12f}".format((maxv+K)/2))
|
N,K = map(int, input().split())
P=input().split()
P = [int(p) for p in P]
maxv=0
expv=0
for i in range(K):
expv+=P[i]
maxv=expv
for i in range(N-K):
expv=expv-P[i]+P[i+K]
maxv=max(maxv,expv)
print("{:.20f}".format((maxv+K)/2))
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 580,710
| 580,709
|
u233159251
|
python
|
p02780
|
N, K = [int(n) for n in input().split(" ")]
lst = [int(n) for n in input().split(" ")]
sum_max = 0
temp = 0
for i in range(K):
temp += (lst[i]+1)/2
for j in range(0,N-K):
temp += (lst[j+K]-lst[j])/2
if temp > sum_max:
sum_max = temp
print(sum_max)
|
N, K = [int(n) for n in input().split(" ")]
lst = [int(n) for n in input().split(" ")]
sum_max = 0
temp = 0
for i in range(K):
temp += (lst[i]+1)/2
sum_max = temp
for j in range(0,N-K):
temp += (lst[j+K]-lst[j])/2
if temp > sum_max:
sum_max = temp
print(sum_max)
|
[
"assignment.add"
] | 580,730
| 580,731
|
u796708718
|
python
|
p02780
|
N, K = [int(x) for x in input().split()]
P = [int(x) for x in input().split()]
def calc(n):
return sum(range(1, n + 1)) / n
sums = []
s = 0
for i in range(N):
s += calc(P[i])
sums.append(s)
max_value = -1
max_index = -1
for i in range(N - K + 1):
s = sums[i+K-1] - sums[i-1]
max_value = max(max_value, s)
if max_value == s:
max_index = i
print(max_value)
# print(sum([calc(P[i]) for i in range(max_index, max_index + K)]))
|
N, K = [int(x) for x in input().split()]
P = [int(x) for x in input().split()]
def calc(n):
return sum(range(1, n + 1)) / n
sums = [0]
s = 0
for i in range(N):
s += calc(P[i])
sums.append(s)
max_value = -1
max_index = -1
# print(sums)
for i in range(N - K + 1):
s = sums[i+K] - sums[i]
# print(i)
# print(i+K)
max_value = max(max_value, s)
if max_value == s:
max_index = i
print(max_value)
# print(sum([calc(P[i]) for i in range(max_index, max_index + K)]))
|
[
"expression.operation.binary.remove"
] | 580,734
| 580,735
|
u778692431
|
python
|
p02780
|
# coding: utf-8
# Your code here!
# coding: utf-8
from math import gcd
from functools import reduce
import sys
sys.setrecursionlimit(200000000)
from inspect import currentframe
# my functions here!
#標準エラー出力
def printargs2err(*args):
names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}
print(', '.join(names.get(id(arg),'???')+' : '+repr(arg) for arg in args),file=sys.stderr)
def debug(x):
print(x,file=sys.stderr)
def printglobals():
for (symbol, value) in globals().items():
print('symbol="%s"、value=%s' % (symbol, value),file=sys.stderr)
def printlocals():
for (symbol, value) in locals().items():
print('symbol="%s"、value=%s' % (symbol, value),file=sys.stderr)
import itertools as its
#入力（後でいじる）
def pin(type=int):
return map(type,input().split())
#どっかで最悪計算量の入力データを用意する関数を作ろう？
def worstdata():
a=0
return a
#solution:
def comp(p):#期待値
return ((p+1)/2)
#input
n,k=(pin())
S=list(pin())
debug(S)
s=([comp(S[_]) for _ in range(n)])
ans=0
#print(s)
x=list(its.accumulate(s))
#print(list(its.accumulate(s)))
#default
for a in range(k):
ans=x[k-1]
#print("*",ans,0,k-1)
temp=0.0
for i in range(1,n-k):
ans=max(ans,x[k+i-1]-x[i-1])
print(ans)
#print(["NO","YES"][1-cond])
|
# coding: utf-8
# Your code here!
# coding: utf-8
from math import gcd
from functools import reduce
import sys
sys.setrecursionlimit(200000000)
from inspect import currentframe
# my functions here!
#標準エラー出力
def printargs2err(*args):
names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}
print(', '.join(names.get(id(arg),'???')+' : '+repr(arg) for arg in args),file=sys.stderr)
def debug(x):
print(x,file=sys.stderr)
def printglobals():
for (symbol, value) in globals().items():
print('symbol="%s"、value=%s' % (symbol, value),file=sys.stderr)
def printlocals():
for (symbol, value) in locals().items():
print('symbol="%s"、value=%s' % (symbol, value),file=sys.stderr)
import itertools as its
#入力（後でいじる）
def pin(type=int):
return map(type,input().split())
#どっかで最悪計算量の入力データを用意する関数を作ろう？
def worstdata():
a=0
return a
#solution:
def comp(p):#期待値
return ((p+1)/2)
#input
n,k=(pin())
S=list(pin())
debug(S)
s=([comp(S[_]) for _ in range(n)])
ans=0
#print(s)
x=list(its.accumulate(s))
#print(list(its.accumulate(s)))
#default
for a in range(k):
ans=x[k-1]
#print("*",ans,0,k-1)
temp=0.0
for i in range(1,n-k+1):
ans=max(ans,x[k+i-1]-x[i-1])
print(ans)
#print(["NO","YES"][1-cond])
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 580,745
| 580,746
|
u857428111
|
python
|
p02780
|
N, K = map(int, input().split())
p = list(map(int, input().split()))
s = 0
for i in range(0,K):
s = s+p[i]
r = s
for i in range(0,N-K):
t = s+p[i+K]-p[i]
if s < t:
r = t
s = t
print ((r+K)/2)
|
N, K = map(int, input().split())
p = list(map(int, input().split()))
s = 0
for i in range(0,K):
s = s+p[i]
u = s
for i in range(0,N-K):
t = s+p[i+K]-p[i]
if u < t:
u = t
s = t
print ((u+K)/2)
|
[
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 580,767
| 580,768
|
u375477204
|
python
|
p02780
|
def solve():
from sys import stdin
f_i = stdin
N, K = map(int, f_i.readline().split())
p = tuple(map(int, f_i.readline().split()))
idx = 0
max_s = sum(p[:K])
s = max_s
for i, t in enumerate(zip(p[1:], p[K:]), start=1):
pi, pj = t
s += (pj - pi)
if s > max_s:
max_s = s
idx = i
ans = (sum(p[idx:idx+K]) + K) / 2
print(ans)
solve()
|
def solve():
from sys import stdin
f_i = stdin
N, K = map(int, f_i.readline().split())
p = tuple(map(int, f_i.readline().split()))
idx = 0
max_s = sum(p[:K])
s = max_s
for i, t in enumerate(zip(p, p[K:]), start=1):
pi, pj = t
s += (pj - pi)
if s > max_s:
max_s = s
idx = i
ans = (sum(p[idx:idx+K]) + K) / 2
print(ans)
solve()
|
[] | 580,771
| 580,772
|
u816488327
|
python
|
p02780
|
N,K=map(int,input().split())
P=list(map(int,input().split()))
ans=0
s=(sum(P[:K])+K)/2
for i in range(1,N-K+1):
ans=max(ans,s-(P[i-1]+1)/2+(P[i+K-1]+1)/2)
s=s-(P[i-1]+1)/2+(P[i+K-1]+1)/2
print(ans)
|
N,K=map(int,input().split())
P=list(map(int,input().split()))
s=(sum(P[:K])+K)/2
ans=s
for i in range(1,N-K+1):
ans=max(ans,s-(P[i-1]+1)/2+(P[i+K-1]+1)/2)
s=s-(P[i-1]+1)/2+(P[i+K-1]+1)/2
print(ans)
|
[
"assignment.remove",
"assignment.add"
] | 580,777
| 580,778
|
u580404776
|
python
|
p02780
|
import sys
input = sys.stdin.readline
N, K = map(int,input().split())
P = list(map(int, input().split()))
Ans = sum(P[0:K])+K
Ans_max = Ans
for i in range(N-K-1):
A = P[i]
B = P[i+K]
Ans = Ans+B-A
if B > A:
Ans_max = max(Ans_max, Ans)
print(Ans/2)
|
import sys
input = sys.stdin.readline
N, K = map(int,input().split())
P = list(map(int, input().split()))
Ans = sum(P[0:K])+K
Ans_max = Ans
for i in range(0,N-K):
A = P[i]
B = P[i+K]
Ans = Ans+B-A
if B > A:
Ans_max = max(Ans_max, Ans)
print(Ans_max/2)
|
[
"call.arguments.add",
"expression.operation.binary.remove",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 580,785
| 580,786
|
u489124637
|
python
|
p02780
|
n,k = map(int,input().split())
arr = list(map(int,input().split()))
exarr = [(i+1)/2 for i in arr]
tmpsum = sum(exarr[:k])
sol = 0
for i in range(n-k):
tmpsum = tmpsum - exarr[i] + exarr[i+k]
sol = max(sol,tmpsum)
print(sol)
|
n,k = map(int,input().split())
arr = list(map(int,input().split()))
exarr = [(i+1)/2 for i in arr]
tmpsum = sum(exarr[:k])
sol = tmpsum
for i in range(n-k):
tmpsum = tmpsum - exarr[i] + exarr[i+k]
sol = max(sol,tmpsum)
print(sol)
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 580,793
| 580,794
|
u078181689
|
python
|
p02780
|
n,k = map(int, input().split())
p = list(map(int, input().split()))
mxidx = 0
mx = 0
tot=0
for i in range(k):
tot+=p[i]
mx=tot
for i in range(k,n):
tot+=p[i]-p[i-k]
if tot>mx:
mxidx=i-k+1
ans=0
for i in range(mxidx, mxidx+k):
ans+=(1+p[i])/2
print(ans)
|
n,k = map(int, input().split())
p = list(map(int, input().split()))
mxidx = 0
mx = 0
tot=0
for i in range(k):
tot+=p[i]
mx=tot
for i in range(k,n):
tot+=p[i]-p[i-k]
if tot>mx:
mxidx=i-k+1
mx=tot
ans=0
for i in range(mxidx, mxidx+k):
ans+=(1+p[i])/2
print(ans)
|
[
"assignment.add"
] | 580,810
| 580,811
|
u802234509
|
python
|
p02780
|
N,K = map(int, input().split())
p = list(map(lambda i: int(i) + 1 , input().split()))
print(N, K)
m_r = sum(p[:K])
m_max = m_r
for i in range(N - K):
m_r -= p[i]
m_r += p[i + K]
if m_max < m_r:
m_max = m_r
print(m_max / 2)
|
N,K = map(int, input().split())
p = list(map(lambda i: int(i) + 1 , input().split()))
m_r = sum(p[:K])
m_max = m_r
for i in range(N - K):
m_r -= p[i]
m_r += p[i + K]
if m_max < m_r:
m_max = m_r
print(m_max / 2)
|
[
"call.remove"
] | 580,824
| 580,825
|
u207082620
|
python
|
p02780
|
N, K = map(int, input().split())
P = list(map(int, input().split()))
q = sum(P[:K])
m = q
for k in range(K):
if k > 0:
q = q - P[k-1] + P[K-1+k]
if m < q:
m = q
print((m+K)/2)
|
N, K = map(int, input().split())
P = list(map(int, input().split()))
q = sum(P[:K])
m = q
for k in range(N-K+1):
if k > 0:
q = q - P[k-1] + P[K-1+k]
if m < q:
m = q
print((m+K)/2)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 580,826
| 580,827
|
u273201018
|
python
|
p02780
|
n, k = map(int,input().split())
ls = list(map(int,input().split()))
ls = [(x+1)/2 for x in ls]
m = 0
tot = sum(ls[:k])
for i in range(1,n-k+1):
tot = tot-ls[i-1]+ls[i+k-1]
m = max(m, tot)
print(m)
|
n, k = map(int,input().split())
ls = list(map(int,input().split()))
ls = [(x+1)/2 for x in ls]
m = tot = sum(ls[:k])
for i in range(1,n-k+1):
tot = tot-ls[i-1]+ls[i+k-1]
m = max(m, tot)
print(m)
|
[] | 580,832
| 580,833
|
u115110170
|
python
|
p02780
|
import sys
input = sys.stdin.readline
N,K = [int(i) for i in input().split()]
p = [int(i) for i in input().split()]
for i in range(N):
l = p[i]
p[i] = ((1+p[i]) * p[i])//2
p[i] = p[i]/l
ans = 0
print(p)
for i in range(K):
ans +=p[i]
l = ans
for i in range(K,N):
ans = ans + p[i] - p[i-K]
l = max(l,ans)
print('{:.8f}'. format(l))
|
import sys
input = sys.stdin.readline
N,K = [int(i) for i in input().split()]
p = [int(i) for i in input().split()]
for i in range(N):
l = p[i]
p[i] = ((1+p[i]) * p[i])//2
p[i] = p[i]/l
ans = 0
for i in range(K):
ans +=p[i]
l = ans
for i in range(K,N):
ans = ans + p[i] - p[i-K]
l = max(l,ans)
print('{:.8f}'. format(l))
|
[
"call.remove"
] | 580,837
| 580,838
|
u490553751
|
python
|
p02780
|
n, k = map(int, input().split())
p_list = list(map(lambda x: (int(x) + 1) / 2, input().split()))
print(p_list)
sum_k = 0
for i in range(k):
sum_k += p_list[i]
sum_max = sum_k
for i in range(k, n):
sum_k -= p_list[i-k]
sum_k += p_list[i]
if(sum_k > sum_max):
sum_max = sum_k
print(sum_max)
|
n, k = map(int, input().split())
p_list = list(map(lambda x: (int(x) + 1) / 2, input().split()))
sum_k = 0
for i in range(k):
sum_k += p_list[i]
sum_max = sum_k
for i in range(k, n):
sum_k -= p_list[i-k]
sum_k += p_list[i]
if(sum_k > sum_max):
sum_max = sum_k
print(sum_max)
|
[
"call.remove"
] | 580,849
| 580,850
|
u363992934
|
python
|
p02780
|
N,K = map(int, input().strip().split())
P = list(map(int, input().strip().split()))
P = [(p+1)/2 for p in P]
ans = sum(P[0:K])
now = ans
for i in range(1,N-K):
now = now - P[i-1] + P[i+K]
ans = max(ans, now)
print(ans)
|
N,K = map(int, input().strip().split())
P = list(map(int, input().strip().split()))
P = [(p+1)/2 for p in P]
ans = sum(P[0:K])
now = ans
for i in range(1,N-K+1):
now = now - P[i-1] + P[i+K-1]
ans = max(ans, now)
print(ans)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add",
"assignment.change"
] | 580,855
| 580,856
|
u518987899
|
python
|
p02780
|
def main():
N, K = [int(s) for s in input().split()]
p = [int(s) for s in input().split()]
s = sum(p[:K])
res = 0
for i in range(1,N):
if i+K > N:
break
s = s + p[i+K-1]
s = s - p[i-1]
res = max(s,res)
print((res+K)/2)
main()
|
def main():
N, K = [int(s) for s in input().split()]
p = [int(s) for s in input().split()]
s = sum(p[:K])
res = s
for i in range(1,N):
if i+K > N:
break
s = s + p[i+K-1]
s = s - p[i-1]
res = max(s,res)
print((res+K)/2)
main()
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 580,868
| 580,869
|
u974620347
|
python
|
p02780
|
N, K = map(int, input().split())
A = [int(x) for x in input().split()]
ans_kouho = sum(A[:K])
now_kouho = sum(A[:K])
for i in range(K, N):
print(ans_kouho)
now_kouho = now_kouho-A[i-K]+A[i]
ans_kouho = max(ans_kouho, now_kouho)
#print(ans_kouho)
ans = (ans_kouho+K)/2
print(ans)
|
N, K = map(int, input().split())
A = [int(x) for x in input().split()]
ans_kouho = sum(A[:K])
now_kouho = sum(A[:K])
for i in range(K, N):
# print(ans_kouho)
now_kouho = now_kouho-A[i-K]+A[i]
ans_kouho = max(ans_kouho, now_kouho)
# print(ans_kouho)
ans = (ans_kouho+K)/2
print(ans)
|
[
"call.remove"
] | 580,872
| 580,873
|
u065079240
|
python
|
p02780
|
N,K=map(int,input().split())
P=list(map(int,input().split()))
sums=[sum(j for j in range(i+1)) for i in range(1001)]
ans=0
for i in range(K):
ans+=sums[P[i]]/P[i]
tmp=ans
for i in range(K,N-K):
l=sums[P[i-K]]/P[i-K]
r=sums[P[i]]/P[i]
tmp=tmp-l+r
ans=max(ans,tmp)
print(ans)
|
N,K=map(int,input().split())
P=list(map(int,input().split()))
sums=[sum(j for j in range(i+1)) for i in range(1001)]
ans=0
for i in range(K):
ans+=sums[P[i]]/P[i]
tmp=ans
for i in range(K,N):
l=sums[P[i-K]]/P[i-K]
r=sums[P[i]]/P[i]
tmp=tmp-l+r
ans=max(ans,tmp)
print(ans)
|
[
"expression.operation.binary.remove"
] | 580,893
| 580,894
|
u589381719
|
python
|
p02780
|
N,K=map(int,input().split())
P=list(map(int,input().split()))
sums=[sum(j for j in range(i+1)) for i in range(1001)]
ans=0
for i in range(K):
ans+=sums[P[i]]/P[i]
tmp=ans
print(ans)
for i in range(K,N-K):
l=sums[P[i-K]]/P[i-K]
r=sums[P[i]]/P[i]
tmp=tmp-l+r
ans=max(ans,tmp)
print(ans)
|
N,K=map(int,input().split())
P=list(map(int,input().split()))
sums=[sum(j for j in range(i+1)) for i in range(1001)]
ans=0
for i in range(K):
ans+=sums[P[i]]/P[i]
tmp=ans
for i in range(K,N):
l=sums[P[i-K]]/P[i-K]
r=sums[P[i]]/P[i]
tmp=tmp-l+r
ans=max(ans,tmp)
print(ans)
|
[
"call.remove",
"expression.operation.binary.remove"
] | 580,895
| 580,894
|
u589381719
|
python
|
p02780
|
n,k=map(int,input().split())
A=list(map(int,input().split()))
m=sum(A[:k])
M=0
for i in range(n-k):
m=m-A[i]+A[i+k]
M=max(M,m)
print((M+k)/2)
|
n,k=map(int,input().split())
A=list(map(int,input().split()))
m=M=sum(A[:k])
for i in range(n-k):
m=m-A[i]+A[i+k]
M=max(M,m)
print((M+k)/2)
|
[
"assignment.add",
"assignment.remove"
] | 580,927
| 580,928
|
u248670337
|
python
|
p02780
|
#確率は(p_i+1)/2
N, K=(int(i) for i in input().split())
P=[int(i) for i in input().split()]
Q=[(P[i]+1)/2 for i in range(len(P))]
R=[0]*(len(Q)+1)
for i in range(1,len(R)-1):
R[i] = R[i-1] + Q[i-1]
maxp=0
for i in range(N-K+1):
maxp=max((R[i+K]-R[i]), maxp)
print(maxp)
|
#確率は(p_i+1)/2
N, K=(int(i) for i in input().split())
P=[int(i) for i in input().split()]
Q=[(P[i]+1)/2 for i in range(len(P))]
R=[0]*(len(Q)+1)
for i in range(1,len(R)):
R[i] = R[i-1] + Q[i-1]
maxp=0
for i in range(N-K+1):
maxp=max((R[i+K]-R[i]), maxp)
print(maxp)
|
[
"expression.operation.binary.remove"
] | 580,929
| 580,930
|
u069172538
|
python
|
p02780
|
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
n,k=map(int,input().split())
A=list(map(int,input().split()))
B=[0]*(n+1)
for i in range(n):
B[i+1]=B[i]+A[i]
for i in range(1,n-k+1):
ans=max(ans,B[i+k]-B[i])
print((ans+k)/2)
|
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
n,k=map(int,input().split())
A=list(map(int,input().split()))
B=[0]*(n+1)
for i in range(n):
B[i+1]=B[i]+A[i]
for i in range(n-k+1):
ans=max(ans,B[i+k]-B[i])
print((ans+k)/2)
# print(B)
|
[
"call.arguments.change"
] | 580,941
| 580,942
|
u716530146
|
python
|
p02780
|
import sys
input = lambda: sys.stdin.readline().rstrip()
def resolve():
N, K = map(int, input().split())
A = list(map(int, input().split()))
total = sum(A[0:K])
total_max = 1
for i in range(0, N-K):
total -= A[i]
total += A[i+K]
total_max = max(total, total_max)
print((total_max+K)/2)
if __name__ == '__main__':
resolve()
|
import sys
input = lambda: sys.stdin.readline().rstrip()
def resolve():
N, K = map(int, input().split())
A = list(map(int, input().split()))
total = sum(A[0:K])
total_max = total
for i in range(0, N-K):
total -= A[i]
total += A[i+K]
total_max = max(total, total_max)
print((total_max+K)/2)
if __name__ == '__main__':
resolve()
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 580,953
| 580,954
|
u648881683
|
python
|
p02780
|
import sys
input = lambda: sys.stdin.readline().rstrip()
def resolve():
N, K = map(int, input().split())
A = list(map(int, input().split()))
total = sum(A[0:K])
total_max = 0
for i in range(0, N-K):
total -= A[i]
total += A[i+K]
total_max = max(total, total_max)
print((total_max+K)/2)
if __name__ == '__main__':
resolve()
|
import sys
input = lambda: sys.stdin.readline().rstrip()
def resolve():
N, K = map(int, input().split())
A = list(map(int, input().split()))
total = sum(A[0:K])
total_max = total
for i in range(0, N-K):
total -= A[i]
total += A[i+K]
total_max = max(total, total_max)
print((total_max+K)/2)
if __name__ == '__main__':
resolve()
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 580,955
| 580,954
|
u648881683
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.