message stringlengths 2 39.6k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 219 108k | cluster float64 11 11 | __index_level_0__ int64 438 217k |
|---|---|---|---|---|---|
Provide a correct Python 3 solution for this coding contest problem.
On a planet far, far away, M languages are spoken. They are conveniently numbered 1 through M.
For CODE FESTIVAL 20XX held on this planet, N participants gathered from all over the planet.
The i-th (1≦i≦N) participant can speak K_i languages number... | instruction | 0 | 63,880 | 11 | 127,760 |
"Correct Solution:
```
import sys
sys.setrecursionlimit(10**9)
def dfs(vNow):
useds[vNow] = True
for v2 in adjL[vNow]:
if not useds[v2]:
dfs(v2)
N, M = map(int, input().split())
adjL = [[] for v in range(N+M)]
for i in range(N):
K, *Ls = map(int, input().split())
for L in Ls:
... | output | 1 | 63,880 | 11 | 127,761 |
Provide a correct Python 3 solution for this coding contest problem.
On a planet far, far away, M languages are spoken. They are conveniently numbered 1 through M.
For CODE FESTIVAL 20XX held on this planet, N participants gathered from all over the planet.
The i-th (1≦i≦N) participant can speak K_i languages number... | instruction | 0 | 63,881 | 11 | 127,762 |
"Correct Solution:
```
from collections import deque
N,M=map(int,input().split())
L=[[] for i in range(M)]
for i in range(N):
for j,k in enumerate(input().split()):
if j==0:
continue
L[int(k)-1].append(i)
G=[[] for i in range(N)]
for l in L:
if len(l)>=2:
for i in range(len(l)-1):
if l[i+1] ... | output | 1 | 63,881 | 11 | 127,763 |
Provide a correct Python 3 solution for this coding contest problem.
On a planet far, far away, M languages are spoken. They are conveniently numbered 1 through M.
For CODE FESTIVAL 20XX held on this planet, N participants gathered from all over the planet.
The i-th (1≦i≦N) participant can speak K_i languages number... | instruction | 0 | 63,882 | 11 | 127,764 |
"Correct Solution:
```
class UnionFind:
def __init__(self, n):
self.v = [-1 for _ in range(n)]
def find(self, x):
if self.v[x] < 0:
return x
else:
self.v[x] = self.find(self.v[x])
return self.v[x]
def unite(self, x, y):
x = self.find(x)
... | output | 1 | 63,882 | 11 | 127,765 |
Provide a correct Python 3 solution for this coding contest problem.
On a planet far, far away, M languages are spoken. They are conveniently numbered 1 through M.
For CODE FESTIVAL 20XX held on this planet, N participants gathered from all over the planet.
The i-th (1≦i≦N) participant can speak K_i languages number... | instruction | 0 | 63,883 | 11 | 127,766 |
"Correct Solution:
```
# -*- coding: utf-8 -*-
class UnionFind():
def __init__(self, n):
self.par = [i for i in range(n)]
def find(self, x):
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x])
return self.par[x]
def unite(sel... | output | 1 | 63,883 | 11 | 127,767 |
Provide a correct Python 3 solution for this coding contest problem.
On a planet far, far away, M languages are spoken. They are conveniently numbered 1 through M.
For CODE FESTIVAL 20XX held on this planet, N participants gathered from all over the planet.
The i-th (1≦i≦N) participant can speak K_i languages number... | instruction | 0 | 63,884 | 11 | 127,768 |
"Correct Solution:
```
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(input())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().spli... | output | 1 | 63,884 | 11 | 127,769 |
Provide a correct Python 3 solution for this coding contest problem.
On a planet far, far away, M languages are spoken. They are conveniently numbered 1 through M.
For CODE FESTIVAL 20XX held on this planet, N participants gathered from all over the planet.
The i-th (1≦i≦N) participant can speak K_i languages number... | instruction | 0 | 63,885 | 11 | 127,770 |
"Correct Solution:
```
N,M=map(int,input().split())
from collections import defaultdict
root=[-1]*(N+M)
def find(i):
global root
if root[i]>=0:
root[i]=find(root[i])
return root[i]
return i
def make(a,b):
global root
ra=find(a)
rb=find(b)
if ra==rb:
return
elif ro... | output | 1 | 63,885 | 11 | 127,771 |
Provide a correct Python 3 solution for this coding contest problem.
On a planet far, far away, M languages are spoken. They are conveniently numbered 1 through M.
For CODE FESTIVAL 20XX held on this planet, N participants gathered from all over the planet.
The i-th (1≦i≦N) participant can speak K_i languages number... | instruction | 0 | 63,886 | 11 | 127,772 |
"Correct Solution:
```
class UF():
def __init__(self, N):
self._parent=[n for n in range(0, N)]
self._size=[1] * N
def find_root(self, x):
if self._parent[x]==x:return x
self._parent[x]=self.find_root(self._parent[x])
return self._parent[x]
def unite(self, x, y):
gx=self.find_root(x)
... | output | 1 | 63,886 | 11 | 127,773 |
Provide a correct Python 3 solution for this coding contest problem.
On a planet far, far away, M languages are spoken. They are conveniently numbered 1 through M.
For CODE FESTIVAL 20XX held on this planet, N participants gathered from all over the planet.
The i-th (1≦i≦N) participant can speak K_i languages number... | instruction | 0 | 63,887 | 11 | 127,774 |
"Correct Solution:
```
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
input = sys.stdin.readline
from math import factorial
import heapq, bisect
import math
import itertools
import queue
from collections import deque
parent_node = []
def union_find(ele):
global paren... | output | 1 | 63,887 | 11 | 127,775 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On a planet far, far away, M languages are spoken. They are conveniently numbered 1 through M.
For CODE FESTIVAL 20XX held on this planet, N participants gathered from all over the planet.
The... | instruction | 0 | 63,888 | 11 | 127,776 |
Yes | output | 1 | 63,888 | 11 | 127,777 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On a planet far, far away, M languages are spoken. They are conveniently numbered 1 through M.
For CODE FESTIVAL 20XX held on this planet, N participants gathered from all over the planet.
The... | instruction | 0 | 63,889 | 11 | 127,778 |
Yes | output | 1 | 63,889 | 11 | 127,779 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On a planet far, far away, M languages are spoken. They are conveniently numbered 1 through M.
For CODE FESTIVAL 20XX held on this planet, N participants gathered from all over the planet.
The... | instruction | 0 | 63,890 | 11 | 127,780 |
Yes | output | 1 | 63,890 | 11 | 127,781 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On a planet far, far away, M languages are spoken. They are conveniently numbered 1 through M.
For CODE FESTIVAL 20XX held on this planet, N participants gathered from all over the planet.
The... | instruction | 0 | 63,891 | 11 | 127,782 |
Yes | output | 1 | 63,891 | 11 | 127,783 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On a planet far, far away, M languages are spoken. They are conveniently numbered 1 through M.
For CODE FESTIVAL 20XX held on this planet, N participants gathered from all over the planet.
The... | instruction | 0 | 63,892 | 11 | 127,784 |
No | output | 1 | 63,892 | 11 | 127,785 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On a planet far, far away, M languages are spoken. They are conveniently numbered 1 through M.
For CODE FESTIVAL 20XX held on this planet, N participants gathered from all over the planet.
The... | instruction | 0 | 63,893 | 11 | 127,786 |
No | output | 1 | 63,893 | 11 | 127,787 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On a planet far, far away, M languages are spoken. They are conveniently numbered 1 through M.
For CODE FESTIVAL 20XX held on this planet, N participants gathered from all over the planet.
The... | instruction | 0 | 63,894 | 11 | 127,788 |
No | output | 1 | 63,894 | 11 | 127,789 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
On a planet far, far away, M languages are spoken. They are conveniently numbered 1 through M.
For CODE FESTIVAL 20XX held on this planet, N participants gathered from all over the planet.
The... | instruction | 0 | 63,895 | 11 | 127,790 |
No | output | 1 | 63,895 | 11 | 127,791 |
Provide a correct Python 3 solution for this coding contest problem.
Welcome to PC Koshien, players. At PC Koshien, competitions are currently being held in a total of three categories: programming category, mobile category, and Ichimai's picture CG category.
Given the number of participants in each department, creat... | instruction | 0 | 63,913 | 11 | 127,826 |
"Correct Solution:
```
#coding:utf-8
#Your code here
a,b,c=map(int,input().split())
print(a+b+c)
``` | output | 1 | 63,913 | 11 | 127,827 |
Provide a correct Python 3 solution for this coding contest problem.
Welcome to PC Koshien, players. At PC Koshien, competitions are currently being held in a total of three categories: programming category, mobile category, and Ichimai's picture CG category.
Given the number of participants in each department, creat... | instruction | 0 | 63,914 | 11 | 127,828 |
"Correct Solution:
```
a = input().split()
b=int(a[0])+int(a[1])+int(a[2])
print(b)
``` | output | 1 | 63,914 | 11 | 127,829 |
Provide a correct Python 3 solution for this coding contest problem.
Welcome to PC Koshien, players. At PC Koshien, competitions are currently being held in a total of three categories: programming category, mobile category, and Ichimai's picture CG category.
Given the number of participants in each department, creat... | instruction | 0 | 63,915 | 11 | 127,830 |
"Correct Solution:
```
# coding: utf-8
# Your code here!
p,m,c= map(int,input().split())
print(p+m+c)
``` | output | 1 | 63,915 | 11 | 127,831 |
Provide a correct Python 3 solution for this coding contest problem.
Welcome to PC Koshien, players. At PC Koshien, competitions are currently being held in a total of three categories: programming category, mobile category, and Ichimai's picture CG category.
Given the number of participants in each department, creat... | instruction | 0 | 63,916 | 11 | 127,832 |
"Correct Solution:
```
# 10 10 20 => 分割して、数値に変換する
p, m, c = map(int, input().split())
print(p + m + c)
``` | output | 1 | 63,916 | 11 | 127,833 |
Provide a correct Python 3 solution for this coding contest problem.
Welcome to PC Koshien, players. At PC Koshien, competitions are currently being held in a total of three categories: programming category, mobile category, and Ichimai's picture CG category.
Given the number of participants in each department, creat... | instruction | 0 | 63,917 | 11 | 127,834 |
"Correct Solution:
```
import math
a,b,c,=map(int,input().split())
print(a+b+c)
``` | output | 1 | 63,917 | 11 | 127,835 |
Provide a correct Python 3 solution for this coding contest problem.
Welcome to PC Koshien, players. At PC Koshien, competitions are currently being held in a total of three categories: programming category, mobile category, and Ichimai's picture CG category.
Given the number of participants in each department, creat... | instruction | 0 | 63,918 | 11 | 127,836 |
"Correct Solution:
```
import sys
import math
p,m,c=map(int,input().split())
total=p+m+c
print(total)
``` | output | 1 | 63,918 | 11 | 127,837 |
Provide a correct Python 3 solution for this coding contest problem.
Welcome to PC Koshien, players. At PC Koshien, competitions are currently being held in a total of three categories: programming category, mobile category, and Ichimai's picture CG category.
Given the number of participants in each department, creat... | instruction | 0 | 63,919 | 11 | 127,838 |
"Correct Solution:
```
while True:
try:
a,b,c=map(int,input().split())
print(a+b+c)
except:break
``` | output | 1 | 63,919 | 11 | 127,839 |
Provide a correct Python 3 solution for this coding contest problem.
Welcome to PC Koshien, players. At PC Koshien, competitions are currently being held in a total of three categories: programming category, mobile category, and Ichimai's picture CG category.
Given the number of participants in each department, creat... | instruction | 0 | 63,920 | 11 | 127,840 |
"Correct Solution:
```
p, m, c = map(int, input().split())
all = p+m+c
print(all)
``` | output | 1 | 63,920 | 11 | 127,841 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Welcome to PC Koshien, players. At PC Koshien, competitions are currently being held in a total of three categories: programming category, mobile category, and Ichimai's picture CG category.
Gi... | instruction | 0 | 63,921 | 11 | 127,842 |
Yes | output | 1 | 63,921 | 11 | 127,843 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Welcome to PC Koshien, players. At PC Koshien, competitions are currently being held in a total of three categories: programming category, mobile category, and Ichimai's picture CG category.
Gi... | instruction | 0 | 63,922 | 11 | 127,844 |
Yes | output | 1 | 63,922 | 11 | 127,845 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Welcome to PC Koshien, players. At PC Koshien, competitions are currently being held in a total of three categories: programming category, mobile category, and Ichimai's picture CG category.
Gi... | instruction | 0 | 63,923 | 11 | 127,846 |
Yes | output | 1 | 63,923 | 11 | 127,847 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Welcome to PC Koshien, players. At PC Koshien, competitions are currently being held in a total of three categories: programming category, mobile category, and Ichimai's picture CG category.
Gi... | instruction | 0 | 63,924 | 11 | 127,848 |
Yes | output | 1 | 63,924 | 11 | 127,849 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Welcome to PC Koshien, players. At PC Koshien, competitions are currently being held in a total of three categories: programming category, mobile category, and Ichimai's picture CG category.
Gi... | instruction | 0 | 63,925 | 11 | 127,850 |
No | output | 1 | 63,925 | 11 | 127,851 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Welcome to PC Koshien, players. At PC Koshien, competitions are currently being held in a total of three categories: programming category, mobile category, and Ichimai's picture CG category.
Gi... | instruction | 0 | 63,926 | 11 | 127,852 |
No | output | 1 | 63,926 | 11 | 127,853 |
Provide a correct Python 3 solution for this coding contest problem.
Example
Input
2 2 7
3 4
3 2
1 3
1 1
2 2
1 2
2 1
1 2
2 2
1 1
Output
5 | instruction | 0 | 63,944 | 11 | 127,888 |
"Correct Solution:
```
import sys
readline = sys.stdin.readline
write = sys.stdout.write
def solve():
P, R, T = map(int, readline().split())
*L, = map(int, readline().split())
RS = [list(map(int, readline().split())) for i in range(P)]
LG = [list(map(int, input().split())) for i in range(T)]
prv =... | output | 1 | 63,944 | 11 | 127,889 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya used to be an accountant before the war began and he is one of the few who knows how to operate a computer, so he was assigned as the programmer.
We all know that programs often store set... | instruction | 0 | 64,263 | 11 | 128,526 |
Yes | output | 1 | 64,263 | 11 | 128,527 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya used to be an accountant before the war began and he is one of the few who knows how to operate a computer, so he was assigned as the programmer.
We all know that programs often store set... | instruction | 0 | 64,264 | 11 | 128,528 |
Yes | output | 1 | 64,264 | 11 | 128,529 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya used to be an accountant before the war began and he is one of the few who knows how to operate a computer, so he was assigned as the programmer.
We all know that programs often store set... | instruction | 0 | 64,265 | 11 | 128,530 |
No | output | 1 | 64,265 | 11 | 128,531 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya used to be an accountant before the war began and he is one of the few who knows how to operate a computer, so he was assigned as the programmer.
We all know that programs often store set... | instruction | 0 | 64,266 | 11 | 128,532 |
No | output | 1 | 64,266 | 11 | 128,533 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya used to be an accountant before the war began and he is one of the few who knows how to operate a computer, so he was assigned as the programmer.
We all know that programs often store set... | instruction | 0 | 64,267 | 11 | 128,534 |
No | output | 1 | 64,267 | 11 | 128,535 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya used to be an accountant before the war began and he is one of the few who knows how to operate a computer, so he was assigned as the programmer.
We all know that programs often store set... | instruction | 0 | 64,268 | 11 | 128,536 |
No | output | 1 | 64,268 | 11 | 128,537 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sereja is a coder and he likes to take part in Codesorfes rounds. However, Uzhland doesn't have good internet connection, so Sereja sometimes skips rounds.
Codesorfes has rounds of two types: D... | instruction | 0 | 64,347 | 11 | 128,694 |
Yes | output | 1 | 64,347 | 11 | 128,695 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sereja is a coder and he likes to take part in Codesorfes rounds. However, Uzhland doesn't have good internet connection, so Sereja sometimes skips rounds.
Codesorfes has rounds of two types: D... | instruction | 0 | 64,348 | 11 | 128,696 |
Yes | output | 1 | 64,348 | 11 | 128,697 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sereja is a coder and he likes to take part in Codesorfes rounds. However, Uzhland doesn't have good internet connection, so Sereja sometimes skips rounds.
Codesorfes has rounds of two types: D... | instruction | 0 | 64,349 | 11 | 128,698 |
Yes | output | 1 | 64,349 | 11 | 128,699 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sereja is a coder and he likes to take part in Codesorfes rounds. However, Uzhland doesn't have good internet connection, so Sereja sometimes skips rounds.
Codesorfes has rounds of two types: D... | instruction | 0 | 64,350 | 11 | 128,700 |
Yes | output | 1 | 64,350 | 11 | 128,701 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sereja is a coder and he likes to take part in Codesorfes rounds. However, Uzhland doesn't have good internet connection, so Sereja sometimes skips rounds.
Codesorfes has rounds of two types: D... | instruction | 0 | 64,351 | 11 | 128,702 |
No | output | 1 | 64,351 | 11 | 128,703 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sereja is a coder and he likes to take part in Codesorfes rounds. However, Uzhland doesn't have good internet connection, so Sereja sometimes skips rounds.
Codesorfes has rounds of two types: D... | instruction | 0 | 64,352 | 11 | 128,704 |
No | output | 1 | 64,352 | 11 | 128,705 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sereja is a coder and he likes to take part in Codesorfes rounds. However, Uzhland doesn't have good internet connection, so Sereja sometimes skips rounds.
Codesorfes has rounds of two types: D... | instruction | 0 | 64,353 | 11 | 128,706 |
No | output | 1 | 64,353 | 11 | 128,707 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sereja is a coder and he likes to take part in Codesorfes rounds. However, Uzhland doesn't have good internet connection, so Sereja sometimes skips rounds.
Codesorfes has rounds of two types: D... | instruction | 0 | 64,354 | 11 | 128,708 |
No | output | 1 | 64,354 | 11 | 128,709 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Iahub and Iahubina went to a picnic in a forest full of trees. Less than 5 minutes passed before Iahub remembered of trees from programming. Moreover, he invented a new problem and Iahubina has ... | instruction | 0 | 64,358 | 11 | 128,716 |
No | output | 1 | 64,358 | 11 | 128,717 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Iahub and Iahubina went to a picnic in a forest full of trees. Less than 5 minutes passed before Iahub remembered of trees from programming. Moreover, he invented a new problem and Iahubina has ... | instruction | 0 | 64,359 | 11 | 128,718 |
No | output | 1 | 64,359 | 11 | 128,719 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a simple way to create hard tasks: take one simple problem as the query, and try to find an algorithm that can solve it faster than bruteforce. This kind of tasks usually appears in OI ... | instruction | 0 | 64,376 | 11 | 128,752 |
No | output | 1 | 64,376 | 11 | 128,753 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are an assistant director in a new musical play. The play consists of n musical parts, each part must be performed by exactly one actor. After the casting the director chose m actors who can... | instruction | 0 | 64,377 | 11 | 128,754 |
No | output | 1 | 64,377 | 11 | 128,755 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are an assistant director in a new musical play. The play consists of n musical parts, each part must be performed by exactly one actor. After the casting the director chose m actors who can... | instruction | 0 | 64,378 | 11 | 128,756 |
No | output | 1 | 64,378 | 11 | 128,757 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.