message stringlengths 2 65.1k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 0 108k | cluster float64 14 14 | __index_level_0__ int64 0 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
VK news recommendation system daily selects interesting publications of one of n disjoint categories for each user. Each publication belongs to exactly one category. For each category i batch al... | instruction | 0 | 62,449 | 14 | 124,898 |
Yes | output | 1 | 62,449 | 14 | 124,899 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
VK news recommendation system daily selects interesting publications of one of n disjoint categories for each user. Each publication belongs to exactly one category. For each category i batch al... | instruction | 0 | 62,450 | 14 | 124,900 |
Yes | output | 1 | 62,450 | 14 | 124,901 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
VK news recommendation system daily selects interesting publications of one of n disjoint categories for each user. Each publication belongs to exactly one category. For each category i batch al... | instruction | 0 | 62,451 | 14 | 124,902 |
Yes | output | 1 | 62,451 | 14 | 124,903 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
VK news recommendation system daily selects interesting publications of one of n disjoint categories for each user. Each publication belongs to exactly one category. For each category i batch al... | instruction | 0 | 62,452 | 14 | 124,904 |
No | output | 1 | 62,452 | 14 | 124,905 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
VK news recommendation system daily selects interesting publications of one of n disjoint categories for each user. Each publication belongs to exactly one category. For each category i batch al... | instruction | 0 | 62,453 | 14 | 124,906 |
No | output | 1 | 62,453 | 14 | 124,907 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
VK news recommendation system daily selects interesting publications of one of n disjoint categories for each user. Each publication belongs to exactly one category. For each category i batch al... | instruction | 0 | 62,454 | 14 | 124,908 |
No | output | 1 | 62,454 | 14 | 124,909 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
VK news recommendation system daily selects interesting publications of one of n disjoint categories for each user. Each publication belongs to exactly one category. For each category i batch al... | instruction | 0 | 62,455 | 14 | 124,910 |
No | output | 1 | 62,455 | 14 | 124,911 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A super computer has been built in the Turtle Academy of Sciences. The computer consists of n·m·k CPUs. The architecture was the paralellepiped of size n × m × k, split into 1 × 1 × 1 cells, each cell contains exactly one CPU. Thus, each CPU... | instruction | 0 | 62,750 | 14 | 125,500 |
Tags: brute force, dfs and similar, graphs
Correct Solution:
```
n,m,k=(int(z) for z in input().split())
M=[]
for i in range(n):
for j in range(m):
s=input()
for p in range(len(s)):
M+=[int(s[p])]
if i!=n-1:
s=input()
res=0
cur=0
for i in range(n):
for j in range(m):
for h in range(k):
if M[cur]==1:
... | output | 1 | 62,750 | 14 | 125,501 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A super computer has been built in the Turtle Academy of Sciences. The computer consists of n·m·k CPUs. The architecture was the paralellepiped of size n × m × k, split into 1 × 1 × 1 cells, each cell contains exactly one CPU. Thus, each CPU... | instruction | 0 | 62,751 | 14 | 125,502 |
Tags: brute force, dfs and similar, graphs
Correct Solution:
```
def put():
return map(int, input().split())
def safe(x,y,z):
return x>=0 and y>=0 and z>=0 and x<n and y<m and z<p
def check(x,y,z):
if mat[x][y][z]=='0':
return 0
cur = [x,y,z]
for i in range(3):
src = cur.copy()
... | output | 1 | 62,751 | 14 | 125,503 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A super computer has been built in the Turtle Academy of Sciences. The computer consists of n·m·k CPUs. The architecture was the paralellepiped of size n × m × k, split into 1 × 1 × 1 cells, each cell contains exactly one CPU. Thus, each CPU... | instruction | 0 | 62,752 | 14 | 125,504 |
Tags: brute force, dfs and similar, graphs
Correct Solution:
```
def func(i,j,t):
if i > 0:
if A[i-1][j][t] == '1':
if i < n-1:
if A[i+1][j][t] == '1':
return True
if j < m-1:
if A[i][j+1][t] == '1' and A[i-1][j+1][t] == '0':
... | output | 1 | 62,752 | 14 | 125,505 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A super computer has been built in the Turtle Academy of Sciences. The computer consists of n·m·k CPUs. The architecture was the paralellepiped of size n × m × k, split into 1 × 1 × 1 cells, each cell contains exactly one CPU. Thus, each CPU... | instruction | 0 | 62,753 | 14 | 125,506 |
Tags: brute force, dfs and similar, graphs
Correct Solution:
```
def safe(pos):
return pos[0] >= 0 and pos[0] < n and pos[1] >= 0 and pos[1] < m and pos[2] >= 0 and pos[2] < p
def CPU_status(pos, number):
return safe(pos) and super_computer[pos[0]][pos[1]][pos[2]] == number
def critical(x,y,z):
if super_com... | output | 1 | 62,753 | 14 | 125,507 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A super computer has been built in the Turtle Academy of Sciences. The computer consists of n·m·k CPUs. The architecture was the paralellepiped of size n × m × k, split into 1 × 1 × 1 cells, each cell contains exactly one CPU. Thus, each CPU... | instruction | 0 | 62,754 | 14 | 125,508 |
Tags: brute force, dfs and similar, graphs
Correct Solution:
```
def check(d, i, j, l):
global result, save
if d[i][j][l] == 1:
if d[i + 1][j][l] == 1 and d[i - 1][j][l] == 1:
#save.append([i, j, l])
result += 1
return
if d[i][j + 1][l] == 1 and d[i][j - 1][l]... | output | 1 | 62,754 | 14 | 125,509 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A super computer has been built in the Turtle Academy of Sciences. The computer consists of n·m·k CPUs. The architecture was the paralellepiped of size n × m × k, split into 1 × 1 × 1 cells, each cell contains exactly one CPU. Thus, each CPU... | instruction | 0 | 62,755 | 14 | 125,510 |
Tags: brute force, dfs and similar, graphs
Correct Solution:
```
def main():
s = input().split()
n, m, k = int(s[0]), int(s[1]), int(s[2])
processor = []
for x in range(n):
for y in range(m):
s = input()
for z in s:
processor.append(int(z) == 1)
if... | output | 1 | 62,755 | 14 | 125,511 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A super computer has been built in the Turtle Academy of Sciences. The computer consists of n·m·k CPUs. The architecture was the paralellepiped of size n × m × k, split into 1 × 1 × 1 cells, each cell contains exactly one CPU. Thus, each CPU... | instruction | 0 | 62,756 | 14 | 125,512 |
Tags: brute force, dfs and similar, graphs
Correct Solution:
```
def put():
return map(int, input().split())
def safe(x,y,z):
return x>=0 and y>=0 and z>=0 and x<n and y<m and z<p
def check(x,y,z):
if mat[x][y][z]==0:
return 0
cur = [x,y,z]
for i in range(3):
src = cur.copy()
... | output | 1 | 62,756 | 14 | 125,513 |
Provide a correct Python 3 solution for this coding contest problem.
Tonight is brain dinner night and all zombies will gather together to scarf down some delicious brains. The artful Heidi plans to crash the party, incognito, disguised as one of them. Her objective is to get away with at least one brain, so she can a... | instruction | 0 | 62,761 | 14 | 125,522 |
"Correct Solution:
```
n = int(input())
print((n + 2 - 1)//2)
``` | output | 1 | 62,761 | 14 | 125,523 |
Provide a correct Python 3 solution for this coding contest problem.
Tonight is brain dinner night and all zombies will gather together to scarf down some delicious brains. The artful Heidi plans to crash the party, incognito, disguised as one of them. Her objective is to get away with at least one brain, so she can a... | instruction | 0 | 62,762 | 14 | 125,524 |
"Correct Solution:
```
attendes = int(input())
print((attendes + 1)//2)
``` | output | 1 | 62,762 | 14 | 125,525 |
Provide a correct Python 3 solution for this coding contest problem.
Tonight is brain dinner night and all zombies will gather together to scarf down some delicious brains. The artful Heidi plans to crash the party, incognito, disguised as one of them. Her objective is to get away with at least one brain, so she can a... | instruction | 0 | 62,763 | 14 | 125,526 |
"Correct Solution:
```
from math import ceil
n = int(input())
# arr = [int(i) for i in input().split()]
print(ceil(n / 2))
``` | output | 1 | 62,763 | 14 | 125,527 |
Provide a correct Python 3 solution for this coding contest problem.
Tonight is brain dinner night and all zombies will gather together to scarf down some delicious brains. The artful Heidi plans to crash the party, incognito, disguised as one of them. Her objective is to get away with at least one brain, so she can a... | instruction | 0 | 62,764 | 14 | 125,528 |
"Correct Solution:
```
import sys, math
def rnd(x):
a = int(x)
b = x-a
if b>=0.5:
a+=1
return(a)
n = int(input())
print(rnd(n/2))
``` | output | 1 | 62,764 | 14 | 125,529 |
Provide a correct Python 3 solution for this coding contest problem.
Tonight is brain dinner night and all zombies will gather together to scarf down some delicious brains. The artful Heidi plans to crash the party, incognito, disguised as one of them. Her objective is to get away with at least one brain, so she can a... | instruction | 0 | 62,765 | 14 | 125,530 |
"Correct Solution:
```
n = int(input())
print((n - 1) // 2 + 1)
``` | output | 1 | 62,765 | 14 | 125,531 |
Provide a correct Python 3 solution for this coding contest problem.
Tonight is brain dinner night and all zombies will gather together to scarf down some delicious brains. The artful Heidi plans to crash the party, incognito, disguised as one of them. Her objective is to get away with at least one brain, so she can a... | instruction | 0 | 62,766 | 14 | 125,532 |
"Correct Solution:
```
n=int(input())
print((n+1)//2)
``` | output | 1 | 62,766 | 14 | 125,533 |
Provide a correct Python 3 solution for this coding contest problem.
Tonight is brain dinner night and all zombies will gather together to scarf down some delicious brains. The artful Heidi plans to crash the party, incognito, disguised as one of them. Her objective is to get away with at least one brain, so she can a... | instruction | 0 | 62,767 | 14 | 125,534 |
"Correct Solution:
```
import sys
import string
from collections import Counter, defaultdict
from math import fsum, sqrt, gcd, ceil, factorial
from itertools import combinations,permutations
# input = sys.stdin.readline
flush = lambda : sys.stdout.flush
comb = lambda x , y : (factorial(x) // factorial(y)) // factoria... | output | 1 | 62,767 | 14 | 125,535 |
Provide a correct Python 3 solution for this coding contest problem.
Tonight is brain dinner night and all zombies will gather together to scarf down some delicious brains. The artful Heidi plans to crash the party, incognito, disguised as one of them. Her objective is to get away with at least one brain, so she can a... | instruction | 0 | 62,768 | 14 | 125,536 |
"Correct Solution:
```
def zombi(n):
return (n + 1) // 2
print(zombi(int(input())))
``` | output | 1 | 62,768 | 14 | 125,537 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Tonight is brain dinner night and all zombies will gather together to scarf down some delicious brains. The artful Heidi plans to crash the party, incognito, disguised as one of them. Her object... | instruction | 0 | 62,769 | 14 | 125,538 |
Yes | output | 1 | 62,769 | 14 | 125,539 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Tonight is brain dinner night and all zombies will gather together to scarf down some delicious brains. The artful Heidi plans to crash the party, incognito, disguised as one of them. Her object... | instruction | 0 | 62,770 | 14 | 125,540 |
Yes | output | 1 | 62,770 | 14 | 125,541 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Tonight is brain dinner night and all zombies will gather together to scarf down some delicious brains. The artful Heidi plans to crash the party, incognito, disguised as one of them. Her object... | instruction | 0 | 62,771 | 14 | 125,542 |
Yes | output | 1 | 62,771 | 14 | 125,543 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Tonight is brain dinner night and all zombies will gather together to scarf down some delicious brains. The artful Heidi plans to crash the party, incognito, disguised as one of them. Her object... | instruction | 0 | 62,772 | 14 | 125,544 |
Yes | output | 1 | 62,772 | 14 | 125,545 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Tonight is brain dinner night and all zombies will gather together to scarf down some delicious brains. The artful Heidi plans to crash the party, incognito, disguised as one of them. Her object... | instruction | 0 | 62,773 | 14 | 125,546 |
No | output | 1 | 62,773 | 14 | 125,547 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Tonight is brain dinner night and all zombies will gather together to scarf down some delicious brains. The artful Heidi plans to crash the party, incognito, disguised as one of them. Her object... | instruction | 0 | 62,774 | 14 | 125,548 |
No | output | 1 | 62,774 | 14 | 125,549 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Tonight is brain dinner night and all zombies will gather together to scarf down some delicious brains. The artful Heidi plans to crash the party, incognito, disguised as one of them. Her object... | instruction | 0 | 62,775 | 14 | 125,550 |
No | output | 1 | 62,775 | 14 | 125,551 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Tonight is brain dinner night and all zombies will gather together to scarf down some delicious brains. The artful Heidi plans to crash the party, incognito, disguised as one of them. Her object... | instruction | 0 | 62,776 | 14 | 125,552 |
No | output | 1 | 62,776 | 14 | 125,553 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One department of some software company has n servers of different specifications. Servers are indexed with consecutive integers from 1 to n. Suppose that the specifications of the j-th server may be expressed with a single integer number c_... | instruction | 0 | 62,876 | 14 | 125,752 |
Tags: binary search, implementation, sortings
Correct Solution:
```
n, x1, x2 = map(int, input().split())
c = list(map(int, input().split()))
c = [(ci, i) for i, ci in enumerate(c)]
c.sort(reverse=True)
def check(x1,x2,reverse=False):
sum1 = sum2 = 0
i = i1 = i2 = 0
while i < len(c):
sum1 += c[i][0]
i ... | output | 1 | 62,876 | 14 | 125,753 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One department of some software company has n servers of different specifications. Servers are indexed with consecutive integers from 1 to n. Suppose that the specifications of the j-th server may be expressed with a single integer number c_... | instruction | 0 | 62,877 | 14 | 125,754 |
Tags: binary search, implementation, sortings
Correct Solution:
```
# ---------------------------iye ha aam zindegi---------------------------------------------
import math
import random
import heapq, bisect
import sys
from collections import deque, defaultdict
from fractions import Fraction
import sys
import threading... | output | 1 | 62,877 | 14 | 125,755 |
Provide tags and a correct Python 3 solution for this coding contest problem.
One department of some software company has n servers of different specifications. Servers are indexed with consecutive integers from 1 to n. Suppose that the specifications of the j-th server may be expressed with a single integer number c_... | instruction | 0 | 62,878 | 14 | 125,756 |
Tags: binary search, implementation, sortings
Correct Solution:
```
def fin(c, x):
return (x + c - 1) // c
def ck(x, b):
r = (n, n)
for i in range(b, n):
r = min(r, (i + fin(c[i][0], x), i))
return r
def sol(r, l):
if r[0] <= n and l[0] <= n and r[1] < n and l[1] < n :
print("Yes"... | output | 1 | 62,878 | 14 | 125,757 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One department of some software company has n servers of different specifications. Servers are indexed with consecutive integers from 1 to n. Suppose that the specifications of the j-th server m... | instruction | 0 | 62,879 | 14 | 125,758 |
No | output | 1 | 62,879 | 14 | 125,759 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One department of some software company has n servers of different specifications. Servers are indexed with consecutive integers from 1 to n. Suppose that the specifications of the j-th server m... | instruction | 0 | 62,880 | 14 | 125,760 |
No | output | 1 | 62,880 | 14 | 125,761 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One department of some software company has n servers of different specifications. Servers are indexed with consecutive integers from 1 to n. Suppose that the specifications of the j-th server m... | instruction | 0 | 62,881 | 14 | 125,762 |
No | output | 1 | 62,881 | 14 | 125,763 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One department of some software company has n servers of different specifications. Servers are indexed with consecutive integers from 1 to n. Suppose that the specifications of the j-th server m... | instruction | 0 | 62,882 | 14 | 125,764 |
No | output | 1 | 62,882 | 14 | 125,765 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Once upon a time there was only one router in the well-known company Bmail. Years went by and over time new routers were purchased. Every time they bought a new router, they connected it to one of the routers bought before it. You are given ... | instruction | 0 | 63,165 | 14 | 126,330 |
Tags: *special, dfs and similar, trees
Correct Solution:
```
n = int(input())
a = list(map(int,input().split()))
b = [n]
i = n - 2
while a[i] != 1:
b.append(a[i])
i = a[i] - 2
b.append(1)
b.reverse()
print(*b)
``` | output | 1 | 63,165 | 14 | 126,331 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Once upon a time there was only one router in the well-known company Bmail. Years went by and over time new routers were purchased. Every time they bought a new router, they connected it to one of the routers bought before it. You are given ... | instruction | 0 | 63,166 | 14 | 126,332 |
Tags: *special, dfs and similar, trees
Correct Solution:
```
n = int(input())
p = [int(i) for i in input().split()]
ans = []
t = n
while t != 1:
ans.append(t)
t = p[t-2]
ans.append(1)
for i in range(len(ans)):
print(ans[len(ans) - 1 - i], end=' ')
``` | output | 1 | 63,166 | 14 | 126,333 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Once upon a time there was only one router in the well-known company Bmail. Years went by and over time new routers were purchased. Every time they bought a new router, they connected it to one of the routers bought before it. You are given ... | instruction | 0 | 63,167 | 14 | 126,334 |
Tags: *special, dfs and similar, trees
Correct Solution:
```
import math
x = int(input())
p = list(map(int,input().split()))
ans = []
sz = 0
while x > 1:
ans.append(x)
x = p[x - 2]
sz += 1
ans.append(1)
sz += 1
for i in range(1,sz + 1):
print (ans[sz - i])
``` | output | 1 | 63,167 | 14 | 126,335 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Once upon a time there was only one router in the well-known company Bmail. Years went by and over time new routers were purchased. Every time they bought a new router, they connected it to one of the routers bought before it. You are given ... | instruction | 0 | 63,168 | 14 | 126,336 |
Tags: *special, dfs and similar, trees
Correct Solution:
```
n = int(input())
parents = list(map(int, input().strip().split()))
cur = parents[-1]-2
path = [n]
while 1:
path.append(cur+2)
if cur == -1:
break
cur = parents[cur]-2
path.reverse()
for i in path:
print(i, end = " ")
``` | output | 1 | 63,168 | 14 | 126,337 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Once upon a time there was only one router in the well-known company Bmail. Years went by and over time new routers were purchased. Every time they bought a new router, they connected it to one of the routers bought before it. You are given ... | instruction | 0 | 63,169 | 14 | 126,338 |
Tags: *special, dfs and similar, trees
Correct Solution:
```
from collections import deque
class Graph():
def __init__(self, n):
self.size = n
self.g = [[] for _ in range(n)]
def addEdge(self, u, v):
self.g[u].append(v)
self.g[v].append(u)
def findPath(self, _from, _to):
... | output | 1 | 63,169 | 14 | 126,339 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Once upon a time there was only one router in the well-known company Bmail. Years went by and over time new routers were purchased. Every time they bought a new router, they connected it to one of the routers bought before it. You are given ... | instruction | 0 | 63,171 | 14 | 126,342 |
Tags: *special, dfs and similar, trees
Correct Solution:
```
# ��������� ������� ������
N = int(input())
input_str = str(input())
input_str = '0 ' + input_str
L = input_str.split()
for i in range(len(L)):
L[i] = int(L[i])
def find_path(l):
# � ��� ���������� ������ ����� ��������������, ������ �������� �� ���... | output | 1 | 63,171 | 14 | 126,343 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Once upon a time there was only one router in the well-known company Bmail. Years went by and over time new routers were purchased. Every time they bought a new router, they connected it to one of the routers bought before it. You are given ... | instruction | 0 | 63,172 | 14 | 126,344 |
Tags: *special, dfs and similar, trees
Correct Solution:
```
'''input
6
1 2 3 4 5
'''
n=int(input())
l=list(map(int,input().strip().split(' ')))
v=n
route=[v]
while v!=1:
v=l[v-2]
route.append(v)
print(*route[::-1])
``` | output | 1 | 63,172 | 14 | 126,345 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once upon a time there was only one router in the well-known company Bmail. Years went by and over time new routers were purchased. Every time they bought a new router, they connected it to one ... | instruction | 0 | 63,173 | 14 | 126,346 |
Yes | output | 1 | 63,173 | 14 | 126,347 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once upon a time there was only one router in the well-known company Bmail. Years went by and over time new routers were purchased. Every time they bought a new router, they connected it to one ... | instruction | 0 | 63,176 | 14 | 126,352 |
Yes | output | 1 | 63,176 | 14 | 126,353 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once upon a time there was only one router in the well-known company Bmail. Years went by and over time new routers were purchased. Every time they bought a new router, they connected it to one ... | instruction | 0 | 63,178 | 14 | 126,356 |
No | output | 1 | 63,178 | 14 | 126,357 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once upon a time there was only one router in the well-known company Bmail. Years went by and over time new routers were purchased. Every time they bought a new router, they connected it to one ... | instruction | 0 | 63,180 | 14 | 126,360 |
No | output | 1 | 63,180 | 14 | 126,361 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between easy and hard versions is constraints.
There are n kids, each of them is reading a unique book. At the end of any day, the i-th kid will give his book to the p_i-th kid (in case of i = p_i the kid will give his b... | instruction | 0 | 63,237 | 14 | 126,474 |
Tags: dfs and similar, dsu, math
Correct Solution:
```
q = int(input())
for _ in range(q):
n = int(input())
perm = list(map(int, input().split()))
remain = set(perm)
result = {i+1: 0 for i in range(n)}
while len(remain) > 0:
m = remain.pop()
cycle = [m]
while True:
... | output | 1 | 63,237 | 14 | 126,475 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between easy and hard versions is constraints.
There are n kids, each of them is reading a unique book. At the end of any day, the i-th kid will give his book to the p_i-th kid (in case of i = p_i the kid will give his b... | instruction | 0 | 63,238 | 14 | 126,476 |
Tags: dfs and similar, dsu, math
Correct Solution:
```
t = int(input())
while t>0:
t -= 1
n = int(input())
a = list(map(int,input().split()))
for i in range(n):
a[i] -= 1
res = [0 for _ in range(n)]
for i in range(n):
if res[i]!=0:
continue
x = [i]
j =... | output | 1 | 63,238 | 14 | 126,477 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.