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.
Mahmoud was trying to solve the vertex cover problem on trees. The problem statement is:
Given an undirected tree consisting of n nodes, find the minimum number of vertices that cover all the e... | instruction | 0 | 103,421 | 13 | 206,842 |
No | output | 1 | 103,421 | 13 | 206,843 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mahmoud was trying to solve the vertex cover problem on trees. The problem statement is:
Given an undirected tree consisting of n nodes, find the minimum number of vertices that cover all the e... | instruction | 0 | 103,422 | 13 | 206,844 |
No | output | 1 | 103,422 | 13 | 206,845 |
Provide a correct Python 3 solution for this coding contest problem.
Given a tree T with non-negative weight, find the height of each node of the tree. For each node, the height is the distance to the most distant leaf from the node.
Constraints
* 1 ≤ n ≤ 10,000
* 0 ≤ wi ≤ 1,000
Input
n
s1 t1 w1
s2 t2 w2
:
sn-1 t... | instruction | 0 | 103,649 | 13 | 207,298 |
"Correct Solution:
```
import sys
from heapq import heappop, heappush
from typing import List
def func(start: int) -> List[int]:
global edges
cost = [sys.maxsize] * n
que = [(0, start)]
cost[start] = 0
while que:
acc, num = heappop(que)
for weight, to in edges[num]:
if... | output | 1 | 103,649 | 13 | 207,299 |
Provide a correct Python 3 solution for this coding contest problem.
Given a tree T with non-negative weight, find the height of each node of the tree. For each node, the height is the distance to the most distant leaf from the node.
Constraints
* 1 ≤ n ≤ 10,000
* 0 ≤ wi ≤ 1,000
Input
n
s1 t1 w1
s2 t2 w2
:
sn-1 t... | instruction | 0 | 103,650 | 13 | 207,300 |
"Correct Solution:
```
from sys import stdin
from collections import defaultdict
readline = stdin.readline
#readline = open('GRL_5_B-in10.txt').readline
def main():
n = int(readline())
g = defaultdict(list)
for _ in range(n - 1):
s, t, d = map(int, readline().split())
g[s].append([d, t])
... | output | 1 | 103,650 | 13 | 207,301 |
Provide a correct Python 3 solution for this coding contest problem.
Given a tree T with non-negative weight, find the height of each node of the tree. For each node, the height is the distance to the most distant leaf from the node.
Constraints
* 1 ≤ n ≤ 10,000
* 0 ≤ wi ≤ 1,000
Input
n
s1 t1 w1
s2 t2 w2
:
sn-1 t... | instruction | 0 | 103,651 | 13 | 207,302 |
"Correct Solution:
```
from heapq import heappop, heappush
INF = 10 ** 20
def main():
n = int(input())
edges = [[] for _ in range(n)]
for _ in range(n - 1):
s, t, w = map(int, input().split())
edges[s].append((w, t))
edges[t].append((w, s))
def func(start):
cost = [INF] * n
que = [(0, s... | output | 1 | 103,651 | 13 | 207,303 |
Provide a correct Python 3 solution for this coding contest problem.
Given a tree T with non-negative weight, find the height of each node of the tree. For each node, the height is the distance to the most distant leaf from the node.
Constraints
* 1 ≤ n ≤ 10,000
* 0 ≤ wi ≤ 1,000
Input
n
s1 t1 w1
s2 t2 w2
:
sn-1 t... | instruction | 0 | 103,652 | 13 | 207,304 |
"Correct Solution:
```
from collections import deque
def solve(tree, root):
def dfs1():
"""各頂点の部分木内で最も遠い頂点(葉)までの距離を求める"""
q1 = deque([root])
q2 = deque([root])
while q1:
v = q1.pop()
for nxt_v, cost in tree[v]:
if nxt_v in par:
... | output | 1 | 103,652 | 13 | 207,305 |
Provide a correct Python 3 solution for this coding contest problem.
Given a tree T with non-negative weight, find the height of each node of the tree. For each node, the height is the distance to the most distant leaf from the node.
Constraints
* 1 ≤ n ≤ 10,000
* 0 ≤ wi ≤ 1,000
Input
n
s1 t1 w1
s2 t2 w2
:
sn-1 t... | instruction | 0 | 103,653 | 13 | 207,306 |
"Correct Solution:
```
def tree_height(T, w):
N = len(T)
# Consider T to be rooted at r = 0
downward = [0] * N # the height of the subtree rooted at each v
upward = [-1] * N # the height of the subtree which contains the root r and is rooted at each v
height = [-1] * N
def dfs1(r):
nonlo... | output | 1 | 103,653 | 13 | 207,307 |
Provide a correct Python 3 solution for this coding contest problem.
Given a tree T with non-negative weight, find the height of each node of the tree. For each node, the height is the distance to the most distant leaf from the node.
Constraints
* 1 ≤ n ≤ 10,000
* 0 ≤ wi ≤ 1,000
Input
n
s1 t1 w1
s2 t2 w2
:
sn-1 t... | instruction | 0 | 103,654 | 13 | 207,308 |
"Correct Solution:
```
import sys
sys.setrecursionlimit(int(1e7))
n = int(input())
tree = {}
for i in range(n - 1):
s, t, w = map(int, input().split())
if s not in tree:
tree[s] = {}
if t not in tree:
tree[t] = {}
tree[s][t] = tree[t][s] = w
max_cost = 0
max_id = 0
def visit(v: in... | output | 1 | 103,654 | 13 | 207,309 |
Provide a correct Python 3 solution for this coding contest problem.
Given a tree T with non-negative weight, find the height of each node of the tree. For each node, the height is the distance to the most distant leaf from the node.
Constraints
* 1 ≤ n ≤ 10,000
* 0 ≤ wi ≤ 1,000
Input
n
s1 t1 w1
s2 t2 w2
:
sn-1 t... | instruction | 0 | 103,655 | 13 | 207,310 |
"Correct Solution:
```
import sys
from operator import itemgetter
sys.setrecursionlimit(200000)
def dfs(u, prev):
global post_order, pre_order
pre_order.append((u, prev))
for w, t in edges[u]:
if t != prev:
dfs(t, u)
post_order.append(u)
n = int(input())
edges = [set() for _ in... | output | 1 | 103,655 | 13 | 207,311 |
Provide a correct Python 3 solution for this coding contest problem.
Given a tree T with non-negative weight, find the height of each node of the tree. For each node, the height is the distance to the most distant leaf from the node.
Constraints
* 1 ≤ n ≤ 10,000
* 0 ≤ wi ≤ 1,000
Input
n
s1 t1 w1
s2 t2 w2
:
sn-1 t... | instruction | 0 | 103,656 | 13 | 207,312 |
"Correct Solution:
```
class Tree():
def __init__(self,n,edge):
self.n = n
self.tree = [[] for _ in range(n)]
for e in edge:
self.tree[e[0]].append((e[1],e[2]))
self.tree[e[1]].append((e[0],e[2]))
def setroot(self,root):
self.root = root
self.paren... | output | 1 | 103,656 | 13 | 207,313 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given a tree T with non-negative weight, find the height of each node of the tree. For each node, the height is the distance to the most distant leaf from the node.
Constraints
* 1 ≤ n ≤ 10,00... | instruction | 0 | 103,657 | 13 | 207,314 |
Yes | output | 1 | 103,657 | 13 | 207,315 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given a tree T with non-negative weight, find the height of each node of the tree. For each node, the height is the distance to the most distant leaf from the node.
Constraints
* 1 ≤ n ≤ 10,00... | instruction | 0 | 103,658 | 13 | 207,316 |
Yes | output | 1 | 103,658 | 13 | 207,317 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given a tree T with non-negative weight, find the height of each node of the tree. For each node, the height is the distance to the most distant leaf from the node.
Constraints
* 1 ≤ n ≤ 10,00... | instruction | 0 | 103,659 | 13 | 207,318 |
Yes | output | 1 | 103,659 | 13 | 207,319 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given a tree T with non-negative weight, find the height of each node of the tree. For each node, the height is the distance to the most distant leaf from the node.
Constraints
* 1 ≤ n ≤ 10,00... | instruction | 0 | 103,660 | 13 | 207,320 |
Yes | output | 1 | 103,660 | 13 | 207,321 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given a tree T with non-negative weight, find the height of each node of the tree. For each node, the height is the distance to the most distant leaf from the node.
Constraints
* 1 ≤ n ≤ 10,00... | instruction | 0 | 103,661 | 13 | 207,322 |
No | output | 1 | 103,661 | 13 | 207,323 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given a tree T with non-negative weight, find the height of each node of the tree. For each node, the height is the distance to the most distant leaf from the node.
Constraints
* 1 ≤ n ≤ 10,00... | instruction | 0 | 103,662 | 13 | 207,324 |
No | output | 1 | 103,662 | 13 | 207,325 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given a tree T with non-negative weight, find the height of each node of the tree. For each node, the height is the distance to the most distant leaf from the node.
Constraints
* 1 ≤ n ≤ 10,00... | instruction | 0 | 103,663 | 13 | 207,326 |
No | output | 1 | 103,663 | 13 | 207,327 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given a tree T with non-negative weight, find the height of each node of the tree. For each node, the height is the distance to the most distant leaf from the node.
Constraints
* 1 ≤ n ≤ 10,00... | instruction | 0 | 103,664 | 13 | 207,328 |
No | output | 1 | 103,664 | 13 | 207,329 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an undirected graph where each edge has one of two colors: black or red.
Your task is to assign a real number to each node so that:
* for each black edge the sum of values at its endpoints is 1;
* for each red edge the ... | instruction | 0 | 103,865 | 13 | 207,730 |
Tags: *special, binary search, dfs and similar, dp, math, ternary search
Correct Solution:
```
# SOLUTION CREDITS: https://codeforces.com/profile/TheVan
import os
import sys
from io import BytesIO, IOBase
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self... | output | 1 | 103,865 | 13 | 207,731 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an undirected graph where each edge has one of two colors: black or red.
Your task is to assign a real number to each node so that:
* for each black edge the sum of values at its endpoints is 1;
* for each red edge the ... | instruction | 0 | 103,866 | 13 | 207,732 |
Tags: *special, binary search, dfs and similar, dp, math, ternary search
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
... | output | 1 | 103,866 | 13 | 207,733 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In this problem at each moment you have a set of intervals. You can move from interval (a, b) from our set to interval (c, d) from our set if and only if c < a < d or c < b < d. Also there is a path from interval I1 from our set to interval ... | instruction | 0 | 103,988 | 13 | 207,976 |
Tags: data structures
Correct Solution:
```
def dfs(node, destination):
if node == destination:
return True
visited[node] = True
for adj in graph[node]:
if not visited[adj] and dfs(adj, destination):
return True
return False
n = int(input())
graph = [[] for _ in range(n... | output | 1 | 103,988 | 13 | 207,977 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem at each moment you have a set of intervals. You can move from interval (a, b) from our set to interval (c, d) from our set if and only if c < a < d or c < b < d. Also there is a ... | instruction | 0 | 103,991 | 13 | 207,982 |
Yes | output | 1 | 103,991 | 13 | 207,983 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem you will have to deal with a very special network.
The network consists of two parts: part A and part B. Each part consists of n vertices; i-th vertex of part A is denoted as Ai... | instruction | 0 | 104,150 | 13 | 208,300 |
No | output | 1 | 104,150 | 13 | 208,301 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this problem you will have to deal with a very special network.
The network consists of two parts: part A and part B. Each part consists of n vertices; i-th vertex of part A is denoted as Ai... | instruction | 0 | 104,151 | 13 | 208,302 |
No | output | 1 | 104,151 | 13 | 208,303 |
Provide a correct Python 3 solution for this coding contest problem.
problem
AOR Ika likes rooted trees with a fractal (self-similar) structure. Consider using the weighted rooted tree $ T $ consisting of $ N $ vertices to represent the rooted tree $ T'$ with the following fractal structure.
* $ T'$ is the addition ... | instruction | 0 | 104,385 | 13 | 208,770 |
"Correct Solution:
```
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LS(): return input().split()
def I(): return... | output | 1 | 104,385 | 13 | 208,771 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
problem
AOR Ika likes rooted trees with a fractal (self-similar) structure. Consider using the weighted rooted tree $ T $ consisting of $ N $ vertices to represent the rooted tree $ T'$ with th... | instruction | 0 | 104,386 | 13 | 208,772 |
No | output | 1 | 104,386 | 13 | 208,773 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
problem
AOR Ika likes rooted trees with a fractal (self-similar) structure. Consider using the weighted rooted tree $ T $ consisting of $ N $ vertices to represent the rooted tree $ T'$ with th... | instruction | 0 | 104,387 | 13 | 208,774 |
No | output | 1 | 104,387 | 13 | 208,775 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
problem
AOR Ika likes rooted trees with a fractal (self-similar) structure. Consider using the weighted rooted tree $ T $ consisting of $ N $ vertices to represent the rooted tree $ T'$ with th... | instruction | 0 | 104,388 | 13 | 208,776 |
No | output | 1 | 104,388 | 13 | 208,777 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
problem
AOR Ika likes rooted trees with a fractal (self-similar) structure. Consider using the weighted rooted tree $ T $ consisting of $ N $ vertices to represent the rooted tree $ T'$ with th... | instruction | 0 | 104,389 | 13 | 208,778 |
No | output | 1 | 104,389 | 13 | 208,779 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given three integers n, d and k.
Your task is to construct an undirected tree on n vertices with diameter d and degree of each vertex at most k, or say that it is impossible.
An undirected tree is a connected undirected graph with ... | instruction | 0 | 104,422 | 13 | 208,844 |
Tags: constructive algorithms, graphs
Correct Solution:
```
from sys import exit
def bad():
print("NO")
exit()
node = 1
def make_branch(u, d, deg, g, n, k):
global node
while deg[u] < k and d > 0 and node < n:
node += 1
deg[u] += 1
deg[node] = 1
g[u].append(node)
... | output | 1 | 104,422 | 13 | 208,845 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given three integers n, d and k.
Your task is to construct an undirected tree on n vertices with diameter d and degree of each vertex at most k, or say that it is impossible.
An undirected tree is a connected undirected graph with ... | instruction | 0 | 104,423 | 13 | 208,846 |
Tags: constructive algorithms, graphs
Correct Solution:
```
n, d, k = map(int, input().split())
if d+1 > n:
print('NO')
exit()
ans = []
dist = [0]*n
deg = [0]*n
for i in range(d+1):
if i == 0 or i == d:
deg[i] = 1
else:
deg[i] = 2
if i != d:
ans.append((i+1, i+2))
dist[... | output | 1 | 104,423 | 13 | 208,847 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given three integers n, d and k.
Your task is to construct an undirected tree on n vertices with diameter d and degree of each vertex at most k, or say that it is impossible.
An undirected tree is a connected undirected graph with ... | instruction | 0 | 104,424 | 13 | 208,848 |
Tags: constructive algorithms, graphs
Correct Solution:
```
import sys
input = sys.stdin.buffer.readline
from collections import deque
n,d,k=map(int,input().split())
if d>=n:
print("NO")
exit()
graph=[[] for i in range(n+1)]
for i in range(1,d+2):
graph[i].append(min(i-1,d+1-i))
# print(graph)
for i ... | output | 1 | 104,424 | 13 | 208,849 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given three integers n, d and k.
Your task is to construct an undirected tree on n vertices with diameter d and degree of each vertex at most k, or say that it is impossible.
An undirected tree is a connected undirected graph with ... | instruction | 0 | 104,425 | 13 | 208,850 |
Tags: constructive algorithms, graphs
Correct Solution:
```
#WARNING This code is just for fun. Reading it might give u a brainfreeze
n,d,k = [int(x) for x in input().strip().split(' ')]
l = []
i = 1
if n<=d:
print("NO")
elif k==1:
if n>2:
print("NO")
elif n==2:
print("YES")
print(1,2)
else:
n+=1
flag = Fal... | output | 1 | 104,425 | 13 | 208,851 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given three integers n, d and k.
Your task is to construct an undirected tree on n vertices with diameter d and degree of each vertex at most k, or say that it is impossible.
An undirected tree is a connected undirected graph with ... | instruction | 0 | 104,426 | 13 | 208,852 |
Tags: constructive algorithms, graphs
Correct Solution:
```
import sys
n,d,k=map(int,input().split())
if(n<=d):
print('NO')
sys.exit()
if(k==1 and n>2):
print('NO')
sys.exit()
edgestot=[]
edges=[[] for i in range(n)]
tovisit=[]
for i in range(d):
edgestot.append([i,i+1])
tovisit.append([i+1,mi... | output | 1 | 104,426 | 13 | 208,853 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given three integers n, d and k.
Your task is to construct an undirected tree on n vertices with diameter d and degree of each vertex at most k, or say that it is impossible.
An undirected tree is a connected undirected graph with ... | instruction | 0 | 104,427 | 13 | 208,854 |
Tags: constructive algorithms, graphs
Correct Solution:
```
def main():
n, d, k = list(map(int, input().split()))
if n == 2 and d == 1 and k == 1:
print("YES")
print("1 2")
return 0
if n == d + 1 and k - 1:
print("YES")
for i in range(1, d + 1):
print(i, i... | output | 1 | 104,427 | 13 | 208,855 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given three integers n, d and k.
Your task is to construct an undirected tree on n vertices with diameter d and degree of each vertex at most k, or say that it is impossible.
An undirected tree is a connected undirected graph with ... | instruction | 0 | 104,428 | 13 | 208,856 |
Tags: constructive algorithms, graphs
Correct Solution:
```
n, d, k = map(int, input().split())
num = d+2
def solve():
global num
if n == 1: return 'NO'
if n == 2:
if d != 1:
return 'NO'
else:
return "YES\n1 2"
if k < 2: return 'NO'
if d > n-1: return 'NO'
depth = [min(i, d-i) for i in... | output | 1 | 104,428 | 13 | 208,857 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given three integers n, d and k.
Your task is to construct an undirected tree on n vertices with diameter d and degree of each vertex at most k, or say that it is impossible.
An undirected tree is a connected undirected graph with ... | instruction | 0 | 104,429 | 13 | 208,858 |
Tags: constructive algorithms, graphs
Correct Solution:
```
n,d,k=map(int,input().strip().split())
ans=[]
if (d>n-1):
print ("NO")
exit(0)
if (k<2 and n>2):
print ("NO")
exit(0)
l1=[0 for i in range(d+2)]
count=d
cnt=d+2
def insert(par,v,r,e):
global count
global cnt
if count==n-1:
print ("YES")
for o in ans... | output | 1 | 104,429 | 13 | 208,859 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three integers n, d and k.
Your task is to construct an undirected tree on n vertices with diameter d and degree of each vertex at most k, or say that it is impossible.
An undire... | instruction | 0 | 104,430 | 13 | 208,860 |
Yes | output | 1 | 104,430 | 13 | 208,861 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three integers n, d and k.
Your task is to construct an undirected tree on n vertices with diameter d and degree of each vertex at most k, or say that it is impossible.
An undire... | instruction | 0 | 104,431 | 13 | 208,862 |
Yes | output | 1 | 104,431 | 13 | 208,863 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three integers n, d and k.
Your task is to construct an undirected tree on n vertices with diameter d and degree of each vertex at most k, or say that it is impossible.
An undire... | instruction | 0 | 104,432 | 13 | 208,864 |
Yes | output | 1 | 104,432 | 13 | 208,865 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three integers n, d and k.
Your task is to construct an undirected tree on n vertices with diameter d and degree of each vertex at most k, or say that it is impossible.
An undire... | instruction | 0 | 104,433 | 13 | 208,866 |
Yes | output | 1 | 104,433 | 13 | 208,867 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three integers n, d and k.
Your task is to construct an undirected tree on n vertices with diameter d and degree of each vertex at most k, or say that it is impossible.
An undire... | instruction | 0 | 104,434 | 13 | 208,868 |
No | output | 1 | 104,434 | 13 | 208,869 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three integers n, d and k.
Your task is to construct an undirected tree on n vertices with diameter d and degree of each vertex at most k, or say that it is impossible.
An undire... | instruction | 0 | 104,435 | 13 | 208,870 |
No | output | 1 | 104,435 | 13 | 208,871 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three integers n, d and k.
Your task is to construct an undirected tree on n vertices with diameter d and degree of each vertex at most k, or say that it is impossible.
An undire... | instruction | 0 | 104,436 | 13 | 208,872 |
No | output | 1 | 104,436 | 13 | 208,873 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given three integers n, d and k.
Your task is to construct an undirected tree on n vertices with diameter d and degree of each vertex at most k, or say that it is impossible.
An undire... | instruction | 0 | 104,437 | 13 | 208,874 |
No | output | 1 | 104,437 | 13 | 208,875 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's define the Eulerian traversal of a tree (a connected undirected graph without cycles) as follows: consider a depth-first search algorithm which traverses vertices of the tree and enumerate... | instruction | 0 | 104,454 | 13 | 208,908 |
No | output | 1 | 104,454 | 13 | 208,909 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
I'm the Map, I'm the Map! I'm the MAP!!!
Map
In anticipation of new adventures Boots wanted to do a good deed. After discussion with the Map and Backpack, they decided to gift Dora a connected... | instruction | 0 | 104,519 | 13 | 209,038 |
No | output | 1 | 104,519 | 13 | 209,039 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
I'm the Map, I'm the Map! I'm the MAP!!!
Map
In anticipation of new adventures Boots wanted to do a good deed. After discussion with the Map and Backpack, they decided to gift Dora a connected... | instruction | 0 | 104,520 | 13 | 209,040 |
No | output | 1 | 104,520 | 13 | 209,041 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
I'm the Map, I'm the Map! I'm the MAP!!!
Map
In anticipation of new adventures Boots wanted to do a good deed. After discussion with the Map and Backpack, they decided to gift Dora a connected... | instruction | 0 | 104,521 | 13 | 209,042 |
No | output | 1 | 104,521 | 13 | 209,043 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
I'm the Map, I'm the Map! I'm the MAP!!!
Map
In anticipation of new adventures Boots wanted to do a good deed. After discussion with the Map and Backpack, they decided to gift Dora a connected... | instruction | 0 | 104,522 | 13 | 209,044 |
No | output | 1 | 104,522 | 13 | 209,045 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.