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 |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
You're given a tree with n vertices.
Your task is to determine the maximum possible number of edges that can be removed in such a way that all the remaining connected components will have even size.
Input
The first line contains an intege... | instruction | 0 | 8,154 | 13 | 16,308 |
Tags: dfs and similar, dp, graphs, greedy, trees
Correct Solution:
```
n=int(input())
if n&1>0:
print(-1)
exit()
g=[[] for i in range(n)]
for i in range(n-1):
u,v=map(int,input().split())
u-=1
v-=1
g[u].append(v)
g[v].append(u)
c=[1]*n
v=[-1]*n
v[0]=0
q=[0]
while q:
x=q[-1]
flag=False
for to in g[x]... | output | 1 | 8,154 | 13 | 16,309 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You're given a tree with n vertices.
Your task is to determine the maximum possible number of edges that can be removed in such a way that all the remaining connected components will have even size.
Input
The first line contains an intege... | instruction | 0 | 8,155 | 13 | 16,310 |
Tags: dfs and similar, dp, graphs, greedy, trees
Correct Solution:
```
# n nodes, n - 1 edges, no possibility for loop
# so no need of maintaining a vis array, it'd not visit nodes previously visited
# as long as you don't go along the edge back which leads you to the current node
from collections import deque
def ... | output | 1 | 8,155 | 13 | 16,311 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You're given a tree with n vertices.
Your task is to determine the maximum possible number of edges that can be removed in such a way that all the remaining connected components will have even size.
Input
The first line contains an intege... | instruction | 0 | 8,156 | 13 | 16,312 |
Tags: dfs and similar, dp, graphs, greedy, trees
Correct Solution:
```
import sys
# import bisect
# from collections import deque
# sys.setrecursionlimit(100000)
Ri = lambda : [int(x) for x in sys.stdin.readline().split()]
ri = lambda : sys.stdin.readline().strip()
def input(): return sys.stdin.readline().strip()
... | output | 1 | 8,156 | 13 | 16,313 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You're given a tree with n vertices.
Your task is to determine the maximum possible number of edges that can be removed in such a way that all the remaining connected components will have even size.
Input
The first line contains an intege... | instruction | 0 | 8,157 | 13 | 16,314 |
Tags: dfs and similar, dp, graphs, greedy, trees
Correct Solution:
```
from sys import exit
def main():
n = int(input())
g = [[] for i in range(n + 5)]
vh = [[] for i in range(n + 5)]
size = [1 for i in range(n + 5)]
par = [i for i in range(n + 5)]
if n % 2 == 1:
print(-1)
exi... | output | 1 | 8,157 | 13 | 16,315 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You're given a tree with n vertices.
Your task is to determine the maximum possible number of edges that can be removed in such a way that all the remaining connected components will have even size.
Input
The first line contains an intege... | instruction | 0 | 8,158 | 13 | 16,316 |
Tags: dfs and similar, dp, graphs, greedy, trees
Correct Solution:
```
n=int(input())
tr=[[] for i in range(n)]
for _ in range(n-1):
u,v=map(int,input().split())
tr[u-1].append(v-1)
tr[v-1].append(u-1)
if n%2:
print(-1)
exit()
c=[1]*n
par=[-1]*n
par[0]=0
q=[0]
while q:
ver=q[-1]
flag=False
for to in tr[... | output | 1 | 8,158 | 13 | 16,317 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You're given a tree with n vertices.
Your task is to determine the maximum possible number of edges that can be removed in such a way that all the remaining connected components will have even size.
Input
The first line contains an intege... | instruction | 0 | 8,159 | 13 | 16,318 |
Tags: dfs and similar, dp, graphs, greedy, trees
Correct Solution:
```
def main():
n = int(input())
if n % 2 != 0:
print(-1)
return
links = [[1, set()] for i in range(1, n+1)]
W = 0
L = 1
i = 0
while i < n-1:
i += 1
[a, b] = [int(x) for x in input().split()]
links[a-1][L].add(b-1)
... | output | 1 | 8,159 | 13 | 16,319 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given a tree with n vertices.
Your task is to determine the maximum possible number of edges that can be removed in such a way that all the remaining connected components will have even ... | instruction | 0 | 8,160 | 13 | 16,320 |
Yes | output | 1 | 8,160 | 13 | 16,321 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given a tree with n vertices.
Your task is to determine the maximum possible number of edges that can be removed in such a way that all the remaining connected components will have even ... | instruction | 0 | 8,161 | 13 | 16,322 |
Yes | output | 1 | 8,161 | 13 | 16,323 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given a tree with n vertices.
Your task is to determine the maximum possible number of edges that can be removed in such a way that all the remaining connected components will have even ... | instruction | 0 | 8,162 | 13 | 16,324 |
Yes | output | 1 | 8,162 | 13 | 16,325 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given a tree with n vertices.
Your task is to determine the maximum possible number of edges that can be removed in such a way that all the remaining connected components will have even ... | instruction | 0 | 8,163 | 13 | 16,326 |
Yes | output | 1 | 8,163 | 13 | 16,327 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given a tree with n vertices.
Your task is to determine the maximum possible number of edges that can be removed in such a way that all the remaining connected components will have even ... | instruction | 0 | 8,164 | 13 | 16,328 |
No | output | 1 | 8,164 | 13 | 16,329 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given a tree with n vertices.
Your task is to determine the maximum possible number of edges that can be removed in such a way that all the remaining connected components will have even ... | instruction | 0 | 8,165 | 13 | 16,330 |
No | output | 1 | 8,165 | 13 | 16,331 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given a tree with n vertices.
Your task is to determine the maximum possible number of edges that can be removed in such a way that all the remaining connected components will have even ... | instruction | 0 | 8,166 | 13 | 16,332 |
No | output | 1 | 8,166 | 13 | 16,333 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given a tree with n vertices.
Your task is to determine the maximum possible number of edges that can be removed in such a way that all the remaining connected components will have even ... | instruction | 0 | 8,167 | 13 | 16,334 |
No | output | 1 | 8,167 | 13 | 16,335 |
Provide a correct Python 3 solution for this coding contest problem.
Problem Statement
Do you know the data structure called BDD (Binary Decision Diagram)? In recent years, ZDD, which has become a hot topic in the video related to Combinatorial Explosion Sister, is a data structure derived from BDD. This problem is a... | instruction | 0 | 8,352 | 13 | 16,704 |
"Correct Solution:
```
def root(x):
if x == par[x]:return x
par[x] = root(par[x])
return par[x]
def unite(x, y):
x = root(x)
y = root(y)
if rank[x] < rank[y]: x,y = y,x
if rank[x] == rank[y]: rank[x] += 1
par[y] = x
def init(n):
x = [None] * s
for i in range(s):
x[i] = ... | output | 1 | 8,352 | 13 | 16,705 |
Provide a correct Python 3 solution for this coding contest problem.
Problem Statement
Do you know the data structure called BDD (Binary Decision Diagram)? In recent years, ZDD, which has become a hot topic in the video related to Combinatorial Explosion Sister, is a data structure derived from BDD. This problem is a... | instruction | 0 | 8,353 | 13 | 16,706 |
"Correct Solution:
```
def root(x):
if x == par[x]:
return x
par[x] = root(par[x])
return par[x]
def unite(x,y):
x = root(x)
y = root(y)
if rank[x] < rank[y]:
par[x] = y
else:
par[y] = x
if rank[x] == rank[y]:
rank[x] += 1
n = int(input())
par = ... | output | 1 | 8,353 | 13 | 16,707 |
Provide a correct Python 3 solution for this coding contest problem.
Example
Input
3
aab
czc
baa
Output
aac | instruction | 0 | 8,354 | 13 | 16,708 |
"Correct Solution:
```
import heapq
class edge:
def __init__(self,to,cap,cost,rev):
self.to = to
self.cap = cap
self.cost = cost
self.rev = rev
class min_cost_flow:
INF = 52**60
def __init__(self, n):
self.V = n
self.G = [[] for _ in range(n)]
self.h... | output | 1 | 8,354 | 13 | 16,709 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is one apple tree in Arkady's garden. It can be represented as a set of junctions connected with branches so that there is only one way to reach any junctions from any other one using branches. The junctions are enumerated from 1 to n,... | instruction | 0 | 8,376 | 13 | 16,752 |
Tags: constructive algorithms, dfs and similar, dp, graphs, greedy, sortings, trees
Correct Solution:
```
n=int(input())
a=input().split()
A=[int(x) for x in a]
B=[[x,[]] for x in range(1,n+1)]
i=0
for i in range(len(A)):
B[A[i]-1][1].append(i+2)
def merge(arr, l, m, r):
n1 = m - l + 1
n2 = r- m
L = [0]... | output | 1 | 8,376 | 13 | 16,753 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is one apple tree in Arkady's garden. It can be represented as a set of junctions connected with branches so that there is only one way to reach any junctions from any other one using branches. The junctions are enumerated from 1 to n,... | instruction | 0 | 8,377 | 13 | 16,754 |
Tags: constructive algorithms, dfs and similar, dp, graphs, greedy, sortings, trees
Correct Solution:
```
n=int(input())
a=[0,0]+[int(x) for x in input().split()]
ans=[0]*(n+1)
for i in range(n,1,-1):
if ans[i]==0:
ans[i]=1
ans[a[i]]+=ans[i]
if n==1:
ans[1]=1
ans=ans[1:]
ans.sort()
print(*ans)
``` | output | 1 | 8,377 | 13 | 16,755 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is one apple tree in Arkady's garden. It can be represented as a set of junctions connected with branches so that there is only one way to reach any junctions from any other one using branches. The junctions are enumerated from 1 to n,... | instruction | 0 | 8,378 | 13 | 16,756 |
Tags: constructive algorithms, dfs and similar, dp, graphs, greedy, sortings, trees
Correct Solution:
```
n = int(input())
tr = {}
p = [int(s) for s in input().split()]
for i in range(n-1):
if not tr.get(p[i]-1):
tr[p[i]-1] = []
tr[p[i]-1].append(i+1)
# print(tr)
lc = [-1 for i in range(n)]
def get_lc(i... | output | 1 | 8,378 | 13 | 16,757 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is one apple tree in Arkady's garden. It can be represented as a set of junctions connected with branches so that there is only one way to reach any junctions from any other one using branches. The junctions are enumerated from 1 to n,... | instruction | 0 | 8,379 | 13 | 16,758 |
Tags: constructive algorithms, dfs and similar, dp, graphs, greedy, sortings, trees
Correct Solution:
```
n = int(input())
if n == 1:
print(1)
else:
adj = [[] for i in range(n+10)]
s = input().split()
for i in range(2,n+1):
pi = int(s[i-2])
adj[i].append(pi)
adj[pi].append(i)
... | output | 1 | 8,379 | 13 | 16,759 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is one apple tree in Arkady's garden. It can be represented as a set of junctions connected with branches so that there is only one way to reach any junctions from any other one using branches. The junctions are enumerated from 1 to n,... | instruction | 0 | 8,380 | 13 | 16,760 |
Tags: constructive algorithms, dfs and similar, dp, graphs, greedy, sortings, trees
Correct Solution:
```
# -*- coding:utf-8 -*-
"""
created by shuangquan.huang at 12/14/18
"""
import collections
import sys
N = int(input())
p = [int(x) for x in input().split()]
G = collections.defaultdict(list)
for i, v in enum... | output | 1 | 8,380 | 13 | 16,761 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is one apple tree in Arkady's garden. It can be represented as a set of junctions connected with branches so that there is only one way to reach any junctions from any other one using branches. The junctions are enumerated from 1 to n,... | instruction | 0 | 8,381 | 13 | 16,762 |
Tags: constructive algorithms, dfs and similar, dp, graphs, greedy, sortings, trees
Correct Solution:
```
n=int(input())
if n==1:
print(1)
else:
p=list(map(int,input().split()))
children=[]
for i in range(n):
children.append([])
for i in range(n-1):
children[p[i]-1].append(i+1)
l... | output | 1 | 8,381 | 13 | 16,763 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is one apple tree in Arkady's garden. It can be represented as a set of junctions connected with branches so that there is only one way to reach any junctions from any other one using branches. The junctions are enumerated from 1 to n,... | instruction | 0 | 8,382 | 13 | 16,764 |
Tags: constructive algorithms, dfs and similar, dp, graphs, greedy, sortings, trees
Correct Solution:
```
n=int(input())###
p=[0,0]+list(map(int,input().split()))#tomamos la entrada
d=[0]*(n+1)#aki vamos a contar la cantidad d colores q necesita cada union
for i in range(n,1,-1):#empezamos x las hojas hasta llegar a la... | output | 1 | 8,382 | 13 | 16,765 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is one apple tree in Arkady's garden. It can be represented as a set of junctions connected with branches so that there is only one way to reach any junctions from any other one using branches. The junctions are enumerated from 1 to n,... | instruction | 0 | 8,383 | 13 | 16,766 |
Tags: constructive algorithms, dfs and similar, dp, graphs, greedy, sortings, trees
Correct Solution:
```
n = int(input())
p = [0,0] + [int(w) for w in input().split()]
d = [0] * (n+1)
for i in range(n, 1, -1):
if d[i] == 0:
d[i] = 1
d[p[i]] += d[i]
if n == 1:
d[1] = 1
d = d[1:]
d.sort()
print(... | output | 1 | 8,383 | 13 | 16,767 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is one apple tree in Arkady's garden. It can be represented as a set of junctions connected with branches so that there is only one way to reach any junctions from any other one using bran... | instruction | 0 | 8,384 | 13 | 16,768 |
Yes | output | 1 | 8,384 | 13 | 16,769 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is one apple tree in Arkady's garden. It can be represented as a set of junctions connected with branches so that there is only one way to reach any junctions from any other one using bran... | instruction | 0 | 8,385 | 13 | 16,770 |
Yes | output | 1 | 8,385 | 13 | 16,771 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is one apple tree in Arkady's garden. It can be represented as a set of junctions connected with branches so that there is only one way to reach any junctions from any other one using bran... | instruction | 0 | 8,386 | 13 | 16,772 |
Yes | output | 1 | 8,386 | 13 | 16,773 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is one apple tree in Arkady's garden. It can be represented as a set of junctions connected with branches so that there is only one way to reach any junctions from any other one using bran... | instruction | 0 | 8,387 | 13 | 16,774 |
Yes | output | 1 | 8,387 | 13 | 16,775 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is one apple tree in Arkady's garden. It can be represented as a set of junctions connected with branches so that there is only one way to reach any junctions from any other one using bran... | instruction | 0 | 8,388 | 13 | 16,776 |
No | output | 1 | 8,388 | 13 | 16,777 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is one apple tree in Arkady's garden. It can be represented as a set of junctions connected with branches so that there is only one way to reach any junctions from any other one using bran... | instruction | 0 | 8,389 | 13 | 16,778 |
No | output | 1 | 8,389 | 13 | 16,779 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is one apple tree in Arkady's garden. It can be represented as a set of junctions connected with branches so that there is only one way to reach any junctions from any other one using bran... | instruction | 0 | 8,390 | 13 | 16,780 |
No | output | 1 | 8,390 | 13 | 16,781 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is one apple tree in Arkady's garden. It can be represented as a set of junctions connected with branches so that there is only one way to reach any junctions from any other one using bran... | instruction | 0 | 8,391 | 13 | 16,782 |
No | output | 1 | 8,391 | 13 | 16,783 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a tree with n nodes. You have to write non-negative integers on its edges so that the following condition would be satisfied:
For every two nodes i, j, look at the path between them and count the sum of numbers on the edges of... | instruction | 0 | 8,438 | 13 | 16,876 |
Tags: constructive algorithms, trees
Correct Solution:
```
import math
n = int(input())
if n == 1:
print()
else:
edge = [list(map(int, input().split())) for i in range(1, n) ]
g = {}
for x, y in edge:
if x not in g:
g[x] = []
if y not in g:
g[y] = []
... | output | 1 | 8,438 | 13 | 16,877 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a tree with n nodes. You have to write non-negative integers on its edges so that the following condition would be satisfied:
For every two nodes i, j, look at the path between th... | instruction | 0 | 8,439 | 13 | 16,878 |
No | output | 1 | 8,439 | 13 | 16,879 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A connected undirected graph is called a vertex cactus, if each vertex of this graph belongs to at most one simple cycle.
A simple cycle in a undirected graph is a sequence of distinct vertices v1, v2, ..., vt (t > 2), such that for any i (... | instruction | 0 | 8,608 | 13 | 17,216 |
Tags: data structures, dfs and similar, dp, graphs, trees
Correct Solution:
```
from collections import defaultdict
import os
import sys
from io import BytesIO, IOBase
from types import GeneratorType
from collections import defaultdict
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file... | output | 1 | 8,608 | 13 | 17,217 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a rooted tree consisting of n vertices numbered from 1 to n. The root of the tree is a vertex number 1.
Initially all vertices contain number 0. Then come q queries, each query ha... | instruction | 0 | 8,638 | 13 | 17,276 |
No | output | 1 | 8,638 | 13 | 17,277 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a rooted tree consisting of n vertices numbered from 1 to n. The root of the tree is a vertex number 1.
Initially all vertices contain number 0. Then come q queries, each query ha... | instruction | 0 | 8,639 | 13 | 17,278 |
No | output | 1 | 8,639 | 13 | 17,279 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a rooted tree consisting of n vertices numbered from 1 to n. The root of the tree is a vertex number 1.
Initially all vertices contain number 0. Then come q queries, each query ha... | instruction | 0 | 8,640 | 13 | 17,280 |
No | output | 1 | 8,640 | 13 | 17,281 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a rooted tree consisting of n vertices numbered from 1 to n. The root of the tree is a vertex number 1.
Initially all vertices contain number 0. Then come q queries, each query ha... | instruction | 0 | 8,641 | 13 | 17,282 |
No | output | 1 | 8,641 | 13 | 17,283 |
Provide tags and a correct Python 3 solution for this coding contest problem.
When Darth Vader gets bored, he sits down on the sofa, closes his eyes and thinks of an infinite rooted tree where each node has exactly n sons, at that for each node, the distance between it an its i-th left child equals to di. The Sith Lor... | instruction | 0 | 8,663 | 13 | 17,326 |
Tags: dp, matrices
Correct Solution:
```
# fast io
from sys import stdin
_data = iter(stdin.read().split('\n'))
input = lambda: next(_data)
N = 101
MOD = 1000000007
def mul_vec_mat(v, a):
c = [0] * N
for i in range(N):
c[i] = sum(a[j][i] * v[j] % MOD for j in range(N)) % MOD
return c
def mul_vec_... | output | 1 | 8,663 | 13 | 17,327 |
Provide tags and a correct Python 3 solution for this coding contest problem.
When Darth Vader gets bored, he sits down on the sofa, closes his eyes and thinks of an infinite rooted tree where each node has exactly n sons, at that for each node, the distance between it an its i-th left child equals to di. The Sith Lor... | instruction | 0 | 8,664 | 13 | 17,328 |
Tags: dp, matrices
Correct Solution:
```
# fast io
from sys import stdin
_data = iter(stdin.read().split('\n'))
input = lambda: next(_data)
N = 101
MOD = 1000000007
def mul_vec_mat(v, a):
n = len(a[0])
m = len(v)
c = [0] * n
for i in range(n):
c[i] = sum(a[j][i] * v[j] % MOD for j in range(m))... | output | 1 | 8,664 | 13 | 17,329 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
When Darth Vader gets bored, he sits down on the sofa, closes his eyes and thinks of an infinite rooted tree where each node has exactly n sons, at that for each node, the distance between it an... | instruction | 0 | 8,666 | 13 | 17,332 |
No | output | 1 | 8,666 | 13 | 17,333 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a directed graph with n nodes and m edges, with all edges having a certain weight.
There might be multiple edges and self loops, and the graph can also be disconnected.
You nee... | instruction | 0 | 8,821 | 13 | 17,642 |
No | output | 1 | 8,821 | 13 | 17,643 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a directed graph with n nodes and m edges, with all edges having a certain weight.
There might be multiple edges and self loops, and the graph can also be disconnected.
You nee... | instruction | 0 | 8,822 | 13 | 17,644 |
No | output | 1 | 8,822 | 13 | 17,645 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a directed graph with n nodes and m edges, with all edges having a certain weight.
There might be multiple edges and self loops, and the graph can also be disconnected.
You nee... | instruction | 0 | 8,823 | 13 | 17,646 |
No | output | 1 | 8,823 | 13 | 17,647 |
Provide a correct Python 3 solution for this coding contest problem.
We have an undirected graph G with N vertices numbered 1 to N and N edges as follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the ... | instruction | 0 | 8,856 | 13 | 17,712 |
"Correct Solution:
```
n,x,y=map(int,input().split())
ans=[0]*n
for i in range(n):
for j in range(i+1,n):
ans[min(j+1-i-1,abs(i+1-x)+abs(j+1-y)+1)] += 1
for i in range(n-1):
print(ans[i+1])
``` | output | 1 | 8,856 | 13 | 17,713 |
Provide a correct Python 3 solution for this coding contest problem.
We have an undirected graph G with N vertices numbered 1 to N and N edges as follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the ... | instruction | 0 | 8,857 | 13 | 17,714 |
"Correct Solution:
```
N, X, Y = map(int, input().split())
K = [0]*(N-1)
for i in range(1,N+1):
for j in range(i+1,N+1):
K[min(min(abs(X-i)+1,abs(Y-i))+abs(j-Y),abs(i-j))-1]+=1
for i in range(N-1):
print(K[i])
``` | output | 1 | 8,857 | 13 | 17,715 |
Provide a correct Python 3 solution for this coding contest problem.
We have an undirected graph G with N vertices numbered 1 to N and N edges as follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the ... | instruction | 0 | 8,858 | 13 | 17,716 |
"Correct Solution:
```
n,x,y=map(int,input().split())
l=[0]*n
for i in range(1,n+1):
for j in range(i+1,n+1):
l[min(j-i,abs(x-i)+1+abs(y-j))]+=1
print(*l[1:],sep='\n')
``` | output | 1 | 8,858 | 13 | 17,717 |
Provide a correct Python 3 solution for this coding contest problem.
We have an undirected graph G with N vertices numbered 1 to N and N edges as follows:
* For each i=1,2,...,N-1, there is an edge between Vertex i and Vertex i+1.
* There is an edge between Vertex X and Vertex Y.
For each k=1,2,...,N-1, solve the ... | instruction | 0 | 8,859 | 13 | 17,718 |
"Correct Solution:
```
n,x,y=map(int,input().split())
ans=[0]*(n-1)
for i in range(1,n+1):
for j in range(i+1,n+1):
ans[(min(j-i,abs(i-x)+abs(j-y)+1))-1]+=1
for i in ans:
print(i)
``` | output | 1 | 8,859 | 13 | 17,719 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.