message stringlengths 2 20.1k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 1.95k 109k | cluster float64 17 17 | __index_level_0__ int64 3.91k 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a game called "Unique Bid Auction". You can read more about it here: https://en.wikipedia.org/wiki/Unique_bid_auction (though you don't have to do it to solve this problem).
Let's simplify this game a bit. Formally, there are n par... | instruction | 0 | 70,065 | 17 | 140,130 |
Tags: implementation
Correct Solution:
```
t = int(input())
def solve():
n = int(input())
arr = list(map(int, input().split()))
ans = -1
d = {}
for i in arr:
if i not in d:
d[i] = 1
else:
d[i] = 2
m = 9999999999999
ans = -1
for i, v in enumerat... | output | 1 | 70,065 | 17 | 140,131 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a game called "Unique Bid Auction". You can read more about it here: https://en.wikipedia.org/wiki/Unique_bid_auction (though you don't have to do it to solve this problem).
Let's simplify this game a bit. Formally, there are n par... | instruction | 0 | 70,066 | 17 | 140,132 |
Tags: implementation
Correct Solution:
```
t = int(input())
for _ in range(t):
contagem = dict()
n = int(input())
aux = list(map(int,input().split()))
for i in range(n):
if aux[i] in contagem:
contagem[aux[i]].append(i+1)
else:
contagem[aux[i]] = [i+1]
... | output | 1 | 70,066 | 17 | 140,133 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On February, 30th n students came in the Center for Training Olympiad Programmers (CTOP) of the Berland State University. They came one by one, one after another. Each of them went in, and before sitting down at his desk, greeted with those ... | instruction | 0 | 70,227 | 17 | 140,454 |
Tags: binary search, constructive algorithms, data structures, greedy
Correct Solution:
```
def read_int():
return int(input().strip())
def read_ints():
return list(map(int, input().strip().split(' ')))
def solve():
"""
4 2 1 3 5
0 2 3 4 1 1 0 2 2
x x x x x x x x x
1 5 8 3 4 2 7 6 9
... | output | 1 | 70,227 | 17 | 140,455 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On February, 30th n students came in the Center for Training Olympiad Programmers (CTOP) of the Berland State University. They came one by one, one after another. Each of them went in, and before sitting down at his desk, greeted with those ... | instruction | 0 | 70,228 | 17 | 140,456 |
Tags: binary search, constructive algorithms, data structures, greedy
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
from collections import Counter
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = B... | output | 1 | 70,228 | 17 | 140,457 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On February, 30th n students came in the Center for Training Olympiad Programmers (CTOP) of the Berland State University. They came one by one, one after another. Each of them went in, and before sitting down at his desk, greeted with those ... | instruction | 0 | 70,229 | 17 | 140,458 |
Tags: binary search, constructive algorithms, data structures, greedy
Correct Solution:
```
# ---------------------------iye ha aam zindegi---------------------------------------------
import math
import random
import heapq,bisect
import sys
from collections import deque, defaultdict
from fractions import Fraction
impo... | output | 1 | 70,229 | 17 | 140,459 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On February, 30th n students came in the Center for Training Olympiad Programmers (CTOP) of the Berland State University. They came one by one, one after another. Each of them went in, and before sitting down at his desk, greeted with those ... | instruction | 0 | 70,230 | 17 | 140,460 |
Tags: binary search, constructive algorithms, data structures, greedy
Correct Solution:
```
n=int(input())
c=[[] for i in range(n)]
[c[int(x)].append(i+1) for i,x in enumerate(input().split())]
s=0;r=[]
for i in range(n):
while len(c[s])==0 and s>=0:
s-=3
if s<0:
print('Impossible')
brea... | output | 1 | 70,230 | 17 | 140,461 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On February, 30th n students came in the Center for Training Olympiad Programmers (CTOP) of the Berland State University. They came one by one, one after another. Each of them went in, and before sitting down at his desk, greeted with those ... | instruction | 0 | 70,231 | 17 | 140,462 |
Tags: binary search, constructive algorithms, data structures, greedy
Correct Solution:
```
#from bisect import bisect_left as bl #c++ lowerbound bl(array,element)
#from bisect import bisect_right as br #c++ upperbound br(array,element)
#from __future__ import print_function, division #w... | output | 1 | 70,231 | 17 | 140,463 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On February, 30th n students came in the Center for Training Olympiad Programmers (CTOP) of the Berland State University. They came one by one, one after another. Each of them went in, and before sitting down at his desk, greeted with those ... | instruction | 0 | 70,232 | 17 | 140,464 |
Tags: binary search, constructive algorithms, data structures, greedy
Correct Solution:
```
import sys
import math
import heapq
import bisect
from collections import Counter
from collections import defaultdict
from io import BytesIO, IOBase
import string
class FastIO(IOBase):
newlines = 0
def __init__(self, ... | output | 1 | 70,232 | 17 | 140,465 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On February, 30th n students came in the Center for Training Olympiad Programmers (CTOP) of the Berland State University. They came one by one, one after another. Each of them went in, and before sitting down at his desk, greeted with those ... | instruction | 0 | 70,233 | 17 | 140,466 |
Tags: binary search, constructive algorithms, data structures, greedy
Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
dic = [[] for i in range(n)]
for i, item in enumerate(a, start=1):
dic[item].append(i)
if not dic[0]:
print("Impossible")
exit()
route = [dic[0].pop()]
s = 0... | output | 1 | 70,233 | 17 | 140,467 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On February, 30th n students came in the Center for Training Olympiad Programmers (CTOP) of the Berland State University. They came one by one, one after another. Each of them went in, and before sitting down at his desk, greeted with those ... | instruction | 0 | 70,234 | 17 | 140,468 |
Tags: binary search, constructive algorithms, data structures, greedy
Correct Solution:
```
from sys import stdin, stdout
from math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log
from collections import defaultdict as dd, deque
from heapq import merge, heapify, heappop, heappush, nsmallest
from bisect import ... | output | 1 | 70,234 | 17 | 140,469 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On February, 30th n students came in the Center for Training Olympiad Programmers (CTOP) of the Berland State University. They came one by one, one after another. Each of them went in, and befor... | instruction | 0 | 70,235 | 17 | 140,470 |
Yes | output | 1 | 70,235 | 17 | 140,471 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On February, 30th n students came in the Center for Training Olympiad Programmers (CTOP) of the Berland State University. They came one by one, one after another. Each of them went in, and befor... | instruction | 0 | 70,236 | 17 | 140,472 |
Yes | output | 1 | 70,236 | 17 | 140,473 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On February, 30th n students came in the Center for Training Olympiad Programmers (CTOP) of the Berland State University. They came one by one, one after another. Each of them went in, and befor... | instruction | 0 | 70,237 | 17 | 140,474 |
Yes | output | 1 | 70,237 | 17 | 140,475 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On February, 30th n students came in the Center for Training Olympiad Programmers (CTOP) of the Berland State University. They came one by one, one after another. Each of them went in, and befor... | instruction | 0 | 70,238 | 17 | 140,476 |
Yes | output | 1 | 70,238 | 17 | 140,477 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On February, 30th n students came in the Center for Training Olympiad Programmers (CTOP) of the Berland State University. They came one by one, one after another. Each of them went in, and befor... | instruction | 0 | 70,239 | 17 | 140,478 |
No | output | 1 | 70,239 | 17 | 140,479 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On February, 30th n students came in the Center for Training Olympiad Programmers (CTOP) of the Berland State University. They came one by one, one after another. Each of them went in, and befor... | instruction | 0 | 70,240 | 17 | 140,480 |
No | output | 1 | 70,240 | 17 | 140,481 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On February, 30th n students came in the Center for Training Olympiad Programmers (CTOP) of the Berland State University. They came one by one, one after another. Each of them went in, and befor... | instruction | 0 | 70,241 | 17 | 140,482 |
No | output | 1 | 70,241 | 17 | 140,483 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On February, 30th n students came in the Center for Training Olympiad Programmers (CTOP) of the Berland State University. They came one by one, one after another. Each of them went in, and befor... | instruction | 0 | 70,242 | 17 | 140,484 |
No | output | 1 | 70,242 | 17 | 140,485 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This year, as in previous years, MemSQL is inviting the top 25 competitors from the Start[c]up qualification round to compete onsite for the final round. Not everyone who is eligible to compete onsite can afford to travel to the office, thou... | instruction | 0 | 70,402 | 17 | 140,804 |
Tags: greedy, implementation
Correct Solution:
```
b=int(input())
a=list(map(int,input().split()))
b=0
a.sort()
for i in range(b):
if a[i]>25:
b+=1
if a[-1]>25:
b=b+(a[-1]-25-b)
print(b)
``` | output | 1 | 70,402 | 17 | 140,805 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This year, as in previous years, MemSQL is inviting the top 25 competitors from the Start[c]up qualification round to compete onsite for the final round. Not everyone who is eligible to compete onsite can afford to travel to the office, thou... | instruction | 0 | 70,403 | 17 | 140,806 |
Tags: greedy, implementation
Correct Solution:
```
def invited(lst):
return max(0, max(lst) - 25)
n = int(input())
a = [int(i) for i in input().split()]
print(invited(a))
``` | output | 1 | 70,403 | 17 | 140,807 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This year, as in previous years, MemSQL is inviting the top 25 competitors from the Start[c]up qualification round to compete onsite for the final round. Not everyone who is eligible to compete onsite can afford to travel to the office, thou... | instruction | 0 | 70,404 | 17 | 140,808 |
Tags: greedy, implementation
Correct Solution:
```
n =int(input())
x = max([int(d)for d in input().split()])
if x<=25:
print(0)
else:
print(x-25)
``` | output | 1 | 70,404 | 17 | 140,809 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This year, as in previous years, MemSQL is inviting the top 25 competitors from the Start[c]up qualification round to compete onsite for the final round. Not everyone who is eligible to compete onsite can afford to travel to the office, thou... | instruction | 0 | 70,405 | 17 | 140,810 |
Tags: greedy, implementation
Correct Solution:
```
k = int(input())
r = list(map(int, input().split()))
m = max(r)
if m < 25:
print(0)
else:
print(m - 25)
``` | output | 1 | 70,405 | 17 | 140,811 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This year, as in previous years, MemSQL is inviting the top 25 competitors from the Start[c]up qualification round to compete onsite for the final round. Not everyone who is eligible to compete onsite can afford to travel to the office, thou... | instruction | 0 | 70,406 | 17 | 140,812 |
Tags: greedy, implementation
Correct Solution:
```
k = int(input())
arr = list(map(int,input().split()))
arr.sort()
if arr[k-1] - 25 > 0:
print(arr[k-1] - 25)
else:
print("0")
``` | output | 1 | 70,406 | 17 | 140,813 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This year, as in previous years, MemSQL is inviting the top 25 competitors from the Start[c]up qualification round to compete onsite for the final round. Not everyone who is eligible to compete onsite can afford to travel to the office, thou... | instruction | 0 | 70,407 | 17 | 140,814 |
Tags: greedy, implementation
Correct Solution:
```
n = int(input())
contestants = [int(i) for i in input().split(' ')]
contestants.sort(reverse=True)
if n <= 25 and contestants[0] > 25: print(contestants[0] - 25)
# elif n == 25 and contestants[0] > 25: print(contestants[0] - 25)
else: print(0)
``` | output | 1 | 70,407 | 17 | 140,815 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This year, as in previous years, MemSQL is inviting the top 25 competitors from the Start[c]up qualification round to compete onsite for the final round. Not everyone who is eligible to compete onsite can afford to travel to the office, thou... | instruction | 0 | 70,408 | 17 | 140,816 |
Tags: greedy, implementation
Correct Solution:
```
n=int(input())
print(max(0,max(list(map(int,input().split())))-25))
``` | output | 1 | 70,408 | 17 | 140,817 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This year, as in previous years, MemSQL is inviting the top 25 competitors from the Start[c]up qualification round to compete onsite for the final round. Not everyone who is eligible to compete onsite can afford to travel to the office, thou... | instruction | 0 | 70,409 | 17 | 140,818 |
Tags: greedy, implementation
Correct Solution:
```
def solve(n, r):
return max(0, max(r) - 25)
def main():
n = int(input())
r = list(map(int, input().split()))
print(solve(n, r))
main()
``` | output | 1 | 70,409 | 17 | 140,819 |
Provide a correct Python 3 solution for this coding contest problem.
Ito joined the Kyudo club after entering high school. At first, I had a hard time because the arrow didn't reach the target, but in the fall of my first year of high school, I managed to improve to the point where the arrow reached the target.
One d... | instruction | 0 | 70,677 | 17 | 141,354 |
"Correct Solution:
```
sum_list = []
while True:
n = int(input())
if n == 0:
break
n //= 4
sum = 0
for _ in range(n):
sum += int(input())
sum_list.append(sum)
for sum_e in sum_list:
print(sum_e)
``` | output | 1 | 70,677 | 17 | 141,355 |
Provide a correct Python 3 solution for this coding contest problem.
Ito joined the Kyudo club after entering high school. At first, I had a hard time because the arrow didn't reach the target, but in the fall of my first year of high school, I managed to improve to the point where the arrow reached the target.
One d... | instruction | 0 | 70,678 | 17 | 141,356 |
"Correct Solution:
```
while True:
n = int(input())
if n == 0:break
print(sum([int(input()) for _ in range(int(n / 4))]))
``` | output | 1 | 70,678 | 17 | 141,357 |
Provide a correct Python 3 solution for this coding contest problem.
Ito joined the Kyudo club after entering high school. At first, I had a hard time because the arrow didn't reach the target, but in the fall of my first year of high school, I managed to improve to the point where the arrow reached the target.
One d... | instruction | 0 | 70,679 | 17 | 141,358 |
"Correct Solution:
```
while True:
a = int(input())
if a == 0:
break
count = 0
for _ in range(int(a / 4)):
b = int(input())
count += b
print(count)
``` | output | 1 | 70,679 | 17 | 141,359 |
Provide a correct Python 3 solution for this coding contest problem.
Ito joined the Kyudo club after entering high school. At first, I had a hard time because the arrow didn't reach the target, but in the fall of my first year of high school, I managed to improve to the point where the arrow reached the target.
One d... | instruction | 0 | 70,680 | 17 | 141,360 |
"Correct Solution:
```
while True:
num = int(input())
if num == 0:
break
else:
kei = 0
for _ in range(int(num / 4)):
num1 = int(input())
kei += num1
print(kei)
``` | output | 1 | 70,680 | 17 | 141,361 |
Provide a correct Python 3 solution for this coding contest problem.
Ito joined the Kyudo club after entering high school. At first, I had a hard time because the arrow didn't reach the target, but in the fall of my first year of high school, I managed to improve to the point where the arrow reached the target.
One d... | instruction | 0 | 70,681 | 17 | 141,362 |
"Correct Solution:
```
while True :
n = int(input())
if n == 0 :
break
sum = 0
for i in range(int(n/4)) :
sum += int(input())
print(sum)
``` | output | 1 | 70,681 | 17 | 141,363 |
Provide a correct Python 3 solution for this coding contest problem.
Ito joined the Kyudo club after entering high school. At first, I had a hard time because the arrow didn't reach the target, but in the fall of my first year of high school, I managed to improve to the point where the arrow reached the target.
One d... | instruction | 0 | 70,682 | 17 | 141,364 |
"Correct Solution:
```
while(True):
N = int(input())
if N==0:
break
time = N // 4
goukei = 0
for i in range(time):
ipt = int(input())
goukei += ipt
print(goukei)
``` | output | 1 | 70,682 | 17 | 141,365 |
Provide a correct Python 3 solution for this coding contest problem.
Ito joined the Kyudo club after entering high school. At first, I had a hard time because the arrow didn't reach the target, but in the fall of my first year of high school, I managed to improve to the point where the arrow reached the target.
One d... | instruction | 0 | 70,683 | 17 | 141,366 |
"Correct Solution:
```
while True:
n=int(input())
if n==0:
exit()
ans=0
for i in range(n//4):
x=int(input())
ans+=x
print(ans)
``` | output | 1 | 70,683 | 17 | 141,367 |
Provide a correct Python 3 solution for this coding contest problem.
Ito joined the Kyudo club after entering high school. At first, I had a hard time because the arrow didn't reach the target, but in the fall of my first year of high school, I managed to improve to the point where the arrow reached the target.
One d... | instruction | 0 | 70,684 | 17 | 141,368 |
"Correct Solution:
```
N=int(input())
while N!=0:
s=[]
for i in range(int(N/4)):
s.append(int(input()))
print(sum(s))
N=int(input())
``` | output | 1 | 70,684 | 17 | 141,369 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Smart Beaver decided to be not only smart, but also a healthy beaver! And so he began to attend physical education classes at school X. In this school, physical education has a very creative teacher. One of his favorite warm-up exercises is ... | instruction | 0 | 71,065 | 17 | 142,130 |
Tags: dp, math
Correct Solution:
```
m = 1000000007
n = int(input())
a = map(int, input().split())
t1, t2 = 0, 0
for i in a:
if i == 1:
t1 += 1
else:
t2 += 1
a = [1, 2]
for i in range(3, t1+1):
a = a[::-1]
a[1] = (a[0]+(i-1)*a[1])%m
if not t1 or t1 == 1:
a[1] = 1
for i in range(t1+1, n+1):
a[1] = a[1]*i%m
pri... | output | 1 | 71,065 | 17 | 142,131 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Smart Beaver decided to be not only smart, but also a healthy beaver! And so he began to attend physical education classes at school X. In this school, physical education has a very creative tea... | instruction | 0 | 71,066 | 17 | 142,132 |
No | output | 1 | 71,066 | 17 | 142,133 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a programing contest named SnakeUp, 2n people want to compete for it. In order to attend this contest, people need to form teams of exactly two people. You are given the strength of each possible combination of two people. All the v... | instruction | 0 | 71,185 | 17 | 142,370 |
Tags: brute force, implementation, sortings
Correct Solution:
```
import sys
N = int(sys.stdin.readline())
members = list()
list_sum = list()
for i in range(2*N-1):
members.append(list(map(int, sys.stdin.readline().split())))
for j in range(len(members[i])):
list_sum.append([members[i][j], (i+2,j+1)]... | output | 1 | 71,185 | 17 | 142,371 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a programing contest named SnakeUp, 2n people want to compete for it. In order to attend this contest, people need to form teams of exactly two people. You are given the strength of each possible combination of two people. All the v... | instruction | 0 | 71,186 | 17 | 142,372 |
Tags: brute force, implementation, sortings
Correct Solution:
```
n=int(input())
out=[-1]*n*2
L=[]
for i in range(1,n*2) :
l=list(map(int,input().split()))
for j in range(len(l)) :
t=[l[j],[i+1,j+1]]
L.append(t)
L=sorted(L,key=lambda x :-x[0])
for i in range(len(L)) :
if out[L[i][1][0]-1]=... | output | 1 | 71,186 | 17 | 142,373 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a programing contest named SnakeUp, 2n people want to compete for it. In order to attend this contest, people need to form teams of exactly two people. You are given the strength of each possible combination of two people. All the v... | instruction | 0 | 71,187 | 17 | 142,374 |
Tags: brute force, implementation, sortings
Correct Solution:
```
from sys import stdin
live = True
if not live: stdin = open('data.in', 'r')
numbers = []
n = int(stdin.readline().strip())
for i in range(2, (2*n + 1)):
line = list(map(int, stdin.readline().strip().split()))
it = 1
for j in line:
numbers.append((... | output | 1 | 71,187 | 17 | 142,375 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a programing contest named SnakeUp, 2n people want to compete for it. In order to attend this contest, people need to form teams of exactly two people. You are given the strength of each possible combination of two people. All the v... | instruction | 0 | 71,188 | 17 | 142,376 |
Tags: brute force, implementation, sortings
Correct Solution:
```
def mergeSort(arr, l, r, merge_arr):
if(l < r):
mid = int(l + r) // 2
mergeSort(arr, l, mid, merge_arr)
mergeSort(arr, mid + 1, r, merge_arr)
merge(arr, l, mid, r, merge_arr)
def merge(source, left, mid, right, merge... | output | 1 | 71,188 | 17 | 142,377 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a programing contest named SnakeUp, 2n people want to compete for it. In order to attend this contest, people need to form teams of exactly two people. You are given the strength of each possible combination of two people. All the v... | instruction | 0 | 71,189 | 17 | 142,378 |
Tags: brute force, implementation, sortings
Correct Solution:
```
n = int(input())*2
v = []
for i in range(1,n):
a = [int(str) for str in input().split(' ')]
for j in range(0,i):
v.append([a[j],i,j])
v.sort(reverse=True)
r = [-1] * n
for i in range(len(v)):
if r[v[i][1]] == -1 and r[v[i][2]] == -1:... | output | 1 | 71,189 | 17 | 142,379 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a programing contest named SnakeUp, 2n people want to compete for it. In order to attend this contest, people need to form teams of exactly two people. You are given the strength of each possible combination of two people. All the v... | instruction | 0 | 71,190 | 17 | 142,380 |
Tags: brute force, implementation, sortings
Correct Solution:
```
n = int(input())
m = list()
ans = [-1] * 2 * n
for i in range(1, 2 * n):
m += map(lambda t: (i, int(t[0]), int(t[1])), enumerate(input().split()))
m = sorted(m, key=lambda t: t[2], reverse=True)
for (i, j, _) in m:
if ans[i] == -1 and ans[j] ... | output | 1 | 71,190 | 17 | 142,381 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a programing contest named SnakeUp, 2n people want to compete for it. In order to attend this contest, people need to form teams of exactly two people. You are given the strength of each possible combination of two people. All the v... | instruction | 0 | 71,191 | 17 | 142,382 |
Tags: brute force, implementation, sortings
Correct Solution:
```
def main():
mode="filee"
if mode=="file":f=open("test.txt","r")
if mode=="file":n=int(f.readline())
else:n=int(input())
w=[]
for i in range(2,2*n+1):
if mode=="file":g=[int(x) for x in f.readline().split()]
else:g... | output | 1 | 71,191 | 17 | 142,383 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a programing contest named SnakeUp, 2n people want to compete for it. In order to attend this contest, people need to form teams of exactly two people. You are given the strength of each possible combination of two people. All the v... | instruction | 0 | 71,192 | 17 | 142,384 |
Tags: brute force, implementation, sortings
Correct Solution:
```
n = int(input())
combs = []
for i in range(2*n - 1):
arr = [int(value) for value in input().split()]
for j,value in enumerate(arr):
combs.append(tuple([value] + sorted([i+2,j+1])))
combs.sort(reverse = True)
ans = [0] * (2 * n + 1)
f... | output | 1 | 71,192 | 17 | 142,385 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a programing contest named SnakeUp, 2n people want to compete for it. In order to attend this contest, people need to form teams of exactly two people. You are given the strength of eac... | instruction | 0 | 71,193 | 17 | 142,386 |
Yes | output | 1 | 71,193 | 17 | 142,387 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a programing contest named SnakeUp, 2n people want to compete for it. In order to attend this contest, people need to form teams of exactly two people. You are given the strength of eac... | instruction | 0 | 71,194 | 17 | 142,388 |
Yes | output | 1 | 71,194 | 17 | 142,389 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a programing contest named SnakeUp, 2n people want to compete for it. In order to attend this contest, people need to form teams of exactly two people. You are given the strength of eac... | instruction | 0 | 71,195 | 17 | 142,390 |
Yes | output | 1 | 71,195 | 17 | 142,391 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a programing contest named SnakeUp, 2n people want to compete for it. In order to attend this contest, people need to form teams of exactly two people. You are given the strength of eac... | instruction | 0 | 71,196 | 17 | 142,392 |
Yes | output | 1 | 71,196 | 17 | 142,393 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a programing contest named SnakeUp, 2n people want to compete for it. In order to attend this contest, people need to form teams of exactly two people. You are given the strength of eac... | instruction | 0 | 71,197 | 17 | 142,394 |
No | output | 1 | 71,197 | 17 | 142,395 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a programing contest named SnakeUp, 2n people want to compete for it. In order to attend this contest, people need to form teams of exactly two people. You are given the strength of eac... | instruction | 0 | 71,198 | 17 | 142,396 |
No | output | 1 | 71,198 | 17 | 142,397 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.