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 formally, there is a singly liked list built on an array of n elements. Element with index i contains two integers: valuei is the integer value in this element, and nexti that is the index of the next element of the singly linked list (or -1, if the current element is the last). The list is sorted, i.e. if nexti ≠ - 1, then valuenexti > valuei.
You are given the number of elements in the list n, the index of the first element start, and the integer x.
You can make up to 2000 queries of the following two types:
* ? i (1 ≤ i ≤ n) — ask the values valuei and nexti,
* ! ans — give the answer for the problem: the minimum integer, greater than or equal to x, or ! -1, if there are no such integers. Your program should terminate after this query.
Write a program that solves this problem.
Input
The first line contains three integers n, start, x (1 ≤ n ≤ 50000, 1 ≤ start ≤ n, 0 ≤ x ≤ 109) — the number of elements in the list, the index of the first element and the integer x.
Output
To print the answer for the problem, print ! ans, where ans is the minimum integer in the list greater than or equal to x, or -1, if there is no such integer.
Interaction
To make a query of the first type, print ? i (1 ≤ i ≤ n), where i is the index of element you want to know information about.
After each query of type ? read two integers valuei and nexti (0 ≤ valuei ≤ 109, - 1 ≤ nexti ≤ n, nexti ≠ 0).
It is guaranteed that if nexti ≠ - 1, then valuenexti > valuei, and that the array values give a valid singly linked list with start being the first element.
Note that you can't ask more than 1999 queries of the type ?.
If nexti = - 1 and valuei = - 1, then it means that you asked more queries than allowed, or asked an invalid query. Your program should immediately terminate (for example, by calling exit(0)). You will receive "Wrong Answer", it means that you asked more queries than allowed, or asked an invalid query. If you ignore this, you can get other verdicts since your program will continue to read from a closed stream.
Your solution will get "Idleness Limit Exceeded", if you don't print anything or forget to flush the output, including the final answer.
To flush you can use (just after printing a query and line end):
* fflush(stdout) in C++;
* System.out.flush() in Java;
* stdout.flush() in Python;
* flush(output) in Pascal;
* For other languages see documentation.
Hacks format
For hacks, use the following format:
In the first line print three integers n, start, x (1 ≤ n ≤ 50000, 1 ≤ start ≤ n, 0 ≤ x ≤ 109).
In the next n lines print the description of the elements of the list: in the i-th line print two integers valuei and nexti (0 ≤ valuei ≤ 109, - 1 ≤ nexti ≤ n, nexti ≠ 0).
The printed structure should be a valid singly linked list. In particular, it should be possible to reach all elements from start by following links nexti, and the last element end should have -1 in the nextend.
Example
Input
5 3 80
97 -1
58 5
16 2
81 1
79 4
Output
? 1
? 2
? 3
? 4
? 5
! 81
Note
You can read more about singly linked list by the following link: <https://en.wikipedia.org/wiki/Linked_list#Singly_linked_list>
The illustration for the first sample case. Start and finish elements are marked dark. <image>
Submitted Solution:
```
def R():
return map(int, input().split())
def ask(i):
print('?', i, flush=True)
return R()
def ans(v):
print('!', v)
exit()
n, s, x = R()
d = [None] * (n + 1)
f = [False] * (n + 1)
mv = -1
i = s
count = 950
for _ in range(n):
if not f[i]:
f[i] = True
v, nxt = ask(i)
if v < 0:
exit()
if v == x or i == s and v > x:
ans(v)
if nxt != -1:
f[nxt] = True
elif v < x:
ans(-1)
if v < x:
nv = d[nxt]
if nv is None:
if v > mv:
mv, mnxt = v, nxt
elif nv > x:
ans(nv)
d[i] = v
count -= 1
if not count:
break
if i == n:
i = 0
i += 1
while mv < x and mnxt >= 1:
mv, mnxt = ask(mnxt)
ans(mv if mv >= x else -1)
``` | 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 formally, there is a singly liked list built on an array of n elements. Element with index i contains two integers: valuei is the integer value in this element, and nexti that is the index of the next element of the singly linked list (or -1, if the current element is the last). The list is sorted, i.e. if nexti ≠ - 1, then valuenexti > valuei.
You are given the number of elements in the list n, the index of the first element start, and the integer x.
You can make up to 2000 queries of the following two types:
* ? i (1 ≤ i ≤ n) — ask the values valuei and nexti,
* ! ans — give the answer for the problem: the minimum integer, greater than or equal to x, or ! -1, if there are no such integers. Your program should terminate after this query.
Write a program that solves this problem.
Input
The first line contains three integers n, start, x (1 ≤ n ≤ 50000, 1 ≤ start ≤ n, 0 ≤ x ≤ 109) — the number of elements in the list, the index of the first element and the integer x.
Output
To print the answer for the problem, print ! ans, where ans is the minimum integer in the list greater than or equal to x, or -1, if there is no such integer.
Interaction
To make a query of the first type, print ? i (1 ≤ i ≤ n), where i is the index of element you want to know information about.
After each query of type ? read two integers valuei and nexti (0 ≤ valuei ≤ 109, - 1 ≤ nexti ≤ n, nexti ≠ 0).
It is guaranteed that if nexti ≠ - 1, then valuenexti > valuei, and that the array values give a valid singly linked list with start being the first element.
Note that you can't ask more than 1999 queries of the type ?.
If nexti = - 1 and valuei = - 1, then it means that you asked more queries than allowed, or asked an invalid query. Your program should immediately terminate (for example, by calling exit(0)). You will receive "Wrong Answer", it means that you asked more queries than allowed, or asked an invalid query. If you ignore this, you can get other verdicts since your program will continue to read from a closed stream.
Your solution will get "Idleness Limit Exceeded", if you don't print anything or forget to flush the output, including the final answer.
To flush you can use (just after printing a query and line end):
* fflush(stdout) in C++;
* System.out.flush() in Java;
* stdout.flush() in Python;
* flush(output) in Pascal;
* For other languages see documentation.
Hacks format
For hacks, use the following format:
In the first line print three integers n, start, x (1 ≤ n ≤ 50000, 1 ≤ start ≤ n, 0 ≤ x ≤ 109).
In the next n lines print the description of the elements of the list: in the i-th line print two integers valuei and nexti (0 ≤ valuei ≤ 109, - 1 ≤ nexti ≤ n, nexti ≠ 0).
The printed structure should be a valid singly linked list. In particular, it should be possible to reach all elements from start by following links nexti, and the last element end should have -1 in the nextend.
Example
Input
5 3 80
97 -1
58 5
16 2
81 1
79 4
Output
? 1
? 2
? 3
? 4
? 5
! 81
Note
You can read more about singly linked list by the following link: <https://en.wikipedia.org/wiki/Linked_list#Singly_linked_list>
The illustration for the first sample case. Start and finish elements are marked dark. <image>
Submitted Solution:
```
# -*- coding: utf-8 -*-
import math
import collections
import bisect
import heapq
import time
import random
import itertools
import sys
"""
created by shhuan at 2017/10/20 11:12
"""
N, X, S = map(int, input().split())
ni = -1
V = float('-inf')
q = {random.randint(1, N) for _ in range(min(N, 999))}
for i in q:
print('?', i)
sys.stdout.flush()
a, b = map(int, input().split())
if V < a <= S:
V = a
ni = b
while V <= S and ni > 0:
print("?", ni)
sys.stdout.flush()
a, b = map(int, input().split())
V = a
ni = b
if V > S:
print("!", V)
else:
print("!", -1)
``` | 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 following format:
L
Output
Print the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L. Your output is considered correct if its absolute or relative error from our answer is at most 10^{-6}.
Examples
Input
3
Output
1.000000000000
Input
999
Output
36926037.000000000000 | 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 following format:
L
Output
Print the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L. Your output is considered correct if its absolute or relative error from our answer is at most 10^{-6}.
Examples
Input
3
Output
1.000000000000
Input
999
Output
36926037.000000000000 | 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 following format:
L
Output
Print the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L. Your output is considered correct if its absolute or relative error from our answer is at most 10^{-6}.
Examples
Input
3
Output
1.000000000000
Input
999
Output
36926037.000000000000 | 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 following format:
L
Output
Print the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L. Your output is considered correct if its absolute or relative error from our answer is at most 10^{-6}.
Examples
Input
3
Output
1.000000000000
Input
999
Output
36926037.000000000000 | 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 following format:
L
Output
Print the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L. Your output is considered correct if its absolute or relative error from our answer is at most 10^{-6}.
Examples
Input
3
Output
1.000000000000
Input
999
Output
36926037.000000000000 | 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 following format:
L
Output
Print the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L. Your output is considered correct if its absolute or relative error from our answer is at most 10^{-6}.
Examples
Input
3
Output
1.000000000000
Input
999
Output
36926037.000000000000 | 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 following format:
L
Output
Print the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L. Your output is considered correct if its absolute or relative error from our answer is at most 10^{-6}.
Examples
Input
3
Output
1.000000000000
Input
999
Output
36926037.000000000000 | 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 following format:
L
Output
Print the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L. Your output is considered correct if its absolute or relative error from our answer is at most 10^{-6}.
Examples
Input
3
Output
1.000000000000
Input
999
Output
36926037.000000000000 | 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 integer.
Input
Input is given from Standard Input in the following format:
L
Output
Print the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L. Your output is considered correct if its absolute or relative error from our answer is at most 10^{-6}.
Examples
Input
3
Output
1.000000000000
Input
999
Output
36926037.000000000000
Submitted Solution:
```
n=int(input())
t=n/3
print(t**3)
``` | 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 integer.
Input
Input is given from Standard Input in the following format:
L
Output
Print the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L. Your output is considered correct if its absolute or relative error from our answer is at most 10^{-6}.
Examples
Input
3
Output
1.000000000000
Input
999
Output
36926037.000000000000
Submitted Solution:
```
L= float(input())
print((L**3)/27)
``` | 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 integer.
Input
Input is given from Standard Input in the following format:
L
Output
Print the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L. Your output is considered correct if its absolute or relative error from our answer is at most 10^{-6}.
Examples
Input
3
Output
1.000000000000
Input
999
Output
36926037.000000000000
Submitted Solution:
```
l = int(input());print((l/3)**3)
``` | 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 integer.
Input
Input is given from Standard Input in the following format:
L
Output
Print the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L. Your output is considered correct if its absolute or relative error from our answer is at most 10^{-6}.
Examples
Input
3
Output
1.000000000000
Input
999
Output
36926037.000000000000
Submitted Solution:
```
n=int(input())
print(n**3/27)
``` | 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 integer.
Input
Input is given from Standard Input in the following format:
L
Output
Print the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L. Your output is considered correct if its absolute or relative error from our answer is at most 10^{-6}.
Examples
Input
3
Output
1.000000000000
Input
999
Output
36926037.000000000000
Submitted Solution:
```
L=int(input())
L1=(L//3)
L2=L%3
while L2>=10**-16:
L1+=(L2/3)
L2=(L2/3)
print(L1**3)
``` | 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 integer.
Input
Input is given from Standard Input in the following format:
L
Output
Print the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L. Your output is considered correct if its absolute or relative error from our answer is at most 10^{-6}.
Examples
Input
3
Output
1.000000000000
Input
999
Output
36926037.000000000000
Submitted Solution:
```
#hello
#password
#input
#understandign python
#less errors
$work now please
q = int(input())
w = q / 3
print(w ** 3)
``` | 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 integer.
Input
Input is given from Standard Input in the following format:
L
Output
Print the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L. Your output is considered correct if its absolute or relative error from our answer is at most 10^{-6}.
Examples
Input
3
Output
1.000000000000
Input
999
Output
36926037.000000000000
Submitted Solution:
```
#include <bits/stdc++.h>
using namespace std;
using ul = unsigned long;
using ll = long long;
using P = pair<int, int>;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
template <class T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T>
void initvv(vector<vector<T>> &v, int a, int b, const T &t = T()) {
v.assign(a, vector<T>(b, t));
}
template <class T>
T gcd(T &a, T &b) {
if (a < b) {
swap(a, b);
}
T r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
vint dx = {-1, 0, 1, 0}, dy = {0, -1, 0, 1};
vint dx8 = {-1, -1, -1, 0, 1, 1, 1, 0}, dy8 = {-1, 0, 1, 1, 1, 0, -1, -1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
42;
int n, m;
cin >> n;
double l = (double)n / 3.0;
printf("%.10f\n", l * l * l);
return 0;
}
``` | 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 integer.
Input
Input is given from Standard Input in the following format:
L
Output
Print the maximum possible volume of a rectangular cuboid whose sum of the dimensions (not necessarily integers) is L. Your output is considered correct if its absolute or relative error from our answer is at most 10^{-6}.
Examples
Input
3
Output
1.000000000000
Input
999
Output
36926037.000000000000
Submitted Solution:
```
l=int(input())
ans=[]
for i in range(l//2+1):
for j in range(l//2+1):
ans.append(i*j*(l-i-j))
print(max(ans))
``` | 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 format:
X A
Output
If X is less than A, print 0; if X is not less than A, print 10.
Examples
Input
3 5
Output
0
Input
7 5
Output
10
Input
6 6
Output
10 | 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 format:
X A
Output
If X is less than A, print 0; if X is not less than A, print 10.
Examples
Input
3 5
Output
0
Input
7 5
Output
10
Input
6 6
Output
10 | 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 format:
X A
Output
If X is less than A, print 0; if X is not less than A, print 10.
Examples
Input
3 5
Output
0
Input
7 5
Output
10
Input
6 6
Output
10 | 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 format:
X A
Output
If X is less than A, print 0; if X is not less than A, print 10.
Examples
Input
3 5
Output
0
Input
7 5
Output
10
Input
6 6
Output
10 | 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 format:
X A
Output
If X is less than A, print 0; if X is not less than A, print 10.
Examples
Input
3 5
Output
0
Input
7 5
Output
10
Input
6 6
Output
10 | 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 format:
X A
Output
If X is less than A, print 0; if X is not less than A, print 10.
Examples
Input
3 5
Output
0
Input
7 5
Output
10
Input
6 6
Output
10 | 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 format:
X A
Output
If X is less than A, print 0; if X is not less than A, print 10.
Examples
Input
3 5
Output
0
Input
7 5
Output
10
Input
6 6
Output
10 | 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 format:
X A
Output
If X is less than A, print 0; if X is not less than A, print 10.
Examples
Input
3 5
Output
0
Input
7 5
Output
10
Input
6 6
Output
10 | 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
Input is given from Standard Input in the following format:
X A
Output
If X is less than A, print 0; if X is not less than A, print 10.
Examples
Input
3 5
Output
0
Input
7 5
Output
10
Input
6 6
Output
10
Submitted Solution:
```
x,y = map(int,input().split())
if x<y:
print(0)
else:
print(10)
``` | 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
Input is given from Standard Input in the following format:
X A
Output
If X is less than A, print 0; if X is not less than A, print 10.
Examples
Input
3 5
Output
0
Input
7 5
Output
10
Input
6 6
Output
10
Submitted Solution:
```
x, a = [int(x) for x in input().split()]
print(0 if x < a else 10)
``` | 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
Input is given from Standard Input in the following format:
X A
Output
If X is less than A, print 0; if X is not less than A, print 10.
Examples
Input
3 5
Output
0
Input
7 5
Output
10
Input
6 6
Output
10
Submitted Solution:
```
x, a = input().split()
print(10) if x >= a else print(0)
``` | 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
Input is given from Standard Input in the following format:
X A
Output
If X is less than A, print 0; if X is not less than A, print 10.
Examples
Input
3 5
Output
0
Input
7 5
Output
10
Input
6 6
Output
10
Submitted Solution:
```
X, A=input().split()
if X>=A:
print(10)
else:
print(0)
``` | 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
Input is given from Standard Input in the following format:
X A
Output
If X is less than A, print 0; if X is not less than A, print 10.
Examples
Input
3 5
Output
0
Input
7 5
Output
10
Input
6 6
Output
10
Submitted Solution:
```
a, b = map(int, input().split())
print(10 if a < b else 0)
``` | 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
Input is given from Standard Input in the following format:
X A
Output
If X is less than A, print 0; if X is not less than A, print 10.
Examples
Input
3 5
Output
0
Input
7 5
Output
10
Input
6 6
Output
10
Submitted Solution:
```
n, k = map(int, input().split())
s = [int(i) for i in input().split()]
left = 0
right = len(s)
count = 0
while not(right == len(s) and left == len(s)):
if sum(s[left:right])>k:
count += 1
if sum(s[left:right])>k:
right += -1
else:
right = len(s)
left += 1
print(count)
``` | 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
Input is given from Standard Input in the following format:
X A
Output
If X is less than A, print 0; if X is not less than A, print 10.
Examples
Input
3 5
Output
0
Input
7 5
Output
10
Input
6 6
Output
10
Submitted Solution:
```
b, c = map(int, input().split())
if b < c:
print('0')
else:
print('10')
``` | 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
Input is given from Standard Input in the following format:
X A
Output
If X is less than A, print 0; if X is not less than A, print 10.
Examples
Input
3 5
Output
0
Input
7 5
Output
10
Input
6 6
Output
10
Submitted Solution:
```
X = 2
A = 3
if X < A:
print(0)
else:
print(10)
``` | 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 smallest number received by a user.
Constraints
* 1 \leq N,K \leq 100
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
Output
Print the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.
Examples
Input
7 3
Output
1
Input
100 10
Output
0
Input
1 1
Output
0 | 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 smallest number received by a user.
Constraints
* 1 \leq N,K \leq 100
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
Output
Print the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.
Examples
Input
7 3
Output
1
Input
100 10
Output
0
Input
1 1
Output
0 | 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 smallest number received by a user.
Constraints
* 1 \leq N,K \leq 100
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
Output
Print the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.
Examples
Input
7 3
Output
1
Input
100 10
Output
0
Input
1 1
Output
0 | 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 smallest number received by a user.
Constraints
* 1 \leq N,K \leq 100
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
Output
Print the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.
Examples
Input
7 3
Output
1
Input
100 10
Output
0
Input
1 1
Output
0 | 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 smallest number received by a user.
Constraints
* 1 \leq N,K \leq 100
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
Output
Print the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.
Examples
Input
7 3
Output
1
Input
100 10
Output
0
Input
1 1
Output
0 | 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 smallest number received by a user.
Constraints
* 1 \leq N,K \leq 100
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
Output
Print the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.
Examples
Input
7 3
Output
1
Input
100 10
Output
0
Input
1 1
Output
0 | 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 smallest number received by a user.
Constraints
* 1 \leq N,K \leq 100
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
Output
Print the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.
Examples
Input
7 3
Output
1
Input
100 10
Output
0
Input
1 1
Output
0 | 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 smallest number received by a user.
Constraints
* 1 \leq N,K \leq 100
* All values in input are integers.
Input
Input is given from Standard Input in the following format:
N K
Output
Print the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.
Examples
Input
7 3
Output
1
Input
100 10
Output
0
Input
1 1
Output
0 | 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 set consists of:
n
a1
a2
.
.
an
You can assume that 1 ≤ n ≤ 5000 and -100000 ≤ ai ≤ 100000.
The input end with a line consisting of a single 0.
Output
For each dataset, print the maximum sum in a line.
Example
Input
7
-5
-1
6
4
9
-6
-7
13
1
2
3
2
-2
-1
1
2
3
2
1
-2
1
3
1000
-200
201
0
Output
19
14
1001 | 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 set consists of:
n
a1
a2
.
.
an
You can assume that 1 ≤ n ≤ 5000 and -100000 ≤ ai ≤ 100000.
The input end with a line consisting of a single 0.
Output
For each dataset, print the maximum sum in a line.
Example
Input
7
-5
-1
6
4
9
-6
-7
13
1
2
3
2
-2
-1
1
2
3
2
1
-2
1
3
1000
-200
201
0
Output
19
14
1001 | 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:nans=max(nlist)
print(nans)
``` | 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 set consists of:
n
a1
a2
.
.
an
You can assume that 1 ≤ n ≤ 5000 and -100000 ≤ ai ≤ 100000.
The input end with a line consisting of a single 0.
Output
For each dataset, print the maximum sum in a line.
Example
Input
7
-5
-1
6
4
9
-6
-7
13
1
2
3
2
-2
-1
1
2
3
2
1
-2
1
3
1000
-200
201
0
Output
19
14
1001 | 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):
ans = max(ans, a[k] - a[j])
print(ans)
``` | 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 set consists of:
n
a1
a2
.
.
an
You can assume that 1 ≤ n ≤ 5000 and -100000 ≤ ai ≤ 100000.
The input end with a line consisting of a single 0.
Output
For each dataset, print the maximum sum in a line.
Example
Input
7
-5
-1
6
4
9
-6
-7
13
1
2
3
2
-2
-1
1
2
3
2
1
-2
1
3
1000
-200
201
0
Output
19
14
1001 | 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)
array.append(line)
if len(array) == n:
break
print(getMax(array))
``` | 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 set consists of:
n
a1
a2
.
.
an
You can assume that 1 ≤ n ≤ 5000 and -100000 ≤ ai ≤ 100000.
The input end with a line consisting of a single 0.
Output
For each dataset, print the maximum sum in a line.
Example
Input
7
-5
-1
6
4
9
-6
-7
13
1
2
3
2
-2
-1
1
2
3
2
1
-2
1
3
1000
-200
201
0
Output
19
14
1001 | 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)
if max_val >= 0 and max_val+num >= 0:
max_val += num
elif max_val >= 0 and max_val+num < 0:
max_val = num
elif max_val < 0 and max_val < num:
max_val = num
max_seq.append(max_val)
print(max(max_seq))
n = int(input())
``` | 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 set consists of:
n
a1
a2
.
.
an
You can assume that 1 ≤ n ≤ 5000 and -100000 ≤ ai ≤ 100000.
The input end with a line consisting of a single 0.
Output
For each dataset, print the maximum sum in a line.
Example
Input
7
-5
-1
6
4
9
-6
-7
13
1
2
3
2
-2
-1
1
2
3
2
1
-2
1
3
1000
-200
201
0
Output
19
14
1001 | 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 set consists of:
n
a1
a2
.
.
an
You can assume that 1 ≤ n ≤ 5000 and -100000 ≤ ai ≤ 100000.
The input end with a line consisting of a single 0.
Output
For each dataset, print the maximum sum in a line.
Example
Input
7
-5
-1
6
4
9
-6
-7
13
1
2
3
2
-2
-1
1
2
3
2
1
-2
1
3
1000
-200
201
0
Output
19
14
1001 | 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 set consists of:
n
a1
a2
.
.
an
You can assume that 1 ≤ n ≤ 5000 and -100000 ≤ ai ≤ 100000.
The input end with a line consisting of a single 0.
Output
For each dataset, print the maximum sum in a line.
Example
Input
7
-5
-1
6
4
9
-6
-7
13
1
2
3
2
-2
-1
1
2
3
2
1
-2
1
3
1000
-200
201
0
Output
19
14
1001 | 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.