message stringlengths 2 48.6k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 318 108k | cluster float64 8 8 | __index_level_0__ int64 636 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Medicine faculty of Berland State University has just finished their admission campaign. As usual, about 80\% of applicants are girls and majority of them are going to live in the university dor... | instruction | 0 | 88,369 | 8 | 176,738 |
No | output | 1 | 88,369 | 8 | 176,739 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Medicine faculty of Berland State University has just finished their admission campaign. As usual, about 80\% of applicants are girls and majority of them are going to live in the university dor... | instruction | 0 | 88,370 | 8 | 176,740 |
No | output | 1 | 88,370 | 8 | 176,741 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Medicine faculty of Berland State University has just finished their admission campaign. As usual, about 80\% of applicants are girls and majority of them are going to live in the university dor... | instruction | 0 | 88,371 | 8 | 176,742 |
No | output | 1 | 88,371 | 8 | 176,743 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Students in a class are making towers of blocks. Each student makes a (non-zero) tower by stacking pieces lengthwise on top of each other. n of the students use pieces made of two blocks and m of the students use pieces made of three blocks.... | instruction | 0 | 88,852 | 8 | 177,704 |
Tags: brute force, greedy, math, number theory
Correct Solution:
```
n,m = map(int, input().split())
answer=0
while True:
if n >=3 and m>=2:
if n/m>3/2:
n-=3
m-=1
else:
n-=2
m-=2
answer+=6
else:
if m =... | output | 1 | 88,852 | 8 | 177,705 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Students in a class are making towers of blocks. Each student makes a (non-zero) tower by stacking pieces lengthwise on top of each other. n of the students use pieces made of two blocks and m of the students use pieces made of three blocks.... | instruction | 0 | 88,853 | 8 | 177,706 |
Tags: brute force, greedy, math, number theory
Correct Solution:
```
n, m = map(int, input().split())
start = 0
end = 10**10
while (end - start > 1):
mid = (end + start) // 2
two = mid // 2 - mid // 6
three = mid // 3 - mid // 6
six = mid // 6
nn = n
mm = m
nn -= two
mm -= three
n... | output | 1 | 88,853 | 8 | 177,707 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Students in a class are making towers of blocks. Each student makes a (non-zero) tower by stacking pieces lengthwise on top of each other. n of the students use pieces made of two blocks and m of the students use pieces made of three blocks.... | instruction | 0 | 88,854 | 8 | 177,708 |
Tags: brute force, greedy, math, number theory
Correct Solution:
```
n, m = input().split()
n = int(n)
m = int(m)
res_n = n * 2
res_m = m * 3
tmp_height = 6
while(tmp_height <= min(res_n, res_m)):
tmpresn = res_n + 2
tmpresm = res_m + 3
# print(tmpresn)
# print(tmpresm)
if max(tmpresn, res_m) > ma... | output | 1 | 88,854 | 8 | 177,709 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Students in a class are making towers of blocks. Each student makes a (non-zero) tower by stacking pieces lengthwise on top of each other. n of the students use pieces made of two blocks and m of the students use pieces made of three blocks.... | instruction | 0 | 88,855 | 8 | 177,710 |
Tags: brute force, greedy, math, number theory
Correct Solution:
```
n,m=map(int,input().split())
curr=max(n*2,m*3)
while n+m>(curr//2+curr//3-curr//6):
curr+=1
print(curr)
``` | output | 1 | 88,855 | 8 | 177,711 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Students in a class are making towers of blocks. Each student makes a (non-zero) tower by stacking pieces lengthwise on top of each other. n of the students use pieces made of two blocks and m of the students use pieces made of three blocks.... | instruction | 0 | 88,856 | 8 | 177,712 |
Tags: brute force, greedy, math, number theory
Correct Solution:
```
nm = input().split(" ")
n = int(nm[0])
m = int(nm[1])
#not allowed to be the same height, not not same number of blocks
if n == 0:
print(3*m)
elif m == 0:
print(2*n)
else:
new = max(3*m, 2*n)
i = 0
while i<new+1:
if i%6 == ... | output | 1 | 88,856 | 8 | 177,713 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Students in a class are making towers of blocks. Each student makes a (non-zero) tower by stacking pieces lengthwise on top of each other. n of the students use pieces made of two blocks and m of the students use pieces made of three blocks.... | instruction | 0 | 88,857 | 8 | 177,714 |
Tags: brute force, greedy, math, number theory
Correct Solution:
```
if __name__=='__main__':
d,t = map(int,input().split(' '))
result = 0
i2 = d*2
i3 = t*3
cm = int(max(i2,i3)/6) #common
while cm>0:
if i2+2<i3+3:
i2+=2
elif i2+2> i3+3:
i3+=3
else... | output | 1 | 88,857 | 8 | 177,715 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Students in a class are making towers of blocks. Each student makes a (non-zero) tower by stacking pieces lengthwise on top of each other. n of the students use pieces made of two blocks and m of the students use pieces made of three blocks.... | instruction | 0 | 88,858 | 8 | 177,716 |
Tags: brute force, greedy, math, number theory
Correct Solution:
```
def check(n, m, ans):
div2 = ans // 2
div3 = ans // 3
div6 = ans // 6
k = 0
if div2 < n or div3 < m:
return False
if div2 - div6 < n:
k = n - (div2 - div6)
return div3 - k >= m
n, m = list(map(int, input(... | output | 1 | 88,858 | 8 | 177,717 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Students in a class are making towers of blocks. Each student makes a (non-zero) tower by stacking pieces lengthwise on top of each other. n of the students use pieces made of two blocks and m of the students use pieces made of three blocks.... | instruction | 0 | 88,859 | 8 | 177,718 |
Tags: brute force, greedy, math, number theory
Correct Solution:
```
n, m = map(int, input().split())
num = max(n * 2, m * 3)
while True:
if num % 2 == 0 or num % 3 == 0:
x = num // 2
y = num // 3
z = num // 6
if x >= n and y >= m and x + y - z >= m + n:
print(num)
... | output | 1 | 88,859 | 8 | 177,719 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Students in a class are making towers of blocks. Each student makes a (non-zero) tower by stacking pieces lengthwise on top of each other. n of the students use pieces made of two blocks and m o... | instruction | 0 | 88,860 | 8 | 177,720 |
Yes | output | 1 | 88,860 | 8 | 177,721 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Students in a class are making towers of blocks. Each student makes a (non-zero) tower by stacking pieces lengthwise on top of each other. n of the students use pieces made of two blocks and m o... | instruction | 0 | 88,861 | 8 | 177,722 |
Yes | output | 1 | 88,861 | 8 | 177,723 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Students in a class are making towers of blocks. Each student makes a (non-zero) tower by stacking pieces lengthwise on top of each other. n of the students use pieces made of two blocks and m o... | instruction | 0 | 88,862 | 8 | 177,724 |
Yes | output | 1 | 88,862 | 8 | 177,725 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Students in a class are making towers of blocks. Each student makes a (non-zero) tower by stacking pieces lengthwise on top of each other. n of the students use pieces made of two blocks and m o... | instruction | 0 | 88,863 | 8 | 177,726 |
Yes | output | 1 | 88,863 | 8 | 177,727 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Students in a class are making towers of blocks. Each student makes a (non-zero) tower by stacking pieces lengthwise on top of each other. n of the students use pieces made of two blocks and m o... | instruction | 0 | 88,864 | 8 | 177,728 |
No | output | 1 | 88,864 | 8 | 177,729 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Students in a class are making towers of blocks. Each student makes a (non-zero) tower by stacking pieces lengthwise on top of each other. n of the students use pieces made of two blocks and m o... | instruction | 0 | 88,865 | 8 | 177,730 |
No | output | 1 | 88,865 | 8 | 177,731 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Students in a class are making towers of blocks. Each student makes a (non-zero) tower by stacking pieces lengthwise on top of each other. n of the students use pieces made of two blocks and m o... | instruction | 0 | 88,866 | 8 | 177,732 |
No | output | 1 | 88,866 | 8 | 177,733 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Students in a class are making towers of blocks. Each student makes a (non-zero) tower by stacking pieces lengthwise on top of each other. n of the students use pieces made of two blocks and m o... | instruction | 0 | 88,867 | 8 | 177,734 |
No | output | 1 | 88,867 | 8 | 177,735 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mishka has got n empty boxes. For every i (1 ≤ i ≤ n), i-th box is a cube with side length ai.
Mishka can put a box i into another box j if the following conditions are met:
* i-th box is not put into another box;
* j-th box doesn't c... | instruction | 0 | 88,937 | 8 | 177,874 |
Tags: greedy
Correct Solution:
```
n = int(input())
a = input().split()
repeats = []
for i in range(n):
repeats.append(a.count(a[i]))
print(max(repeats))
``` | output | 1 | 88,937 | 8 | 177,875 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mishka has got n empty boxes. For every i (1 ≤ i ≤ n), i-th box is a cube with side length ai.
Mishka can put a box i into another box j if the following conditions are met:
* i-th box is not put into another box;
* j-th box doesn't c... | instruction | 0 | 88,938 | 8 | 177,876 |
Tags: greedy
Correct Solution:
```
N = int(input())
boxes = list(map(int,input().split()))
high = 0
for item in boxes:
high = max(high, boxes.count(item))
print(high)
``` | output | 1 | 88,938 | 8 | 177,877 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mishka has got n empty boxes. For every i (1 ≤ i ≤ n), i-th box is a cube with side length ai.
Mishka can put a box i into another box j if the following conditions are met:
* i-th box is not put into another box;
* j-th box doesn't c... | instruction | 0 | 88,939 | 8 | 177,878 |
Tags: greedy
Correct Solution:
```
#Ya Hassan Mojtaba
n=int(input())
my=[n for n in input().split()]
ans=1
for i in my:
ans=max(my.count(i),ans)
print(ans)
``` | output | 1 | 88,939 | 8 | 177,879 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mishka has got n empty boxes. For every i (1 ≤ i ≤ n), i-th box is a cube with side length ai.
Mishka can put a box i into another box j if the following conditions are met:
* i-th box is not put into another box;
* j-th box doesn't c... | instruction | 0 | 88,940 | 8 | 177,880 |
Tags: greedy
Correct Solution:
```
n = int(input())
s = input()
k = list(map(int, s.split()))
name =[]
count = []
for each in k:
if (each in name) == True:
count[name.index(each)] += 1
else:
name.append(each)
count.append(1)
print(max(count))
``` | output | 1 | 88,940 | 8 | 177,881 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mishka has got n empty boxes. For every i (1 ≤ i ≤ n), i-th box is a cube with side length ai.
Mishka can put a box i into another box j if the following conditions are met:
* i-th box is not put into another box;
* j-th box doesn't c... | instruction | 0 | 88,941 | 8 | 177,882 |
Tags: greedy
Correct Solution:
```
n= int(input())
lis=list(map(int,input().split()))
lis.sort()
c=1
mx=1
for i in range(n-1):
if lis[i]==lis[i+1]:
c+=1
else:
c=1
if mx<c:
mx=c
print(mx)
``` | output | 1 | 88,941 | 8 | 177,883 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mishka has got n empty boxes. For every i (1 ≤ i ≤ n), i-th box is a cube with side length ai.
Mishka can put a box i into another box j if the following conditions are met:
* i-th box is not put into another box;
* j-th box doesn't c... | instruction | 0 | 88,942 | 8 | 177,884 |
Tags: greedy
Correct Solution:
```
# -*- coding: utf-8 -*-
"""
Created on Tue Dec 12 19:12:40 2017
@author: ms
"""
def merge(left, right):
a = []
left.append(float("Inf"))
right.append(float("Inf"))
i = 0
j = 0
iters = len(left) + len(right)
for k in range(iters-2):
if left[i] <= r... | output | 1 | 88,942 | 8 | 177,885 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mishka has got n empty boxes. For every i (1 ≤ i ≤ n), i-th box is a cube with side length ai.
Mishka can put a box i into another box j if the following conditions are met:
* i-th box is not put into another box;
* j-th box doesn't c... | instruction | 0 | 88,943 | 8 | 177,886 |
Tags: greedy
Correct Solution:
```
from collections import defaultdict
n=int(input())
a=sorted(list(map(int,input().split())))
d=defaultdict(int)
for i in a:
d[i]+=1
print(max(d.values()))
``` | output | 1 | 88,943 | 8 | 177,887 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mishka has got n empty boxes. For every i (1 ≤ i ≤ n), i-th box is a cube with side length ai.
Mishka can put a box i into another box j if the following conditions are met:
* i-th box is not put into another box;
* j-th box doesn't c... | instruction | 0 | 88,944 | 8 | 177,888 |
Tags: greedy
Correct Solution:
```
input()
a={}
for i in input().split():
i=int(i)
if i in a:
a[i]+=1
else:
a[i]=1
a=sorted(a.items(),key=lambda i:i[0],reverse=True)
b=[i[1] for i in a]
print(max(b))
``` | output | 1 | 88,944 | 8 | 177,889 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mishka has got n empty boxes. For every i (1 ≤ i ≤ n), i-th box is a cube with side length ai.
Mishka can put a box i into another box j if the following conditions are met:
* i-th box is no... | instruction | 0 | 88,945 | 8 | 177,890 |
Yes | output | 1 | 88,945 | 8 | 177,891 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mishka has got n empty boxes. For every i (1 ≤ i ≤ n), i-th box is a cube with side length ai.
Mishka can put a box i into another box j if the following conditions are met:
* i-th box is no... | instruction | 0 | 88,946 | 8 | 177,892 |
Yes | output | 1 | 88,946 | 8 | 177,893 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mishka has got n empty boxes. For every i (1 ≤ i ≤ n), i-th box is a cube with side length ai.
Mishka can put a box i into another box j if the following conditions are met:
* i-th box is no... | instruction | 0 | 88,947 | 8 | 177,894 |
Yes | output | 1 | 88,947 | 8 | 177,895 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mishka has got n empty boxes. For every i (1 ≤ i ≤ n), i-th box is a cube with side length ai.
Mishka can put a box i into another box j if the following conditions are met:
* i-th box is no... | instruction | 0 | 88,948 | 8 | 177,896 |
Yes | output | 1 | 88,948 | 8 | 177,897 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mishka has got n empty boxes. For every i (1 ≤ i ≤ n), i-th box is a cube with side length ai.
Mishka can put a box i into another box j if the following conditions are met:
* i-th box is no... | instruction | 0 | 88,949 | 8 | 177,898 |
No | output | 1 | 88,949 | 8 | 177,899 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mishka has got n empty boxes. For every i (1 ≤ i ≤ n), i-th box is a cube with side length ai.
Mishka can put a box i into another box j if the following conditions are met:
* i-th box is no... | instruction | 0 | 88,950 | 8 | 177,900 |
No | output | 1 | 88,950 | 8 | 177,901 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mishka has got n empty boxes. For every i (1 ≤ i ≤ n), i-th box is a cube with side length ai.
Mishka can put a box i into another box j if the following conditions are met:
* i-th box is no... | instruction | 0 | 88,951 | 8 | 177,902 |
No | output | 1 | 88,951 | 8 | 177,903 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mishka has got n empty boxes. For every i (1 ≤ i ≤ n), i-th box is a cube with side length ai.
Mishka can put a box i into another box j if the following conditions are met:
* i-th box is no... | instruction | 0 | 88,952 | 8 | 177,904 |
No | output | 1 | 88,952 | 8 | 177,905 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In one very old text file there was written Great Wisdom. This Wisdom was so Great that nobody could decipher it, even Phong — the oldest among the inhabitants of Mainframe. But still he managed... | instruction | 0 | 88,983 | 8 | 177,966 |
Yes | output | 1 | 88,983 | 8 | 177,967 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In one very old text file there was written Great Wisdom. This Wisdom was so Great that nobody could decipher it, even Phong — the oldest among the inhabitants of Mainframe. But still he managed... | instruction | 0 | 88,984 | 8 | 177,968 |
Yes | output | 1 | 88,984 | 8 | 177,969 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In one very old text file there was written Great Wisdom. This Wisdom was so Great that nobody could decipher it, even Phong — the oldest among the inhabitants of Mainframe. But still he managed... | instruction | 0 | 88,985 | 8 | 177,970 |
Yes | output | 1 | 88,985 | 8 | 177,971 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In one very old text file there was written Great Wisdom. This Wisdom was so Great that nobody could decipher it, even Phong — the oldest among the inhabitants of Mainframe. But still he managed... | instruction | 0 | 88,986 | 8 | 177,972 |
Yes | output | 1 | 88,986 | 8 | 177,973 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In one very old text file there was written Great Wisdom. This Wisdom was so Great that nobody could decipher it, even Phong — the oldest among the inhabitants of Mainframe. But still he managed... | instruction | 0 | 88,987 | 8 | 177,974 |
No | output | 1 | 88,987 | 8 | 177,975 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In one very old text file there was written Great Wisdom. This Wisdom was so Great that nobody could decipher it, even Phong — the oldest among the inhabitants of Mainframe. But still he managed... | instruction | 0 | 88,988 | 8 | 177,976 |
No | output | 1 | 88,988 | 8 | 177,977 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In one very old text file there was written Great Wisdom. This Wisdom was so Great that nobody could decipher it, even Phong — the oldest among the inhabitants of Mainframe. But still he managed... | instruction | 0 | 88,989 | 8 | 177,978 |
No | output | 1 | 88,989 | 8 | 177,979 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In one very old text file there was written Great Wisdom. This Wisdom was so Great that nobody could decipher it, even Phong — the oldest among the inhabitants of Mainframe. But still he managed... | instruction | 0 | 88,990 | 8 | 177,980 |
No | output | 1 | 88,990 | 8 | 177,981 |
Provide a correct Python 3 solution for this coding contest problem.
There is a cave.
The cave has N rooms and M passages. The rooms are numbered 1 to N, and the passages are numbered 1 to M. Passage i connects Room A_i and Room B_i bidirectionally. One can travel between any two rooms by traversing passages. Room 1 ... | instruction | 0 | 89,007 | 8 | 178,014 |
"Correct Solution:
```
from collections import deque
n,m = map(int,input().split())
ab = [list(map(int, input().split())) for _ in range(m)]
path = [[] for _ in range(n+1)]
for a,b in ab:
path[a].append(b)
path[b].append(a)
q = deque([1])
ans = [0] * (n+1)
while q:
v = q.popleft()
for w in path[v]... | output | 1 | 89,007 | 8 | 178,015 |
Provide a correct Python 3 solution for this coding contest problem.
There is a cave.
The cave has N rooms and M passages. The rooms are numbered 1 to N, and the passages are numbered 1 to M. Passage i connects Room A_i and Room B_i bidirectionally. One can travel between any two rooms by traversing passages. Room 1 ... | instruction | 0 | 89,008 | 8 | 178,016 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
from collections import deque
n, m = map(int, input().split())
G = [[] for _ in range(n+1)]
for _ in range(m):
u, v = map(int, input().split())
G[u].append(v)
G[v].append(u)
q = deque([1])
p = [0]*(n+1)
while q:
v = q.popleft()
for u in G[... | output | 1 | 89,008 | 8 | 178,017 |
Provide a correct Python 3 solution for this coding contest problem.
There is a cave.
The cave has N rooms and M passages. The rooms are numbered 1 to N, and the passages are numbered 1 to M. Passage i connects Room A_i and Room B_i bidirectionally. One can travel between any two rooms by traversing passages. Room 1 ... | instruction | 0 | 89,009 | 8 | 178,018 |
"Correct Solution:
```
import queue
n,m=map(int,input().split())
e=[[] for _ in range(n+1)]
INF=10**18
d=[INF]*(n+1)
ans=[0]*(n+1)
for _ in range(m):
a,b=map(int,input().split())
e[a]+=[b]
e[b]+=[a]
q=queue.Queue()
q.put(1)
d[1]=0
while not q.empty():
now=q.get()
for to in e[now]:
if d[to]==INF:
ans... | output | 1 | 89,009 | 8 | 178,019 |
Provide a correct Python 3 solution for this coding contest problem.
There is a cave.
The cave has N rooms and M passages. The rooms are numbered 1 to N, and the passages are numbered 1 to M. Passage i connects Room A_i and Room B_i bidirectionally. One can travel between any two rooms by traversing passages. Room 1 ... | instruction | 0 | 89,010 | 8 | 178,020 |
"Correct Solution:
```
n,m=map(int,input().split())
g=[[] for x in range(n)]
for c in range(m):
a,b= map(int,input().split())
g[a-1].append(b-1)
g[b-1].append(a-1)
ans_list=[-1]*n
queue=[0]
while queue:
qi=queue.pop(0)
for gi in g[qi]:
if ans_list[gi]==-1:
queue.append(gi)
... | output | 1 | 89,010 | 8 | 178,021 |
Provide a correct Python 3 solution for this coding contest problem.
There is a cave.
The cave has N rooms and M passages. The rooms are numbered 1 to N, and the passages are numbered 1 to M. Passage i connects Room A_i and Room B_i bidirectionally. One can travel between any two rooms by traversing passages. Room 1 ... | instruction | 0 | 89,011 | 8 | 178,022 |
"Correct Solution:
```
(n,m),*t=[map(int,t.split())for t in open(0)]
e=[[]for _ in range(n+1)]
for a,b in t:
e[a]+=b,
e[b]+=a,
q=[1]
d=[0]*-~n
for v in q:
for w in e[v]:
if d[w]<1:
d[w]=v
q+=w,
print('Yes',*d[2:])
``` | output | 1 | 89,011 | 8 | 178,023 |
Provide a correct Python 3 solution for this coding contest problem.
There is a cave.
The cave has N rooms and M passages. The rooms are numbered 1 to N, and the passages are numbered 1 to M. Passage i connects Room A_i and Room B_i bidirectionally. One can travel between any two rooms by traversing passages. Room 1 ... | instruction | 0 | 89,012 | 8 | 178,024 |
"Correct Solution:
```
from collections import deque
n, m = map(int, input().split())
g = [[] for _ in range(n)]
for i in range(m):
a, b = map(int, input().split())
g[a-1].append(b-1)
g[b-1].append(a-1)
q = deque([0])
pre = [-1 for _ in range(n)]
while q:
v = q.popleft()
for t in g[v]:
if pr... | output | 1 | 89,012 | 8 | 178,025 |
Provide a correct Python 3 solution for this coding contest problem.
There is a cave.
The cave has N rooms and M passages. The rooms are numbered 1 to N, and the passages are numbered 1 to M. Passage i connects Room A_i and Room B_i bidirectionally. One can travel between any two rooms by traversing passages. Room 1 ... | instruction | 0 | 89,013 | 8 | 178,026 |
"Correct Solution:
```
from collections import deque
n,m = map(int,input().split())
net = [[] for _ in range(n+1)]
for _ in range(m):
a,b = map(int,input().split())
net[a].append(b)
net[b].append(a)
a = [-1] * (n+1)
d = deque()
d.append(1)
while d:
u = d.popleft()
for child in net[u]:
if ... | output | 1 | 89,013 | 8 | 178,027 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.