Datasets:

TheFactoryX
/

edition_1568_deepmind-code_contests-readymade

name stringlengths 4 70	description stringlengths 31 8.62k	public_tests dict	private_tests dict	generated_tests dict	source int64 1 6	difficulty int64 0 21	solutions dict	incorrect_solutions dict	cf_contest_id int64 0 1.55k	cf_index stringclasses 23 values	cf_points float64 0 3.75k	cf_rating int64 0 3.5k	cf_tags listlengths 0 7	is_description_translated bool 2 classes	untranslated_description stringclasses 36 values	time_limit dict	memory_limit_bytes int64 0 1.07B
abc-garfield	"You are given a functional graph. It is a directed graph, in which from each vertex goes exactly on(...TRUNCATED)	{ "input": [ "1 2 1\n1 100 1\n1 100 100\n", "100 100 100\n1 1 1\n1 1 1\n" ], "output": [ "99", "0" ] }	{ "input": [], "output": [] }	{"input":["4","6","3","7","5","8","4","3","5","6","8","7"],"output":["aaaa\naaab\naaba\naabb\naabc\n(...TRUNCATED)	1	12	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	470	A	500	800	[ "data structures", "greedy", "sortings" ]	false	"Problem\n\nKND君は会津大学に在籍する学生プログラマである。彼の住む町の(...TRUNCATED)	{ "nanos": 0, "seconds": 1 }	256,000,000
p03254 AtCoder Grand Contest 027 - Candy Distribution Again	"Vasya is currently at a car rental service, and he wants to reach cinema. The film he has bought a (...TRUNCATED)	{"input":["5\n3\n1 6\n1 7\n1 5\n2\n1 4\n1 3\n3\n1 10\n3 5\n2 3\n3\n1 15\n2 4\n1 10\n1\n1 100\n"],"ou(...TRUNCATED)	{"input":["100 1 7\n83\n174\n191\n145\n167\n55\n232\n157\n51\n209\n85\n73\n216\n39\n72\n76\n132\n70\(...TRUNCATED)	{"input":["5\nAJMP\naB33d\nE\n86AE\nAM\n6\nJPEM\nWaEaETC302Q\nCP\nrTurnAGundam1isdefferentf","5\nAJM(...TRUNCATED)	2	8	{"language":[1],"solution":["from collections import deque\nclass Frog():\n\t\n\tdef __init__(self,n(...TRUNCATED)	{"language":[4,3,3,1,2,4,2,2,3,3,4,3,4,3,2,2,4,3,3,3,4,2,2,2,4,3,2,2,3,3,4,4,4,1,1,4,1,1,1,3,2,4,2,1(...TRUNCATED)	0		0	3,400	[]	false		{ "nanos": 0, "seconds": 2 }	134,217,728
p03225 Tenka1 Programmer Contest - Equilateral	"You are given N positive integers a_1, a_2, ..., a_N.\n\nFor a non-negative integer m, let f(m) = ((...TRUNCATED)	{"input":["2 7 10\n3 12 10\n5 16 8\n","4 8 10\n0 12 3\n1 1 0\n0 3 11\n1 6 9\n","3 10 10\n0 12 10\n1 (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["5\n3\n1 1\n1 1\n1 1\n3\n1 1\n1 1\n1 1\n3\n1 1\n1 1\n1 1\n3\n1 2\n1 1\n1 1\n3\n1 100\n1 1\(...TRUNCATED)	2	9	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	290	D	1,000	0	[ "dp", "matrices" ]	false		{ "nanos": 0, "seconds": 1 }	268,435,456
p01835 Donut Decoration	"Linda likes to change her hair color from time to time, and would be pleased if her boyfriend Archi(...TRUNCATED)	{"input":["3\n3 0 2 5\n1 1 1 6\n3 2 1 10\n1 -2 3 6\n2\n1 2\n3 3\n1\n2\n3\n0\n3 0 2 5\n1 1 1 6\n3 2 1(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["abcdabcdab\n5\n2 2 8 ba\n2 1 10 ab\n1 3 a\n1 4 b\n2 1 4 ab\n","ababababa\n3\n2 2 7 aba\n1(...TRUNCATED)	6	12	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,4,2,2,2,2,2(...TRUNCATED)	{"language":[4,2,2,2,2,1,4,2,3,3,4,1,4,1,2,2,2,2,2,2,3,2,1,3,3,2,2,1,2,2,4,3,1,4,1,1,3,4,4,3,2,3,4,3(...TRUNCATED)	0		0	0	[]	false		{ "nanos": 500000000, "seconds": 2 }	256,000,000
1189_A. Keanu Reeves	"You are given an integer x represented as a product of n its prime divisors p_1 ⋅ p_2, ⋅ … (...TRUNCATED)	{"input":["5 5 13 0 4\n0 1 5\n2 1 2\n3 2 3\n1 4 0\n4 3 4\n","2 1 123456789 0 1\n0 1 0\n","2 1 999999(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["61\n17357774\n248290406\n171408490\n20054376\n118774144\n110228788\n8827234\n85304880\n15(...TRUNCATED)	2	8	{"language":[2,2,2,4,2,4,2,4,4,4,4,2,4,2,4,2,4,3,2,2,2,4,2,2,2,2,1,4,4,4,4,2,2,2,2,4,4,2,4,4,2,4,2,3(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,4,2,0,2,2,4,2,2,2,2,2,4,2,2,2,2,0,2,2,2],"solution":["#include <bits/(...TRUNCATED)	1,129	D	0	1,700	[ "constructive algorithms", "graphs", "greedy", "sortings" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
730_G. Car Repair Shop	"Malek has recently found a treasure map. While he was looking for a treasure he found a locked door(...TRUNCATED)	{ "input": [ "4 5\n10 4 18 3\n", "2 2\n1 2\n" ], "output": [ "4", "1" ] }	{"input":["1 0\n1 1 0\n1 446844829 77109657 780837560\n1 754808995 539371459\n","1 1\n1 1\n2 2 0\n1 (...TRUNCATED)	{"input":["3 2\n1 2 5\n","3 10\n5 3 10\n","3 4\n0 2 5\n","1 100\n5\n","7 20\n2 15 12 11 20 19 12\n",(...TRUNCATED)	6	0	{"language":[2,2,2,2,2,2,4,2,2,4,4,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2(...TRUNCATED)	{"language":[3,3,3,2,3,2,3,2,4,2,2,3,3,4,4,3,2,2,4,3,2,3,2,2,4,2,2,4,2,3,2,2,2,2,2,2,2,2,4,2,2,3,2,4(...TRUNCATED)	0		2,500	0	[ "dp", "math" ]	false		{ "nanos": 0, "seconds": 1 }	512,000,000
699_F. Limak and Shooting Points	"You are given a sequence of length N: A_1, A_2, ..., A_N. For each integer i between 1 and N (inclu(...TRUNCATED)	{ "input": [ "3\n3 4 5\n1 0 5\n5 3 2\n" ], "output": [ "9\n0\n6\n" ] }	{ "input": [], "output": [] }	{"input":["21 6\n12 15 14 4 4 7 3 4 11 1 15 4 12 11 12 8 11 12 3 4 4\n","50 25\n19 1 17 6 4 21 9 16 (...TRUNCATED)	2	7	{"language":[2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,0,2,0,2,2,2,2,2,0,2,0,1,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,0,2,2(...TRUNCATED)	0	A	0	800	[ "" ]	false		{ "nanos": 0, "seconds": 8 }	1,073,741,824
acdemy	"A certain business maintains a list of all its customers' names. The list is arranged in order of i(...TRUNCATED)	{ "input": [ "11 5 2\n11010100101\n", "11 5 1\n11010100101\n" ], "output": [ "1\n", "3\n" ] }	{ "input": [], "output": [] }	{"input":["1 10\n700282491 332230980 954401907 59481241 188256336 995466811 463183048 725322957 8929(...TRUNCATED)	2	0	{"language":[1,1],"solution":["from math import*\nfor i in range (input()):\n num ,k = map(int,ra(...TRUNCATED)	{"language":[2,2,2,0,0,2,2,3,3,2,2,2,3,3,2,0,3,2,2,2,2,2,2,2,3,2,2,2,4,2,2,2,2,2,2,0,2,2,2,2,3,2,2,0(...TRUNCATED)	0		0	1,100	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	134,217,728
83_C. Track	"In code world all genders are considered equal ( It means their is nothing like male or female). No(...TRUNCATED)	{ "input": [ "3\nkek\npreceq\ncheburek\n", "4\nmail\nai\nlru\ncf\n" ], "output": [ "NO\n", "cfmailru\n" ] }	{"input":["5\n42665793 142698407 856080769 176604645 248258165\n10\n1 5 141156007\n2 5 5 3\n2 4 4 2\(...TRUNCATED)	{"input":["brtakoktrosttttttttttosafasfkalsfkodfdasiofhadfhasdsajfdsafoasodsafahaihfdisoadspapsapios(...TRUNCATED)	2	7	{"language":[1,1,1],"solution":["t = int(input())\nfor i in range(t):\n n = int(input())\n pri(...TRUNCATED)	{ "language": [], "solution": [] }	0		0	1,700	[]	false		{ "nanos": 0, "seconds": 3 }	536,870,912
1466_F. Euclid's nightmare	"Chef had a hard time arguing with his friend, and after getting a great old kick Chef saw a colored(...TRUNCATED)	{ "input": [ "7\n1\n2\n3\n4\n5\n100\n2000000\n" ], "output": [ "0\n0\n4\n4\n12\n990998587\n804665184\n" ] }	{ "input": [], "output": [] }	{"input":["0.2 0.1 1.448460702857607\n","1.0 200.44854766953543 1.0\n","0.3 1.3846300094261417 0.6\n(...TRUNCATED)	2	2	{"language":[4,3,1,3,2,2,4,2,4,2,4,2,3,2,3,2,2,3,3,2,3,3,2,3,4,2,2,4,3,2,4,2,3,2,3,2,2,4,4,3,2,3,2,3(...TRUNCATED)	{ "language": [], "solution": [] }	9		500	0	[ "data structures", "dfs and similar", "shortest paths", "trees" ]	false		{ "nanos": 0, "seconds": 2 }	64,000,000