message stringlengths 2 20.2k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 757 108k | cluster float64 4 4 | __index_level_0__ int64 1.51k 217k |
|---|---|---|---|---|---|
Provide a correct Python 3 solution for this coding contest problem.
Early morning in summer camp
The morning of JAG summer training camp is early. To be exact, it is not so fast, but many participants feel that it is fast.
At the facility that is the venue for the training camp every year, participants must collect... | instruction | 0 | 29,060 | 4 | 58,120 |
"Correct Solution:
```
def dfs(s):
for t in G[s]:
if not used[t]:
used[t] = 1
dfs(t)
res.append(s)
def rdfs(s, l):
for t in RG[s]:
if label[t] is None:
label[t] = l
rdfs(t, l)
while 1:
n = int(input())
if n == 0:
break
G =... | output | 1 | 29,060 | 4 | 58,121 |
Provide a correct Python 3 solution for this coding contest problem.
Early morning in summer camp
The morning of JAG summer training camp is early. To be exact, it is not so fast, but many participants feel that it is fast.
At the facility that is the venue for the training camp every year, participants must collect... | instruction | 0 | 29,061 | 4 | 58,122 |
"Correct Solution:
```
def fix(c):
return int(c) - 1
def bfs(x, order, visited):
if visited[x]:
return
visited[x] = True
for to in edges[x]:
bfs(to, order, visited)
order.append(x)
def bfs_rev(x, visited):
if visited[x]:
return []
visited[x] = True
ret = [x]
for to in rev_edges[x]:
r... | output | 1 | 29,061 | 4 | 58,123 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Early morning in summer camp
The morning of JAG summer training camp is early. To be exact, it is not so fast, but many participants feel that it is fast.
At the facility that is the venue for... | instruction | 0 | 29,062 | 4 | 58,124 |
No | output | 1 | 29,062 | 4 | 58,125 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arya has n opponents in the school. Each day he will fight with all opponents who are present this day. His opponents have some fighting plan that guarantees they will win, but implementing this... | instruction | 0 | 29,603 | 4 | 59,206 |
No | output | 1 | 29,603 | 4 | 59,207 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arya has n opponents in the school. Each day he will fight with all opponents who are present this day. His opponents have some fighting plan that guarantees they will win, but implementing this... | instruction | 0 | 29,604 | 4 | 59,208 |
No | output | 1 | 29,604 | 4 | 59,209 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The new camp by widely-known over the country Spring Programming Camp is going to start soon. Hence, all the team of friendly curators and teachers started composing the camp's schedule. After some continuous discussion, they came up with a ... | instruction | 0 | 30,109 | 4 | 60,218 |
Tags: greedy, hashing, strings
Correct Solution:
```
flip = {'0': '1', '1': '0'}
# copied
s, t = input(), input()
n, m = len(s), len(t)
p = [0] * m
for i in range(1, m):
g = p[i - 1]
while g and (t[i] != t[g]):
g = p[g - 1]
p[i] = g + int(t[i] == t[g])
s_cnt = {'0': s.count('0'), '1': s.count('1... | output | 1 | 30,109 | 4 | 60,219 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The new camp by widely-known over the country Spring Programming Camp is going to start soon. Hence, all the team of friendly curators and teachers started composing the camp's schedule. After some continuous discussion, they came up with a ... | instruction | 0 | 30,110 | 4 | 60,220 |
Tags: greedy, hashing, strings
Correct Solution:
```
def computeLPS(pat):
l=0;M=len(pat)
i=1
while i<M:
if pat[i]==pat[l]:
l+=1
lps[i]=l
i+=1
else:
if l!=0:
l=lps[l-1]
else:
lps[i]=0
i... | output | 1 | 30,110 | 4 | 60,221 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The new camp by widely-known over the country Spring Programming Camp is going to start soon. Hence, all the team of friendly curators and teachers started composing the camp's schedule. After some continuous discussion, they came up with a ... | instruction | 0 | 30,111 | 4 | 60,222 |
Tags: greedy, hashing, strings
Correct Solution:
```
import sys
input = sys.stdin.readline
def MP(s):
a = [0] * (len(s) + 1)
a[0] = -1
j = -1
for i in range(len(s)):
while j >= 0 and s[i] != s[j]:
j = a[j]
j += 1
a[i + 1] = j
return a
s = input()[:-1]
t = inpu... | output | 1 | 30,111 | 4 | 60,223 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The new camp by widely-known over the country Spring Programming Camp is going to start soon. Hence, all the team of friendly curators and teachers started composing the camp's schedule. After some continuous discussion, they came up with a ... | instruction | 0 | 30,112 | 4 | 60,224 |
Tags: greedy, hashing, strings
Correct Solution:
```
def longestPrefixSuffix(s) :
n = len(s)
lps = [0] * n # lps[0] is always 0
# length of the previous
# longest prefix suffix
l = 0
# the loop calculates lps[i]
# for i = 1 to n-1
i = 1
while (i < n) :
... | output | 1 | 30,112 | 4 | 60,225 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The new camp by widely-known over the country Spring Programming Camp is going to start soon. Hence, all the team of friendly curators and teachers started composing the camp's schedule. After some continuous discussion, they came up with a ... | instruction | 0 | 30,113 | 4 | 60,226 |
Tags: greedy, hashing, strings
Correct Solution:
```
# Python3 implementation of the approach
from collections import defaultdict
# Function to return the length of maximum
# proper suffix which is also proper prefix
def Prefix_Array(t):
m = len(t)
arr =[-1]*m
k =-1
for i in range(1, m):
while k>-1 and t... | output | 1 | 30,113 | 4 | 60,227 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The new camp by widely-known over the country Spring Programming Camp is going to start soon. Hence, all the team of friendly curators and teachers started composing the camp's schedule. After some continuous discussion, they came up with a ... | instruction | 0 | 30,114 | 4 | 60,228 |
Tags: greedy, hashing, strings
Correct Solution:
```
def prefix(s):
v = [0] * len(s)
for i in range(1, len(s)):
k = v[i - 1]
while k > 0 and s[k] != s[i]:
k = v[k - 1]
if s[k] == s[i]:
k = k + 1
v[i] = k
return v[-1]
def tl():
ans = input()
p... | output | 1 | 30,114 | 4 | 60,229 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The new camp by widely-known over the country Spring Programming Camp is going to start soon. Hence, all the team of friendly curators and teachers started composing the camp's schedule. After some continuous discussion, they came up with a ... | instruction | 0 | 30,115 | 4 | 60,230 |
Tags: greedy, hashing, strings
Correct Solution:
```
import math
s=input()
t_=input()
tt=''
t=t_
ans=''
for i in range(len(t_)-1):
tt+=t_[i]
if (t_.endswith(tt)):
t=t_[i+1:]
s0=s.count('0')
s1=s.count('1')
t_0=t_.count('0')
t_1=t_.count('1')
t0=t.count('0')
t1=t.count('1')
if s0>=t_0 and s1>=t_1:
ans+=t_
s0-=t_0
... | output | 1 | 30,115 | 4 | 60,231 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The new camp by widely-known over the country Spring Programming Camp is going to start soon. Hence, all the team of friendly curators and teachers started composing the camp's schedule. After some continuous discussion, they came up with a ... | instruction | 0 | 30,116 | 4 | 60,232 |
Tags: greedy, hashing, strings
Correct Solution:
```
string = input()
sub_string = input()
if len(string)<len(sub_string):
print(string)
else:
nof1_st = string.count('1')
nof0_st = string.count('0')
nof1_su = sub_string.count('1')
nof0_su = sub_string.count('0')
if nof1_su==0:
print((nof... | output | 1 | 30,116 | 4 | 60,233 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The new camp by widely-known over the country Spring Programming Camp is going to start soon. Hence, all the team of friendly curators and teachers started composing the camp's schedule. After s... | instruction | 0 | 30,117 | 4 | 60,234 |
Yes | output | 1 | 30,117 | 4 | 60,235 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The new camp by widely-known over the country Spring Programming Camp is going to start soon. Hence, all the team of friendly curators and teachers started composing the camp's schedule. After s... | instruction | 0 | 30,118 | 4 | 60,236 |
Yes | output | 1 | 30,118 | 4 | 60,237 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The new camp by widely-known over the country Spring Programming Camp is going to start soon. Hence, all the team of friendly curators and teachers started composing the camp's schedule. After s... | instruction | 0 | 30,119 | 4 | 60,238 |
Yes | output | 1 | 30,119 | 4 | 60,239 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The new camp by widely-known over the country Spring Programming Camp is going to start soon. Hence, all the team of friendly curators and teachers started composing the camp's schedule. After s... | instruction | 0 | 30,120 | 4 | 60,240 |
Yes | output | 1 | 30,120 | 4 | 60,241 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The new camp by widely-known over the country Spring Programming Camp is going to start soon. Hence, all the team of friendly curators and teachers started composing the camp's schedule. After s... | instruction | 0 | 30,121 | 4 | 60,242 |
No | output | 1 | 30,121 | 4 | 60,243 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The new camp by widely-known over the country Spring Programming Camp is going to start soon. Hence, all the team of friendly curators and teachers started composing the camp's schedule. After s... | instruction | 0 | 30,122 | 4 | 60,244 |
No | output | 1 | 30,122 | 4 | 60,245 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The new camp by widely-known over the country Spring Programming Camp is going to start soon. Hence, all the team of friendly curators and teachers started composing the camp's schedule. After s... | instruction | 0 | 30,123 | 4 | 60,246 |
No | output | 1 | 30,123 | 4 | 60,247 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The new camp by widely-known over the country Spring Programming Camp is going to start soon. Hence, all the team of friendly curators and teachers started composing the camp's schedule. After s... | instruction | 0 | 30,124 | 4 | 60,248 |
No | output | 1 | 30,124 | 4 | 60,249 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya studies at university. The current academic year finishes with n special days. Petya needs to pass m exams in those special days. The special days in this problem are numbered from 1 to n.... | instruction | 0 | 30,679 | 4 | 61,358 |
Yes | output | 1 | 30,679 | 4 | 61,359 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya studies at university. The current academic year finishes with n special days. Petya needs to pass m exams in those special days. The special days in this problem are numbered from 1 to n.... | instruction | 0 | 30,680 | 4 | 61,360 |
Yes | output | 1 | 30,680 | 4 | 61,361 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya studies at university. The current academic year finishes with n special days. Petya needs to pass m exams in those special days. The special days in this problem are numbered from 1 to n.... | instruction | 0 | 30,681 | 4 | 61,362 |
Yes | output | 1 | 30,681 | 4 | 61,363 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya studies at university. The current academic year finishes with n special days. Petya needs to pass m exams in those special days. The special days in this problem are numbered from 1 to n.... | instruction | 0 | 30,682 | 4 | 61,364 |
Yes | output | 1 | 30,682 | 4 | 61,365 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya studies at university. The current academic year finishes with n special days. Petya needs to pass m exams in those special days. The special days in this problem are numbered from 1 to n.... | instruction | 0 | 30,683 | 4 | 61,366 |
No | output | 1 | 30,683 | 4 | 61,367 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya studies at university. The current academic year finishes with n special days. Petya needs to pass m exams in those special days. The special days in this problem are numbered from 1 to n.... | instruction | 0 | 30,684 | 4 | 61,368 |
No | output | 1 | 30,684 | 4 | 61,369 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya studies at university. The current academic year finishes with n special days. Petya needs to pass m exams in those special days. The special days in this problem are numbered from 1 to n.... | instruction | 0 | 30,685 | 4 | 61,370 |
No | output | 1 | 30,685 | 4 | 61,371 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya studies at university. The current academic year finishes with n special days. Petya needs to pass m exams in those special days. The special days in this problem are numbered from 1 to n.... | instruction | 0 | 30,686 | 4 | 61,372 |
No | output | 1 | 30,686 | 4 | 61,373 |
Provide a correct Python 3 solution for this coding contest problem.
In this problem, we use the 24-hour clock.
Takahashi gets up exactly at the time H_1 : M_1 and goes to bed exactly at the time H_2 : M_2. (See Sample Inputs below for clarity.) He has decided to study for K consecutive minutes while he is up. What i... | instruction | 0 | 30,703 | 4 | 61,406 |
"Correct Solution:
```
h1,m1,h2,m2,k = map(int,input().split())
h=(h2-h1)*60
m=m2-m1
print(h+m-k)
``` | output | 1 | 30,703 | 4 | 61,407 |
Provide a correct Python 3 solution for this coding contest problem.
In this problem, we use the 24-hour clock.
Takahashi gets up exactly at the time H_1 : M_1 and goes to bed exactly at the time H_2 : M_2. (See Sample Inputs below for clarity.) He has decided to study for K consecutive minutes while he is up. What i... | instruction | 0 | 30,704 | 4 | 61,408 |
"Correct Solution:
```
h1, m1, h2, m2, k = map(int, input().split(' '))
print(60*(h2-h1)+m2-m1-k)
``` | output | 1 | 30,704 | 4 | 61,409 |
Provide a correct Python 3 solution for this coding contest problem.
In this problem, we use the 24-hour clock.
Takahashi gets up exactly at the time H_1 : M_1 and goes to bed exactly at the time H_2 : M_2. (See Sample Inputs below for clarity.) He has decided to study for K consecutive minutes while he is up. What i... | instruction | 0 | 30,705 | 4 | 61,410 |
"Correct Solution:
```
h1,m1,h2,m2,k=map(int,input().split())
s=(h2*60+m2)-(h1*60+m1)
print(s-k)
``` | output | 1 | 30,705 | 4 | 61,411 |
Provide a correct Python 3 solution for this coding contest problem.
In this problem, we use the 24-hour clock.
Takahashi gets up exactly at the time H_1 : M_1 and goes to bed exactly at the time H_2 : M_2. (See Sample Inputs below for clarity.) He has decided to study for K consecutive minutes while he is up. What i... | instruction | 0 | 30,706 | 4 | 61,412 |
"Correct Solution:
```
a=list(map(int,input().split()))
print((a[2]*60+a[3])-(a[0]*60+a[1])-a[4])
``` | output | 1 | 30,706 | 4 | 61,413 |
Provide a correct Python 3 solution for this coding contest problem.
In this problem, we use the 24-hour clock.
Takahashi gets up exactly at the time H_1 : M_1 and goes to bed exactly at the time H_2 : M_2. (See Sample Inputs below for clarity.) He has decided to study for K consecutive minutes while he is up. What i... | instruction | 0 | 30,707 | 4 | 61,414 |
"Correct Solution:
```
h,m,H,M,k = map(int,input().split())
v = H*60+M
u = h*60+m+k
print(v-u)
``` | output | 1 | 30,707 | 4 | 61,415 |
Provide a correct Python 3 solution for this coding contest problem.
In this problem, we use the 24-hour clock.
Takahashi gets up exactly at the time H_1 : M_1 and goes to bed exactly at the time H_2 : M_2. (See Sample Inputs below for clarity.) He has decided to study for K consecutive minutes while he is up. What i... | instruction | 0 | 30,708 | 4 | 61,416 |
"Correct Solution:
```
h1,m1,h2,m2,k=map(int,input().split())
s=(h2-h1)*60+(m2-m1)
print(s-k)
``` | output | 1 | 30,708 | 4 | 61,417 |
Provide a correct Python 3 solution for this coding contest problem.
In this problem, we use the 24-hour clock.
Takahashi gets up exactly at the time H_1 : M_1 and goes to bed exactly at the time H_2 : M_2. (See Sample Inputs below for clarity.) He has decided to study for K consecutive minutes while he is up. What i... | instruction | 0 | 30,709 | 4 | 61,418 |
"Correct Solution:
```
a,b,c,d,e=map(int,input().split())
f=(c-a)*60+(d-b)-e
print(f)
``` | output | 1 | 30,709 | 4 | 61,419 |
Provide a correct Python 3 solution for this coding contest problem.
In this problem, we use the 24-hour clock.
Takahashi gets up exactly at the time H_1 : M_1 and goes to bed exactly at the time H_2 : M_2. (See Sample Inputs below for clarity.) He has decided to study for K consecutive minutes while he is up. What i... | instruction | 0 | 30,710 | 4 | 61,420 |
"Correct Solution:
```
a,b,c,d,e=(int(x) for x in input().split())
f=c-a
g=d-b
print((f*60+g)-e)
``` | output | 1 | 30,710 | 4 | 61,421 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem, we use the 24-hour clock.
Takahashi gets up exactly at the time H_1 : M_1 and goes to bed exactly at the time H_2 : M_2. (See Sample Inputs below for clarity.) He has decided t... | instruction | 0 | 30,711 | 4 | 61,422 |
Yes | output | 1 | 30,711 | 4 | 61,423 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem, we use the 24-hour clock.
Takahashi gets up exactly at the time H_1 : M_1 and goes to bed exactly at the time H_2 : M_2. (See Sample Inputs below for clarity.) He has decided t... | instruction | 0 | 30,712 | 4 | 61,424 |
Yes | output | 1 | 30,712 | 4 | 61,425 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem, we use the 24-hour clock.
Takahashi gets up exactly at the time H_1 : M_1 and goes to bed exactly at the time H_2 : M_2. (See Sample Inputs below for clarity.) He has decided t... | instruction | 0 | 30,713 | 4 | 61,426 |
Yes | output | 1 | 30,713 | 4 | 61,427 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem, we use the 24-hour clock.
Takahashi gets up exactly at the time H_1 : M_1 and goes to bed exactly at the time H_2 : M_2. (See Sample Inputs below for clarity.) He has decided t... | instruction | 0 | 30,714 | 4 | 61,428 |
Yes | output | 1 | 30,714 | 4 | 61,429 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem, we use the 24-hour clock.
Takahashi gets up exactly at the time H_1 : M_1 and goes to bed exactly at the time H_2 : M_2. (See Sample Inputs below for clarity.) He has decided t... | instruction | 0 | 30,715 | 4 | 61,430 |
No | output | 1 | 30,715 | 4 | 61,431 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem, we use the 24-hour clock.
Takahashi gets up exactly at the time H_1 : M_1 and goes to bed exactly at the time H_2 : M_2. (See Sample Inputs below for clarity.) He has decided t... | instruction | 0 | 30,716 | 4 | 61,432 |
No | output | 1 | 30,716 | 4 | 61,433 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem, we use the 24-hour clock.
Takahashi gets up exactly at the time H_1 : M_1 and goes to bed exactly at the time H_2 : M_2. (See Sample Inputs below for clarity.) He has decided t... | instruction | 0 | 30,717 | 4 | 61,434 |
No | output | 1 | 30,717 | 4 | 61,435 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem, we use the 24-hour clock.
Takahashi gets up exactly at the time H_1 : M_1 and goes to bed exactly at the time H_2 : M_2. (See Sample Inputs below for clarity.) He has decided t... | instruction | 0 | 30,718 | 4 | 61,436 |
No | output | 1 | 30,718 | 4 | 61,437 |
Provide a correct Python 3 solution for this coding contest problem.
At Aizu Riverside Hospital, inpatients walk twice a day for rehabilitation and health promotion. As the number of people trying to recover their physical strength by walking is increasing day by day in order to leave the hospital energetically, the d... | instruction | 0 | 30,863 | 4 | 61,726 |
"Correct Solution:
```
while True:
n = int(input())
if n==0: break
km= 0
for i in range(n):
p,d1,d2 = map(int,input().split())
m = d1 +d2
if km < m:
km = m
a = p
print(a,km)
``` | output | 1 | 30,863 | 4 | 61,727 |
Provide a correct Python 3 solution for this coding contest problem.
At Aizu Riverside Hospital, inpatients walk twice a day for rehabilitation and health promotion. As the number of people trying to recover their physical strength by walking is increasing day by day in order to leave the hospital energetically, the d... | instruction | 0 | 30,864 | 4 | 61,728 |
"Correct Solution:
```
import sys
f = sys.stdin
import operator
while True:
n = int(f.readline())
if n == 0:
break
pd = [map(int, f.readline().split()) for _ in range(n)]
pd = [[p, d1 + d2] for p, d1, d2 in pd]
pd.sort(key=operator.itemgetter(1))
print(*pd[-1])
``` | output | 1 | 30,864 | 4 | 61,729 |
Provide a correct Python 3 solution for this coding contest problem.
At Aizu Riverside Hospital, inpatients walk twice a day for rehabilitation and health promotion. As the number of people trying to recover their physical strength by walking is increasing day by day in order to leave the hospital energetically, the d... | instruction | 0 | 30,865 | 4 | 61,730 |
"Correct Solution:
```
while True:
N=int(input())
if N== 0:
break
B=0
V=0
for i in range(N):
p,d,g=map(int,input().split())
S=d+g
if S>V:
V=S
B=p
print(B,V)
``` | output | 1 | 30,865 | 4 | 61,731 |
Provide a correct Python 3 solution for this coding contest problem.
At Aizu Riverside Hospital, inpatients walk twice a day for rehabilitation and health promotion. As the number of people trying to recover their physical strength by walking is increasing day by day in order to leave the hospital energetically, the d... | instruction | 0 | 30,866 | 4 | 61,732 |
"Correct Solution:
```
while True:
n = int(input())
if n == 0:
break
ls = []
for i in range(n):
v = list(map(int,input().split()))
ls.append((sum(v[1:]),v[0]))
ls.sort()
ls.reverse()
print(ls[0][1],ls[0][0])
``` | output | 1 | 30,866 | 4 | 61,733 |
Provide a correct Python 3 solution for this coding contest problem.
At Aizu Riverside Hospital, inpatients walk twice a day for rehabilitation and health promotion. As the number of people trying to recover their physical strength by walking is increasing day by day in order to leave the hospital energetically, the d... | instruction | 0 | 30,867 | 4 | 61,734 |
"Correct Solution:
```
while 1:
n = int(input())
if n == 0:
break
L = []
for i in range(n):
p,d1,d2 = map(int,input().split())
L.append((p,d1+d2))
L.sort(key = lambda x :-x[1])
print(L[0][0],L[0][1])
``` | output | 1 | 30,867 | 4 | 61,735 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.