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.
For a given weighted graph G(V, E) and a source r, find the source shortest path to each vertex from the source (SSSP: Single Source Shortest Path).
Constraints
* 1 ≤ |V| ≤ 100000
* 0 ≤ di ≤ 1... | instruction | 0 | 72,474 | 13 | 144,948 |
Yes | output | 1 | 72,474 | 13 | 144,949 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For a given weighted graph G(V, E) and a source r, find the source shortest path to each vertex from the source (SSSP: Single Source Shortest Path).
Constraints
* 1 ≤ |V| ≤ 100000
* 0 ≤ di ≤ 1... | instruction | 0 | 72,475 | 13 | 144,950 |
No | output | 1 | 72,475 | 13 | 144,951 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For a given weighted graph G(V, E) and a source r, find the source shortest path to each vertex from the source (SSSP: Single Source Shortest Path).
Constraints
* 1 ≤ |V| ≤ 100000
* 0 ≤ di ≤ 1... | instruction | 0 | 72,476 | 13 | 144,952 |
No | output | 1 | 72,476 | 13 | 144,953 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For a given weighted graph G(V, E) and a source r, find the source shortest path to each vertex from the source (SSSP: Single Source Shortest Path).
Constraints
* 1 ≤ |V| ≤ 100000
* 0 ≤ di ≤ 1... | instruction | 0 | 72,477 | 13 | 144,954 |
No | output | 1 | 72,477 | 13 | 144,955 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
For a given weighted graph G(V, E) and a source r, find the source shortest path to each vertex from the source (SSSP: Single Source Shortest Path).
Constraints
* 1 ≤ |V| ≤ 100000
* 0 ≤ di ≤ 1... | instruction | 0 | 72,478 | 13 | 144,956 |
No | output | 1 | 72,478 | 13 | 144,957 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Chouti was tired of the tedious homework, so he opened up an old programming problem he created years ago.
You are given a connected undirected graph with n vertices and m weighted edges. There are k special vertices: x_1, x_2, …, x_k.
Let... | instruction | 0 | 72,515 | 13 | 145,030 |
Tags: dsu, graphs, shortest paths, sortings
Correct Solution:
```
import sys
def int_reader():
yield from (int(d) for d in sys.stdin.read().split())
ints = int_reader()
n, m, k = [next(ints) for i in range(3)]
special = [next(ints) for i in range(k)]
is_special = [0]*(n+1)
for x in special:
is_special[x] = 1
... | output | 1 | 72,515 | 13 | 145,031 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Chouti was tired of the tedious homework, so he opened up an old programming problem he created years ago.
You are given a connected undirected graph with n vertices and m weighted edges. There are k special vertices: x_1, x_2, …, x_k.
Let... | instruction | 0 | 72,516 | 13 | 145,032 |
Tags: dsu, graphs, shortest paths, sortings
Correct Solution:
```
import heapq
import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
retur... | output | 1 | 72,516 | 13 | 145,033 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Chouti was tired of the tedious homework, so he opened up an old programming problem he created years ago.
You are given a connected undirected graph with n vertices and m weighted edges. There are k special vertices: x_1, x_2, …, x_k.
Let... | instruction | 0 | 72,517 | 13 | 145,034 |
Tags: dsu, graphs, shortest paths, sortings
Correct Solution:
```
n, m, k = map(int, input().split())
a = list(map(int, input().split()))
g = []
f = list(range(n+1))
s = [0] * (n+1)
def search(n):
while f[n] != n:
# print(f[n])
f[n] = f[f[n]]
n = f[n]
return n
def can_merge(u, v):
... | output | 1 | 72,517 | 13 | 145,035 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Chouti was tired of the tedious homework, so he opened up an old programming problem he created years ago.
You are given a connected undirected graph with n vertices and m weighted edges. There are k special vertices: x_1, x_2, …, x_k.
Let... | instruction | 0 | 72,518 | 13 | 145,036 |
Tags: dsu, graphs, shortest paths, sortings
Correct Solution:
```
def main():
import sys
input = sys.stdin.readline
# def find(a):
# if par[a] == a:
# return a
# par[a] = find(par[a])
# return par[a]
def find(a):
upd = []
cur = a
while par[cu... | output | 1 | 72,518 | 13 | 145,037 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Chouti was tired of the tedious homework, so he opened up an old programming problem he created years ago.
You are given a connected undirected graph with n vertices and m weighted edges. There are k special vertices: x_1, x_2, …, x_k.
Let... | instruction | 0 | 72,519 | 13 | 145,038 |
Tags: dsu, graphs, shortest paths, sortings
Correct Solution:
```
import sys
input = sys.stdin.readline
# def find(a):
# if par[a] == a:
# return a
# par[a] = find(par[a])
# return par[a]
def find(a):
upd = []
cur = a
while par[cur] != cur:
upd.append(cur)
cur = par[cur... | output | 1 | 72,519 | 13 | 145,039 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Chouti was tired of the tedious homework, so he opened up an old programming problem he created years ago.
You are given a connected undirected graph with n vertices and m weighted edges. There are k special vertices: x_1, x_2, …, x_k.
Let... | instruction | 0 | 72,520 | 13 | 145,040 |
Tags: dsu, graphs, shortest paths, sortings
Correct Solution:
```
import sys
import heapq
from collections import deque
n,m,k=map(int,sys.stdin.readline().split())
X=list(map(int,sys.stdin.readline().split()))
start=X[0]
EDGE=[list(map(int,sys.stdin.readline().split())) for i in range(m)]
COST_vertex=[[] for i in ran... | output | 1 | 72,520 | 13 | 145,041 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Chouti was tired of the tedious homework, so he opened up an old programming problem he created years ago.
You are given a connected undirected graph with n vertices and m weighted edges. There are k special vertices: x_1, x_2, …, x_k.
Let... | instruction | 0 | 72,521 | 13 | 145,042 |
Tags: dsu, graphs, shortest paths, sortings
Correct Solution:
```
class Union:
def __init__(self, n, list_k):
self.p = {i:i for i in range(n+1)}
self.rank = {i:0 for i in range(n+1)}
for k in list_k:
self.rank[k] = 1
def find(self, x):
if x <... | output | 1 | 72,521 | 13 | 145,043 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Chouti was tired of the tedious homework, so he opened up an old programming problem he created years ago.
You are given a connected undirected graph with n vertices and m weighted edges. There are k special vertices: x_1, x_2, …, x_k.
Let... | instruction | 0 | 72,522 | 13 | 145,044 |
Tags: dsu, graphs, shortest paths, sortings
Correct Solution:
```
import sys
input = sys.stdin.readline
n, m, k = list(map(int, input().split()))
x = list(map(int, input().split()))
uf = [-1 for _ in range(n+1)]
def find(p, uf):
if uf[p] < 0:
return p
uf[p] = find(uf[p], uf)
return uf[p]
def ... | output | 1 | 72,522 | 13 | 145,045 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chouti was tired of the tedious homework, so he opened up an old programming problem he created years ago.
You are given a connected undirected graph with n vertices and m weighted edges. There... | instruction | 0 | 72,523 | 13 | 145,046 |
Yes | output | 1 | 72,523 | 13 | 145,047 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chouti was tired of the tedious homework, so he opened up an old programming problem he created years ago.
You are given a connected undirected graph with n vertices and m weighted edges. There... | instruction | 0 | 72,524 | 13 | 145,048 |
Yes | output | 1 | 72,524 | 13 | 145,049 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chouti was tired of the tedious homework, so he opened up an old programming problem he created years ago.
You are given a connected undirected graph with n vertices and m weighted edges. There... | instruction | 0 | 72,525 | 13 | 145,050 |
Yes | output | 1 | 72,525 | 13 | 145,051 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chouti was tired of the tedious homework, so he opened up an old programming problem he created years ago.
You are given a connected undirected graph with n vertices and m weighted edges. There... | instruction | 0 | 72,526 | 13 | 145,052 |
Yes | output | 1 | 72,526 | 13 | 145,053 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chouti was tired of the tedious homework, so he opened up an old programming problem he created years ago.
You are given a connected undirected graph with n vertices and m weighted edges. There... | instruction | 0 | 72,527 | 13 | 145,054 |
No | output | 1 | 72,527 | 13 | 145,055 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chouti was tired of the tedious homework, so he opened up an old programming problem he created years ago.
You are given a connected undirected graph with n vertices and m weighted edges. There... | instruction | 0 | 72,528 | 13 | 145,056 |
No | output | 1 | 72,528 | 13 | 145,057 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chouti was tired of the tedious homework, so he opened up an old programming problem he created years ago.
You are given a connected undirected graph with n vertices and m weighted edges. There... | instruction | 0 | 72,529 | 13 | 145,058 |
No | output | 1 | 72,529 | 13 | 145,059 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chouti was tired of the tedious homework, so he opened up an old programming problem he created years ago.
You are given a connected undirected graph with n vertices and m weighted edges. There... | instruction | 0 | 72,530 | 13 | 145,060 |
No | output | 1 | 72,530 | 13 | 145,061 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex cover problem very interesting.
Suppose the graph G is given. Subset A of its vertices is called a vertex cover of this graph, if for each ed... | instruction | 0 | 72,936 | 13 | 145,872 |
Tags: dfs and similar, graphs
Correct Solution:
```
(n, m) = map(int, input().split())
G = [None] * (n + 1)
for i in range(1, n + 1):
G[i] = []
for i in range(m):
(u, v) = map(int, input().split())
G[u].append(v)
G[v].append(u)
div = [None] * (n + 1)
def bfs():
global n, m, G, div
S = set(x f... | output | 1 | 72,936 | 13 | 145,873 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex cover problem very interesting.
Suppose the graph G is given. Subset A of its vertices is called a vertex cover of this graph, if for each ed... | instruction | 0 | 72,937 | 13 | 145,874 |
Tags: dfs and similar, graphs
Correct Solution:
```
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import random
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),... | output | 1 | 72,937 | 13 | 145,875 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex cover problem very interesting.
Suppose the graph G is given. Subset A of its vertices is called a vertex cover of this graph, if for each ed... | instruction | 0 | 72,938 | 13 | 145,876 |
Tags: dfs and similar, graphs
Correct Solution:
```
n,m=map(int,input().split())
flag=False
f=[0]*100001
E=[[] for i in range(n+1)]
e=[tuple(map(int,input().split())) for _ in range(m)]
for u,v in sorted(e): E[u]+=[v]; E[v]+=[u]
def bfs(nom,col):
ch=[(nom,col)]
while ch:
v,c=ch.pop()
if f[v]==0:
f[v]... | output | 1 | 72,938 | 13 | 145,877 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex cover problem very interesting.
Suppose the graph G is given. Subset A of its vertices is called a vertex cover of this graph, if for each ed... | instruction | 0 | 72,939 | 13 | 145,878 |
Tags: dfs and similar, graphs
Correct Solution:
```
n,m = map(int, input().split())
g={x : [] for x in range(1, n + 1)}
for item in range(m):
u,v = map(int, input().split())
g[v].append(u)
g[u].append(v)
colors = [None]*(n+1)
def inversecolor(clr):
return [0,1][clr == 0]
def solve(g):
paths = ... | output | 1 | 72,939 | 13 | 145,879 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex cover problem very interesting.
Suppose the graph G is given. Subset A of its vertices is called a vertex cover of this graph, if for each ed... | instruction | 0 | 72,940 | 13 | 145,880 |
Tags: dfs and similar, graphs
Correct Solution:
```
from collections import deque
lin = input().split()
n, m = int(lin[0]), int(lin[1])
graph = [[] for i in range(n)]
# graph2 = n * [[]] equivalent
for i in range(m):
curr = input().split()
u, v = int(curr[0]) - 1, int(curr[1]) - 1
graph[u].append(v)
gr... | output | 1 | 72,940 | 13 | 145,881 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex cover problem very interesting.
Suppose the graph G is given. Subset A of its vertices is called a vertex cover of this graph, if for each ed... | instruction | 0 | 72,941 | 13 | 145,882 |
Tags: dfs and similar, graphs
Correct Solution:
```
def main():
n, m = map(int, input().split())
l = [[] for _ in range(n + 1)]
for _ in range(m):
u, v = map(int, input().split())
l[u].append(v)
l[v].append(u)
res = [0] * (n + 1)
for u, x in enumerate(res):
if not x:
... | output | 1 | 72,941 | 13 | 145,883 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex cover problem very interesting.
Suppose the graph G is given. Subset A of its vertices is called a vertex cover of this graph, if for each ed... | instruction | 0 | 72,942 | 13 | 145,884 |
Tags: dfs and similar, graphs
Correct Solution:
```
M=lambda:map(int,input().split())
n,m=M()
graph=[set() for i in range(n)]
for _ in range(m):
a,b=M()
graph[a-1].add(b-1)
graph[b-1].add(a-1)
visited=[-1 for i in range(n)]
stack=[]
for i in range(n):
if visited[i]==-1 and len(graph[i])>0:
visit... | output | 1 | 72,942 | 13 | 145,885 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex cover problem very interesting.
Suppose the graph G is given. Subset A of its vertices is called a vertex cover of this graph, if for each ed... | instruction | 0 | 72,943 | 13 | 145,886 |
Tags: dfs and similar, graphs
Correct Solution:
```
inp = lambda : map(int, input().split())
n, m = inp()
lines = [[] for i in range(n + 1)]
for i in range(m):
x, y = inp()
lines[x].append(y)
lines[y].append(x)
color = [-1] * (n + 1)
for j in range(1, n + 1):
if color[j] != -1:
continue
head... | output | 1 | 72,943 | 13 | 145,887 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex cover problem very interesting.
Suppose the graph G is given. Subset A of its vertices is call... | instruction | 0 | 72,944 | 13 | 145,888 |
Yes | output | 1 | 72,944 | 13 | 145,889 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex cover problem very interesting.
Suppose the graph G is given. Subset A of its vertices is call... | instruction | 0 | 72,945 | 13 | 145,890 |
Yes | output | 1 | 72,945 | 13 | 145,891 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex cover problem very interesting.
Suppose the graph G is given. Subset A of its vertices is call... | instruction | 0 | 72,946 | 13 | 145,892 |
Yes | output | 1 | 72,946 | 13 | 145,893 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex cover problem very interesting.
Suppose the graph G is given. Subset A of its vertices is call... | instruction | 0 | 72,947 | 13 | 145,894 |
Yes | output | 1 | 72,947 | 13 | 145,895 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex cover problem very interesting.
Suppose the graph G is given. Subset A of its vertices is call... | instruction | 0 | 72,948 | 13 | 145,896 |
No | output | 1 | 72,948 | 13 | 145,897 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex cover problem very interesting.
Suppose the graph G is given. Subset A of its vertices is call... | instruction | 0 | 72,949 | 13 | 145,898 |
No | output | 1 | 72,949 | 13 | 145,899 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex cover problem very interesting.
Suppose the graph G is given. Subset A of its vertices is call... | instruction | 0 | 72,950 | 13 | 145,900 |
No | output | 1 | 72,950 | 13 | 145,901 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex cover problem very interesting.
Suppose the graph G is given. Subset A of its vertices is call... | instruction | 0 | 72,951 | 13 | 145,902 |
No | output | 1 | 72,951 | 13 | 145,903 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an undirected graph, consisting of n vertices and m edges. The graph does not necessarily connected. Guaranteed, that the graph does not contain multiple edges (more than one edges... | instruction | 0 | 73,051 | 13 | 146,102 |
No | output | 1 | 73,051 | 13 | 146,103 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an undirected graph, consisting of n vertices and m edges. The graph does not necessarily connected. Guaranteed, that the graph does not contain multiple edges (more than one edges... | instruction | 0 | 73,052 | 13 | 146,104 |
No | output | 1 | 73,052 | 13 | 146,105 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an undirected graph, consisting of n vertices and m edges. The graph does not necessarily connected. Guaranteed, that the graph does not contain multiple edges (more than one edges... | instruction | 0 | 73,053 | 13 | 146,106 |
No | output | 1 | 73,053 | 13 | 146,107 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anadi has a set of dominoes. Every domino has two parts, and each part contains some dots. For every a and b such that 1 ≤ a ≤ b ≤ 6, there is exactly one domino with a dots on one half and b dots on the other half. The set contains exactly ... | instruction | 0 | 73,406 | 13 | 146,812 |
Tags: brute force, graphs
Correct Solution:
```
def dominoes(n,m,edges):
if n<=6:
return m
if m==0:
return 0
mscore=7
for a in range(1,7):
for b in range(a):
score=codeg(a,b,edges)
if score<mscore:
mscore=score
return m-mscore
def code... | output | 1 | 73,406 | 13 | 146,813 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anadi has a set of dominoes. Every domino has two parts, and each part contains some dots. For every a and b such that 1 ≤ a ≤ b ≤ 6, there is exactly one domino with a dots on one half and b dots on the other half. The set contains exactly ... | instruction | 0 | 73,407 | 13 | 146,814 |
Tags: brute force, graphs
Correct Solution:
```
n,m=map(int,input().split())
edges=[list(map(int,input().split())) for i in range(m)]
for i in range(m):
edges[i][0]-=1
edges[i][1]-=1
from itertools import permutations
l=list(permutations(range(6)))
mx=0
for ij in l:
for node in range(7):
for seven... | output | 1 | 73,407 | 13 | 146,815 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anadi has a set of dominoes. Every domino has two parts, and each part contains some dots. For every a and b such that 1 ≤ a ≤ b ≤ 6, there is exactly one domino with a dots on one half and b dots on the other half. The set contains exactly ... | instruction | 0 | 73,408 | 13 | 146,816 |
Tags: brute force, graphs
Correct Solution:
```
n, m = map(int, input().split())
edges = [[*map(int, input().split())] for _ in range(m)]
print(max(len({tuple(sorted((mask // (6 ** (x - 1))) % 6 for x in e)) for e in edges}) for mask in range(6 ** n)))
``` | output | 1 | 73,408 | 13 | 146,817 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anadi has a set of dominoes. Every domino has two parts, and each part contains some dots. For every a and b such that 1 ≤ a ≤ b ≤ 6, there is exactly one domino with a dots on one half and b dots on the other half. The set contains exactly ... | instruction | 0 | 73,409 | 13 | 146,818 |
Tags: brute force, graphs
Correct Solution:
```
import itertools
n, m = map(int, input().split())
edge = [[0 for _ in range(n)] for _ in range(n)]
for i in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
edge[a][b] = 1
edge[b][a] = 1
ans = 0
d = [0] * n
for d in list(itertools.product(rang... | output | 1 | 73,409 | 13 | 146,819 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anadi has a set of dominoes. Every domino has two parts, and each part contains some dots. For every a and b such that 1 ≤ a ≤ b ≤ 6, there is exactly one domino with a dots on one half and b dots on the other half. The set contains exactly ... | instruction | 0 | 73,410 | 13 | 146,820 |
Tags: brute force, graphs
Correct Solution:
```
n,m=map(int,input().split())
d=[]
if n<7:
print(m)
exit(0)
for i in range(8):
d.append(set())
for i in range(m):
a,b=map(int,input().split())
d[a-1].add(b-1)
d[b-1].add(a-1)
minn=100
for i in range(0,7):
for j in range(0,7):
ss=d[i]&d[... | output | 1 | 73,410 | 13 | 146,821 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anadi has a set of dominoes. Every domino has two parts, and each part contains some dots. For every a and b such that 1 ≤ a ≤ b ≤ 6, there is exactly one domino with a dots on one half and b dots on the other half. The set contains exactly ... | instruction | 0 | 73,411 | 13 | 146,822 |
Tags: brute force, graphs
Correct Solution:
```
n, m = map(int, input().split())
g = [[]]*(n+1)
for i in range(m):
a, b = map(int, input().split())
g[a] = g[a][:] + [b]
g[b] = g[b][:] + [a]
if n==7:
M = 0
for i in range(1, n+1):
for j in range(1, n+1):
if i == j:
continue
N = []
for k in g[i]+g... | output | 1 | 73,411 | 13 | 146,823 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anadi has a set of dominoes. Every domino has two parts, and each part contains some dots. For every a and b such that 1 ≤ a ≤ b ≤ 6, there is exactly one domino with a dots on one half and b dots on the other half. The set contains exactly ... | instruction | 0 | 73,412 | 13 | 146,824 |
Tags: brute force, graphs
Correct Solution:
```
n,m=map(int,input().split())
L=[]
for i in range(n+1):
h=[]
L.append(h)
arr=[]
for i in range(m):
u,v=map(int,input().split())
L[u].append(v)
L[v].append(u)
arr.append((u,v))
if(n<7):
print(m)
else:
ans=0
for i in range(1,8):
e... | output | 1 | 73,412 | 13 | 146,825 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anadi has a set of dominoes. Every domino has two parts, and each part contains some dots. For every a and b such that 1 ≤ a ≤ b ≤ 6, there is exactly one domino with a dots on one half and b dots on the other half. The set contains exactly ... | instruction | 0 | 73,413 | 13 | 146,826 |
Tags: brute force, graphs
Correct Solution:
```
n , m = map(int,input().split())
lis=[]
for i in range(7):
lis.append(set())
for i in range(m):
a , b = map(int,input().split())
lis[a-1].add(b)
lis[b-1].add(a)
if n<=6:
print(m)
else:
ma=1000000
for i in range(7):
for j in range(i+1,7... | output | 1 | 73,413 | 13 | 146,827 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Anadi has a set of dominoes. Every domino has two parts, and each part contains some dots. For every a and b such that 1 ≤ a ≤ b ≤ 6, there is exactly one domino with a dots on one half and b do... | instruction | 0 | 73,414 | 13 | 146,828 |
Yes | output | 1 | 73,414 | 13 | 146,829 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Anadi has a set of dominoes. Every domino has two parts, and each part contains some dots. For every a and b such that 1 ≤ a ≤ b ≤ 6, there is exactly one domino with a dots on one half and b do... | instruction | 0 | 73,415 | 13 | 146,830 |
Yes | output | 1 | 73,415 | 13 | 146,831 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.