message stringlengths 2 44.5k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 42 109k | cluster float64 5 5 | __index_level_0__ int64 84 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n numbers a1, a2, ..., an. You can perform at most k operations. For each operation you can multiply one of the numbers by x. We want to make <image> as large as possible, where <image> denotes the bitwise OR.
Find the maximum possible value of <image> after performing at most k operations optimally.
Input
The first line contains three integers n, k and x (1 ≤ n ≤ 200 000, 1 ≤ k ≤ 10, 2 ≤ x ≤ 8).
The second line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 109).
Output
Output the maximum value of a bitwise OR of sequence elements after performing operations.
Examples
Input
3 1 2
1 1 1
Output
3
Input
4 2 3
1 2 4 8
Output
79
Note
For the first sample, any possible choice of doing one operation will result the same three numbers 1, 1, 2 so the result is <image>.
For the second sample if we multiply 8 by 3 two times we'll get 72. In this case the numbers will become 1, 2, 4, 72 so the OR value will be 79 and is the largest possible result.
Submitted Solution:
```
from sys import stdin
input=stdin.readline
def get_or(a,b):
return a|b
class SegmentTree:
def __init__(self, data, default=0, func=max):
"""initialize the segment tree with data"""
self._default = default
self._func = func
self._len = len(data)
self._size = _size = 1 << (self._len - 1).bit_length()
self.data = [default] * (2 * _size)
self.data[_size:_size + self._len] = data
for i in reversed(range(_size)):
self.data[i] = func(self.data[i + i], self.data[i + i + 1])
def __delitem__(self, idx):
self[idx] = self._default
def __getitem__(self, idx):
return self.data[idx + self._size]
def __setitem__(self, idx, value):
idx += self._size
self.data[idx] = value
idx >>= 1
while idx:
self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])
idx >>= 1
def __len__(self):
return self._len
def query(self, start, stop):
"""func of data[start, stop)"""
start += self._size
stop += self._size
res_left = res_right = self._default
while start < stop:
if start & 1:
res_left = self._func(res_left, self.data[start])
start += 1
if stop & 1:
stop -= 1
res_right = self._func(self.data[stop], res_right)
start >>= 1
stop >>= 1
return self._func(res_left, res_right)
def __repr__(self):
return "SegmentTree({0})".format(self.data)
def f(a,k,x):
st=SegmentTree(data=a,func=get_or,default=0)
n=len(a)
x=pow(x,k)
cmax=st.query(0,n)
for i in range(len(a)):
st.__setitem__(i,a[i]*x)
cmax=max(cmax,st.query(0,n))
st.__setitem__(i,a[i])
return cmax
n,k,x=map(int,input().strip().split())
a=list(map(int,input().strip().split()))
# a=[200]*(2*(10**5))
print(f(a,k,x))
``` | instruction | 0 | 26,947 | 5 | 53,894 |
Yes | output | 1 | 26,947 | 5 | 53,895 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n numbers a1, a2, ..., an. You can perform at most k operations. For each operation you can multiply one of the numbers by x. We want to make <image> as large as possible, where <image> denotes the bitwise OR.
Find the maximum possible value of <image> after performing at most k operations optimally.
Input
The first line contains three integers n, k and x (1 ≤ n ≤ 200 000, 1 ≤ k ≤ 10, 2 ≤ x ≤ 8).
The second line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 109).
Output
Output the maximum value of a bitwise OR of sequence elements after performing operations.
Examples
Input
3 1 2
1 1 1
Output
3
Input
4 2 3
1 2 4 8
Output
79
Note
For the first sample, any possible choice of doing one operation will result the same three numbers 1, 1, 2 so the result is <image>.
For the second sample if we multiply 8 by 3 two times we'll get 72. In this case the numbers will become 1, 2, 4, 72 so the OR value will be 79 and is the largest possible result.
Submitted Solution:
```
import sys
import math
#from queue import *
#import random
#sys.setrecursionlimit(int(1e6))
input = sys.stdin.readline
############ ---- USER DEFINED INPUT FUNCTIONS ---- ############
def inp():
return(int(input()))
def inara():
return(list(map(int,input().split())))
def insr():
s = input()
return(list(s[:len(s) - 1]))
def invr():
return(map(int,input().split()))
################################################################
############ ---- THE ACTUAL CODE STARTS BELOW ---- ############
n,k,x=invr()
ara=inara()
ara.append(0)
ara.reverse()
ara.append(0)
ara.reverse()
mul=int(math.pow(x,k))
pref=[0]*(n+2)
for i in range(1,n+1):
pref[i]=pref[i-1]|ara[i]
suff=[0]*(n+2)
for i in range(n,0,-1):
suff[i]=suff[i+1]|ara[i]
ans=0
for i in range(1,n+1):
ans=max(ans,pref[i-1]|ara[i]*mul|suff[i+1])
print(ans)
``` | instruction | 0 | 26,948 | 5 | 53,896 |
Yes | output | 1 | 26,948 | 5 | 53,897 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n numbers a1, a2, ..., an. You can perform at most k operations. For each operation you can multiply one of the numbers by x. We want to make <image> as large as possible, where <image> denotes the bitwise OR.
Find the maximum possible value of <image> after performing at most k operations optimally.
Input
The first line contains three integers n, k and x (1 ≤ n ≤ 200 000, 1 ≤ k ≤ 10, 2 ≤ x ≤ 8).
The second line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 109).
Output
Output the maximum value of a bitwise OR of sequence elements after performing operations.
Examples
Input
3 1 2
1 1 1
Output
3
Input
4 2 3
1 2 4 8
Output
79
Note
For the first sample, any possible choice of doing one operation will result the same three numbers 1, 1, 2 so the result is <image>.
For the second sample if we multiply 8 by 3 two times we'll get 72. In this case the numbers will become 1, 2, 4, 72 so the OR value will be 79 and is the largest possible result.
Submitted Solution:
```
n,k,x = list(map(int,input().split()))
arr = list(map(int,input().split()))
arr.sort(reverse=True)
for i in range(k):
arr[0]*=x
ans = 0
for i in range(n):
ans|=arr[i]
print(ans)
``` | instruction | 0 | 26,949 | 5 | 53,898 |
No | output | 1 | 26,949 | 5 | 53,899 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n numbers a1, a2, ..., an. You can perform at most k operations. For each operation you can multiply one of the numbers by x. We want to make <image> as large as possible, where <image> denotes the bitwise OR.
Find the maximum possible value of <image> after performing at most k operations optimally.
Input
The first line contains three integers n, k and x (1 ≤ n ≤ 200 000, 1 ≤ k ≤ 10, 2 ≤ x ≤ 8).
The second line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 109).
Output
Output the maximum value of a bitwise OR of sequence elements after performing operations.
Examples
Input
3 1 2
1 1 1
Output
3
Input
4 2 3
1 2 4 8
Output
79
Note
For the first sample, any possible choice of doing one operation will result the same three numbers 1, 1, 2 so the result is <image>.
For the second sample if we multiply 8 by 3 two times we'll get 72. In this case the numbers will become 1, 2, 4, 72 so the OR value will be 79 and is the largest possible result.
Submitted Solution:
```
l=list(map(int,input().split(" ")))
n=l[0]
m=l[1]
x=l[2]
mi=[1]
for i in range(1,m+1):
mi.append(mi[i-1]*x)
a=[0]+list(map(int,input().split(" ")))
f=[[]]
for i in range(0,m+2):
f[0].append(0)
for i in range(1,n+1):
f.append([f[i-1][0]|a[i]])
for j in range(1,m+1):
# print(i,j)
f[i].append(f[i-1][j])
for k in range(0,j+1):
f[i][j]=max(f[i][j],f[i-1][j-k]|(a[i]*mi[k]))
# for i in range(0,m+1):
print(f[n][m])
``` | instruction | 0 | 26,950 | 5 | 53,900 |
No | output | 1 | 26,950 | 5 | 53,901 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n numbers a1, a2, ..., an. You can perform at most k operations. For each operation you can multiply one of the numbers by x. We want to make <image> as large as possible, where <image> denotes the bitwise OR.
Find the maximum possible value of <image> after performing at most k operations optimally.
Input
The first line contains three integers n, k and x (1 ≤ n ≤ 200 000, 1 ≤ k ≤ 10, 2 ≤ x ≤ 8).
The second line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 109).
Output
Output the maximum value of a bitwise OR of sequence elements after performing operations.
Examples
Input
3 1 2
1 1 1
Output
3
Input
4 2 3
1 2 4 8
Output
79
Note
For the first sample, any possible choice of doing one operation will result the same three numbers 1, 1, 2 so the result is <image>.
For the second sample if we multiply 8 by 3 two times we'll get 72. In this case the numbers will become 1, 2, 4, 72 so the OR value will be 79 and is the largest possible result.
Submitted Solution:
```
a = input().split()
n = int(a[0])
k = int(a[1])
x = int(a[2])
a = input().split()
for i in range(len(a)):
a[i]=int(a[i])
a.sort()
ans = 0
for i in range(k):
a[-1]*=x
for i in a:
ans|=i
print(ans)
``` | instruction | 0 | 26,951 | 5 | 53,902 |
No | output | 1 | 26,951 | 5 | 53,903 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n numbers a1, a2, ..., an. You can perform at most k operations. For each operation you can multiply one of the numbers by x. We want to make <image> as large as possible, where <image> denotes the bitwise OR.
Find the maximum possible value of <image> after performing at most k operations optimally.
Input
The first line contains three integers n, k and x (1 ≤ n ≤ 200 000, 1 ≤ k ≤ 10, 2 ≤ x ≤ 8).
The second line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 109).
Output
Output the maximum value of a bitwise OR of sequence elements after performing operations.
Examples
Input
3 1 2
1 1 1
Output
3
Input
4 2 3
1 2 4 8
Output
79
Note
For the first sample, any possible choice of doing one operation will result the same three numbers 1, 1, 2 so the result is <image>.
For the second sample if we multiply 8 by 3 two times we'll get 72. In this case the numbers will become 1, 2, 4, 72 so the OR value will be 79 and is the largest possible result.
Submitted Solution:
```
n, k, x = list(map(int, input().split()))
arr = list(map(int, input().split()))
arr[arr.index(max(arr))] = max(arr) * (x ** k)
print(sum(set(arr)))
``` | instruction | 0 | 26,952 | 5 | 53,904 |
No | output | 1 | 26,952 | 5 | 53,905 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Input
The input contains a single integer a (1 ≤ a ≤ 30).
Output
Output a single integer.
Example
Input
3
Output
27
Submitted Solution:
```
n = int(input())
print([4, 22, 27, 58, 85, 94, 121, 166, 202, 265, 274, 319, 346, 355, 378, 382, 391, 438, 454, 483, 517, 526, 535, 562, 576, 588, 627, 634, 636, 645, 648, 654, 663, 666, 690, 706, 728, 729, 762, 778, 825, 852, 861, 895, 913, 915, 922][n - 1])
``` | instruction | 0 | 27,057 | 5 | 54,114 |
Yes | output | 1 | 27,057 | 5 | 54,115 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Input
The input contains a single integer a (1 ≤ a ≤ 30).
Output
Output a single integer.
Example
Input
3
Output
27
Submitted Solution:
```
print([4,22,27,58,85,94,121,166,202,265,274,319,346,355,378,382,391,438,454,483,517,526,535,562,576,588,627,634,636,645][int(input())-1])
``` | instruction | 0 | 27,058 | 5 | 54,116 |
Yes | output | 1 | 27,058 | 5 | 54,117 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Input
The input contains a single integer a (1 ≤ a ≤ 30).
Output
Output a single integer.
Example
Input
3
Output
27
Submitted Solution:
```
n = int(input())
print([4, 22, 27, 58, 85, 94, 121, 166, 202, 265, 274, 319, 346, 355, 378, 382, 391, 438, 454, 483, 517, 526, 535, 562, 576, 588, 627, 634, 636, 645, 648, 654, 663, 666, 690, 706, 728, 729, 762, 778, 825, 852, 861, 895, 913, 915, 922, 958, 985, 1086, 1111, 1165][n-1])
``` | instruction | 0 | 27,059 | 5 | 54,118 |
Yes | output | 1 | 27,059 | 5 | 54,119 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Input
The input contains a single integer a (1 ≤ a ≤ 30).
Output
Output a single integer.
Example
Input
3
Output
27
Submitted Solution:
```
def sumDigits(n):
answer = 0
while n > 0:
answer += n%10
n = n // 10
return answer
def listFactors(n):
# Precondition: n <= 30
answer = []
while n > 1:
for i in range(2,n+1):
if n%i == 0:
answer.append(i)
n = n // i
break
return answer
# print("Input i")
i = int(input())
test = 4
numsofar = 0
while numsofar < i:
# print("Checking " + str(test))
if len(listFactors(test)) > 1: # It's composite
# print("Test is composite")
numsum = sumDigits(test)
factorsum = 0
for factor in listFactors(test):
factorsum += sumDigits(factor)
if numsum == factorsum: # We've found one
numsofar += 1
if numsofar == i:
print(test)
break
test += 1
``` | instruction | 0 | 27,060 | 5 | 54,120 |
Yes | output | 1 | 27,060 | 5 | 54,121 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Input
The input contains a single integer a (1 ≤ a ≤ 30).
Output
Output a single integer.
Example
Input
3
Output
27
Submitted Solution:
```
def mp():
return map(int, input().split())
k = int(input())
print(k ** k)
``` | instruction | 0 | 27,061 | 5 | 54,122 |
No | output | 1 | 27,061 | 5 | 54,123 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Input
The input contains a single integer a (1 ≤ a ≤ 30).
Output
Output a single integer.
Example
Input
3
Output
27
Submitted Solution:
```
import sys
for line in sys.stdin:
x = int(line)
print(x**3)
``` | instruction | 0 | 27,062 | 5 | 54,124 |
No | output | 1 | 27,062 | 5 | 54,125 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Input
The input contains a single integer a (1 ≤ a ≤ 30).
Output
Output a single integer.
Example
Input
3
Output
27
Submitted Solution:
```
#!/usr/bin/env python3
def main():
try:
while True:
n = int(input())
if n == 3:
print(27)
elif n == 1:
print(4)
elif n == 2:
print(1)
elif n < 5:
assert False
else:
print('?')
except EOFError:
pass
main()
``` | instruction | 0 | 27,063 | 5 | 54,126 |
No | output | 1 | 27,063 | 5 | 54,127 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Input
The input contains a single integer a (1 ≤ a ≤ 30).
Output
Output a single integer.
Example
Input
3
Output
27
Submitted Solution:
```
a = int(input())
if(a==3):
print(27)
elif(a==1):
print(4)
elif(a==2):
print(22)
else:
print(3)
``` | instruction | 0 | 27,064 | 5 | 54,128 |
No | output | 1 | 27,064 | 5 | 54,129 |
Provide a correct Python 3 solution for this coding contest problem.
We have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown.
We will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum.
Constraints
* 1 ≤ K ≤ N ≤ 200000
* 1 ≤ p_i ≤ 1000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
p_1 ... p_N
Output
Print the maximum possible value of the expected value of the sum of the numbers shown.
Your output will be considered correct when its absolute or relative error from our answer is at most 10^{-6}.
Examples
Input
5 3
1 2 2 4 5
Output
7.000000000000
Input
4 1
6 6 6 6
Output
3.500000000000
Input
10 4
17 13 13 12 15 20 10 13 17 11
Output
32.000000000000 | instruction | 0 | 27,154 | 5 | 54,308 |
"Correct Solution:
```
n,k= map(int,input().split())
p= list(map(int,input().split()))
sp=[0]*(n-(k-1))
sp[0]=sum(p[0:k])
for i in range(1,n-(k-1)):sp[i]=sp[i-1]+p[i+k-1]-p[i-1]
print((max(sp)+k)/2)
``` | output | 1 | 27,154 | 5 | 54,309 |
Provide a correct Python 3 solution for this coding contest problem.
We have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown.
We will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum.
Constraints
* 1 ≤ K ≤ N ≤ 200000
* 1 ≤ p_i ≤ 1000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
p_1 ... p_N
Output
Print the maximum possible value of the expected value of the sum of the numbers shown.
Your output will be considered correct when its absolute or relative error from our answer is at most 10^{-6}.
Examples
Input
5 3
1 2 2 4 5
Output
7.000000000000
Input
4 1
6 6 6 6
Output
3.500000000000
Input
10 4
17 13 13 12 15 20 10 13 17 11
Output
32.000000000000 | instruction | 0 | 27,155 | 5 | 54,310 |
"Correct Solution:
```
n,k=map(int,input().split())
p=list(map(int,input().split()))
q=[0]
for i in range(0,n-k):
q.append(q[-1]+p[i+k]-p[i])
b=q.index(max(q))
s=0
for i in range(b,b+k):
s+=p[i]
print((s+k)/2)
``` | output | 1 | 27,155 | 5 | 54,311 |
Provide a correct Python 3 solution for this coding contest problem.
We have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown.
We will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum.
Constraints
* 1 ≤ K ≤ N ≤ 200000
* 1 ≤ p_i ≤ 1000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
p_1 ... p_N
Output
Print the maximum possible value of the expected value of the sum of the numbers shown.
Your output will be considered correct when its absolute or relative error from our answer is at most 10^{-6}.
Examples
Input
5 3
1 2 2 4 5
Output
7.000000000000
Input
4 1
6 6 6 6
Output
3.500000000000
Input
10 4
17 13 13 12 15 20 10 13 17 11
Output
32.000000000000 | instruction | 0 | 27,156 | 5 | 54,312 |
"Correct Solution:
```
n,k=map(int,input().split())
a=list(map(int,input().split()))
s=sum(a[:k])
l=[s]
for x in range(n-k):
s=s-a[x]+a[x+k]
l.append(s)
print((max(l)+k)/2)
``` | output | 1 | 27,156 | 5 | 54,313 |
Provide a correct Python 3 solution for this coding contest problem.
We have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown.
We will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum.
Constraints
* 1 ≤ K ≤ N ≤ 200000
* 1 ≤ p_i ≤ 1000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
p_1 ... p_N
Output
Print the maximum possible value of the expected value of the sum of the numbers shown.
Your output will be considered correct when its absolute or relative error from our answer is at most 10^{-6}.
Examples
Input
5 3
1 2 2 4 5
Output
7.000000000000
Input
4 1
6 6 6 6
Output
3.500000000000
Input
10 4
17 13 13 12 15 20 10 13 17 11
Output
32.000000000000 | instruction | 0 | 27,157 | 5 | 54,314 |
"Correct Solution:
```
N, K = 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[K+i]
if m < s:
m = s
print((m+K)/2)
``` | output | 1 | 27,157 | 5 | 54,315 |
Provide a correct Python 3 solution for this coding contest problem.
We have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown.
We will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum.
Constraints
* 1 ≤ K ≤ N ≤ 200000
* 1 ≤ p_i ≤ 1000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
p_1 ... p_N
Output
Print the maximum possible value of the expected value of the sum of the numbers shown.
Your output will be considered correct when its absolute or relative error from our answer is at most 10^{-6}.
Examples
Input
5 3
1 2 2 4 5
Output
7.000000000000
Input
4 1
6 6 6 6
Output
3.500000000000
Input
10 4
17 13 13 12 15 20 10 13 17 11
Output
32.000000000000 | instruction | 0 | 27,159 | 5 | 54,318 |
"Correct Solution:
```
n,k=map(int, input().split())
p=[int(x) for x in input().split()]
s=0
for c in range(k):
s+=p[c]
t=s
for c in range(n-k):
t+=p[c+k]-p[c]
if t>s:
s=t
print((s+k)/2)
``` | output | 1 | 27,159 | 5 | 54,319 |
Provide a correct Python 3 solution for this coding contest problem.
We have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown.
We will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum.
Constraints
* 1 ≤ K ≤ N ≤ 200000
* 1 ≤ p_i ≤ 1000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
p_1 ... p_N
Output
Print the maximum possible value of the expected value of the sum of the numbers shown.
Your output will be considered correct when its absolute or relative error from our answer is at most 10^{-6}.
Examples
Input
5 3
1 2 2 4 5
Output
7.000000000000
Input
4 1
6 6 6 6
Output
3.500000000000
Input
10 4
17 13 13 12 15 20 10 13 17 11
Output
32.000000000000 | instruction | 0 | 27,160 | 5 | 54,320 |
"Correct Solution:
```
n,k=map(int,input().split())
A=list(map(int,input().split()))
B=[(i+1)/2 for i in A]
m=M=sum(B[:k])
for i in range(n-k):
m=m-B[i]+B[k+i]
M=max(M,m)
print(M)
``` | output | 1 | 27,160 | 5 | 54,321 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown.
We will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum.
Constraints
* 1 ≤ K ≤ N ≤ 200000
* 1 ≤ p_i ≤ 1000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
p_1 ... p_N
Output
Print the maximum possible value of the expected value of the sum of the numbers shown.
Your output will be considered correct when its absolute or relative error from our answer is at most 10^{-6}.
Examples
Input
5 3
1 2 2 4 5
Output
7.000000000000
Input
4 1
6 6 6 6
Output
3.500000000000
Input
10 4
17 13 13 12 15 20 10 13 17 11
Output
32.000000000000
Submitted Solution:
```
N,K = map(int,input().split())
P = list(map(int,input().split()))
Q = sum(P[:K])
R = Q
for n in range(N-K):
Q = Q-P[n]+P[n+K]
R = max(Q,R)
print((R+K)/2)
``` | instruction | 0 | 27,163 | 5 | 54,326 |
Yes | output | 1 | 27,163 | 5 | 54,327 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown.
We will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum.
Constraints
* 1 ≤ K ≤ N ≤ 200000
* 1 ≤ p_i ≤ 1000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
p_1 ... p_N
Output
Print the maximum possible value of the expected value of the sum of the numbers shown.
Your output will be considered correct when its absolute or relative error from our answer is at most 10^{-6}.
Examples
Input
5 3
1 2 2 4 5
Output
7.000000000000
Input
4 1
6 6 6 6
Output
3.500000000000
Input
10 4
17 13 13 12 15 20 10 13 17 11
Output
32.000000000000
Submitted Solution:
```
n,k=map(int,input().split())
p=[(i+1)/2 for i in map(float,input().split())]
MAX=sum(p[0:k])
s=[MAX]*n
for i in range(0,n-k):
s[i+1]=p[i+k]+s[i]-p[i]
MAX=max(MAX,s[i+1])
print(MAX)
``` | instruction | 0 | 27,165 | 5 | 54,330 |
Yes | output | 1 | 27,165 | 5 | 54,331 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have N dice arranged in a line from left to right. The i-th die from the left shows p_i numbers from 1 to p_i with equal probability when thrown.
We will choose K adjacent dice, throw each of them independently, and compute the sum of the numbers shown. Find the maximum possible value of the expected value of this sum.
Constraints
* 1 ≤ K ≤ N ≤ 200000
* 1 ≤ p_i ≤ 1000
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
p_1 ... p_N
Output
Print the maximum possible value of the expected value of the sum of the numbers shown.
Your output will be considered correct when its absolute or relative error from our answer is at most 10^{-6}.
Examples
Input
5 3
1 2 2 4 5
Output
7.000000000000
Input
4 1
6 6 6 6
Output
3.500000000000
Input
10 4
17 13 13 12 15 20 10 13 17 11
Output
32.000000000000
Submitted Solution:
```
input_line = [int(i) for i in input().split(" ")]
k = input_line[1]
input_line = [(int(i) + 1) / 2 for i in input().split(" ")]
max_excepted_value = 0
for i in range(len(input_line) - k + 1):
sum_excepted_value = sum(input_line[i: i+ k])
if max_excepted_value < sum_excepted_value:
max_excepted_value = sum_excepted_value
print(max_excepted_value)
``` | instruction | 0 | 27,166 | 5 | 54,332 |
No | output | 1 | 27,166 | 5 | 54,333 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi is going to set a 3-character password.
How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?
Constraints
* 1 \leq N \leq 9
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the number of possible passwords.
Examples
Input
2
Output
8
Input
1
Output
1 | instruction | 0 | 27,170 | 5 | 54,340 |
"Correct Solution:
```
inp = int(input())
print(inp*inp*inp)
``` | output | 1 | 27,170 | 5 | 54,341 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi is going to set a 3-character password.
How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?
Constraints
* 1 \leq N \leq 9
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the number of possible passwords.
Examples
Input
2
Output
8
Input
1
Output
1 | instruction | 0 | 27,171 | 5 | 54,342 |
"Correct Solution:
```
N=int(input())
print(int(pow(N,3)))
``` | output | 1 | 27,171 | 5 | 54,343 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi is going to set a 3-character password.
How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?
Constraints
* 1 \leq N \leq 9
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the number of possible passwords.
Examples
Input
2
Output
8
Input
1
Output
1 | instruction | 0 | 27,172 | 5 | 54,344 |
"Correct Solution:
```
_N = int(input())
print(_N * _N * _N)
``` | output | 1 | 27,172 | 5 | 54,345 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi is going to set a 3-character password.
How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?
Constraints
* 1 \leq N \leq 9
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the number of possible passwords.
Examples
Input
2
Output
8
Input
1
Output
1 | instruction | 0 | 27,173 | 5 | 54,346 |
"Correct Solution:
```
N=int(input())
T=3
print(N**3)
``` | output | 1 | 27,173 | 5 | 54,347 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi is going to set a 3-character password.
How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?
Constraints
* 1 \leq N \leq 9
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the number of possible passwords.
Examples
Input
2
Output
8
Input
1
Output
1 | instruction | 0 | 27,174 | 5 | 54,348 |
"Correct Solution:
```
p=int(input())
print(p**3)
``` | output | 1 | 27,174 | 5 | 54,349 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi is going to set a 3-character password.
How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?
Constraints
* 1 \leq N \leq 9
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the number of possible passwords.
Examples
Input
2
Output
8
Input
1
Output
1 | instruction | 0 | 27,175 | 5 | 54,350 |
"Correct Solution:
```
N = int(input())
r = N*N*N
print(r)
``` | output | 1 | 27,175 | 5 | 54,351 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi is going to set a 3-character password.
How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?
Constraints
* 1 \leq N \leq 9
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the number of possible passwords.
Examples
Input
2
Output
8
Input
1
Output
1 | instruction | 0 | 27,176 | 5 | 54,352 |
"Correct Solution:
```
#A問題
N = int(input())
print(N**3)
``` | output | 1 | 27,176 | 5 | 54,353 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi is going to set a 3-character password.
How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?
Constraints
* 1 \leq N \leq 9
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the number of possible passwords.
Examples
Input
2
Output
8
Input
1
Output
1 | instruction | 0 | 27,177 | 5 | 54,354 |
"Correct Solution:
```
a=int(input())
answer=a**3
print(answer)
``` | output | 1 | 27,177 | 5 | 54,355 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi is going to set a 3-character password.
How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?
Constraints
* 1 \leq N \leq 9
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the number of possible passwords.
Examples
Input
2
Output
8
Input
1
Output
1
Submitted Solution:
```
#140
n = int(input())
print(n**3)
``` | instruction | 0 | 27,178 | 5 | 54,356 |
Yes | output | 1 | 27,178 | 5 | 54,357 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi is going to set a 3-character password.
How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?
Constraints
* 1 \leq N \leq 9
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the number of possible passwords.
Examples
Input
2
Output
8
Input
1
Output
1
Submitted Solution:
```
A = int(input())
print(str(A ** 3))
``` | instruction | 0 | 27,179 | 5 | 54,358 |
Yes | output | 1 | 27,179 | 5 | 54,359 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi is going to set a 3-character password.
How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?
Constraints
* 1 \leq N \leq 9
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the number of possible passwords.
Examples
Input
2
Output
8
Input
1
Output
1
Submitted Solution:
```
n = input()
e = int(n)
print(e*e*e)
``` | instruction | 0 | 27,180 | 5 | 54,360 |
Yes | output | 1 | 27,180 | 5 | 54,361 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi is going to set a 3-character password.
How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?
Constraints
* 1 \leq N \leq 9
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the number of possible passwords.
Examples
Input
2
Output
8
Input
1
Output
1
Submitted Solution:
```
a = int(input())
num = a ** 3
print(num)
``` | instruction | 0 | 27,181 | 5 | 54,362 |
Yes | output | 1 | 27,181 | 5 | 54,363 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi is going to set a 3-character password.
How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?
Constraints
* 1 \leq N \leq 9
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the number of possible passwords.
Examples
Input
2
Output
8
Input
1
Output
1
Submitted Solution:
```
n = int(input())
result = 1
while n >= 1:
result *= n
n -= 1
print(result)
``` | instruction | 0 | 27,182 | 5 | 54,364 |
No | output | 1 | 27,182 | 5 | 54,365 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi is going to set a 3-character password.
How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?
Constraints
* 1 \leq N \leq 9
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the number of possible passwords.
Examples
Input
2
Output
8
Input
1
Output
1
Submitted Solution:
```
n = int(input())
password = n^3
print(password)
``` | instruction | 0 | 27,183 | 5 | 54,366 |
No | output | 1 | 27,183 | 5 | 54,367 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi is going to set a 3-character password.
How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?
Constraints
* 1 \leq N \leq 9
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the number of possible passwords.
Examples
Input
2
Output
8
Input
1
Output
1
Submitted Solution:
```
n=int(input())
a=list(map(int, input().split()))
b=list(map(int, input().split()))
c=list(map(int, input().split()))
cnt=0
for i,v in enumerate(a):
cnt += b[v-1]
if i == 0:continue
if v-1 == a[i-1]:
#print(c[v-1])
cnt += c[v-2]
print(cnt)
``` | instruction | 0 | 27,184 | 5 | 54,368 |
No | output | 1 | 27,184 | 5 | 54,369 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi is going to set a 3-character password.
How many possible passwords are there if each of its characters must be a digit between 1 and N (inclusive)?
Constraints
* 1 \leq N \leq 9
* N is an integer.
Input
Input is given from Standard Input in the following format:
N
Output
Print the number of possible passwords.
Examples
Input
2
Output
8
Input
1
Output
1
Submitted Solution:
```
def check(N):
if type(N) == int and N >= 1 and N <= 9:
return(N**3)
check(N)
``` | instruction | 0 | 27,185 | 5 | 54,370 |
No | output | 1 | 27,185 | 5 | 54,371 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an integer N that has exactly four digits in base ten. How many times does `2` occur in the base-ten representation of N?
Constraints
* 1000 \leq N \leq 9999
Input
Input is given from Standard Input in the following format:
N
Output
Print the answer.
Examples
Input
1222
Output
3
Input
3456
Output
0
Input
9592
Output
1 | instruction | 0 | 27,202 | 5 | 54,404 |
"Correct Solution:
```
s = input()
ct = 0
for i in range(4):
if s[i] == '2':ct+=1
print(ct)
``` | output | 1 | 27,202 | 5 | 54,405 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an integer N that has exactly four digits in base ten. How many times does `2` occur in the base-ten representation of N?
Constraints
* 1000 \leq N \leq 9999
Input
Input is given from Standard Input in the following format:
N
Output
Print the answer.
Examples
Input
1222
Output
3
Input
3456
Output
0
Input
9592
Output
1 | instruction | 0 | 27,203 | 5 | 54,406 |
"Correct Solution:
```
i = list(input())
n = 0
for x in i:
if x == '2':
n += 1
print(n)
``` | output | 1 | 27,203 | 5 | 54,407 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an integer N that has exactly four digits in base ten. How many times does `2` occur in the base-ten representation of N?
Constraints
* 1000 \leq N \leq 9999
Input
Input is given from Standard Input in the following format:
N
Output
Print the answer.
Examples
Input
1222
Output
3
Input
3456
Output
0
Input
9592
Output
1 | instruction | 0 | 27,204 | 5 | 54,408 |
"Correct Solution:
```
N = input().strip()
print(N.count('2'))
``` | output | 1 | 27,204 | 5 | 54,409 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an integer N that has exactly four digits in base ten. How many times does `2` occur in the base-ten representation of N?
Constraints
* 1000 \leq N \leq 9999
Input
Input is given from Standard Input in the following format:
N
Output
Print the answer.
Examples
Input
1222
Output
3
Input
3456
Output
0
Input
9592
Output
1 | instruction | 0 | 27,205 | 5 | 54,410 |
"Correct Solution:
```
N = input().strip()
print(N.count("2"))
``` | output | 1 | 27,205 | 5 | 54,411 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an integer N that has exactly four digits in base ten. How many times does `2` occur in the base-ten representation of N?
Constraints
* 1000 \leq N \leq 9999
Input
Input is given from Standard Input in the following format:
N
Output
Print the answer.
Examples
Input
1222
Output
3
Input
3456
Output
0
Input
9592
Output
1 | instruction | 0 | 27,206 | 5 | 54,412 |
"Correct Solution:
```
def caddi2018b_a():
n = input()
print(n.count("2"))
caddi2018b_a()
``` | output | 1 | 27,206 | 5 | 54,413 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an integer N that has exactly four digits in base ten. How many times does `2` occur in the base-ten representation of N?
Constraints
* 1000 \leq N \leq 9999
Input
Input is given from Standard Input in the following format:
N
Output
Print the answer.
Examples
Input
1222
Output
3
Input
3456
Output
0
Input
9592
Output
1 | instruction | 0 | 27,207 | 5 | 54,414 |
"Correct Solution:
```
N = input()
cnt = 0
for s in N:
if s == "2":
cnt += 1
print(cnt)
``` | output | 1 | 27,207 | 5 | 54,415 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an integer N that has exactly four digits in base ten. How many times does `2` occur in the base-ten representation of N?
Constraints
* 1000 \leq N \leq 9999
Input
Input is given from Standard Input in the following format:
N
Output
Print the answer.
Examples
Input
1222
Output
3
Input
3456
Output
0
Input
9592
Output
1 | instruction | 0 | 27,208 | 5 | 54,416 |
"Correct Solution:
```
n = input()
ans = n.count('2')
print(ans)
``` | output | 1 | 27,208 | 5 | 54,417 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an integer N that has exactly four digits in base ten. How many times does `2` occur in the base-ten representation of N?
Constraints
* 1000 \leq N \leq 9999
Input
Input is given from Standard Input in the following format:
N
Output
Print the answer.
Examples
Input
1222
Output
3
Input
3456
Output
0
Input
9592
Output
1 | instruction | 0 | 27,209 | 5 | 54,418 |
"Correct Solution:
```
n = input()
ans = 0
for v in n:
if v == '2':
ans += 1
print(ans)
``` | output | 1 | 27,209 | 5 | 54,419 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an integer N that has exactly four digits in base ten. How many times does `2` occur in the base-ten representation of N?
Constraints
* 1000 \leq N \leq 9999
Input
Input is given from Standard Input in the following format:
N
Output
Print the answer.
Examples
Input
1222
Output
3
Input
3456
Output
0
Input
9592
Output
1
Submitted Solution:
```
s = input()
print(s.count("2"))
``` | instruction | 0 | 27,210 | 5 | 54,420 |
Yes | output | 1 | 27,210 | 5 | 54,421 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an integer N that has exactly four digits in base ten. How many times does `2` occur in the base-ten representation of N?
Constraints
* 1000 \leq N \leq 9999
Input
Input is given from Standard Input in the following format:
N
Output
Print the answer.
Examples
Input
1222
Output
3
Input
3456
Output
0
Input
9592
Output
1
Submitted Solution:
```
N = input()
a = 0
for i in N:
if i == "2":
a += 1
print(a)
``` | instruction | 0 | 27,211 | 5 | 54,422 |
Yes | output | 1 | 27,211 | 5 | 54,423 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an integer N that has exactly four digits in base ten. How many times does `2` occur in the base-ten representation of N?
Constraints
* 1000 \leq N \leq 9999
Input
Input is given from Standard Input in the following format:
N
Output
Print the answer.
Examples
Input
1222
Output
3
Input
3456
Output
0
Input
9592
Output
1
Submitted Solution:
```
from collections import Counter
N = str(input())
print(N.count('2'))
``` | instruction | 0 | 27,212 | 5 | 54,424 |
Yes | output | 1 | 27,212 | 5 | 54,425 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.