peterverebics/CodeNet_Python_118 huggingface dataset:
a = input()
b = input().split()
c = 0

for i in range(len(b)):
    if a == b[i]:
        c = 1
if c == 0:
    print('NO')
else:
    print('YES')
n = int(input())
a = sorted(list(map(lambda x: int(x),input().split())))
flag = 0
for i in range(n - 1):
    if a[i] == a[i+1] :
        print('NO')
        flag = 1
        break

if flag == 0 :
    print('Yes')
input_num = int(input())
a = list(map(int,input().rstrip().split(" ")))
ans = True
for i in range(1,input_num):
  for i2 in range(i):
    if a[i2] == a[i]:
      ans = False
      break
if ans:
  print("Yes")
else:
  print("NO")
N = int(input())
A= list(map(int, input().split()))

A_uniq = len(set(A))

if N==A_uniq:
  print('YES')
else:
  ('NO')
N = int(input())
A = list(map(int, input().split()))

table = {}
answer = 'Yes'
for i in range(0, len(A)):
    Ai = A[i]
    count = table.get(Ai) + 1 if table.get(Ai) else 1
    table[Ai] = count

    if table.get(Ai) >= 2:
        answer = 'No'
        break

print(answer)
# -*- coding: utf-8 -*-
def main():
    StringN    = input();
    listA      = input();
    newlistA   = listA.split();
    duplicateA = set(newlistA);

    if int(StringN) != len(newlistA):
        print('No');
        return 0;
    if int(StringN) == len(duplicateA):
        print('Yes');
    else :
        print('No');


main();
N=int(input())
A=list(map(int, input().split()))

A=sorted(A)

for i in range(0,int(N/2),2):
  if len(A) >= i+1:
    if A[i] == A[i+1]:
      print("NO")
      exit(0)
print("YES")
n=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(n):
  if i==n-1:
    print("Yes")
    break
  elif a[i]==a[i+1]:
    print("No")
    break
n = int(input())
data = list(map(int, input().split()))

for i in range(len(data)):
  for j in range(1, len(data) - i):
    if (data[i] == data[i+j]):
      print("No")
      exit()

print("Yes")
l1 = input().split()
l2 = set(l1)
if len(l1) == len(l2):
  print("YES")
else:
  print("NO")
N = int(input())
A = list(map(int, input().split()))
s = list(set(A))
if len(A) == len(s):
    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")
n=int(input())
a=list(map(int,input().split()))
b=list(set(a))
if len(a)==len(b):
  print("Yes")
else:
  print("No")
N = int(input())
A = list(map(int, input().split()))

if len(set(A)) != N:
  print("No")
else:
  print("Yes")
N = int(input())
A = list(map(int, input().strip().split()))

a = len(A)
cnt = 0
for i in range(a - 1):
    for j in range(a - 1 - i):
        
        if A[i] == A[j + i + 1]:            
            cnt += 1
        
if cnt > 0:
    print('No')
else:
    print('Yes')
n = int(input())
s = set(input().split())
if n == s:
  print('YES')
else:
  print('NO')
n = int(input())

a = list(map(int, input().split()))


x = len(set(a))


if x == len(a):
    print("Yes")
else:
    print("No")
n = int(input())
a = list(map(int,input().split()))
a.sort()
ans = 'Yes'
for i in range(n-1):
    if a[i] == a[i+1]:
        ans = 'No'
        
print(ans)
N=int(input())
s=list(map(int,input().split()))
# N=6
# s=[4 ,1 ,3 ,1 ,6 ,2]


from collections import Counter
S=Counter(s)#カウンタークラスが作られる。S=Counter({'b': 5, 'c': 4, 'a': 3})

if S.most_common(1)[0][1]==1:
    print("YES")
else:
    print("N0")
n=int(input())
a=list(map(int,input().split()))
list=[]
for i in a:
	if a in list:
		print("NO")
		break
	list.append(a)
else:
	print("YES")
N=input()
A=input().split()
if(N in A):
  print("YES")
else:
  print("NO")
n = int(input())
s = list(map(int,input().split()))

if len(s) == len(set(s)):
    print('Yes')
else:
    print('No')
n=input()
t=input().split()
if len(set(t))==n:
    print("YES")
else:
    print("NO")
N = int(input())
A = input().split()
A.sort()
f = 0

for i in range(N - 1):
    if A[i] == A[i+1]:
        print("NO")
        f += 1
        break

if f==1:
    print("YES")
# C - Distinct or Not

N = int(input())
A = list(map(int, input().split(' ')))
A.sort()
S = list(set(A))
if A == S:
    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')
n=int(input())
a=[int() for i in input().split()]
b=0
for j in range(n):
  for k in range(n):
    if a[j]==a[k] and j!=k:
      b+=1
if b==0:
  print('YES')
else:
  print('NO')
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)
N = input()
A = input().split()

if A[0] in A[1:] :
    print('YES')
else:
    print('NO')
from collections import Counter
N=int(input())
A=list(map(int, input().split()))
count=0
B=Counter(A)
for i in B.values():
	if i!=1:
		count+=1
		break
if count==1:
	print('No')
else:
	print('Yes')
import heapq

N = int(input())
A = list(int(x) for x in input().split())
heapq.heapify(A)
com1 = heapq.heappop(A)
ans = True

for _ in range(N-1):
    com2 = heapq.heappop(A)

    if com1 == com2:
        ans = False
        break

    com1 = com2

if ans:
    print('Yes')
else:
    print('No')
a=int(input())
b=list(input().split())
c=sorted(b)
for i in range (a-1):
 if c[i]==c[i+1]:
  print("No")
  break
 else:print("Yes")
a=int(input())
b=list(input().split())
c=sorted(b)
for i in range (a-1):
 if c[i]==c[i+1]:
  print("No")
  break
 else:print("Yes")
 break
n = int(input())
suuretu = list(map(int,input().split()))
nn = frg = 0
while nn <= n-2:
    mm = nn+1
    while mm <= n-1:
        if suuretu[nn] == suuretu[mm]:
            frg = 1
            print('NO')
            break
        else:
            mm +=1
    
    if nn >= n-1:
        print('YES')
        break
    else:
        nn += 1
n=int(input())
a=[int(i) for i in input().split()]
b=0
for j in range(n):
  for k in range(n):
    if a[j]==a[k] and j!=k:
      b+=1
      break
    break
if b==0:
  print('YES')
else:
  print('NO')
n = int(input())
a = [int(i) for i in input().split()]
dic = {}
for i in range(n):
	try:
		dic[a[i]] += 1
	except:
		dic[a[i]] = 1
if max(dic.values()) > 1:
	print("Yes")
else:
  	print("No")
n = int(input())
a = [int(i) for i in input().split()]
res = set()
ans = False
for i in a:
    if i in res:
        ans = True
    else:        
        res.add(i)
if ans ==True:
    print('No')
else:
    print('Yes')
n = int(input())
a = list(map(int , input().split()))

set_a = set(a)

if len(set_a) == len(a):
    print("Yes")
else:
    print("No")
N = int(input())
A = [int(x) for x in input().split()]
A.sort()
for i in range(1, len(A)):
    if A[i - 1] != A[i]:
        k = True
    else:
        k = False
        break

if k:
    print("Yes")
else:
    print("No")
n = int(input())
a = map(int, input().split())
re = 0

from collections import Counter

c = Counter(a)

for i, v in c.items():
    if v >= 2:
        re += 1

if re >= 1:
    print("No")
else:
    print("Yes")
#154 Distinct or not
n = int(input())
a = list(map(int,input().split()))
b = set(a)

if len(a) == b:
    print('YES')
else:
    print('NO')
N = int(input())
array = list(map(lambda x: int(x), input().split()))

are_all_different = True

for n in range(N):
    print(array.count(array[n]))
    if array.count(array[n]) >= 2:
        are_all_different = False

if are_all_different:
  print("YES")
else:
  print("NO")
n= int(input())
che={}
ans='Yes'
a = list(map(int, input().split()))
for i in a:
  if i in che.keys():
    ans='No'
  else:
    che[i]=0
print(ans)
from collections import Counter
n = int(input())
if(sorted(Counter([i for i in input().split()]).most_common(), key=lambda x: x[1])[0][1] > 1):
  print('NO')
else:
  print('YES')
n=int(input())
c=sorted(list(map(int, input().split())))
ans = 0

for i in range(n-1):
    if c[i] == c[i+1]:
        ans +=1

if ans == 0:
    print('YES')
if ans != 0:
    print('N0')
import sys

N = int(input())
As = list(map(int, input().split()))

As.sort()
for i in range(N):
    for j in range(i + 1, N):
        if As[i] == As[j]:
            print('NO')
            sys.exit(0)
        if As[j] > As[i]:
            print('break!')
            break

print('YES')
n = int(input())
a = list(map(int, input().split()))
for i in a:
    if a.count(i) >= 2:
        print("NO")
        
print("YES")
N = int(input())
A = [int(i) for i in input().split()]
f = 0
for i in range(10):
    if A.count(i) > 1:
        f = 1 
        
if f > 0:
    print("NO")
else:
 print("YES")
n=int(input())
a=list(map(int,input().split()))
A=set(a)
if len(a)==len(A):
  print('No')
else:
  print('Yes')
N=int(input())
A=sorted(list(map(int,input().split())))
for i in range(1,N):
  if A[i] == A[i-1]:
    print("YES")
  else:
    print("NO")
length=input()
#len-1
Narray=sorted(input().split())
n=0
while n<int(length)-2:
	if Narray[n] == Narray[n+1]:
		print("NO")
		break
	elif n==int(length)-2:
		print("YES")
		break
	else:
		n+=1
n = int(input())
nums = list(map(int,input().split()))
c = 0
nums = sorted(nums)

for i in range(n-1):
    if nums[i] == nums[i+1]:
        c += 1
        break
    
if c != 0:
    print('No')

else:
    print('Yes')
N = int(input())
A = list(map(int,input().split()))

if len(set(A)) == len(A):
    print("Yes")
else:
    print("No")
N = int(input())
A = map(int,input().split())

len2 = len(set(A))

if N == len2:
    print('Yes')
else:
    print('No')
N = int(input())
a = list(map(int, input().split()))
A = 0
for i in range(N):
    if a.count(a[A]) == 1:
        A += 1
    else:
        print('NO')
if A == N:
    print('YES')
n = int(input())
a = list(map(int, input().split()))

a.sort()

flag = 0
for i in range(0, n - 1):
    if (a[i] == a[i+1]):
        flag = 1
        break

if(flag == 1):
    print("No")
else:
    print("Yes")
n = int(input())
a = list(map(int,input().split()))
ans = 'YES'
if n < 3:
	if a[0] == a[1]:
		ans = 'NO'
else:
	for i in range(1,4):
		s = a[0:i] + a[i+1:n]
		if a[i] in s:
			ans = 'NO'
print(ans)
N=int(input())
ls=[int(s) for s in input().split()]
s=set(ls)
if len(s)==N:
  print('Yes')
else:
  print('No')
n = int(input())
lis = list(map(int, input().split()))

dic = {}

for i in lis:
    dic[i] = dic.get(i, 0) + 1
    if dic[i] != 1:
        print('No')
        break
else:
    print('Yes')
# -*- coding: utf-8 -*-
N = input()
input_line = input()
Ai = input_line.split(" ")
Comment = "Yes"
for i in range(int(N)):
  for j in range(i+1,int(N)):
    if(Ai[i] == Ai[j]):
      Comment = "No"
      break
      
print(Comment)
N = int(input())
A = list(input().split())
A = sorted(A)
c = 0
for i in range(N-1):
  if A[i] == A[i+1]:
    break
  else:
    c += 1
if c == 0:
  print("NO")
else:
  print("YES")
import collections
N = int(input())
A = list(input().split())
l = collections.Counter(A)
if len(l) == len(A):
    print("Yes")
else:
    print("No")
N = int(input())
A = input().split()
flag=0
 
for i in range(N): 
        for i1 in range(N): 
            if i != i1: 
                if A[i] == A[i1]: 
                    break
                else:
                  flag+=1
 
if flag>0:
  print("YES")
else:
  print("NO")
n=int(input())
lst=list(map(int,input().split()))
dic_a={}
for i in range(len(lst)):
  if lst[i] in dic_a:
    dic_a[lst[i]]=1
  else:
    print("NO")
else:print("YES")
n=int(input())
a=list(map(int,input().split(" ")))
deta=[]
error=False

for i in range(n):
  if len(deta)==0:
    pass
  elif error:
    break
  elif a[i] in deta:
    error=True
    deta.append(a[i])
  if error:
    print("YES")
  else:
    print("NO")
n = input()
a = input().split()
n = int(n)
a = [int(s) for s in a]
s =0

print(n,a)

for f in range(n):
  
  for g in range(n):

    if g != f:
    	if a[f] == a[g]:
      		#print(a[f], a[g])
      		s = s+1
      
if s>0: print("NO")
else: print('YES')
N = int(input())
A = [int(x) for x in input().split()]
NO = False
while NO == False:
    for i in A:
        j=0
        if A[j] == i:
            j += 1
            NO = True
if NO == True:
    print('NO')
else:
    print('YES')
N = int(input())
A = [int(x) for x in input().split()]
A.sort()

new_A = list(set(A))
if A == new_A:
    print('YES')
else:
    print('NO')
N = int(input())
A = []

tmp = input().split()

for i in range(N):
  A.append(int(tmp[i]))
    
A.sort()

hantei = True

for i in range(N):
  tmp = i
  if i == tmp:
    hantei = False
    
if hantei == True:
  print("YES")
else:
  print("NO")
import sys
N = int(input())
A = list(input().split())
def has(s):
    return len(s) != len(set(s))
B = has(A)

if B == False:
    print("NO")
    sys.stdout.flush
else:
    print("YES")
    sys.stdout.flush
N = int(input())
A = list(map(int, input().split()))
n = 0

A.sort()
for i in range(N-1):
  if A[i] == A[i+1]:
    print('NO')
    break
    
  else:
    n += 1
    
if n  != 0:
  print('YES')
#入力
N = int(input())
li = list(map(int,input().split()))


S = 0
for i in range(9):
    if li.count(i) <2:
        S = S
    else:
        S = S + 1
if S == 0:
    print('YES')
else:
    print('NO')
N = int(input())
A = {int(i) for i in input().split()}
if N == len(A):
    print('Yes')
else:
    print('No')
import itertools

n=int(input())
a=list(map(int,input().split()))

for i in itertools.combinations(a,2):
	if i[0]==i[1]:
		print("No")
		exit()
		
print("Yes")
n=int(input())
l= input().split()
leng=len(l)
flag="NO"

for i in range(leng):
  #print(i)
  for ii in range(i+1, leng):
    #print(l[i],l[ii])
    if l[i] == l[ii]:
      flag="NO"
      break
    else:
      flag = "YES"

print(flag)
A=list(map(int, input().split()))
n=len(A)
A.sort()
for i in range(n-1):
  if A[i]==A[i+1]:
    print('NO')
    exit()
else:
  print('YES')
import numpy as np
n = input()
num_list = list(map(int,input().split()))
num_list = np.sort(num_list)

flag = False
for i in range(len(num_list)):
    if i == len(num_list)-1:
        break
    
    if num_list[i] == num_list[i+1]:
        flag = True
        break
        
if flag:
    print('No')

else:
    print('Yes')
import collections
n=int(input())
a=list(map(int,input().split()))
b=len(a)
c=collections.Counter(a)
e=len(c.values())
print(e)
if b==e:
    print("YES")
else:
    print("NO")
n = int(input())
a = list(map(int, input().split()))

if set(a) == len(a):
  print("YES")
else:
  print("NO")
N = int(input())
A = [int(e) for e in input().split()]
B = 0
for i in range(N):
    for j in range(N-i-1):
        if A[i] == A[i+j+1]:
            print('No')
            B = 1
            break
        else:
            continue
        break
    
    
    if i == N-1 and B != 1:
        print('Yes')
N = input()
a = list(input().split())

import collections
c = collections.Counter(a)

flag = True
for i in c.values():
    #print(i)
    if i!=1:
        flag = False
        break
if flag == False:
    print('No')
else:
    print('Yes')
N = int(input())
A = [int(x) for x in input().split()]
la = len(A)
B = set(A)
lb = len(B)
if la == lb:
  print("Yes")
else:
  print("No")
N = int(input())
A = list(map(int, input().split()))
print("{}".format("Yes" if len(A) == len(set(A)) else "No"))
N = int(input())
A = list(map(int, input().split()))

A.sort()

flag = True
for i in range(len(A) - 1):
    if A[i] == A[i + 1]:
        flag = False
        break
    
if flag:
    print("Yes")
else:
    print("No")
import collections
N = int(input())
A = list(map(int , input().split()))
c = collections.Counter(A)
if len(c) == N:
    print('Yes')
else:
    print('No')
n = input()
y = map(int, input().split())
k = list(y)
t = len(set(k))
q = len(k)

if q > t:
    print("No")
else:
    print("Yes")
#from statistics import median
#import collections
#aa = collections.Counter(a) # list to list
#from itertools import combinations # (string,3) 3回
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def main():
    n = int(input())
    A = sorted(readInts())
    setA = list(set(A))
    if setA == A:
        print('YES')
    else:
        print('NO')
if __name__ == '__main__':
  main()
N = int(input())
A = list(map(int, input().split()))
 
for i in range(N):
  if A[i] in A[i+1:]:
    print('NO')
else:
  print('YES')
t=list(input().replace(" ",""))
del t[0]
t.sort()
n=len(t)
p=0
for i in range(n-1):
    if t[i]==t[i+1]:
        p+=1
        
if p>0:
    print("NO")
else:
    print("YES")
# -*- coding: utf-8 -*-
def main():
    StringN = input();
    listA = input();
    newlistA = listA.split();
    duplicateA = set(newlistA);

    if int(StringN) == len(duplicateA):
        print('Yes');
    else :
        print('No');


main();
n = int(input())
a = list(map(int, input().split()))
b = set(a)
if len(a) == len(b):
  print('Yes')
else:
  print('No')
N=int(input())
num=list(map(int,input().split()))
#print(num)
num.sort()
ans=0
for i in range(N-1):
    if num[i]==num[i+1]:
        ans=1
        break
if ans==0:
    print("Yes")
if ans==1:
    print("No")
N=int(input())
A=input().split()
if len(set(A))==N:
    print("Yes")
else:
    print("No")
N = int(input())
A = list(map(int, input().split()))

res = True
for n in range(N):
    for i in range(N):
        if n != i:
            if A[n] == A[i]:
                res = False
if res:
    print('Yes')
else:
    print('No')
a=int(input())
list_a = [int(x) for x in input().split()]
set_a = set(list_a)
list_b = list(set_a)

list_a.sort()
if list_a == list_b:
    print("YES")
else:
    print("NO")
n = int(input())
a = list(map(int,input().split()))
cnt = 0
for i in range(n):
    for j in range(n):
        if a[i] == a[j]:
            cnt += 1
if cnt > n:
    print('No')
else:
    print('Yes')
import collections
N = int(input())
A = list(map(int, input().split()))
c = collections.Counter(A)
if c.most_common()[0][1] > 1:
    print('No')
else:
    print('Yes')
import numpy as np
def f(n, a):
    if len(np.unique(a)) == a:
        print('YES')
    else:
        print('NO')

n = input()
a = list(map(int, input().split()))

f(n, a)
n = int(input())
ls = list(map(int,input().split()))
ls.sort()
a = 0
for i in range(len(ls)-1):
    if ls[i] == ls[i+1]:
        a += 1
        break
    else:
        continue
if a == 1:
    print('No')
else:
    print('Yes')
from collections import Counter

# input
N = int(input())
A = list(map(int, input().split()))

if [1 ** N] == Counter(A).values():
    print("YES")
else:
    print("NO")
N = int(input())
A = list(map(int,input().split()))
def yabaton(A):
  for i in range(0,N-1):
    for j in range(i+1,N):
      if A[i] == A[j]:
        return 'NO'
  return 'YES'
yabaton(A)
n = int(input())
a = list(map(int, input().split(' ')))
s = set(a)

if len(a) is len(s):
    print('YES')
else:
    print('NO')
from sys import stdin


def get_result(data):
    N, A = data[0], data[1]
    return 'Yes' if len(list(set(A))) == N[0] else 'NO'

if __name__ == '__main__':
    raw_data = [val.rstrip('\n') for val in stdin.readlines()]
    data = [list(map(int, val.split(' '))) for val in raw_data]
    result = get_result(data)
    print(result)
N = int(input())
S = input().split()
if N == set(S):
  print("YES")
else:
  print("NO")
n = int(input())
arr = list(map(int, input().split()))

flag = False
for i in arr:
    if arr.count(i) >= 2:
        flag = True
        break

if flag: print("No")
else: print("Yes")
N = int(input())
A = list(map(int, input().split())) 
flag = 0

for i in range(N-2):
 for j in range (i+1,N-1):
  if A[i]==A[j]:
   flag = 1
   break

if flag == 0:
 print ('YES')
else:
 print ('NO')
N = int(input())
A = list(map(int, input().split()))
A.sort()

for i in range(N-1):
  if A[i] == A[i+1]:
    print('No')
    exit()
  else:
    pass
print('Yes')
n = int(input())

a = list(map(int, input().split()))
ngcounter = 0
for i in range(n):
  num = a[i]
  a.pop(i)
  if num in a:
    ngcounter += 1
    break
  else:
    a.append(num)
    
if ngcounter > 0:
  print("NO")
else:
  print("YES")
N = int(input())
A = list(map(int, input().split()))


list=[]
cnt=0
for a in A:
    if a in list:
        print('No')
        break
    else:
        list.append(a)
        cnt+=1
if cnt==N:
    print('Yes')
N,K=map(int,input().split())
P=list(map(int,input().split()))
for i in range(N):
  if i!=0:
    P[i]=P[i-1]+(P[i]+1)/2
  else:
    P[i]=(P[i]+1)/2
    
ans=P[K-1]
for i in range(N-K+1):
  ans=max(ans,P[i+K-1]-P[i-1])
    
print(ans)
n, k = map(int, input().split())
ls = list(map(int, input().split()))

exv = 0

for j in range(k):
    exv += (ls[j] + 1) / 2

ans = exv

for i in range(k, n):
    exv += (ls[i] + 1) / 2
    exv -= (ls[i - k] + 1) / 2
    
    if exv > ans:
        ans = exv

print(ans)
n,k = map(int,input().split())
p = list(map(int,input().split()))

pp = list(map(lambda x:(x+1)/2,p))

p_rui = [pp[0]]
for i in range(1,n):
    p_rui.append(p_rui[i-1]+pp[i])



walist=[p_rui[k-1]]
for i in range(0,n-k):
    walist += [p_rui[k+i]-p_rui[i]]

print(max(walist))
n, k = map(int, input().split())
p = [(int(p) + 1) / 2. for p in input().split()]
sumexp = sum(p[:k])
maxexp = sumexp
for i in range(n-k):
  sumexp += p[i+k] - p[i]
  if sumexp > maxexp:
    maxexp = sumexp
print(maxexp)
N,K = map(int,input().split())
ruiseki = [0]*(N+1)
now = 0
maximum = -999999999
ans = 0
p = list(map(int,input().split()))
for i in range(N):
    now += p[i]
    ruiseki[i+1] = now
for i in range(0,N-K+1):
    P = ruiseki[i+K]-ruiseki[i]
    if P > maximum:
        maximum = P
        Q = p[i:i+K]
for i in range(len(Q)):
    ans += (0.5*Q[i]*(Q[i]+1))/Q[i]
print(ans)
N, K = map(int,input().split())
dices = list(map(int,input().split()))
list =[]
check=0
for i in range(K):
    check+=dices[i]
list.append(check)
for j in range(N-K):
    check -= dices[j]
    check += dices[j+K]
    list.append(check)    
print((max(list)+K)/2)
N, K = map(int, input().split())
lis_p = map(int, input().split())
def calc_exp(x):
    return (int(x) + 1)/2
lis_exp = list(map(calc_exp, lis_p))
dp= sum(lis_exp[0:K])
cumKsum = sum(lis_exp[0:K])
for i in range(1, N-K+1):
    cumKsum = cumKsum - lis_exp[i-1] + lis_exp[i+K-1]
    dp = max(cumKsum, dp)
print(dp)
#!/usr/bin/env python3
N, K = [int(str) for str in input().strip().split()]
x = [int(str) for str in input().strip().split()]

sums = [0]
for i in x:
    sums.append(sums[-1] + (i + 1) / 2)

ans = 0
for i in range(N - K + 1):
    ans = max(sums[i + K] - sums[i], ans)

print(ans)
expected_value_dic = {}

def get_expected_value(x):
    return (1 + x) / 2

n, k = map(int, input().split())

P = list(map(int, input().split()))
expected_values = [get_expected_value(p) for p in P]
cumulative_values = [expected_values[0]]
for expected_value in expected_values[1:]:
    cumulative_values.append(cumulative_values[-1] + expected_value)

result = cumulative_values[k-1]
for i in range(k, n):
    temp = cumulative_values[i] - cumulative_values[i - k]
    if temp > result:
        result = temp

print(result)
n,k = map(int,input().split())
p = list(map(int,input().split()))
s = [0]
ans = [0]

#累積和
for i in range(n):
    s.append(s[i]+(p[i]+1)/2)

#区間kの和をリストに格納
for i in range(n-k+1):
    ans[i] = s[k+i] - s[i]
    ans.append(ans[i])

#区間kの和の中で最大値
print(max(ans))
n, k = map(int, input().split())
P = list(map(int, input().split()))

import numpy as np

max_v = np.sum(P[:k])

#print(max_v)
j = 0
cum = 0

temp_max = max_v

for i in range(k, n):
  temp_max += P[i]
  temp_max -= P[i-k]
  if temp_max>max_v:
    max_v = temp_max
    j=i-k
              
ans = (max_v+k)/2
print(ans)
#print(max_v)
n,k=map(int,input().split())
p=[int(i)+1 for i in input().split()]

num=sum(p[:k])
ans=num
for i in range(n-k):
  tmp=p[i+k]-p[i]
  num+=tmp
  if ans<num:
    ans=num

print(ans/2)
n,k=map(int,input().split())
p=list(map(int,input().split()))

rui=[]
rui.append(p[0]/2+0.5)
for i in range(1,n):
    rui.append(rui[i-1]+(p[i]/2+0.5))

#print(rui)
ans=[]
ans.append(rui[k-1])
for i in range(n-k):
    ans.append(rui[k+i]-rui[i])
    #print(ans)
print(max(ans))
n, k = map(int, input().split())
P = list(map(int, input().split()))


E = [0] * 1001

total = 0
for i in range(1, 1001):
    total += i
    e = total / i
    E[i] = e

P_to_E = [E[p] for p in P]


candidate = sum(P_to_E[:k])
candidates = [candidate]

for i in range(n-k):
    drop = P_to_E[i]
    add = P_to_E[i+k]
    candidate += add - drop
    candidates.append(candidate)

print(max(candidates))
n,k=map(int,input().split())
i=list(map(int,input().split()))
l=[0]*(n-k)
for j in range(n-k):
  l[j]=i[j+k]-i[j]
place=0
plus=0
for j in range(n-k):
  plus=plus+l[j]
  if plus>0:
    place=j+1
    plus=0
a=0.0
for j in range(k):
  a+=float(i[j+place]+1)/2
print(a)