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 |
|---|---|---|---|---|---|
Provide a correct Python 3 solution for this coding contest problem.
Example
Input
3
3 0 1
Output
2 | instruction | 0 | 9,006 | 5 | 18,012 |
"Correct Solution:
```
import sys
def main():
n = int(input())
d = ""
while len(d) != n:
d += "".join(input().split())
digits = set()
for i in range(n):
for j in range(i+1,n+1):
# print(i,j)
seq = d[i:j]
if not seq:
continue
... | output | 1 | 9,006 | 5 | 18,013 |
Provide a correct Python 3 solution for this coding contest problem.
Example
Input
3
3 0 1
Output
2 | instruction | 0 | 9,007 | 5 | 18,014 |
"Correct Solution:
```
n, *d = map(int, open(0).read().split())
d = ''.join(map(str, d))
se = set()
for i in range(n):
for j in range(i + 1, n + 1):
se.add(int(d[i:j]))
ans = 0
while ans in se:
ans += 1
print(ans)
``` | output | 1 | 9,007 | 5 | 18,015 |
Provide a correct Python 3 solution for this coding contest problem.
Example
Input
3
3 0 1
Output
2 | instruction | 0 | 9,008 | 5 | 18,016 |
"Correct Solution:
```
j=''.join
n=int(input())
d=j(j(input().split())for i in[0]*(n//19+(n%19!=0)))
i=0
while 1:
if d.find(str(i))<0:
print(i)
exit()
i+=1
``` | output | 1 | 9,008 | 5 | 18,017 |
Provide a correct Python 3 solution for this coding contest problem.
Example
Input
3
3 0 1
Output
2 | instruction | 0 | 9,009 | 5 | 18,018 |
"Correct Solution:
```
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 998244353
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.rea... | output | 1 | 9,009 | 5 | 18,019 |
Provide a correct Python 3 solution for this coding contest problem.
Example
Input
3
3 0 1
Output
2 | instruction | 0 | 9,010 | 5 | 18,020 |
"Correct Solution:
```
n = int(input())
length = int(n / 19) + 1
if n > 19 and n % 19 == 0:
length -= 1
d = []
for i in range(length):
d += list(map(int, input().split()))
start, end = 1, 10
l = []
flag = False
for j in range(1, len(d)+1):
for i in range(0, len(d)):
tmp = ''.join(map(str, d[i:i+j]))... | output | 1 | 9,010 | 5 | 18,021 |
Provide a correct Python 3 solution for this coding contest problem.
Example
Input
3
3 0 1
Output
2 | instruction | 0 | 9,011 | 5 | 18,022 |
"Correct Solution:
```
n,*d=open(0).read().split()
n=int(n)
s=set()
for i in range(n):
for j in range(i+1,n+1):
s|={int(''.join(d[i:j]))}
for i,j in enumerate(sorted(s)):
if i!=j:
print(i)
break
``` | output | 1 | 9,011 | 5 | 18,023 |
Provide a correct Python 3 solution for this coding contest problem.
Example
Input
3
3 0 1
Output
2 | instruction | 0 | 9,012 | 5 | 18,024 |
"Correct Solution:
```
n=int(input())
d=''.join([''.join(input().split())for i in range(n//19+(n%19!=0))])
i=0
while True:
if d.find(str(i))==-1:
print(i)
exit()
i+=1
``` | output | 1 | 9,012 | 5 | 18,025 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a_1, a_2, …, a_n.
In one operation you can choose two elements a_i and a_j (i ≠ j) and decrease each of them by one.
You need to check whether it is possible to make all... | instruction | 0 | 9,197 | 5 | 18,394 |
Yes | output | 1 | 9,197 | 5 | 18,395 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a_1, a_2, …, a_n.
In one operation you can choose two elements a_i and a_j (i ≠ j) and decrease each of them by one.
You need to check whether it is possible to make all... | instruction | 0 | 9,198 | 5 | 18,396 |
No | output | 1 | 9,198 | 5 | 18,397 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two sets of integers: A and B. You need to output the sum of elements in the set C = \\{x | x = a ⊕ b, a ∈ A, b ∈ B\} modulo 998244353, where ⊕ denotes the [bitwise XOR operation](... | instruction | 0 | 9,220 | 5 | 18,440 |
No | output | 1 | 9,220 | 5 | 18,441 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
<image> <image>
*The two images are equivalent, feel free to use either one.
Input
The input contains a single integer a (-100 ≤ a ≤ 100).
Output
Output the result – an integer number.
Exa... | instruction | 0 | 9,321 | 5 | 18,642 |
Yes | output | 1 | 9,321 | 5 | 18,643 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
<image> <image>
*The two images are equivalent, feel free to use either one.
Input
The input contains a single integer a (-100 ≤ a ≤ 100).
Output
Output the result – an integer number.
Exa... | instruction | 0 | 9,322 | 5 | 18,644 |
Yes | output | 1 | 9,322 | 5 | 18,645 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
<image> <image>
*The two images are equivalent, feel free to use either one.
Input
The input contains a single integer a (-100 ≤ a ≤ 100).
Output
Output the result – an integer number.
Exa... | instruction | 0 | 9,323 | 5 | 18,646 |
Yes | output | 1 | 9,323 | 5 | 18,647 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
<image> <image>
*The two images are equivalent, feel free to use either one.
Input
The input contains a single integer a (-100 ≤ a ≤ 100).
Output
Output the result – an integer number.
Exa... | instruction | 0 | 9,324 | 5 | 18,648 |
Yes | output | 1 | 9,324 | 5 | 18,649 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
<image> <image>
*The two images are equivalent, feel free to use either one.
Input
The input contains a single integer a (-100 ≤ a ≤ 100).
Output
Output the result – an integer number.
Exa... | instruction | 0 | 9,325 | 5 | 18,650 |
No | output | 1 | 9,325 | 5 | 18,651 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
<image> <image>
*The two images are equivalent, feel free to use either one.
Input
The input contains a single integer a (-100 ≤ a ≤ 100).
Output
Output the result – an integer number.
Exa... | instruction | 0 | 9,326 | 5 | 18,652 |
No | output | 1 | 9,326 | 5 | 18,653 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
<image> <image>
*The two images are equivalent, feel free to use either one.
Input
The input contains a single integer a (-100 ≤ a ≤ 100).
Output
Output the result – an integer number.
Exa... | instruction | 0 | 9,327 | 5 | 18,654 |
No | output | 1 | 9,327 | 5 | 18,655 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
<image> <image>
*The two images are equivalent, feel free to use either one.
Input
The input contains a single integer a (-100 ≤ a ≤ 100).
Output
Output the result – an integer number.
Exa... | instruction | 0 | 9,328 | 5 | 18,656 |
No | output | 1 | 9,328 | 5 | 18,657 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently, Vladimir got bad mark in algebra again. To avoid such unpleasant events in future he decided to train his arithmetic skills. He wrote four integer numbers a, b, c, d on the blackboard.... | instruction | 0 | 9,498 | 5 | 18,996 |
Yes | output | 1 | 9,498 | 5 | 18,997 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently, Vladimir got bad mark in algebra again. To avoid such unpleasant events in future he decided to train his arithmetic skills. He wrote four integer numbers a, b, c, d on the blackboard.... | instruction | 0 | 9,499 | 5 | 18,998 |
Yes | output | 1 | 9,499 | 5 | 18,999 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently, Vladimir got bad mark in algebra again. To avoid such unpleasant events in future he decided to train his arithmetic skills. He wrote four integer numbers a, b, c, d on the blackboard.... | instruction | 0 | 9,500 | 5 | 19,000 |
Yes | output | 1 | 9,500 | 5 | 19,001 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently, Vladimir got bad mark in algebra again. To avoid such unpleasant events in future he decided to train his arithmetic skills. He wrote four integer numbers a, b, c, d on the blackboard.... | instruction | 0 | 9,501 | 5 | 19,002 |
Yes | output | 1 | 9,501 | 5 | 19,003 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently, Vladimir got bad mark in algebra again. To avoid such unpleasant events in future he decided to train his arithmetic skills. He wrote four integer numbers a, b, c, d on the blackboard.... | instruction | 0 | 9,502 | 5 | 19,004 |
No | output | 1 | 9,502 | 5 | 19,005 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently, Vladimir got bad mark in algebra again. To avoid such unpleasant events in future he decided to train his arithmetic skills. He wrote four integer numbers a, b, c, d on the blackboard.... | instruction | 0 | 9,503 | 5 | 19,006 |
No | output | 1 | 9,503 | 5 | 19,007 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently, Vladimir got bad mark in algebra again. To avoid such unpleasant events in future he decided to train his arithmetic skills. He wrote four integer numbers a, b, c, d on the blackboard.... | instruction | 0 | 9,504 | 5 | 19,008 |
No | output | 1 | 9,504 | 5 | 19,009 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently, Vladimir got bad mark in algebra again. To avoid such unpleasant events in future he decided to train his arithmetic skills. He wrote four integer numbers a, b, c, d on the blackboard.... | instruction | 0 | 9,505 | 5 | 19,010 |
No | output | 1 | 9,505 | 5 | 19,011 |
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 m.
Let M = 2m - 1.
You are also given a set of n integers denoted as the set T. The integers will be provided in base 2 as n binary strings of length m.
A set of inte... | instruction | 0 | 9,638 | 5 | 19,276 |
No | output | 1 | 9,638 | 5 | 19,277 |
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 m.
Let M = 2m - 1.
You are also given a set of n integers denoted as the set T. The integers will be provided in base 2 as n binary strings of length m.
A set of inte... | instruction | 0 | 9,639 | 5 | 19,278 |
No | output | 1 | 9,639 | 5 | 19,279 |
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 m.
Let M = 2m - 1.
You are also given a set of n integers denoted as the set T. The integers will be provided in base 2 as n binary strings of length m.
A set of inte... | instruction | 0 | 9,640 | 5 | 19,280 |
No | output | 1 | 9,640 | 5 | 19,281 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an array a_0, a_1, ..., a_{N-1} of length N. Process Q queries of the following types.
The type of i-th query is represented by T_i.
* T_i=1: You are given two integers X_i,V_i. Replace the value of A_{X_i} with V_i.
* T_i=2: You are ... | instruction | 0 | 9,650 | 5 | 19,300 |
"Correct Solution:
```
from typing import Callable, List, Union
T = Union[int, str]
class SegmentTree:
"""Segment Tree"""
__slots__ = ["e", "op", "_n", "_size", "tree"]
def __init__(self, initial_values: List[T], e: T, op: Callable[[T, T], T]) -> None:
self.e = e
self.op = op
se... | output | 1 | 9,650 | 5 | 19,301 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an array a_0, a_1, ..., a_{N-1} of length N. Process Q queries of the following types.
The type of i-th query is represented by T_i.
* T_i=1: You are given two integers X_i,V_i. Replace the value of A_{X_i} with V_i.
* T_i=2: You are ... | instruction | 0 | 9,651 | 5 | 19,302 |
"Correct Solution:
```
import sys
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
N, Q = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
def segfunc(x, y):
return max(x, y)
def init(init_val):
for i in range(n):
seg[i + num ... | output | 1 | 9,651 | 5 | 19,303 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an array a_0, a_1, ..., a_{N-1} of length N. Process Q queries of the following types.
The type of i-th query is represented by T_i.
* T_i=1: You are given two integers X_i,V_i. Replace the value of A_{X_i} with V_i.
* T_i=2: You are ... | instruction | 0 | 9,652 | 5 | 19,304 |
"Correct Solution:
```
from typing import Callable, List, Union
T = Union[int, str]
class SegmentTree:
"""Segment Tree"""
__slots__ = ["_n", "_log", "_size", "op", "e", "tree"]
def __init__(self, initial_values: List[T], op: Callable[[T, T], T], e: T) -> None:
self._n = len(initial_values)
... | output | 1 | 9,652 | 5 | 19,305 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an array a_0, a_1, ..., a_{N-1} of length N. Process Q queries of the following types.
The type of i-th query is represented by T_i.
* T_i=1: You are given two integers X_i,V_i. Replace the value of A_{X_i} with V_i.
* T_i=2: You are ... | instruction | 0 | 9,653 | 5 | 19,306 |
"Correct Solution:
```
import sys
input = lambda: sys.stdin.readline().rstrip()
# SegmentTree
class SegmentTree:
def __init__(self,n,p,unit,f):
self.num=2**((n-1).bit_length())
self.seg=[unit]*(2*self.num)
for i in range(n):self.seg[i+self.num]=p[i]
for i in range(self.num-1,0,-1):
self.seg[i]=... | output | 1 | 9,653 | 5 | 19,307 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an array a_0, a_1, ..., a_{N-1} of length N. Process Q queries of the following types.
The type of i-th query is represented by T_i.
* T_i=1: You are given two integers X_i,V_i. Replace the value of A_{X_i} with V_i.
* T_i=2: You are ... | instruction | 0 | 9,654 | 5 | 19,308 |
"Correct Solution:
```
"""
セグメント木
func：二項演算の関数（モノイドである必要あり）
e：単位元（モノイドにおける）
update, find, bisect, 全てにおいて, 1-indexとなっている。
(大抵の場合、Atcoderの問題文の表記のままの値を、メソッドに代入すれば良い)
"""
class SegmentTree:
def __init__(self, n, func, e, arrange=None):
self.init(n)
self.func = func
self.e = e
self.make_a... | output | 1 | 9,654 | 5 | 19,309 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an array a_0, a_1, ..., a_{N-1} of length N. Process Q queries of the following types.
The type of i-th query is represented by T_i.
* T_i=1: You are given two integers X_i,V_i. Replace the value of A_{X_i} with V_i.
* T_i=2: You are ... | instruction | 0 | 9,655 | 5 | 19,310 |
"Correct Solution:
```
class RMaxQ:
__slots__ = ["n", "data"]
def __init__(self, li):
self.n = len(li)
self.data = li*2
for i in range(self.n - 1, 0, -1):
self.data[i] = max(self.data[2*i], self.data[2*i+1])
def update(self, i, a):
i += self.n
... | output | 1 | 9,655 | 5 | 19,311 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an array a_0, a_1, ..., a_{N-1} of length N. Process Q queries of the following types.
The type of i-th query is represented by T_i.
* T_i=1: You are given two integers X_i,V_i. Replace the value of A_{X_i} with V_i.
* T_i=2: You are ... | instruction | 0 | 9,656 | 5 | 19,312 |
"Correct Solution:
```
class LazySegmentTree():
def __init__(self, n, op, e, mapping, composition, id):
self.n = n
self.op = op
self.e = e
self.mapping = mapping
self.composition = composition
self.id = id
self.log = (n - 1).bit_length()
self.size = 1 ... | output | 1 | 9,656 | 5 | 19,313 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an array a_0, a_1, ..., a_{N-1} of length N. Process Q queries of the following types.
The type of i-th query is represented by T_i.
* T_i=1: You are given two integers X_i,V_i. Replace the value of A_{X_i} with V_i.
* T_i=2: You are ... | instruction | 0 | 9,657 | 5 | 19,314 |
"Correct Solution:
```
class segment_tree:
__slots__ = ["op_M", "e_M","N","N0","dat"]
def __init__(self, N, operator_M, e_M):
self.op_M = operator_M
self.e_M = e_M
self.N = N
self.N0 = 1<<(N-1).bit_length()
self.dat = [self.e_M]*(2*self.N0)
# 長さNの配列 initial で初期化
... | output | 1 | 9,657 | 5 | 19,315 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a_0, a_1, ..., a_{N-1} of length N. Process Q queries of the following types.
The type of i-th query is represented by T_i.
* T_i=1: You are given two integers X_i,V_i. ... | instruction | 0 | 9,658 | 5 | 19,316 |
Yes | output | 1 | 9,658 | 5 | 19,317 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a_0, a_1, ..., a_{N-1} of length N. Process Q queries of the following types.
The type of i-th query is represented by T_i.
* T_i=1: You are given two integers X_i,V_i. ... | instruction | 0 | 9,659 | 5 | 19,318 |
Yes | output | 1 | 9,659 | 5 | 19,319 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a_0, a_1, ..., a_{N-1} of length N. Process Q queries of the following types.
The type of i-th query is represented by T_i.
* T_i=1: You are given two integers X_i,V_i. ... | instruction | 0 | 9,660 | 5 | 19,320 |
Yes | output | 1 | 9,660 | 5 | 19,321 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a_0, a_1, ..., a_{N-1} of length N. Process Q queries of the following types.
The type of i-th query is represented by T_i.
* T_i=1: You are given two integers X_i,V_i. ... | instruction | 0 | 9,661 | 5 | 19,322 |
Yes | output | 1 | 9,661 | 5 | 19,323 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a_0, a_1, ..., a_{N-1} of length N. Process Q queries of the following types.
The type of i-th query is represented by T_i.
* T_i=1: You are given two integers X_i,V_i. ... | instruction | 0 | 9,662 | 5 | 19,324 |
No | output | 1 | 9,662 | 5 | 19,325 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a_0, a_1, ..., a_{N-1} of length N. Process Q queries of the following types.
The type of i-th query is represented by T_i.
* T_i=1: You are given two integers X_i,V_i. ... | instruction | 0 | 9,663 | 5 | 19,326 |
No | output | 1 | 9,663 | 5 | 19,327 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a_0, a_1, ..., a_{N-1} of length N. Process Q queries of the following types.
The type of i-th query is represented by T_i.
* T_i=1: You are given two integers X_i,V_i. ... | instruction | 0 | 9,664 | 5 | 19,328 |
No | output | 1 | 9,664 | 5 | 19,329 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array a_0, a_1, ..., a_{N-1} of length N. Process Q queries of the following types.
The type of i-th query is represented by T_i.
* T_i=1: You are given two integers X_i,V_i. ... | instruction | 0 | 9,665 | 5 | 19,330 |
No | output | 1 | 9,665 | 5 | 19,331 |
Provide a correct Python 3 solution for this coding contest problem.
problem
Given a sequence of n integers a1, a2, ..., an and a positive integer k (1 ≤ k ≤ n), then the sum of k consecutive integers Si = ai + ai + Create a program that outputs the maximum value of 1 + ... + ai + k-1 (1 ≤ i ≤ n --k + 1).
input
T... | instruction | 0 | 9,815 | 5 | 19,630 |
"Correct Solution:
```
def main():
while True:
a = []
n, k = [int(x) for x in input().split()]
if n == 0 and k == 0: break
for i in range(n): a.append(int(input()))
l = [0]
for i in range(1, n - k + 1): l.append(a[i + k - 1] - a[i - 1])
maxsum = 0
maxi = 0
s = 0
for i, x in enumerate(l):
s += x
... | output | 1 | 9,815 | 5 | 19,631 |
Provide a correct Python 3 solution for this coding contest problem.
problem
Given a sequence of n integers a1, a2, ..., an and a positive integer k (1 ≤ k ≤ n), then the sum of k consecutive integers Si = ai + ai + Create a program that outputs the maximum value of 1 + ... + ai + k-1 (1 ≤ i ≤ n --k + 1).
input
T... | instruction | 0 | 9,816 | 5 | 19,632 |
"Correct Solution:
```
while True:
n, k = map(int, input().split())
if n == 0 and k == 0:
break
x = 0
a = []
for i in range(n):
y = int(input())
a.append(y)
s = 0
for j in range(k):
s += a[j]
S = []
S.append(s)
for i in range(1, n-k+... | output | 1 | 9,816 | 5 | 19,633 |
Provide a correct Python 3 solution for this coding contest problem.
problem
Given a sequence of n integers a1, a2, ..., an and a positive integer k (1 ≤ k ≤ n), then the sum of k consecutive integers Si = ai + ai + Create a program that outputs the maximum value of 1 + ... + ai + k-1 (1 ≤ i ≤ n --k + 1).
input
T... | instruction | 0 | 9,817 | 5 | 19,634 |
"Correct Solution:
```
# coding: utf-8
# Your code here!
while True:
n,k=map(int,input().split())
if n==0 and k==0:
break
a=[int(input()) for _ in range(n)]
s=sum(a[0:k])
ss=[s]
for i in range(k,n):
s=s+a[i]-a[i-k]
ss.append(s)
print(max(ss))
``` | output | 1 | 9,817 | 5 | 19,635 |
Provide a correct Python 3 solution for this coding contest problem.
problem
Given a sequence of n integers a1, a2, ..., an and a positive integer k (1 ≤ k ≤ n), then the sum of k consecutive integers Si = ai + ai + Create a program that outputs the maximum value of 1 + ... + ai + k-1 (1 ≤ i ≤ n --k + 1).
input
T... | instruction | 0 | 9,818 | 5 | 19,636 |
"Correct Solution:
```
#!/usr/bin/env python
import string
import sys
from itertools import chain, dropwhile, takewhile
def read(
*shape, f=int, it=chain.from_iterable(sys.stdin), whitespaces=set(string.whitespace)
):
def read_word():
w = lambda c: c in whitespaces
nw = lambda c: c not in whit... | output | 1 | 9,818 | 5 | 19,637 |
Provide a correct Python 3 solution for this coding contest problem.
problem
Given a sequence of n integers a1, a2, ..., an and a positive integer k (1 ≤ k ≤ n), then the sum of k consecutive integers Si = ai + ai + Create a program that outputs the maximum value of 1 + ... + ai + k-1 (1 ≤ i ≤ n --k + 1).
input
T... | instruction | 0 | 9,819 | 5 | 19,638 |
"Correct Solution:
```
while True:
n, k = map(int,input().split())
if n == k == 0:
break
data = [int(input()) for _ in range(n)]
s = sum(data[0:k])
ss = [s]
for i in range(k, n):
s = s + data[i]- data[i-k]
ss.append(s)
print(max(ss))
``` | output | 1 | 9,819 | 5 | 19,639 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.