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.
Let's call an undirected graph of n vertices p-interesting, if the following conditions fulfill:
* the graph contains exactly 2n + p edges;
* the graph doesn't contain self-loops and mult... | instruction | 0 | 18,050 | 13 | 36,100 |
Yes | output | 1 | 18,050 | 13 | 36,101 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's call an undirected graph of n vertices p-interesting, if the following conditions fulfill:
* the graph contains exactly 2n + p edges;
* the graph doesn't contain self-loops and mult... | instruction | 0 | 18,051 | 13 | 36,102 |
Yes | output | 1 | 18,051 | 13 | 36,103 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's call an undirected graph of n vertices p-interesting, if the following conditions fulfill:
* the graph contains exactly 2n + p edges;
* the graph doesn't contain self-loops and mult... | instruction | 0 | 18,052 | 13 | 36,104 |
Yes | output | 1 | 18,052 | 13 | 36,105 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's call an undirected graph of n vertices p-interesting, if the following conditions fulfill:
* the graph contains exactly 2n + p edges;
* the graph doesn't contain self-loops and mult... | instruction | 0 | 18,053 | 13 | 36,106 |
Yes | output | 1 | 18,053 | 13 | 36,107 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's call an undirected graph of n vertices p-interesting, if the following conditions fulfill:
* the graph contains exactly 2n + p edges;
* the graph doesn't contain self-loops and mult... | instruction | 0 | 18,054 | 13 | 36,108 |
No | output | 1 | 18,054 | 13 | 36,109 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's call an undirected graph of n vertices p-interesting, if the following conditions fulfill:
* the graph contains exactly 2n + p edges;
* the graph doesn't contain self-loops and mult... | instruction | 0 | 18,055 | 13 | 36,110 |
No | output | 1 | 18,055 | 13 | 36,111 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's call an undirected graph of n vertices p-interesting, if the following conditions fulfill:
* the graph contains exactly 2n + p edges;
* the graph doesn't contain self-loops and mult... | instruction | 0 | 18,056 | 13 | 36,112 |
No | output | 1 | 18,056 | 13 | 36,113 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Let's call an undirected graph of n vertices p-interesting, if the following conditions fulfill:
* the graph contains exactly 2n + p edges;
* the graph doesn't contain self-loops and mult... | instruction | 0 | 18,057 | 13 | 36,114 |
No | output | 1 | 18,057 | 13 | 36,115 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a connected weighted graph with n vertices and m edges. The graph doesn't contain loops nor multiple edges. Consider some edge with id i. Let's determine for this edge the maximum ... | instruction | 0 | 18,215 | 13 | 36,430 |
No | output | 1 | 18,215 | 13 | 36,431 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a directed graph G with N vertices and M edges.
The vertices are numbered 1 to N, and the i-th edge is directed from Vertex A_i to Vertex B_i.
It is guaranteed that the graph contains no self-loops or multiple edges.
Determine whether there... | instruction | 0 | 18,323 | 13 | 36,646 |
"Correct Solution:
```
def main():
from collections import deque
n,m,*t=map(int,open(0).read().split())
i,o=[0]*n,[[]for _ in range(n)]
for a,b in zip(*[iter(t)]*2):
o[a-1]+=b-1,
i[b-1]+=1
q=deque(v for v in range(n)if i[v]<1)
r=[]
while q:
v=q.popleft()
r+=v,
for w in o[v]:
i[w]... | output | 1 | 18,323 | 13 | 36,647 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a directed graph G with N vertices and M edges.
The vertices are numbered 1 to N, and the i-th edge is directed from Vertex A_i to Vertex B_i.
It is guaranteed that the graph contains no self-loops or multiple edges.
Determine whether there... | instruction | 0 | 18,324 | 13 | 36,648 |
"Correct Solution:
```
import sys
sys.setrecursionlimit(100000)
N, M = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(M)]
R = {}
for a, b in AB:
if a in R:
R[a].append(b)
else:
R[a] = [b]
def nasu(x, e):
D[x] = 1
if x not in R:
return []
for i in R[x]:
... | output | 1 | 18,324 | 13 | 36,649 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a directed graph G with N vertices and M edges.
The vertices are numbered 1 to N, and the i-th edge is directed from Vertex A_i to Vertex B_i.
It is guaranteed that the graph contains no self-loops or multiple edges.
Determine whether there... | instruction | 0 | 18,325 | 13 | 36,650 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
n,m = map(int,input().split())
edge = [[] for _ in [0]*n]
back = [[] for _ in [0]*n]
for _ in [0]*m:
a,b = map(int,input().split())
edge[a-1].append(b-1)
back[b-1].append(a-1)
res = [None]*(n+1)
for end in range(n):
for start in edge[end... | output | 1 | 18,325 | 13 | 36,651 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a directed graph G with N vertices and M edges.
The vertices are numbered 1 to N, and the i-th edge is directed from Vertex A_i to Vertex B_i.
It is guaranteed that the graph contains no self-loops or multiple edges.
Determine whether there... | instruction | 0 | 18,326 | 13 | 36,652 |
"Correct Solution:
```
n, m = map(int, input().split())
ans = [0] * (n + 1)
import collections
g = collections.defaultdict(set)
for _ in range(m):
a, b = map(int, input().split())
g[a-1].add(b-1)
def minCircle(s):
f = [None] * n
visited = set()
q = []
q.append(s)
while q:
node = q.... | output | 1 | 18,326 | 13 | 36,653 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a directed graph G with N vertices and M edges.
The vertices are numbered 1 to N, and the i-th edge is directed from Vertex A_i to Vertex B_i.
It is guaranteed that the graph contains no self-loops or multiple edges.
Determine whether there... | instruction | 0 | 18,327 | 13 | 36,654 |
"Correct Solution:
```
N,M=map(int,input().split())
AB=[list(map(int,input().split())) for i in range(M)]
c=[[] for i in range(N)]
for a,b in AB:
c[a-1].append(b-1)
from collections import deque
import sys
sys.setrecursionlimit(10**9)
def f2(q):
s=set(q)
for a,b in AB:
if a in s and b in s:
... | output | 1 | 18,327 | 13 | 36,655 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a directed graph G with N vertices and M edges.
The vertices are numbered 1 to N, and the i-th edge is directed from Vertex A_i to Vertex B_i.
It is guaranteed that the graph contains no self-loops or multiple edges.
Determine whether there... | instruction | 0 | 18,328 | 13 | 36,656 |
"Correct Solution:
```
from collections import deque
def resolve():
N, M = map(int, input().split())
G = [[] for _ in range(N)]
for _ in range(M):
a, b = map(lambda x: int(x) - 1, input().split())
G[a].append(b)
shortest = N + 1
res = []
for s in range(N):
dist = [-1] *... | output | 1 | 18,328 | 13 | 36,657 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a directed graph G with N vertices and M edges.
The vertices are numbered 1 to N, and the i-th edge is directed from Vertex A_i to Vertex B_i.
It is guaranteed that the graph contains no self-loops or multiple edges.
Determine whether there... | instruction | 0 | 18,329 | 13 | 36,658 |
"Correct Solution:
```
from collections import deque
import sys
sys.setrecursionlimit(10**6)
class DirectedGraph:
def __init__(self, adj):
self.n = len(adj)
self.adj = adj
self.is_asyclic = False
self.max_path_len = None
def topological_sort(self):
indegree = [0] * self... | output | 1 | 18,329 | 13 | 36,659 |
Provide a correct Python 3 solution for this coding contest problem.
Given is a directed graph G with N vertices and M edges.
The vertices are numbered 1 to N, and the i-th edge is directed from Vertex A_i to Vertex B_i.
It is guaranteed that the graph contains no self-loops or multiple edges.
Determine whether there... | instruction | 0 | 18,330 | 13 | 36,660 |
"Correct Solution:
```
from collections import deque
def solve_f(n, g):
for i in range(n):
parent = [-1] * n
queue = deque([i])
done = False
answer = []
# bfs
while len(queue) > 0:
p = queue.popleft()
for q in g[p]:
if q == i... | output | 1 | 18,330 | 13 | 36,661 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a directed graph G with N vertices and M edges.
The vertices are numbered 1 to N, and the i-th edge is directed from Vertex A_i to Vertex B_i.
It is guaranteed that the graph contains n... | instruction | 0 | 18,331 | 13 | 36,662 |
Yes | output | 1 | 18,331 | 13 | 36,663 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a directed graph G with N vertices and M edges.
The vertices are numbered 1 to N, and the i-th edge is directed from Vertex A_i to Vertex B_i.
It is guaranteed that the graph contains n... | instruction | 0 | 18,332 | 13 | 36,664 |
Yes | output | 1 | 18,332 | 13 | 36,665 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a directed graph G with N vertices and M edges.
The vertices are numbered 1 to N, and the i-th edge is directed from Vertex A_i to Vertex B_i.
It is guaranteed that the graph contains n... | instruction | 0 | 18,333 | 13 | 36,666 |
Yes | output | 1 | 18,333 | 13 | 36,667 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a directed graph G with N vertices and M edges.
The vertices are numbered 1 to N, and the i-th edge is directed from Vertex A_i to Vertex B_i.
It is guaranteed that the graph contains n... | instruction | 0 | 18,334 | 13 | 36,668 |
Yes | output | 1 | 18,334 | 13 | 36,669 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a directed graph G with N vertices and M edges.
The vertices are numbered 1 to N, and the i-th edge is directed from Vertex A_i to Vertex B_i.
It is guaranteed that the graph contains n... | instruction | 0 | 18,335 | 13 | 36,670 |
No | output | 1 | 18,335 | 13 | 36,671 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a directed graph G with N vertices and M edges.
The vertices are numbered 1 to N, and the i-th edge is directed from Vertex A_i to Vertex B_i.
It is guaranteed that the graph contains n... | instruction | 0 | 18,336 | 13 | 36,672 |
No | output | 1 | 18,336 | 13 | 36,673 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a directed graph G with N vertices and M edges.
The vertices are numbered 1 to N, and the i-th edge is directed from Vertex A_i to Vertex B_i.
It is guaranteed that the graph contains n... | instruction | 0 | 18,337 | 13 | 36,674 |
No | output | 1 | 18,337 | 13 | 36,675 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given is a directed graph G with N vertices and M edges.
The vertices are numbered 1 to N, and the i-th edge is directed from Vertex A_i to Vertex B_i.
It is guaranteed that the graph contains n... | instruction | 0 | 18,338 | 13 | 36,676 |
No | output | 1 | 18,338 | 13 | 36,677 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which performs the following operations to a binary search tree $T$ by adding the find operation to A: Binary Search Tree I.
* insert $k$: Insert a node containing $k$ as key into $T$.
* find $k$: Report whether $T$ has a node conta... | instruction | 0 | 18,533 | 13 | 37,066 |
"Correct Solution:
```
import sys
class Node:
__slots__ = ['key', 'left', 'right']
def __init__(self, key):
self.key = key
self.left = self.right = None
root = None
def insert(key):
global root
x, y = root, None
while x:
y = x
if key < x.key:
x = x.left
... | output | 1 | 18,533 | 13 | 37,067 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which performs the following operations to a binary search tree $T$ by adding the find operation to A: Binary Search Tree I.
* insert $k$: Insert a node containing $k$ as key into $T$.
* find $k$: Report whether $T$ has a node conta... | instruction | 0 | 18,534 | 13 | 37,068 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
print = sys.stdout.write
class Node:
__slots__ = ["data", "left", "right"]
def __init__(self, data):
self.data = data
self.left = None
self.right = None
class BinarySearchTree:
__slots__ = ["root"]
def __init__(self):... | output | 1 | 18,534 | 13 | 37,069 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which performs the following operations to a binary search tree $T$ by adding the find operation to A: Binary Search Tree I.
* insert $k$: Insert a node containing $k$ as key into $T$.
* find $k$: Report whether $T$ has a node conta... | instruction | 0 | 18,535 | 13 | 37,070 |
"Correct Solution:
```
import sys
NIL = -1
class Node:
def __init__(self, key):
self.key = key
self.parent = NIL
self.left = NIL
self.right = NIL
class Tree:
def __init__(self):
self.root = NIL
def insert(self, z):
y = NIL
x = self.root
... | output | 1 | 18,535 | 13 | 37,071 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which performs the following operations to a binary search tree $T$ by adding the find operation to A: Binary Search Tree I.
* insert $k$: Insert a node containing $k$ as key into $T$.
* find $k$: Report whether $T$ has a node conta... | instruction | 0 | 18,536 | 13 | 37,072 |
"Correct Solution:
```
class Node:
def __init__(self):
self.key, self.left, self.right, self.parent = 0, None, None, None
class BST:
def __init__(self):
self.root = None
def insert(self, key):
x, y = self.root, None
z = Node()
z.key = key
while x != None... | output | 1 | 18,536 | 13 | 37,073 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which performs the following operations to a binary search tree $T$ by adding the find operation to A: Binary Search Tree I.
* insert $k$: Insert a node containing $k$ as key into $T$.
* find $k$: Report whether $T$ has a node conta... | instruction | 0 | 18,537 | 13 | 37,074 |
"Correct Solution:
```
class node:
def __init__(self):
self.p = -1
self.l = -1
self.r = -1
def preParse(u):
if u == -1:
return
print(" " + str(u), end = '')
preParse(T[u].l)
preParse(T[u].r)
def inParse(u):
if u == -1:
return
inParse(T[u].l)
prin... | output | 1 | 18,537 | 13 | 37,075 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which performs the following operations to a binary search tree $T$ by adding the find operation to A: Binary Search Tree I.
* insert $k$: Insert a node containing $k$ as key into $T$.
* find $k$: Report whether $T$ has a node conta... | instruction | 0 | 18,538 | 13 | 37,076 |
"Correct Solution:
```
class node():
def __init__(self, key, parent, left, right):
self.key = key
self.parent = parent
self.left = left
self.right = right
root = None
def insert(z):
global root
y = None
x = root
while x != None:
y = x
if z.key < x... | output | 1 | 18,538 | 13 | 37,077 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which performs the following operations to a binary search tree $T$ by adding the find operation to A: Binary Search Tree I.
* insert $k$: Insert a node containing $k$ as key into $T$.
* find $k$: Report whether $T$ has a node conta... | instruction | 0 | 18,539 | 13 | 37,078 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(100000)
def insert(k, node):
if k < node:
if tree[node]["left"] == None:
tree[node]["left"] = k
tree[k] = {"parent": node, "left": None, "right": None}
return
else:
insert... | output | 1 | 18,539 | 13 | 37,079 |
Provide a correct Python 3 solution for this coding contest problem.
Write a program which performs the following operations to a binary search tree $T$ by adding the find operation to A: Binary Search Tree I.
* insert $k$: Insert a node containing $k$ as key into $T$.
* find $k$: Report whether $T$ has a node conta... | instruction | 0 | 18,540 | 13 | 37,080 |
"Correct Solution:
```
class Tree():
def __init__(self):
self.nodes = {}
self.root = None
def add_node(self, key):
if key not in self.nodes:
self.nodes[key] = Node(key)
def insert(self, z_key):
self.add_node(z_key)
z = self.nodes[z_key]
y = None ... | output | 1 | 18,540 | 13 | 37,081 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which performs the following operations to a binary search tree $T$ by adding the find operation to A: Binary Search Tree I.
* insert $k$: Insert a node containing $k$ as key i... | instruction | 0 | 18,541 | 13 | 37,082 |
Yes | output | 1 | 18,541 | 13 | 37,083 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which performs the following operations to a binary search tree $T$ by adding the find operation to A: Binary Search Tree I.
* insert $k$: Insert a node containing $k$ as key i... | instruction | 0 | 18,542 | 13 | 37,084 |
Yes | output | 1 | 18,542 | 13 | 37,085 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which performs the following operations to a binary search tree $T$ by adding the find operation to A: Binary Search Tree I.
* insert $k$: Insert a node containing $k$ as key i... | instruction | 0 | 18,543 | 13 | 37,086 |
Yes | output | 1 | 18,543 | 13 | 37,087 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which performs the following operations to a binary search tree $T$ by adding the find operation to A: Binary Search Tree I.
* insert $k$: Insert a node containing $k$ as key i... | instruction | 0 | 18,544 | 13 | 37,088 |
Yes | output | 1 | 18,544 | 13 | 37,089 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which performs the following operations to a binary search tree $T$ by adding the find operation to A: Binary Search Tree I.
* insert $k$: Insert a node containing $k$ as key i... | instruction | 0 | 18,545 | 13 | 37,090 |
No | output | 1 | 18,545 | 13 | 37,091 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which performs the following operations to a binary search tree $T$ by adding the find operation to A: Binary Search Tree I.
* insert $k$: Insert a node containing $k$ as key i... | instruction | 0 | 18,546 | 13 | 37,092 |
No | output | 1 | 18,546 | 13 | 37,093 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which performs the following operations to a binary search tree $T$ by adding the find operation to A: Binary Search Tree I.
* insert $k$: Insert a node containing $k$ as key i... | instruction | 0 | 18,547 | 13 | 37,094 |
No | output | 1 | 18,547 | 13 | 37,095 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Write a program which performs the following operations to a binary search tree $T$ by adding the find operation to A: Binary Search Tree I.
* insert $k$: Insert a node containing $k$ as key i... | instruction | 0 | 18,548 | 13 | 37,096 |
No | output | 1 | 18,548 | 13 | 37,097 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem.
A legendary tree rests deep in the forest. Legend has it that individuals who realize this tree would eternally become a Legendary Grandmaster.
To help you dete... | instruction | 0 | 18,606 | 13 | 37,212 |
No | output | 1 | 18,606 | 13 | 37,213 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem.
A legendary tree rests deep in the forest. Legend has it that individuals who realize this tree would eternally become a Legendary Grandmaster.
To help you dete... | instruction | 0 | 18,607 | 13 | 37,214 |
No | output | 1 | 18,607 | 13 | 37,215 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Note that this is the second problem of the two similar problems. You can hack this problem if you solve it. But you can hack the previous problem only if you solve both problems.
You are given... | instruction | 0 | 18,624 | 13 | 37,248 |
No | output | 1 | 18,624 | 13 | 37,249 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Note that this is the second problem of the two similar problems. You can hack this problem if you solve it. But you can hack the previous problem only if you solve both problems.
You are given... | instruction | 0 | 18,625 | 13 | 37,250 |
No | output | 1 | 18,625 | 13 | 37,251 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Note that this is the second problem of the two similar problems. You can hack this problem if you solve it. But you can hack the previous problem only if you solve both problems.
You are given... | instruction | 0 | 18,626 | 13 | 37,252 |
No | output | 1 | 18,626 | 13 | 37,253 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a positive integer D. Let's build the following graph from it:
* each vertex is a divisor of D (not necessarily prime, 1 and D itself are also included);
* two vertices x and y (x > y) have an undirected edge between the... | instruction | 0 | 18,667 | 13 | 37,334 |
Tags: combinatorics, graphs, greedy, math, number theory
Correct Solution:
```
from sys import stdin
mod=998244353
N=10**5+3
fac=[1]*(N+1)
for i in range(1,N+1):
fac[i]=fac[i-1]*i%mod
inv_fac=[1]*(N+1)
inv_fac[N]=pow(fac[N],mod-2,mod)
for i in range(N-1,0,-1):
inv_fac[i]=inv_fac[i+1]*(i+1)%mod
D=int(stdin.readline())... | output | 1 | 18,667 | 13 | 37,335 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a positive integer D. Let's build the following graph from it:
* each vertex is a divisor of D (not necessarily prime, 1 and D itself are also included);
* two vertices x and y (x > y) have an undirected edge between the... | instruction | 0 | 18,668 | 13 | 37,336 |
Tags: combinatorics, graphs, greedy, math, number theory
Correct Solution:
```
# region fastio # from https://codeforces.com/contest/1333/submission/75948789
import sys, io, os
BUFSIZE = 8192
class FastIO(io.IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffe... | output | 1 | 18,668 | 13 | 37,337 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a positive integer D. Let's build the following graph from it:
* each vertex is a divisor of D (not necessarily prime, 1 and D itself are also included);
* two vertices x and y (x > y) have an undirected edge between the... | instruction | 0 | 18,669 | 13 | 37,338 |
Tags: combinatorics, graphs, greedy, math, number theory
Correct Solution:
```
import io, os
import sys
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
D=int(input())
q=int(input())
mod=998244353
Q=[tuple(map(int,input().split())) for i in range(q)]
from math import gcd
from math import sqrt
L=[]
Q2=[]
f... | output | 1 | 18,669 | 13 | 37,339 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a positive integer D. Let's build the following graph from it:
* each vertex is a divisor of D (not necessarily prime, 1 and D itself are also included);
* two vertices x and y (x > y) have an undirected edge between the... | instruction | 0 | 18,670 | 13 | 37,340 |
Tags: combinatorics, graphs, greedy, math, number theory
Correct Solution:
```
mod = 998244353
eps = 10**-9
def main():
import sys
input = sys.stdin.buffer.readline
# comb init
# mod = 1000000007
nmax = 100 # change here
fac = [0] * nmax
finv = [0] * nmax
inv = [0] * nmax
fac[0] ... | output | 1 | 18,670 | 13 | 37,341 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.