message stringlengths 2 49.9k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 446 108k | cluster float64 13 13 | __index_level_0__ int64 892 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) ... | instruction | 0 | 44,940 | 13 | 89,880 |
Yes | output | 1 | 44,940 | 13 | 89,881 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) ... | instruction | 0 | 44,941 | 13 | 89,882 |
Yes | output | 1 | 44,941 | 13 | 89,883 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
DZY loves Physics, and he enjoys calculating density.
Almost everything has density, even a graph. We define the density of a non-directed graph (nodes and edges of the graph have some values) ... | instruction | 0 | 44,942 | 13 | 89,884 |
Yes | output | 1 | 44,942 | 13 | 89,885 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ilya is very fond of graphs, especially trees. During his last trip to the forest Ilya found a very interesting tree rooted at vertex 1. There is an integer number written on each vertex of the ... | instruction | 0 | 45,095 | 13 | 90,190 |
No | output | 1 | 45,095 | 13 | 90,191 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ilya is very fond of graphs, especially trees. During his last trip to the forest Ilya found a very interesting tree rooted at vertex 1. There is an integer number written on each vertex of the ... | instruction | 0 | 45,096 | 13 | 90,192 |
No | output | 1 | 45,096 | 13 | 90,193 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ilya is very fond of graphs, especially trees. During his last trip to the forest Ilya found a very interesting tree rooted at vertex 1. There is an integer number written on each vertex of the ... | instruction | 0 | 45,097 | 13 | 90,194 |
No | output | 1 | 45,097 | 13 | 90,195 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ilya is very fond of graphs, especially trees. During his last trip to the forest Ilya found a very interesting tree rooted at vertex 1. There is an integer number written on each vertex of the ... | instruction | 0 | 45,098 | 13 | 90,196 |
No | output | 1 | 45,098 | 13 | 90,197 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a complete undirected graph with n vertices. A number ai is assigned to each vertex, and the weight of an edge between vertices i and j is equal to ai xor aj.
Calculate the weight... | instruction | 0 | 45,115 | 13 | 90,230 |
No | output | 1 | 45,115 | 13 | 90,231 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a complete undirected graph with n vertices. A number ai is assigned to each vertex, and the weight of an edge between vertices i and j is equal to ai xor aj.
Calculate the weight... | instruction | 0 | 45,116 | 13 | 90,232 |
No | output | 1 | 45,116 | 13 | 90,233 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a complete undirected graph with n vertices. A number ai is assigned to each vertex, and the weight of an edge between vertices i and j is equal to ai xor aj.
Calculate the weight... | instruction | 0 | 45,117 | 13 | 90,234 |
No | output | 1 | 45,117 | 13 | 90,235 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a complete undirected graph with n vertices. A number ai is assigned to each vertex, and the weight of an edge between vertices i and j is equal to ai xor aj.
Calculate the weight... | instruction | 0 | 45,118 | 13 | 90,236 |
No | output | 1 | 45,118 | 13 | 90,237 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a tree G with N vertices. The vertices are numbered 1 through N, and the i-th edge connects Vertex a_i and Vertex b_i.
Consider painting the edges in G with some number of colors. We want to paint them so that, for each vertex, the colors o... | instruction | 0 | 45,191 | 13 | 90,382 |
"Correct Solution:
```
def p_d():
n = int(input())
t = [[] for _ in range(n)]
p = [-1] * n
for i in range(n - 1):
a, b = map(int, input().split())
t[a - 1].append((i, b - 1))
p[b - 1] = a - 1
q = [(0, -1)]
ans = [-1] * (n - 1)
while q:
x, c0 = q.pop()
... | output | 1 | 45,191 | 13 | 90,383 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a tree G with N vertices. The vertices are numbered 1 through N, and the i-th edge connects Vertex a_i and Vertex b_i.
Consider painting the edges in G with some number of colors. We want to paint them so that, for each vertex, the colors o... | instruction | 0 | 45,192 | 13 | 90,384 |
"Correct Solution:
```
from collections import deque
def main():
N, *AB = map(int, open(0).read().split())
A, B = AB[::2], AB[1::2]
E = [[] for _ in range(N + 1)]
for a, b in zip(A, B):
E[a].append(b)
Q = deque([1])
C = [0] * (N + 1)
while Q:
v = Q.popleft()
c = 0
... | output | 1 | 45,192 | 13 | 90,385 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a tree G with N vertices. The vertices are numbered 1 through N, and the i-th edge connects Vertex a_i and Vertex b_i.
Consider painting the edges in G with some number of colors. We want to paint them so that, for each vertex, the colors o... | instruction | 0 | 45,193 | 13 | 90,386 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
n = int(input())
ab = [list(map(int,input().split())) for i in range(n-1)]
ans = [0] * (n-1)
abi = [[] for _ in range(n+1)]
#再起のlimitを上げる
import sys
sys.setrecursionlimit(4100000)
for i,(a,b) in enumerate(ab):
abi[a].append((i,b))
abi[b].append((i,a))
def dfs(v,pa... | output | 1 | 45,193 | 13 | 90,387 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a tree G with N vertices. The vertices are numbered 1 through N, and the i-th edge connects Vertex a_i and Vertex b_i.
Consider painting the edges in G with some number of colors. We want to paint them so that, for each vertex, the colors o... | instruction | 0 | 45,194 | 13 | 90,388 |
"Correct Solution:
```
n = int(input())
g = [[] for i in range(n)]
for i in range(n-1):
a,b = map(int,input().split())
g[a-1].append([b-1,i])
g[b-1].append([a-1,i])
from collections import deque
d = deque([(0,-1)])
ans = [0 for i in range(n-1)]
while d:
a,noc = d.popleft()
c = 1 if noc != 1 else 2
... | output | 1 | 45,194 | 13 | 90,389 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a tree G with N vertices. The vertices are numbered 1 through N, and the i-th edge connects Vertex a_i and Vertex b_i.
Consider painting the edges in G with some number of colors. We want to paint them so that, for each vertex, the colors o... | instruction | 0 | 45,195 | 13 | 90,390 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
n = int(input())
l=[[]]
nn = []
for _ in range(n+1):
l.append([])
for i in range(n-1):
a,b = map(int,input().split())
l[a].append(b)
l[b].append(a)
nn.append(b)
ml = list(map(len,l))
m = max(ml)
co = []
for i in range(n+1):
co.appe... | output | 1 | 45,195 | 13 | 90,391 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a tree G with N vertices. The vertices are numbered 1 through N, and the i-th edge connects Vertex a_i and Vertex b_i.
Consider painting the edges in G with some number of colors. We want to paint them so that, for each vertex, the colors o... | instruction | 0 | 45,196 | 13 | 90,392 |
"Correct Solution:
```
import sys
sys.setrecursionlimit(500000)
N = int(input())
E = [[] for _ in range(N+1)]
for i in range(N-1):
a,b = map(int,input().split())
E[a].append((b,i))
E[b].append((a,i))
#最大の次数を見つける
K = max(len(e) for e in E)
print(K)
ans = [-1] * (N-1)
def dfs(v=1,p=0,p_col=-1):
col = 1
... | output | 1 | 45,196 | 13 | 90,393 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a tree G with N vertices. The vertices are numbered 1 through N, and the i-th edge connects Vertex a_i and Vertex b_i.
Consider painting the edges in G with some number of colors. We want to paint them so that, for each vertex, the colors o... | instruction | 0 | 45,197 | 13 | 90,394 |
"Correct Solution:
```
import sys
sys.setrecursionlimit(10**8)
n=int(input())
AB=[list(map(int,input().split())) for _ in range(n-1)]
path=[[] for _ in range(n)]
for i,(a,b) in enumerate(AB):
a,b=a-1,b-1
path[a].append((b,i))
path[b].append((a,i))
visited=[0]*n
ans=[None]*(n-1)
def dfs(v,c=-1):
nc=1
fo... | output | 1 | 45,197 | 13 | 90,395 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a tree G with N vertices. The vertices are numbered 1 through N, and the i-th edge connects Vertex a_i and Vertex b_i.
Consider painting the edges in G with some number of colors. We want to paint them so that, for each vertex, the colors o... | instruction | 0 | 45,198 | 13 | 90,396 |
"Correct Solution:
```
# 2019/11/24
import sys
sys.setrecursionlimit(10**9)
n=int(input())
ab=[]
edge=[[] for _ in range(n)]
for i in range(n-1):
a,b=map(int,input().split())
a,b=a-1,b-1
ab.append((a,b))
edge[a].append(b)
ans={}
def solve(p,c):
global ans
cnt=1
for vtx in edge[p]:
... | output | 1 | 45,198 | 13 | 90,397 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a tree G with N vertices. The vertices are numbered 1 through N, and the i-th edge connects Vertex a_i and Vertex b_i.
Consider painting the edges in G with some number of colors. We w... | instruction | 0 | 45,199 | 13 | 90,398 |
Yes | output | 1 | 45,199 | 13 | 90,399 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a tree G with N vertices. The vertices are numbered 1 through N, and the i-th edge connects Vertex a_i and Vertex b_i.
Consider painting the edges in G with some number of colors. We w... | instruction | 0 | 45,200 | 13 | 90,400 |
Yes | output | 1 | 45,200 | 13 | 90,401 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a tree G with N vertices. The vertices are numbered 1 through N, and the i-th edge connects Vertex a_i and Vertex b_i.
Consider painting the edges in G with some number of colors. We w... | instruction | 0 | 45,201 | 13 | 90,402 |
Yes | output | 1 | 45,201 | 13 | 90,403 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a tree G with N vertices. The vertices are numbered 1 through N, and the i-th edge connects Vertex a_i and Vertex b_i.
Consider painting the edges in G with some number of colors. We w... | instruction | 0 | 45,202 | 13 | 90,404 |
Yes | output | 1 | 45,202 | 13 | 90,405 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a tree G with N vertices. The vertices are numbered 1 through N, and the i-th edge connects Vertex a_i and Vertex b_i.
Consider painting the edges in G with some number of colors. We w... | instruction | 0 | 45,203 | 13 | 90,406 |
No | output | 1 | 45,203 | 13 | 90,407 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a tree G with N vertices. The vertices are numbered 1 through N, and the i-th edge connects Vertex a_i and Vertex b_i.
Consider painting the edges in G with some number of colors. We w... | instruction | 0 | 45,204 | 13 | 90,408 |
No | output | 1 | 45,204 | 13 | 90,409 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a tree G with N vertices. The vertices are numbered 1 through N, and the i-th edge connects Vertex a_i and Vertex b_i.
Consider painting the edges in G with some number of colors. We w... | instruction | 0 | 45,205 | 13 | 90,410 |
No | output | 1 | 45,205 | 13 | 90,411 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a tree G with N vertices. The vertices are numbered 1 through N, and the i-th edge connects Vertex a_i and Vertex b_i.
Consider painting the edges in G with some number of colors. We w... | instruction | 0 | 45,206 | 13 | 90,412 |
No | output | 1 | 45,206 | 13 | 90,413 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dima the hamster enjoys nibbling different things: cages, sticks, bad problemsetters and even trees!
Recently he found a binary search tree and instinctively nibbled all of its edges, hence messing up the vertices. Dima knows that if Andrew... | instruction | 0 | 45,394 | 13 | 90,788 |
Tags: brute force, dp, math, number theory, trees
Correct Solution:
```
from math import gcd
import random,time,sys
input=sys.stdin.buffer.readline
def main():
n=int(input())
a=list(map(int,input().split()))
#a=[2*random.randint(1,10**9) for i in range(n)]
start=time.time()
a+=[0]
GCD=[0 for ... | output | 1 | 45,394 | 13 | 90,789 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dima the hamster enjoys nibbling different things: cages, sticks, bad problemsetters and even trees!
Recently he found a binary search tree and instinctively nibbled all of its edges, hence messing up the vertices. Dima knows that if Andrew... | instruction | 0 | 45,395 | 13 | 90,790 |
Tags: brute force, dp, math, number theory, trees
Correct Solution:
```
from sys import stdin
from math import gcd
n=int(stdin.readline())
a=[int(x) for x in stdin.readline().split()]
c = []
ld=[]
rd=[]
def check(l, r, e):
if r == l: return c[l][e] > 0
if e < l and ld[l][r-l] != 0:
return ld[l][r-l] =... | output | 1 | 45,395 | 13 | 90,791 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dima the hamster enjoys nibbling different things: cages, sticks, bad problemsetters and even trees!
Recently he found a binary search tree and instinctively nibbled all of its edges, hence messing up the vertices. Dima knows that if Andrew... | instruction | 0 | 45,396 | 13 | 90,792 |
Tags: brute force, dp, math, number theory, trees
Correct Solution:
```
from math import gcd
import random,time,sys
input=sys.stdin.buffer.readline
def main():
n=int(input())
a=list(map(int,input().split()))
#a=[2*random.randint(1,10**9) for i in range(n)]
start=time.time()
a+=[0]
dp=[[False ... | output | 1 | 45,396 | 13 | 90,793 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Dima the hamster enjoys nibbling different things: cages, sticks, bad problemsetters and even trees!
Recently he found a binary search tree and instinctively nibbled all of its edges, hence messing up the vertices. Dima knows that if Andrew... | instruction | 0 | 45,397 | 13 | 90,794 |
Tags: brute force, dp, math, number theory, trees
Correct Solution:
```
from math import gcd
import random,time,sys
input=sys.stdin.buffer.readline
def main():
n=int(input())
a=list(map(int,input().split()))
#a=[2*random.randint(1,10**9) for i in range(n)]
start=time.time()
GCD=[1<<i for i in ran... | output | 1 | 45,397 | 13 | 90,795 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dima the hamster enjoys nibbling different things: cages, sticks, bad problemsetters and even trees!
Recently he found a binary search tree and instinctively nibbled all of its edges, hence mes... | instruction | 0 | 45,398 | 13 | 90,796 |
No | output | 1 | 45,398 | 13 | 90,797 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dima the hamster enjoys nibbling different things: cages, sticks, bad problemsetters and even trees!
Recently he found a binary search tree and instinctively nibbled all of its edges, hence mes... | instruction | 0 | 45,399 | 13 | 90,798 |
No | output | 1 | 45,399 | 13 | 90,799 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dima the hamster enjoys nibbling different things: cages, sticks, bad problemsetters and even trees!
Recently he found a binary search tree and instinctively nibbled all of its edges, hence mes... | instruction | 0 | 45,400 | 13 | 90,800 |
No | output | 1 | 45,400 | 13 | 90,801 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dima the hamster enjoys nibbling different things: cages, sticks, bad problemsetters and even trees!
Recently he found a binary search tree and instinctively nibbled all of its edges, hence mes... | instruction | 0 | 45,401 | 13 | 90,802 |
No | output | 1 | 45,401 | 13 | 90,803 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a graph with 3 ⋅ n vertices and m edges. You are to find a matching of n edges, or an independent set of n vertices.
A set of edges is called a matching if no two edges share an endpoint.
A set of vertices is called an indepe... | instruction | 0 | 45,464 | 13 | 90,928 |
Tags: constructive algorithms, graphs, greedy, sortings
Correct Solution:
```
def naiveSolve(n):
return
def main():
# Try to make the matching by taking as many random edges as possible.
# Any vertex that is excluded will either be connected to nothing or to
# a vertex in the mat... | output | 1 | 45,464 | 13 | 90,929 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a graph with 3 ⋅ n vertices and m edges. You are to find a matching of n edges, or an independent set of n vertices.
A set of edges is called a matching if no two edges share an endpoint.
A set of vertices is called an indepe... | instruction | 0 | 45,465 | 13 | 90,930 |
Tags: constructive algorithms, graphs, greedy, sortings
Correct Solution:
```
import sys
import io, os
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
t = int(input())
for _ in range(t):
n, m = map(int, input().split())
edge = []
for i in range(m):
u, v = map(int, input().split())
... | output | 1 | 45,465 | 13 | 90,931 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a graph with 3 ⋅ n vertices and m edges. You are to find a matching of n edges, or an independent set of n vertices.
A set of edges is called a matching if no two edges share an endpoint.
A set of vertices is called an indepe... | instruction | 0 | 45,466 | 13 | 90,932 |
Tags: constructive algorithms, graphs, greedy, sortings
Correct Solution:
```
from sys import stdin
input = stdin.readline
T = int(input())
for _ in range(T):
n, m = [int(i) for i in input().split()]
ind_edg_v = [True]*(3*n+1)
ind_edg_e = [0]*n
num_edg = 0
for j in range(m):
ed... | output | 1 | 45,466 | 13 | 90,933 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a graph with 3 ⋅ n vertices and m edges. You are to find a matching of n edges, or an independent set of n vertices.
A set of edges is called a matching if no two edges share an endpoint.
A set of vertices is called an indepe... | instruction | 0 | 45,467 | 13 | 90,934 |
Tags: constructive algorithms, graphs, greedy, sortings
Correct Solution:
```
from sys import stdin
input = stdin.readline
def solve_graph():
n,m = map(int, input().split())
included = [False] + ([True]*(3*n))
matching =[]
for i in range(1,m+1):
e1, e2 = map(int, input().split())
if in... | output | 1 | 45,467 | 13 | 90,935 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a graph with 3 ⋅ n vertices and m edges. You are to find a matching of n edges, or an independent set of n vertices.
A set of edges is called a matching if no two edges share an endpoint.
A set of vertices is called an indepe... | instruction | 0 | 45,468 | 13 | 90,936 |
Tags: constructive algorithms, graphs, greedy, sortings
Correct Solution:
```
from sys import stdin
input = stdin.readline
myint = int
def solve_graph():
n,m = map(myint, input().split())
included = [False] + ([True]*(3*n))
matching =[]
for i in range(1,m+1):
e1, e2 = map(myint, input().split... | output | 1 | 45,468 | 13 | 90,937 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a graph with 3 ⋅ n vertices and m edges. You are to find a matching of n edges, or an independent set of n vertices.
A set of edges is called a matching if no two edges share an endpoint.
A set of vertices is called an indepe... | instruction | 0 | 45,469 | 13 | 90,938 |
Tags: constructive algorithms, graphs, greedy, sortings
Correct Solution:
```
import sys
input = sys.stdin.readline
T = int(input())
for _ in range(T):
n, m = map(int, input().split())
v = set(range(1, 3 * n + 1))
e = []
for i in range(1, m + 1):
a, b = map(int, input().split())
if a in ... | output | 1 | 45,469 | 13 | 90,939 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a graph with 3 ⋅ n vertices and m edges. You are to find a matching of n edges, or an independent set of n vertices.
A set of edges is called a matching if no two edges share an endpoint.
A set of vertices is called an indepe... | instruction | 0 | 45,470 | 13 | 90,940 |
Tags: constructive algorithms, graphs, greedy, sortings
Correct Solution:
```
import sys
input = sys.stdin.readline
T=int(input())
for testcases in range(T):
n,m=map(int,input().split())
EDGE=[[0,0]]+[list(map(int,input().split())) for i in range(m)]
USED=[0]*(3*n+1)
count=0
ANS=[]
for i in ... | output | 1 | 45,470 | 13 | 90,941 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a graph with 3 ⋅ n vertices and m edges. You are to find a matching of n edges, or an independent set of n vertices.
A set of edges is called a matching if no two edges share an endpoint.
A set of vertices is called an indepe... | instruction | 0 | 45,471 | 13 | 90,942 |
Tags: constructive algorithms, graphs, greedy, sortings
Correct Solution:
```
'''
cho n và m:
có 3*n đỉnh và m mối quan hệ giữa các đỉnh
kết hợp:
tập hợp các cạnh không có chung điểm cuối
độc lập:
tập hợp các điểm mà không có bất kì điểm nào nằm trong chung trong một cạnh
output:
in ra nếu có tập có độ lớn n thỏa kết ... | output | 1 | 45,471 | 13 | 90,943 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a graph with 3 ⋅ n vertices and m edges. You are to find a matching of n edges, or an independent set of n vertices.
A set of edges is called a matching if no two edges share an e... | instruction | 0 | 45,472 | 13 | 90,944 |
Yes | output | 1 | 45,472 | 13 | 90,945 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a graph with 3 ⋅ n vertices and m edges. You are to find a matching of n edges, or an independent set of n vertices.
A set of edges is called a matching if no two edges share an e... | instruction | 0 | 45,473 | 13 | 90,946 |
Yes | output | 1 | 45,473 | 13 | 90,947 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a graph with 3 ⋅ n vertices and m edges. You are to find a matching of n edges, or an independent set of n vertices.
A set of edges is called a matching if no two edges share an e... | instruction | 0 | 45,474 | 13 | 90,948 |
Yes | output | 1 | 45,474 | 13 | 90,949 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a graph with 3 ⋅ n vertices and m edges. You are to find a matching of n edges, or an independent set of n vertices.
A set of edges is called a matching if no two edges share an e... | instruction | 0 | 45,475 | 13 | 90,950 |
Yes | output | 1 | 45,475 | 13 | 90,951 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a graph with 3 ⋅ n vertices and m edges. You are to find a matching of n edges, or an independent set of n vertices.
A set of edges is called a matching if no two edges share an e... | instruction | 0 | 45,476 | 13 | 90,952 |
No | output | 1 | 45,476 | 13 | 90,953 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a graph with 3 ⋅ n vertices and m edges. You are to find a matching of n edges, or an independent set of n vertices.
A set of edges is called a matching if no two edges share an e... | instruction | 0 | 45,477 | 13 | 90,954 |
No | output | 1 | 45,477 | 13 | 90,955 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a graph with 3 ⋅ n vertices and m edges. You are to find a matching of n edges, or an independent set of n vertices.
A set of edges is called a matching if no two edges share an e... | instruction | 0 | 45,478 | 13 | 90,956 |
No | output | 1 | 45,478 | 13 | 90,957 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.