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 |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a famous olympiad, which has more than a hundred participants. The Olympiad consists of two stages: the elimination stage, and the final stage. At least a hundred participants will adva... | instruction | 0 | 94,594 | 17 | 189,188 |
Yes | output | 1 | 94,594 | 17 | 189,189 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a famous olympiad, which has more than a hundred participants. The Olympiad consists of two stages: the elimination stage, and the final stage. At least a hundred participants will adva... | instruction | 0 | 94,595 | 17 | 189,190 |
Yes | output | 1 | 94,595 | 17 | 189,191 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a famous olympiad, which has more than a hundred participants. The Olympiad consists of two stages: the elimination stage, and the final stage. At least a hundred participants will adva... | instruction | 0 | 94,596 | 17 | 189,192 |
No | output | 1 | 94,596 | 17 | 189,193 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a famous olympiad, which has more than a hundred participants. The Olympiad consists of two stages: the elimination stage, and the final stage. At least a hundred participants will adva... | instruction | 0 | 94,597 | 17 | 189,194 |
No | output | 1 | 94,597 | 17 | 189,195 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a famous olympiad, which has more than a hundred participants. The Olympiad consists of two stages: the elimination stage, and the final stage. At least a hundred participants will adva... | instruction | 0 | 94,598 | 17 | 189,196 |
No | output | 1 | 94,598 | 17 | 189,197 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a famous olympiad, which has more than a hundred participants. The Olympiad consists of two stages: the elimination stage, and the final stage. At least a hundred participants will adva... | instruction | 0 | 94,599 | 17 | 189,198 |
No | output | 1 | 94,599 | 17 | 189,199 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Famous Brazil city Rio de Janeiro holds a tennis tournament and Ostap Bender doesn't want to miss this event. There will be n players participating, and the tournament will follow knockout rules... | instruction | 0 | 94,890 | 17 | 189,780 |
Yes | output | 1 | 94,890 | 17 | 189,781 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Famous Brazil city Rio de Janeiro holds a tennis tournament and Ostap Bender doesn't want to miss this event. There will be n players participating, and the tournament will follow knockout rules... | instruction | 0 | 94,891 | 17 | 189,782 |
Yes | output | 1 | 94,891 | 17 | 189,783 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Famous Brazil city Rio de Janeiro holds a tennis tournament and Ostap Bender doesn't want to miss this event. There will be n players participating, and the tournament will follow knockout rules... | instruction | 0 | 94,892 | 17 | 189,784 |
Yes | output | 1 | 94,892 | 17 | 189,785 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Famous Brazil city Rio de Janeiro holds a tennis tournament and Ostap Bender doesn't want to miss this event. There will be n players participating, and the tournament will follow knockout rules... | instruction | 0 | 94,893 | 17 | 189,786 |
Yes | output | 1 | 94,893 | 17 | 189,787 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Famous Brazil city Rio de Janeiro holds a tennis tournament and Ostap Bender doesn't want to miss this event. There will be n players participating, and the tournament will follow knockout rules... | instruction | 0 | 94,894 | 17 | 189,788 |
No | output | 1 | 94,894 | 17 | 189,789 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Famous Brazil city Rio de Janeiro holds a tennis tournament and Ostap Bender doesn't want to miss this event. There will be n players participating, and the tournament will follow knockout rules... | instruction | 0 | 94,895 | 17 | 189,790 |
No | output | 1 | 94,895 | 17 | 189,791 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Famous Brazil city Rio de Janeiro holds a tennis tournament and Ostap Bender doesn't want to miss this event. There will be n players participating, and the tournament will follow knockout rules... | instruction | 0 | 94,896 | 17 | 189,792 |
No | output | 1 | 94,896 | 17 | 189,793 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Famous Brazil city Rio de Janeiro holds a tennis tournament and Ostap Bender doesn't want to miss this event. There will be n players participating, and the tournament will follow knockout rules... | instruction | 0 | 94,897 | 17 | 189,794 |
No | output | 1 | 94,897 | 17 | 189,795 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There were n groups of students which came to write a training contest. A group is either one person who can write the contest with anyone else, or two people who want to write the contest in the same team.
The coach decided to form teams o... | instruction | 0 | 94,975 | 17 | 189,950 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
# http://codeforces.com/contest/899/problem/A
n = int(input())
people = [int(x) for x in input().split()]
count_2, count_3 = 0, 0
for x in people:
if x == 2:
count_2 += 1
else:
count_3 += 1
if count_2 < count_3:
print(coun... | output | 1 | 94,975 | 17 | 189,951 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There were n groups of students which came to write a training contest. A group is either one person who can write the contest with anyone else, or two people who want to write the contest in the same team.
The coach decided to form teams o... | instruction | 0 | 94,976 | 17 | 189,952 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
t=(int(input()))
l=list(map(int,input().split()))
one,two=0,0
for i in l:
if i==1:
one=one+1
else:
two=two+1
if one<=two:
print(one)
else:
print(two+(one-two)//3)
``` | output | 1 | 94,976 | 17 | 189,953 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There were n groups of students which came to write a training contest. A group is either one person who can write the contest with anyone else, or two people who want to write the contest in the same team.
The coach decided to form teams o... | instruction | 0 | 94,977 | 17 | 189,954 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
n = int(input())
num = list(map(int, input().split()))
o = num.count(1)
t = num.count(2)
if t >= o:
out = o
t -= o
else:
out = t
o -= t
out += int(o / 3)
print(out)
``` | output | 1 | 94,977 | 17 | 189,955 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There were n groups of students which came to write a training contest. A group is either one person who can write the contest with anyone else, or two people who want to write the contest in the same team.
The coach decided to form teams o... | instruction | 0 | 94,978 | 17 | 189,956 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
n = int(input())
A = list(input().split())
c = [A.count("1"), A.count("2")]
if c[0] > c[1]:
k = c[1]
c = [c[0] - c[1], 0]
k += c[0] // 3
else:
k = c[0]
print(k)
``` | output | 1 | 94,978 | 17 | 189,957 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There were n groups of students which came to write a training contest. A group is either one person who can write the contest with anyone else, or two people who want to write the contest in the same team.
The coach decided to form teams o... | instruction | 0 | 94,979 | 17 | 189,958 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
# -*- coding: utf-8 -*-
"""
Created on Fri Apr 3 01:33:24 2020
@author: Designer
"""
even=0
odd=0
a=int(input(''))
b=str(input('').strip())
for i in range(0,len(b),2):
if b[i] == '2':
even=even+1
else:
odd=odd+1
if odd == 0:... | output | 1 | 94,979 | 17 | 189,959 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There were n groups of students which came to write a training contest. A group is either one person who can write the contest with anyone else, or two people who want to write the contest in the same team.
The coach decided to form teams o... | instruction | 0 | 94,980 | 17 | 189,960 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
cnt = min(a.count(1), a.count(2))
ans = cnt + max(0, (a.count(1) - cnt) // 3)
print(ans)
``` | output | 1 | 94,980 | 17 | 189,961 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There were n groups of students which came to write a training contest. A group is either one person who can write the contest with anyone else, or two people who want to write the contest in the same team.
The coach decided to form teams o... | instruction | 0 | 94,981 | 17 | 189,962 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
input()
data = list(map(int, input().split()))
n1 = data.count(1)
n2 = len(data) - n1
print(min(n1, n2) + (n1 - min(n1, n2)) // 3)
``` | output | 1 | 94,981 | 17 | 189,963 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There were n groups of students which came to write a training contest. A group is either one person who can write the contest with anyone else, or two people who want to write the contest in the same team.
The coach decided to form teams o... | instruction | 0 | 94,982 | 17 | 189,964 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
n = int(input())
l = [int(i) for i in input().split(" ")]
one = l.count(1)
two = n - one
result = 0
if two >= one:
result = one
else:
result += two
one = one - two
result += int(one/3)
print(result)
``` | output | 1 | 94,982 | 17 | 189,965 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There were n groups of students which came to write a training contest. A group is either one person who can write the contest with anyone else, or two people who want to write the contest in th... | instruction | 0 | 94,983 | 17 | 189,966 |
Yes | output | 1 | 94,983 | 17 | 189,967 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There were n groups of students which came to write a training contest. A group is either one person who can write the contest with anyone else, or two people who want to write the contest in th... | instruction | 0 | 94,984 | 17 | 189,968 |
Yes | output | 1 | 94,984 | 17 | 189,969 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There were n groups of students which came to write a training contest. A group is either one person who can write the contest with anyone else, or two people who want to write the contest in th... | instruction | 0 | 94,985 | 17 | 189,970 |
Yes | output | 1 | 94,985 | 17 | 189,971 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There were n groups of students which came to write a training contest. A group is either one person who can write the contest with anyone else, or two people who want to write the contest in th... | instruction | 0 | 94,986 | 17 | 189,972 |
Yes | output | 1 | 94,986 | 17 | 189,973 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There were n groups of students which came to write a training contest. A group is either one person who can write the contest with anyone else, or two people who want to write the contest in th... | instruction | 0 | 94,987 | 17 | 189,974 |
No | output | 1 | 94,987 | 17 | 189,975 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There were n groups of students which came to write a training contest. A group is either one person who can write the contest with anyone else, or two people who want to write the contest in th... | instruction | 0 | 94,988 | 17 | 189,976 |
No | output | 1 | 94,988 | 17 | 189,977 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There were n groups of students which came to write a training contest. A group is either one person who can write the contest with anyone else, or two people who want to write the contest in th... | instruction | 0 | 94,989 | 17 | 189,978 |
No | output | 1 | 94,989 | 17 | 189,979 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There were n groups of students which came to write a training contest. A group is either one person who can write the contest with anyone else, or two people who want to write the contest in th... | instruction | 0 | 94,990 | 17 | 189,980 |
No | output | 1 | 94,990 | 17 | 189,981 |
Provide tags and a correct Python 3 solution for this coding contest problem.
As a German University in Cairo (GUC) student and a basketball player, Herr Wafa was delighted once he heard the news. GUC is finally participating in the Annual Basketball Competition (ABC).
A team is to be formed of n players, all of whi... | instruction | 0 | 95,306 | 17 | 190,612 |
Tags: combinatorics, dp, math, probabilities
Correct Solution:
```
n,m,h=map(int,input().split())
s=list(map(int,input().split()))
a=1
S=sum(s)
for i in range(S-s[h-1]+1,S):
a*=(i-n+1)/i
print(-1 if S<n else 1-a)
# Made By Mostafa_Khaled
``` | output | 1 | 95,306 | 17 | 190,613 |
Provide tags and a correct Python 3 solution for this coding contest problem.
As a German University in Cairo (GUC) student and a basketball player, Herr Wafa was delighted once he heard the news. GUC is finally participating in the Annual Basketball Competition (ABC).
A team is to be formed of n players, all of whi... | instruction | 0 | 95,307 | 17 | 190,614 |
Tags: combinatorics, dp, math, probabilities
Correct Solution:
```
"""
atleast 1 =1- zero of them (only wafa)
"""
n,m,h=map(int,input().split())
M=[int(x) for x in input().split()]
M=[0]+M
tot=sum(M)
if tot<n:
print(-1)
else:
tot-=1
M[h]-=1
ans=1.0
others=tot-M[h]
for i in range(0,n-1):
... | output | 1 | 95,307 | 17 | 190,615 |
Provide tags and a correct Python 3 solution for this coding contest problem.
As a German University in Cairo (GUC) student and a basketball player, Herr Wafa was delighted once he heard the news. GUC is finally participating in the Annual Basketball Competition (ABC).
A team is to be formed of n players, all of whi... | instruction | 0 | 95,308 | 17 | 190,616 |
Tags: combinatorics, dp, math, probabilities
Correct Solution:
```
n,m,h = map(int,input().split())
lis = list(map(int,input().split()))
if sum(lis)<n:
print(-1)
else:
s=sum(lis)
ans=1
for i in range(n-1):
ans*=(s-lis[h-1]-i)
ans/=(s-i-1)
print(1-ans)
``` | output | 1 | 95,308 | 17 | 190,617 |
Provide tags and a correct Python 3 solution for this coding contest problem.
As a German University in Cairo (GUC) student and a basketball player, Herr Wafa was delighted once he heard the news. GUC is finally participating in the Annual Basketball Competition (ABC).
A team is to be formed of n players, all of whi... | instruction | 0 | 95,309 | 17 | 190,618 |
Tags: combinatorics, dp, math, probabilities
Correct Solution:
```
import sys
import math
n,m,h = [int(x) for x in input().split()]
arr = [int(x) for x in input().split()]
total = sum(arr)
if (total < n):
print ("-1")
sys.exit()
total1 = total - arr[h-1]
rem = total - total1-1
total = total - 1
ans = 1
'''
#s... | output | 1 | 95,309 | 17 | 190,619 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As a German University in Cairo (GUC) student and a basketball player, Herr Wafa was delighted once he heard the news. GUC is finally participating in the Annual Basketball Competition (ABC).
... | instruction | 0 | 95,310 | 17 | 190,620 |
No | output | 1 | 95,310 | 17 | 190,621 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As a German University in Cairo (GUC) student and a basketball player, Herr Wafa was delighted once he heard the news. GUC is finally participating in the Annual Basketball Competition (ABC).
... | instruction | 0 | 95,311 | 17 | 190,622 |
No | output | 1 | 95,311 | 17 | 190,623 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As a German University in Cairo (GUC) student and a basketball player, Herr Wafa was delighted once he heard the news. GUC is finally participating in the Annual Basketball Competition (ABC).
... | instruction | 0 | 95,312 | 17 | 190,624 |
No | output | 1 | 95,312 | 17 | 190,625 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n students standing in a row. Two coaches are forming two teams — the first coach chooses the first team and the second coach chooses the second team.
The i-th student has integer programming skill a_i. All programming skills are ... | instruction | 0 | 96,157 | 17 | 192,314 |
Tags: data structures, implementation, sortings
Correct Solution:
```
inf = 10 ** 6
n, k = map(int, input().split())
a = [-inf] + list(map(int, input().split()))
ans = [-1]*(n+10)
leftnext = [-1]*(n+10)
rightnext = [-1]*(n+10)
for i in range(1, n + 1):
rightnext[i] = i + 1
leftnext[i] = i - 1
visited = [Fal... | output | 1 | 96,157 | 17 | 192,315 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n students standing in a row. Two coaches are forming two teams — the first coach chooses the first team and the second coach chooses the second team.
The i-th student has integer programming skill a_i. All programming skills are ... | instruction | 0 | 96,158 | 17 | 192,316 |
Tags: data structures, implementation, sortings
Correct Solution:
```
n, k = map(int, input().split())
lst = map(int, input().split())
def debug():
print('-')
lst = [0 for _ in range(n)]
for i in range(n):
node = table[i]
lst[node.index] = node.team
print (''.join(str(x) for x in lst))
print('-')
class No... | output | 1 | 96,158 | 17 | 192,317 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n students standing in a row. Two coaches are forming two teams — the first coach chooses the first team and the second coach chooses the second team.
The i-th student has integer programming skill a_i. All programming skills are ... | instruction | 0 | 96,159 | 17 | 192,318 |
Tags: data structures, implementation, sortings
Correct Solution:
```
# AC
import sys
class Main:
def __init__(self):
self.buff = None
self.index = 0
def next(self):
if self.buff is None or self.index == len(self.buff):
self.buff = sys.stdin.readline().split()
... | output | 1 | 96,159 | 17 | 192,319 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n students standing in a row. Two coaches are forming two teams — the first coach chooses the first team and the second coach chooses the second team.
The i-th student has integer programming skill a_i. All programming skills are ... | instruction | 0 | 96,160 | 17 | 192,320 |
Tags: data structures, implementation, sortings
Correct Solution:
```
n,k=[int(x) for x in input().split()]
a=[int(x) for x in input().split()]
team=[0]*n
nxt=[x+1 for x in range(len(a))]
nxt[-1]=n+2*k
prv=[x-1 for x in range(len(a))]
prv[0]=-2*k
loc=[0]*(len(a)+1)
for i,v in enumerate(a):
loc[v]=i
left=n
val=1
whil... | output | 1 | 96,160 | 17 | 192,321 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n students standing in a row. Two coaches are forming two teams — the first coach chooses the first team and the second coach chooses the second team.
The i-th student has integer programming skill a_i. All programming skills are ... | instruction | 0 | 96,161 | 17 | 192,322 |
Tags: data structures, implementation, sortings
Correct Solution:
```
def solve(n, k, a):
pre, nex, d = {}, {}, {}
for i in range(n):
pre[i] = i - 1
nex[i] = i + 1
d[a[i]] = i
a.sort(reverse=True)
res = [0] * n
turn = 1
for x in a:
index = d[x]
if res[ind... | output | 1 | 96,161 | 17 | 192,323 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n students standing in a row. Two coaches are forming two teams — the first coach chooses the first team and the second coach chooses the second team.
The i-th student has integer programming skill a_i. All programming skills are ... | instruction | 0 | 96,162 | 17 | 192,324 |
Tags: data structures, implementation, sortings
Correct Solution:
```
class Node:
def __init__(self, v, i):
self.v = v
self.i = i
self.left = None
self.right = None
n, k = map(int, input().split())
nums = list(map(int, input().split()))
nodes = [Node(v, i) for i, v in enumerate(nums... | output | 1 | 96,162 | 17 | 192,325 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n students standing in a row. Two coaches are forming two teams — the first coach chooses the first team and the second coach chooses the second team.
The i-th student has integer programming skill a_i. All programming skills are ... | instruction | 0 | 96,163 | 17 | 192,326 |
Tags: data structures, implementation, sortings
Correct Solution:
```
import sys
input = sys.stdin.readline
n,k=map(int,input().split())
A=list(map(int,input().split()))
A_INV=[-1]*n
for i in range(n):
A_INV[A[i]-1]=i
L=list(range(-1,n-1))
R=list(range(1,n+1))
USELIST=[0]*n
ANS=[0]*n
NOW=1
for a in A_INV[:... | output | 1 | 96,163 | 17 | 192,327 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n students standing in a row. Two coaches are forming two teams — the first coach chooses the first team and the second coach chooses the second team.
The i-th student has integer programming skill a_i. All programming skills are ... | instruction | 0 | 96,164 | 17 | 192,328 |
Tags: data structures, implementation, sortings
Correct Solution:
```
import sys
input = sys.stdin.readline
n, k = map(int, input().split())
left = [i-1 for i in range(n)]
right = [i+1 for i in range(n)]
ans = [0] * n
def next(i):
upd = [i]
i = right[i]
while i < n and ans[i] != 0:
upd.append(i)
... | output | 1 | 96,164 | 17 | 192,329 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n students standing in a row. Two coaches are forming two teams — the first coach chooses the first team and the second coach chooses the second team.
The i-th student has integer pro... | instruction | 0 | 96,165 | 17 | 192,330 |
Yes | output | 1 | 96,165 | 17 | 192,331 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n students standing in a row. Two coaches are forming two teams — the first coach chooses the first team and the second coach chooses the second team.
The i-th student has integer pro... | instruction | 0 | 96,166 | 17 | 192,332 |
Yes | output | 1 | 96,166 | 17 | 192,333 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n students standing in a row. Two coaches are forming two teams — the first coach chooses the first team and the second coach chooses the second team.
The i-th student has integer pro... | instruction | 0 | 96,167 | 17 | 192,334 |
Yes | output | 1 | 96,167 | 17 | 192,335 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n students standing in a row. Two coaches are forming two teams — the first coach chooses the first team and the second coach chooses the second team.
The i-th student has integer pro... | instruction | 0 | 96,168 | 17 | 192,336 |
Yes | output | 1 | 96,168 | 17 | 192,337 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n students standing in a row. Two coaches are forming two teams — the first coach chooses the first team and the second coach chooses the second team.
The i-th student has integer pro... | instruction | 0 | 96,169 | 17 | 192,338 |
No | output | 1 | 96,169 | 17 | 192,339 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.