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.
This is an interactive problem.
You are given a sorted in increasing order singly linked list. You should find the minimum integer in the list which is greater than or equal to x.
More formall... | instruction | 0 | 63,638 | 5 | 127,276 |
No | output | 1 | 63,638 | 5 | 127,277 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem.
You are given a sorted in increasing order singly linked list. You should find the minimum integer in the list which is greater than or equal to x.
More formall... | instruction | 0 | 63,639 | 5 | 127,278 |
No | output | 1 | 63,639 | 5 | 127,279 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a positive integer L. Find the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.
Constraints
* 1 ≤ L ≤ 1000
* L is an integer.
Input
Input is given from Standard Input in the fol... | instruction | 0 | 63,752 | 5 | 127,504 |
"Correct Solution:
```
ll = int(input())
print((ll/3)**3)
``` | output | 1 | 63,752 | 5 | 127,505 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a positive integer L. Find the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.
Constraints
* 1 ≤ L ≤ 1000
* L is an integer.
Input
Input is given from Standard Input in the fol... | instruction | 0 | 63,753 | 5 | 127,506 |
"Correct Solution:
```
l = float(input())
print(pow(l/3,3))
``` | output | 1 | 63,753 | 5 | 127,507 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a positive integer L. Find the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.
Constraints
* 1 ≤ L ≤ 1000
* L is an integer.
Input
Input is given from Standard Input in the fol... | instruction | 0 | 63,754 | 5 | 127,508 |
"Correct Solution:
```
l=int(input(''))
print((l/3)**3)
``` | output | 1 | 63,754 | 5 | 127,509 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a positive integer L. Find the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.
Constraints
* 1 ≤ L ≤ 1000
* L is an integer.
Input
Input is given from Standard Input in the fol... | instruction | 0 | 63,755 | 5 | 127,510 |
"Correct Solution:
```
L=float(input())
print(pow(L/3,3))
``` | output | 1 | 63,755 | 5 | 127,511 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a positive integer L. Find the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.
Constraints
* 1 ≤ L ≤ 1000
* L is an integer.
Input
Input is given from Standard Input in the fol... | instruction | 0 | 63,756 | 5 | 127,512 |
"Correct Solution:
```
n = int(input())
n = n/3
print(n**3)
``` | output | 1 | 63,756 | 5 | 127,513 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a positive integer L. Find the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.
Constraints
* 1 ≤ L ≤ 1000
* L is an integer.
Input
Input is given from Standard Input in the fol... | instruction | 0 | 63,757 | 5 | 127,514 |
"Correct Solution:
```
A=int(input())
print((A/3)**3)
``` | output | 1 | 63,757 | 5 | 127,515 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a positive integer L. Find the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.
Constraints
* 1 ≤ L ≤ 1000
* L is an integer.
Input
Input is given from Standard Input in the fol... | instruction | 0 | 63,758 | 5 | 127,516 |
"Correct Solution:
```
print((int(input())**3 / 27))
``` | output | 1 | 63,758 | 5 | 127,517 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a positive integer L. Find the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.
Constraints
* 1 ≤ L ≤ 1000
* L is an integer.
Input
Input is given from Standard Input in the fol... | instruction | 0 | 63,759 | 5 | 127,518 |
"Correct Solution:
```
L = int(input())
print(pow(L,3)/27)
``` | output | 1 | 63,759 | 5 | 127,519 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a positive integer L. Find the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.
Constraints
* 1 ≤ L ≤ 1000
* L is an intege... | instruction | 0 | 63,760 | 5 | 127,520 |
Yes | output | 1 | 63,760 | 5 | 127,521 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a positive integer L. Find the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.
Constraints
* 1 ≤ L ≤ 1000
* L is an intege... | instruction | 0 | 63,761 | 5 | 127,522 |
Yes | output | 1 | 63,761 | 5 | 127,523 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a positive integer L. Find the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.
Constraints
* 1 ≤ L ≤ 1000
* L is an intege... | instruction | 0 | 63,762 | 5 | 127,524 |
Yes | output | 1 | 63,762 | 5 | 127,525 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a positive integer L. Find the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.
Constraints
* 1 ≤ L ≤ 1000
* L is an intege... | instruction | 0 | 63,763 | 5 | 127,526 |
Yes | output | 1 | 63,763 | 5 | 127,527 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a positive integer L. Find the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.
Constraints
* 1 ≤ L ≤ 1000
* L is an intege... | instruction | 0 | 63,764 | 5 | 127,528 |
No | output | 1 | 63,764 | 5 | 127,529 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a positive integer L. Find the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.
Constraints
* 1 ≤ L ≤ 1000
* L is an intege... | instruction | 0 | 63,765 | 5 | 127,530 |
No | output | 1 | 63,765 | 5 | 127,531 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a positive integer L. Find the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.
Constraints
* 1 ≤ L ≤ 1000
* L is an intege... | instruction | 0 | 63,766 | 5 | 127,532 |
No | output | 1 | 63,766 | 5 | 127,533 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a positive integer L. Find the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L.
Constraints
* 1 ≤ L ≤ 1000
* L is an intege... | instruction | 0 | 63,767 | 5 | 127,534 |
No | output | 1 | 63,767 | 5 | 127,535 |
Provide a correct Python 3 solution for this coding contest problem.
X and A are integers between 0 and 9 (inclusive).
If X is less than A, print 0; if X is not less than A, print 10.
Constraints
* 0 \leq X, A \leq 9
* All values in input are integers.
Input
Input is given from Standard Input in the following for... | instruction | 0 | 63,784 | 5 | 127,568 |
"Correct Solution:
```
a,b = input().split()
a,b = int(a),int(b)
print(0 if a < b else 10)
``` | output | 1 | 63,784 | 5 | 127,569 |
Provide a correct Python 3 solution for this coding contest problem.
X and A are integers between 0 and 9 (inclusive).
If X is less than A, print 0; if X is not less than A, print 10.
Constraints
* 0 \leq X, A \leq 9
* All values in input are integers.
Input
Input is given from Standard Input in the following for... | instruction | 0 | 63,785 | 5 | 127,570 |
"Correct Solution:
```
X,A = list(map(int,input().split()))
a = 10 if X>=A else 0
print(a)
``` | output | 1 | 63,785 | 5 | 127,571 |
Provide a correct Python 3 solution for this coding contest problem.
X and A are integers between 0 and 9 (inclusive).
If X is less than A, print 0; if X is not less than A, print 10.
Constraints
* 0 \leq X, A \leq 9
* All values in input are integers.
Input
Input is given from Standard Input in the following for... | instruction | 0 | 63,786 | 5 | 127,572 |
"Correct Solution:
```
X, A = input().split(" ")
if X < A:
print(0)
else:
print(10)
``` | output | 1 | 63,786 | 5 | 127,573 |
Provide a correct Python 3 solution for this coding contest problem.
X and A are integers between 0 and 9 (inclusive).
If X is less than A, print 0; if X is not less than A, print 10.
Constraints
* 0 \leq X, A \leq 9
* All values in input are integers.
Input
Input is given from Standard Input in the following for... | instruction | 0 | 63,787 | 5 | 127,574 |
"Correct Solution:
```
[x,a]=[int(_) for _ in input().split()]
print('0' if x<a else '10')
``` | output | 1 | 63,787 | 5 | 127,575 |
Provide a correct Python 3 solution for this coding contest problem.
X and A are integers between 0 and 9 (inclusive).
If X is less than A, print 0; if X is not less than A, print 10.
Constraints
* 0 \leq X, A \leq 9
* All values in input are integers.
Input
Input is given from Standard Input in the following for... | instruction | 0 | 63,788 | 5 | 127,576 |
"Correct Solution:
```
x,a=map(int,input().split())
print([0,10][x>=a])
``` | output | 1 | 63,788 | 5 | 127,577 |
Provide a correct Python 3 solution for this coding contest problem.
X and A are integers between 0 and 9 (inclusive).
If X is less than A, print 0; if X is not less than A, print 10.
Constraints
* 0 \leq X, A \leq 9
* All values in input are integers.
Input
Input is given from Standard Input in the following for... | instruction | 0 | 63,789 | 5 | 127,578 |
"Correct Solution:
```
a,b = map(int,input().split())
print(0 if a < b else 10)
``` | output | 1 | 63,789 | 5 | 127,579 |
Provide a correct Python 3 solution for this coding contest problem.
X and A are integers between 0 and 9 (inclusive).
If X is less than A, print 0; if X is not less than A, print 10.
Constraints
* 0 \leq X, A \leq 9
* All values in input are integers.
Input
Input is given from Standard Input in the following for... | instruction | 0 | 63,790 | 5 | 127,580 |
"Correct Solution:
```
X,N=map(int,input().split())
print(0 if X < N else 10)
``` | output | 1 | 63,790 | 5 | 127,581 |
Provide a correct Python 3 solution for this coding contest problem.
X and A are integers between 0 and 9 (inclusive).
If X is less than A, print 0; if X is not less than A, print 10.
Constraints
* 0 \leq X, A \leq 9
* All values in input are integers.
Input
Input is given from Standard Input in the following for... | instruction | 0 | 63,791 | 5 | 127,582 |
"Correct Solution:
```
X, A = map(int, input().split())
print(10 if X >= A else 0)
``` | output | 1 | 63,791 | 5 | 127,583 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
X and A are integers between 0 and 9 (inclusive).
If X is less than A, print 0; if X is not less than A, print 10.
Constraints
* 0 \leq X, A \leq 9
* All values in input are integers.
Input
... | instruction | 0 | 63,792 | 5 | 127,584 |
Yes | output | 1 | 63,792 | 5 | 127,585 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
X and A are integers between 0 and 9 (inclusive).
If X is less than A, print 0; if X is not less than A, print 10.
Constraints
* 0 \leq X, A \leq 9
* All values in input are integers.
Input
... | instruction | 0 | 63,793 | 5 | 127,586 |
Yes | output | 1 | 63,793 | 5 | 127,587 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
X and A are integers between 0 and 9 (inclusive).
If X is less than A, print 0; if X is not less than A, print 10.
Constraints
* 0 \leq X, A \leq 9
* All values in input are integers.
Input
... | instruction | 0 | 63,794 | 5 | 127,588 |
Yes | output | 1 | 63,794 | 5 | 127,589 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
X and A are integers between 0 and 9 (inclusive).
If X is less than A, print 0; if X is not less than A, print 10.
Constraints
* 0 \leq X, A \leq 9
* All values in input are integers.
Input
... | instruction | 0 | 63,795 | 5 | 127,590 |
Yes | output | 1 | 63,795 | 5 | 127,591 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
X and A are integers between 0 and 9 (inclusive).
If X is less than A, print 0; if X is not less than A, print 10.
Constraints
* 0 \leq X, A \leq 9
* All values in input are integers.
Input
... | instruction | 0 | 63,796 | 5 | 127,592 |
No | output | 1 | 63,796 | 5 | 127,593 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
X and A are integers between 0 and 9 (inclusive).
If X is less than A, print 0; if X is not less than A, print 10.
Constraints
* 0 \leq X, A \leq 9
* All values in input are integers.
Input
... | instruction | 0 | 63,797 | 5 | 127,594 |
No | output | 1 | 63,797 | 5 | 127,595 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
X and A are integers between 0 and 9 (inclusive).
If X is less than A, print 0; if X is not less than A, print 10.
Constraints
* 0 \leq X, A \leq 9
* All values in input are integers.
Input
... | instruction | 0 | 63,798 | 5 | 127,596 |
No | output | 1 | 63,798 | 5 | 127,597 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
X and A are integers between 0 and 9 (inclusive).
If X is less than A, print 0; if X is not less than A, print 10.
Constraints
* 0 \leq X, A \leq 9
* All values in input are integers.
Input
... | instruction | 0 | 63,799 | 5 | 127,598 |
No | output | 1 | 63,799 | 5 | 127,599 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the small... | instruction | 0 | 63,816 | 5 | 127,632 |
"Correct Solution:
```
n,k = map(int,input().split())
print(int((n % k) != 0))
``` | output | 1 | 63,816 | 5 | 127,633 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the small... | instruction | 0 | 63,817 | 5 | 127,634 |
"Correct Solution:
```
n, k = list(map(int, input().split()))
print(min(1, n % k))
``` | output | 1 | 63,817 | 5 | 127,635 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the small... | instruction | 0 | 63,818 | 5 | 127,636 |
"Correct Solution:
```
N, K = map(int, str(input()).split())
print(0 if N % K == 0 else 1)
``` | output | 1 | 63,818 | 5 | 127,637 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the small... | instruction | 0 | 63,819 | 5 | 127,638 |
"Correct Solution:
```
N,K=map(int,input().split())
print(int(bool(N%K)))
``` | output | 1 | 63,819 | 5 | 127,639 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the small... | instruction | 0 | 63,820 | 5 | 127,640 |
"Correct Solution:
```
N,K=map(int,input().split())
print((N%K>0)+0)
``` | output | 1 | 63,820 | 5 | 127,641 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the small... | instruction | 0 | 63,821 | 5 | 127,642 |
"Correct Solution:
```
n,k=map(int,input().split())
print("0") if n%k==0 else print("1")
``` | output | 1 | 63,821 | 5 | 127,643 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the small... | instruction | 0 | 63,822 | 5 | 127,644 |
"Correct Solution:
```
a,b = list(map(int,input().split()))
print(0 if a%b == 0 else 1)
``` | output | 1 | 63,822 | 5 | 127,645 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the small... | instruction | 0 | 63,823 | 5 | 127,646 |
"Correct Solution:
```
N, K = map(int, input().split())
print('1' if N % K else '0')
``` | output | 1 | 63,823 | 5 | 127,647 |
Provide a correct Python 3 solution for this coding contest problem.
Given a sequence of numbers a1, a2, a3, ..., an, find the maximum sum of a contiguous subsequence of those numbers. Note that, a subsequence of one element is also a contiquous subsequence.
Input
The input consists of multiple datasets. Each data... | instruction | 0 | 63,896 | 5 | 127,792 |
"Correct Solution:
```
while 1:
n=int(input())
if n==0:break
a=[int(input())for _ in[0]*n]
for i in range(1,n):a[i]=max(a[i],a[i]+a[i-1])
print(max(a))
``` | output | 1 | 63,896 | 5 | 127,793 |
Provide a correct Python 3 solution for this coding contest problem.
Given a sequence of numbers a1, a2, a3, ..., an, find the maximum sum of a contiguous subsequence of those numbers. Note that, a subsequence of one element is also a contiquous subsequence.
Input
The input consists of multiple datasets. Each data... | instruction | 0 | 63,897 | 5 | 127,794 |
"Correct Solution:
```
while 1:
n=int(input())
if n==0:break
nlist=[]
nans=-100001
for i in range(n):
nlist.append(int(input()))
nkeep=0
for i in nlist:
if nkeep<0:
nkeep=i
else:
nkeep+=i
if nans<nkeep:nans=nkeep
if max(nlist)<0:nan... | output | 1 | 63,897 | 5 | 127,795 |
Provide a correct Python 3 solution for this coding contest problem.
Given a sequence of numbers a1, a2, a3, ..., an, find the maximum sum of a contiguous subsequence of those numbers. Note that, a subsequence of one element is also a contiquous subsequence.
Input
The input consists of multiple datasets. Each data... | instruction | 0 | 63,898 | 5 | 127,796 |
"Correct Solution:
```
import itertools
while True:
n = int(input())
if n == 0:
break
else:
a = [int(input()) for i in range(n)]
a = list(itertools.accumulate(a))
a.insert(0, 0)
ans = -100000
for j in range(n):
for k in range(j + 1, n + 1):
... | output | 1 | 63,898 | 5 | 127,797 |
Provide a correct Python 3 solution for this coding contest problem.
Given a sequence of numbers a1, a2, a3, ..., an, find the maximum sum of a contiguous subsequence of those numbers. Note that, a subsequence of one element is also a contiquous subsequence.
Input
The input consists of multiple datasets. Each data... | instruction | 0 | 63,899 | 5 | 127,798 |
"Correct Solution:
```
from sys import stdin
def getMax(array):
mx = mx2 = array[0]
for i in array[1:]:
mx2 = max(i, mx2 + i)
mx = max(mx, mx2)
return mx
for line in stdin:
n = int(line)
if n == 0:
break
array = []
for line in stdin:
line = int(line)
... | output | 1 | 63,899 | 5 | 127,799 |
Provide a correct Python 3 solution for this coding contest problem.
Given a sequence of numbers a1, a2, a3, ..., an, find the maximum sum of a contiguous subsequence of those numbers. Note that, a subsequence of one element is also a contiquous subsequence.
Input
The input consists of multiple datasets. Each data... | instruction | 0 | 63,900 | 5 | 127,800 |
"Correct Solution:
```
import sys
n = int(input())
while n != 0:
max_seq = []
max_val = int(input())
for i in range(n-1):
num = int(input())
if num >= 0 and max_val >= 0:
max_val += num
else:
if max_val >= 0:
max_seq.append(max_val)
... | output | 1 | 63,900 | 5 | 127,801 |
Provide a correct Python 3 solution for this coding contest problem.
Given a sequence of numbers a1, a2, a3, ..., an, find the maximum sum of a contiguous subsequence of those numbers. Note that, a subsequence of one element is also a contiquous subsequence.
Input
The input consists of multiple datasets. Each data... | instruction | 0 | 63,901 | 5 | 127,802 |
"Correct Solution:
```
while 1:
n=int(input())
if n==0: break
a=[int(input()) for i in range(n)]
temp = 0
most = -999999999
for i in range(n):
temp = 0
for j in range(i,n):
temp += a[j]
if temp > most:
most = temp
print(most)
``` | output | 1 | 63,901 | 5 | 127,803 |
Provide a correct Python 3 solution for this coding contest problem.
Given a sequence of numbers a1, a2, a3, ..., an, find the maximum sum of a contiguous subsequence of those numbers. Note that, a subsequence of one element is also a contiquous subsequence.
Input
The input consists of multiple datasets. Each data... | instruction | 0 | 63,902 | 5 | 127,804 |
"Correct Solution:
```
while True:
n = int(input())
if n == 0:
break
res = -1111111111
s = 0
for i in range(n):
a = int(input())
s = max(s + a, a)
res = max(s, res)
print(res)
``` | output | 1 | 63,902 | 5 | 127,805 |
Provide a correct Python 3 solution for this coding contest problem.
Given a sequence of numbers a1, a2, a3, ..., an, find the maximum sum of a contiguous subsequence of those numbers. Note that, a subsequence of one element is also a contiquous subsequence.
Input
The input consists of multiple datasets. Each data... | instruction | 0 | 63,903 | 5 | 127,806 |
"Correct Solution:
```
while True:
n = int(input())
if n==0 : break
a = []
for i in range(n):
a.append(int(input()))
maxp = -100001
maxcont = -100001
for i in range(n):
maxcont = max(a[i], maxcont + a[i])
maxp = max(maxp, maxcont)
print(maxp)
``` | output | 1 | 63,903 | 5 | 127,807 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.