message stringlengths 2 22.8k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 16 109k | cluster float64 1 1 | __index_level_0__ int64 32 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N towns in Takahashi Kingdom. They are conveniently numbered 1 through N.
Takahashi the king is planning to go on a tour of inspection for M days. He will determine a sequence of town... | instruction | 0 | 8,952 | 1 | 17,904 |
No | output | 1 | 8,952 | 1 | 17,905 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N towns in Takahashi Kingdom. They are conveniently numbered 1 through N.
Takahashi the king is planning to go on a tour of inspection for M days. He will determine a sequence of town... | instruction | 0 | 8,953 | 1 | 17,906 |
No | output | 1 | 8,953 | 1 | 17,907 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N towns in Takahashi Kingdom. They are conveniently numbered 1 through N.
Takahashi the king is planning to go on a tour of inspection for M days. He will determine a sequence of town... | instruction | 0 | 8,954 | 1 | 17,908 |
No | output | 1 | 8,954 | 1 | 17,909 |
Provide a correct Python 3 solution for this coding contest problem.
When a boy was cleaning up after his grand father passing, he found an old paper:
<image>
In addition, other side of the paper says that "go ahead a number of steps equivalent to the first integer, and turn clockwise by degrees equivalent to the ... | instruction | 0 | 8,955 | 1 | 17,910 |
"Correct Solution:
```
import math
Tre = []
num = 0
while True:
li = list(map(int,input().split(",")))
if li == [0,0]:
break
Tre.append(li)
num += 1
x,y = 0,0
deg = 90
for i in range(num):
x,y = x + Tre[i][0]*math.cos(math.pi*deg/180),y + Tre[i][0]*math.sin(math.pi*deg/180)
deg = deg - T... | output | 1 | 8,955 | 1 | 17,911 |
Provide a correct Python 3 solution for this coding contest problem.
When a boy was cleaning up after his grand father passing, he found an old paper:
<image>
In addition, other side of the paper says that "go ahead a number of steps equivalent to the first integer, and turn clockwise by degrees equivalent to the ... | instruction | 0 | 8,957 | 1 | 17,914 |
"Correct Solution:
```
import sys
import math
def sign(x):
if x>=0:
return 1.0
else:
return -1.0
pi = math.pi
deg = 0.0
pos_x = 0.0
pos_y = 0.0
lines = sys.stdin.readlines()
for line in lines:
line = line.split(",")
inp = []
for i in line:
inp.append(int(i))
if inp[0]>0... | output | 1 | 8,957 | 1 | 17,915 |
Provide a correct Python 3 solution for this coding contest problem.
When a boy was cleaning up after his grand father passing, he found an old paper:
<image>
In addition, other side of the paper says that "go ahead a number of steps equivalent to the first integer, and turn clockwise by degrees equivalent to the ... | instruction | 0 | 8,958 | 1 | 17,916 |
"Correct Solution:
```
from math import sin,cos,pi
x = 0
y = 0
ca = 90
while True:
d, a = list(map(int, input().split(",")))
if d or a:
x += d*cos(ca*pi/180)
y += d*sin(ca*pi/180)
ca -= a
else:
break
print(int(x))
print(int(y))
``` | output | 1 | 8,958 | 1 | 17,917 |
Provide a correct Python 3 solution for this coding contest problem.
When a boy was cleaning up after his grand father passing, he found an old paper:
<image>
In addition, other side of the paper says that "go ahead a number of steps equivalent to the first integer, and turn clockwise by degrees equivalent to the ... | instruction | 0 | 8,959 | 1 | 17,918 |
"Correct Solution:
```
import math
import cmath
coordinates = 0
ang = 90
while True:
line = list(map(float, input().split(",")))
if line[0] == 0 and line[1] == 0:
break
coordinates += cmath.rect(line[0], math.radians(ang))
ang -= line[1]
print(int(coordinates.real))
print(int(coordinates.imag... | output | 1 | 8,959 | 1 | 17,919 |
Provide a correct Python 3 solution for this coding contest problem.
When a boy was cleaning up after his grand father passing, he found an old paper:
<image>
In addition, other side of the paper says that "go ahead a number of steps equivalent to the first integer, and turn clockwise by degrees equivalent to the ... | instruction | 0 | 8,960 | 1 | 17,920 |
"Correct Solution:
```
import cmath
import math
z = 0 + 0j
theta = 90
while True:
r, phi = map(int, input().split(","))
if r == phi == 0:
break
z += cmath.rect(r, math.radians(theta))
theta = (theta - phi) % 360
print(math.trunc(z.real))
print(math.trunc(z.imag))
``` | output | 1 | 8,960 | 1 | 17,921 |
Provide a correct Python 3 solution for this coding contest problem.
When a boy was cleaning up after his grand father passing, he found an old paper:
<image>
In addition, other side of the paper says that "go ahead a number of steps equivalent to the first integer, and turn clockwise by degrees equivalent to the ... | instruction | 0 | 8,961 | 1 | 17,922 |
"Correct Solution:
```
# AOJ 0016 Treasure Hunt
# Python3 2018.6.15 bal4u
import math
PI = 3.1415926535897932384626433832795
M = 0.01745329251994329576923690768489
EPS = 1e-8
r, q, f = 0, 90*M, 0
while True:
d, a = list(map(int, input().split(',')))
if d == 0 and a == 0: break
r2 = math.sqrt(r*r + d*d - 2*r*d*mat... | output | 1 | 8,961 | 1 | 17,923 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Last summer Peter was at his granny's in the country, when a wolf attacked sheep in the nearby forest. Now he fears to walk through the forest, to walk round the forest, even to get out of the house. He explains this not by the fear of the w... | instruction | 0 | 9,331 | 1 | 18,662 |
Tags: combinatorics, dp
Correct Solution:
```
__author__ = 'Darren'
def solve():
n = int(input())
a, b, c, mod = 2, 2, 4, 1000000009
while n > 2:
a = (a << 1) % mod
c = c * (a - 3) % mod
b = (b + c) % mod
n -= 2
print((b * b + 1) * 2 % mod)
if __name__ == '__main__':
... | output | 1 | 9,331 | 1 | 18,663 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Last summer Peter was at his granny's in the country, when a wolf attacked sheep in the nearby forest. Now he fears to walk through the forest, to walk round the forest, even to get out of the house. He explains this not by the fear of the w... | instruction | 0 | 9,332 | 1 | 18,664 |
Tags: combinatorics, dp
Correct Solution:
```
n=int(input())
z=8
y=[]
for i in range(n//2-1):
y.append((z-3)%1000000009)
z*=2
z%=1000000009
if n==2:
print(10)
else:
a=4
for i in range(n//2,2,-1):
a*=y[i-3]
a+=4
a%=1000000009
a+=2
print(2*(a**2+1)%1000000009)
``` | output | 1 | 9,332 | 1 | 18,665 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Last summer Peter was at his granny's in the country, when a wolf attacked sheep in the nearby forest. Now he fears to walk through the forest, to walk round the forest, even to get out of the house. He explains this not by the fear of the w... | instruction | 0 | 9,333 | 1 | 18,666 |
Tags: combinatorics, dp
Correct Solution:
```
a,b,c,m=1,2,4,10**9+9
n=int(input())
for i in range(1,n//2):
c=c*a%m
b=(b+c)%m
a=(2*a+3)%m
print((b*b+1)*2%m)
``` | output | 1 | 9,333 | 1 | 18,667 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Last summer Peter was at his granny's in the country, when a wolf attacked sheep in the nearby forest. Now he fears to walk through the forest, to walk round the forest, even to get out of the house. He explains this not by the fear of the w... | instruction | 0 | 9,334 | 1 | 18,668 |
Tags: combinatorics, dp
Correct Solution:
```
# METO Bot 0.9.9
a,b,c,m=1,2,4,10**9+9
n=int(input())
for i in range(1,n//2):
c=c*a%m
b=(b+c)%m
a=(2*a+3)%m
print((b*b+1)*2%m)
``` | output | 1 | 9,334 | 1 | 18,669 |
Provide tags and a correct Python 2 solution for this coding contest problem.
On vacations n pupils decided to go on excursion and gather all together. They need to overcome the path with the length l meters. Each of the pupils will go with the speed equal to v1. To get to the excursion quickly, it was decided to rent... | instruction | 0 | 9,527 | 1 | 19,054 |
Tags: binary search, math
Correct Solution:
```
from sys import stdin, stdout
from collections import Counter, defaultdict
from itertools import permutations, combinations
raw_input = stdin.readline
from math import ceil
pr = stdout.write
def in_num():
return int(raw_input())
def in_arr():
return map(int,ra... | output | 1 | 9,527 | 1 | 19,055 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On vacations n pupils decided to go on excursion and gather all together. They need to overcome the path with the length l meters. Each of the pupils will go with the speed equal to v1. To get to the excursion quickly, it was decided to rent... | instruction | 0 | 9,528 | 1 | 19,056 |
Tags: binary search, math
Correct Solution:
```
array = list(map(int,input().split()))
n = int(array[0])
l = int(array[1])
v1 = int(array[2])
v2 = int(array[3])
k = int(array[4])
bus = n//k
if n%k != 0:
bus += 1
V = (v1+v2) + 2*v2*(bus-1)
U = (v1+v2) + 2*v1*(bus-1)
print (l*V/U/v2)
``` | output | 1 | 9,528 | 1 | 19,057 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On vacations n pupils decided to go on excursion and gather all together. They need to overcome the path with the length l meters. Each of the pupils will go with the speed equal to v1. To get to the excursion quickly, it was decided to rent... | instruction | 0 | 9,529 | 1 | 19,058 |
Tags: binary search, math
Correct Solution:
```
n, l, v1, v2, k = map(int, input().split())
diff = v2 - v1
n = (n + k - 1) // k * 2
p1 = (n * v2 - diff) * l
p2 = (n * v1 + diff) * v2
print(p1 / p2)
``` | output | 1 | 9,529 | 1 | 19,059 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On vacations n pupils decided to go on excursion and gather all together. They need to overcome the path with the length l meters. Each of the pupils will go with the speed equal to v1. To get to the excursion quickly, it was decided to rent... | instruction | 0 | 9,530 | 1 | 19,060 |
Tags: binary search, math
Correct Solution:
```
#coding=utf-8
import sys
eps = 1e-6
def solve(n, l, v1, v2):
t2 = 1.0 * (v1 + v2) * l / (n * (v1 + v2) * v2 - (n - 1) * v2 * (v2 - v1))
l2 = v2 * t2
l1 = l - l2
t1 = l1 / v1
#print(t1, l1, t2, l2)
return t1 + t2
#print(solve(3, 6, 1, 2))
#print(s... | output | 1 | 9,530 | 1 | 19,061 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On vacations n pupils decided to go on excursion and gather all together. They need to overcome the path with the length l meters. Each of the pupils will go with the speed equal to v1. To get to the excursion quickly, it was decided to rent... | instruction | 0 | 9,531 | 1 | 19,062 |
Tags: binary search, math
Correct Solution:
```
n, L, v1, v2, k = map(int, input().split())
n = (n + k - 1) // k * 2
dif = v2 - v1
p1 = (n * v2 - dif) * L
p2 = (n * v1 + dif) * v2
ans = p1 / p2
print(ans)
``` | output | 1 | 9,531 | 1 | 19,063 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On vacations n pupils decided to go on excursion and gather all together. They need to overcome the path with the length l meters. Each of the pupils will go with the speed equal to v1. To get to the excursion quickly, it was decided to rent... | instruction | 0 | 9,532 | 1 | 19,064 |
Tags: binary search, math
Correct Solution:
```
#!/usr/local/bin/python3
# -*- coding:utf-8 -*-
import math
inputParams = input().split()
n = int(inputParams[0])
l = int(inputParams[1])
v1 = int(inputParams[2])
v2 = int(inputParams[3])
k = int(inputParams[4])
# 运送次数
times = math.ceil(n / k)
t1 = l / (v2 + (2 * v2 /... | output | 1 | 9,532 | 1 | 19,065 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On vacations n pupils decided to go on excursion and gather all together. They need to overcome the path with the length l meters. Each of the pupils will go with the speed equal to v1. To get to the excursion quickly, it was decided to rent... | instruction | 0 | 9,533 | 1 | 19,066 |
Tags: binary search, math
Correct Solution:
```
n, l, v1, v2, k = [int(x) for x in input().split()]
x = (n+k-1)//k
print((l - ((l/v1)/((x/(v2-v1)) + ((x-1)/(v2+v1)) + (1/v1))))/v1)
``` | output | 1 | 9,533 | 1 | 19,067 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On vacations n pupils decided to go on excursion and gather all together. They need to overcome the path with the length l meters. Each of the pupils will go with the speed equal to v1. To get to the excursion quickly, it was decided to rent... | instruction | 0 | 9,534 | 1 | 19,068 |
Tags: binary search, math
Correct Solution:
```
n, l, v1, v2, k = list(map(int, input().split()))
n = (n+k-1)//k
t = l / ((v1 + (v2 - v1) * v1 / (v1 + v2)) * (n - 1) + v2)
print(t * n + t * (v2 - v1) / (v1 + v2) * (n - 1))
``` | output | 1 | 9,534 | 1 | 19,069 |
Provide tags and a correct Python 3 solution for this coding contest problem.
On vacations n pupils decided to go on excursion and gather all together. They need to overcome the path with the length l meters. Each of the pupils will go with the speed equal to v1. To get to the excursion quickly, it was decided to rent... | instruction | 0 | 9,535 | 1 | 19,070 |
Tags: binary search, math
Correct Solution:
```
n, L, v1, v2, k = map(int, input().split())
n = (n + k - 1) // k * 2
dif = v2 - v1
p1 = (n * v2 - dif) * L
p2 = (n * v1 + dif) * v2
ans = p1 / p2
print('%.7f' % ans)
``` | output | 1 | 9,535 | 1 | 19,071 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On vacations n pupils decided to go on excursion and gather all together. They need to overcome the path with the length l meters. Each of the pupils will go with the speed equal to v1. To get t... | instruction | 0 | 9,536 | 1 | 19,072 |
Yes | output | 1 | 9,536 | 1 | 19,073 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On vacations n pupils decided to go on excursion and gather all together. They need to overcome the path with the length l meters. Each of the pupils will go with the speed equal to v1. To get t... | instruction | 0 | 9,537 | 1 | 19,074 |
Yes | output | 1 | 9,537 | 1 | 19,075 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On vacations n pupils decided to go on excursion and gather all together. They need to overcome the path with the length l meters. Each of the pupils will go with the speed equal to v1. To get t... | instruction | 0 | 9,538 | 1 | 19,076 |
Yes | output | 1 | 9,538 | 1 | 19,077 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On vacations n pupils decided to go on excursion and gather all together. They need to overcome the path with the length l meters. Each of the pupils will go with the speed equal to v1. To get t... | instruction | 0 | 9,539 | 1 | 19,078 |
Yes | output | 1 | 9,539 | 1 | 19,079 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On vacations n pupils decided to go on excursion and gather all together. They need to overcome the path with the length l meters. Each of the pupils will go with the speed equal to v1. To get t... | instruction | 0 | 9,540 | 1 | 19,080 |
No | output | 1 | 9,540 | 1 | 19,081 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On vacations n pupils decided to go on excursion and gather all together. They need to overcome the path with the length l meters. Each of the pupils will go with the speed equal to v1. To get t... | instruction | 0 | 9,541 | 1 | 19,082 |
No | output | 1 | 9,541 | 1 | 19,083 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On vacations n pupils decided to go on excursion and gather all together. They need to overcome the path with the length l meters. Each of the pupils will go with the speed equal to v1. To get t... | instruction | 0 | 9,542 | 1 | 19,084 |
No | output | 1 | 9,542 | 1 | 19,085 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On vacations n pupils decided to go on excursion and gather all together. They need to overcome the path with the length l meters. Each of the pupils will go with the speed equal to v1. To get t... | instruction | 0 | 9,543 | 1 | 19,086 |
No | output | 1 | 9,543 | 1 | 19,087 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n cities and m two-way roads in Berland, each road connects two cities. It is known that there is no more than one road connecting each pair of cities, and there is no road which connects the city with itself. It is possible that t... | instruction | 0 | 9,544 | 1 | 19,088 |
Tags: constructive algorithms, dfs and similar, flows, graphs, greedy
Correct Solution:
```
def hierholzer(graph):
edges = []
for node in graph:
for neighbour in graph[node]:
if graph[node][neighbour] is False: continue
stack = [node]
parents = defaultdict(list)
... | output | 1 | 9,544 | 1 | 19,089 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n cities and m two-way roads in Berland, each road connects two cities. It is known that there is no more than one road connecting each pair of cities, and there is no road which connects the city with itself. It is possible that t... | instruction | 0 | 9,545 | 1 | 19,090 |
Tags: constructive algorithms, dfs and similar, flows, graphs, greedy
Correct Solution:
```
t = int(input())
from collections import defaultdict
for test_number in range(t):
n, m = map(int, input().split())
graph = defaultdict(dict)
for _ in range(m):
u, v = map(int, input().split())
graph[... | output | 1 | 9,545 | 1 | 19,091 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n cities and m two-way roads in Berland, each road connects two cities. It is known that there is no more than one road connecting each pair of cities, and there is no road which connects the city with itself. It is possible that t... | instruction | 0 | 9,546 | 1 | 19,092 |
Tags: constructive algorithms, dfs and similar, flows, graphs, greedy
Correct Solution:
```
import sys
from collections import defaultdict
rlines = sys.stdin.readlines()
lines = (l.strip() for l in rlines)
def eucycle(n,m,adj):
dir_edges = []
us = list(adj.keys())
for u in us:
while adj[u]:
v0 = u
v1 = a... | output | 1 | 9,546 | 1 | 19,093 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n cities and m two-way roads in Berland, each road connects two cities. It is known that there is no more than one road connecting each pair of cities, and there is no road which connects the city with itself. It is possible that t... | instruction | 0 | 9,547 | 1 | 19,094 |
Tags: constructive algorithms, dfs and similar, flows, graphs, greedy
Correct Solution:
```
import sys
import collections
rlines = sys.stdin.readlines()
lines = (l.strip() for l in rlines)
def eucycle(n,m,adj):
diredges = []
us = list(adj.keys())
for u in us:
while adj[u]:
v0 = u
... | output | 1 | 9,547 | 1 | 19,095 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n cities and m two-way roads in Berland, each road connects two cities. It is known that there is no more than one road connecting each pair of cities, and there is no road which connects the city with itself. It is possible that t... | instruction | 0 | 9,548 | 1 | 19,096 |
Tags: constructive algorithms, dfs and similar, flows, graphs, greedy
Correct Solution:
```
from collections import defaultdict, Counter
T = int(input())
for _ in range(T):
global lst
N, M = map(int, input().split())
visit = set()
oddNodes = []
directed = []
G = defaultdict(list)
oriG = def... | output | 1 | 9,548 | 1 | 19,097 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cities and m two-way roads in Berland, each road connects two cities. It is known that there is no more than one road connecting each pair of cities, and there is no road which conne... | instruction | 0 | 9,549 | 1 | 19,098 |
No | output | 1 | 9,549 | 1 | 19,099 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cities and m two-way roads in Berland, each road connects two cities. It is known that there is no more than one road connecting each pair of cities, and there is no road which conne... | instruction | 0 | 9,550 | 1 | 19,100 |
No | output | 1 | 9,550 | 1 | 19,101 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cities and m two-way roads in Berland, each road connects two cities. It is known that there is no more than one road connecting each pair of cities, and there is no road which conne... | instruction | 0 | 9,551 | 1 | 19,102 |
No | output | 1 | 9,551 | 1 | 19,103 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n cities and m two-way roads in Berland, each road connects two cities. It is known that there is no more than one road connecting each pair of cities, and there is no road which conne... | instruction | 0 | 9,552 | 1 | 19,104 |
No | output | 1 | 9,552 | 1 | 19,105 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The construction of subway in Bertown is almost finished! The President of Berland will visit this city soon to look at the new subway himself.
There are n stations in the subway. It was built according to the Bertown Transport Law:
1. F... | instruction | 0 | 9,616 | 1 | 19,232 |
Tags: dfs and similar, greedy, math
Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
if(n==1):print('1'),exit()
if(n==2):print('4'),exit()
b=[i for i in range(0,n+1)]
r=[1 for i in range(0,n+1)]
def find(x):
if b[x]==x:
return x
else:
b[x]=find(b[x])
return b[x]
for ... | output | 1 | 9,616 | 1 | 19,233 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The construction of subway in Bertown is almost finished! The President of Berland will visit this city soon to look at the new subway himself.
There are n stations in the subway. It was built according to the Bertown Transport Law:
1. F... | instruction | 0 | 9,617 | 1 | 19,234 |
Tags: dfs and similar, greedy, math
Correct Solution:
```
input()
l = [[int(x)-1,False] for x in input().split()]
loop = []
for begin in l:
if begin[1]:
continue
count = 0;
nextI = begin[0];
while not l[nextI][1]:
l[nextI][1]=True
nextI = l[nextI][0]
count += 1
loop.a... | output | 1 | 9,617 | 1 | 19,235 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The construction of subway in Bertown is almost finished! The President of Berland will visit this city soon to look at the new subway himself.
There are n stations in the subway. It was built according to the Bertown Transport Law:
1. F... | instruction | 0 | 9,618 | 1 | 19,236 |
Tags: dfs and similar, greedy, math
Correct Solution:
```
n=int(input())
p=[0]+list(map(int,input().split()))
vis=[0]*(n+1)
part=[]
for i in range(1,n+1):
if not vis[i]:
tot=0
x=i
while not vis[x]:
tot+=1
vis[x]=1
x=p[x]
part.append(tot)
part.sort(... | output | 1 | 9,618 | 1 | 19,237 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The construction of subway in Bertown is almost finished! The President of Berland will visit this city soon to look at the new subway himself.
There are n stations in the subway. It was built according to the Bertown Transport Law:
1. F... | instruction | 0 | 9,619 | 1 | 19,238 |
Tags: dfs and similar, greedy, math
Correct Solution:
```
from itertools import product
def solve():
stations = int(input())
arr = [int(x) - 1 for x in input().split(" ")]
cycles = []
discovered = {} # All the nodes already traversed
for i in arr:
# Already part of a cycle found
if... | output | 1 | 9,619 | 1 | 19,239 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The construction of subway in Bertown is almost finished! The President of Berland will visit this city soon to look at the new subway himself.
There are n stations in the subway. It was built according to the Bertown Transport Law:
1. F... | instruction | 0 | 9,620 | 1 | 19,240 |
Tags: dfs and similar, greedy, math
Correct Solution:
```
from collections import defaultdict as dd
g=dd(list)
def addE(u,v):
g[u].append(v)
g[v].append(u)
n=int(input())
l=[int(x) for x in input().split()]
for i in range(n):
addE(i+1,l[i])
visited=[False]*(n+1)
def dfs(v,count):
visited[v]=True
stack=[v]
while l... | output | 1 | 9,620 | 1 | 19,241 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The construction of subway in Bertown is almost finished! The President of Berland will visit this city soon to look at the new subway himself.
There are n stations in the subway. It was built according to the Bertown Transport Law:
1. F... | instruction | 0 | 9,621 | 1 | 19,242 |
Tags: dfs and similar, greedy, math
Correct Solution:
```
n = int(input())
p = [int(i)-1 for i in input().split()]
visited = [0 for _ in range(n)]
cycle = [0,0]
for i in range(n):
j = i
count = 0
while not visited[j]:
visited[j] = 1
count += 1
j = p[j]
if count > 0:
cycle... | output | 1 | 9,621 | 1 | 19,243 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The construction of subway in Bertown is almost finished! The President of Berland will visit this city soon to look at the new subway himself.
There are n stations in the subway. It was built according to the Bertown Transport Law:
1. F... | instruction | 0 | 9,622 | 1 | 19,244 |
Tags: dfs and similar, greedy, math
Correct Solution:
```
import sys
input = sys.stdin.readline
class Unionfind:
def __init__(self, n):
self.par = [-1]*n
self.rank = [1]*n
def root(self, x):
p = x
while not self.par[p]<0:
p = self.par[p]
... | output | 1 | 9,622 | 1 | 19,245 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The construction of subway in Bertown is almost finished! The President of Berland will visit this city soon to look at the new subway himself.
There are n stations in the subway. It was built according to the Bertown Transport Law:
1. F... | instruction | 0 | 9,623 | 1 | 19,246 |
Tags: dfs and similar, greedy, math
Correct Solution:
```
def dfs(i, Colour, P):
Stack = [i]
size = 0
while Stack:
v = Stack[-1]
if Colour[v] == 0:
Colour[v] = 1
size += 1
if Colour[P[v] - 1] == 0:
Stack.append(P[v] - 1)
else:
... | output | 1 | 9,623 | 1 | 19,247 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The construction of subway in Bertown is almost finished! The President of Berland will visit this city soon to look at the new subway himself.
There are n stations in the subway. It was built ... | instruction | 0 | 9,624 | 1 | 19,248 |
Yes | output | 1 | 9,624 | 1 | 19,249 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The construction of subway in Bertown is almost finished! The President of Berland will visit this city soon to look at the new subway himself.
There are n stations in the subway. It was built ... | instruction | 0 | 9,625 | 1 | 19,250 |
Yes | output | 1 | 9,625 | 1 | 19,251 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The construction of subway in Bertown is almost finished! The President of Berland will visit this city soon to look at the new subway himself.
There are n stations in the subway. It was built ... | instruction | 0 | 9,626 | 1 | 19,252 |
Yes | output | 1 | 9,626 | 1 | 19,253 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.