Datasets:

TheFactoryX
/

edition_1984_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
p00447 Searching Constellation	"You are given a complete directed graph K_n with n vertices: each pair of vertices u ≠ v in K_n h(...TRUNCATED)	{ "input": [ "5\n3 2 1 6 5\n", "4\n3 3 3 3\n" ], "output": [ "8", "0" ] }	{"input":["4 10\n1 333333333 666666666 1000000000\n1000000000 1000000000 1000000000 1000000000\n1 1\(...TRUNCATED)	{"input":["1000\nspnogbxcrp\nbaukbqnmyu\nogxdxhtcwz\nbsjufplykz\nkhicdrdixl\nzookiqggel\nfczygjfhfa\(...TRUNCATED)	2	0	{"language":[2,4,2,4,1,2,2,2,2,2,3,3,2,2,3,2,4,3,2,4,2,4,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,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)	886		0	2,500	[ "brute force", "implementation", "strings" ]	false		{ "nanos": 0, "seconds": 2 }	134,217,728
chandu-and-his-girlfriend-returns	"In computer science, there is a method called \"Divide And Conquer By Node\" to solve some hard pro(...TRUNCATED)	{"input":["1 1 1\n","3 1 0\n"],"output":[" (...TRUNCATED)	{"input":["10 10\n.L.....R..\n.........U\n..D....D..\n.R......L.\n....L.....\n.........D\n......U...(...TRUNCATED)	{"input":["5 6\n3 1 2 6\n3 1 2 6\n1 1\n2 3 6\n3 1 5 6\n","5 7\n2 6 7\n5 1 1 1 1 1\n3 6 5 5\n0\n4 4 3(...TRUNCATED)	2	6	{"language":[2,3,4,3,3,4,1,3,3,2,4,4,3,3,1,3,2,3,3,2,3,4,3,3,3,2,3,4,4,3,3,3,2,3,3,3,2,3,2,3,3,3,3,3(...TRUNCATED)	{ "language": [], "solution": [] }	209	D	2,500	3,500	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
814_C. An impassioned circulation of affection	Example Input ACM Output 0	{"input":["4\n2 1 2 3 4 3 2 6 1 1 2 2 1 2 3 2\n","1\n42\n","2\n1 1 1 1\n"],"output":["6 4 3 2 ","42 (...TRUNCATED)	{"input":["7\n","2000000000000000000\n","1000000000000000000\n","987654321012345678\n"],"output":["2(...TRUNCATED)	{"input":["72\n909 34\n420 51\n621 76\n65 48\n82 41\n665 53\n43 33\n309 21\n942 51\n156 13\n997 11\n(...TRUNCATED)	2	7	{"language":[4,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,1,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	219	D	1,000	1,700	[ "dp", "probabilities" ]	false		{ "nanos": 0, "seconds": 2 }	512,000,000
571_E. Geometric Progressions	"Nathan O. Davis is a student at the department of integrated systems. Today he learned digital quan(...TRUNCATED)	{"input":["3\n7 7 3 5\n1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 5\n4 5 2 3\n1 2\n2 3\n3 4\n4 1\n4 2\n4 3 2 1\(...TRUNCATED)	{"input":["2 1\n1000000000 1000000000\n2 1\n","3 2\n123 345 567\n1 2\n3 2\n","3 0\n4 1 4\n","3 2\n1 (...TRUNCATED)	{"input":["2 5 1\n0 4 6\n0 2 7\n","1 1 1000000000\n0 0 1\n","5 200 10\n1 1 1\n1000000000 200 1000000(...TRUNCATED)	5	8	{"language":[3,4,3,1,3,1,2,3,4,3,3,2,3,2,4,3,2,2,2,1,1,2,3,3,3,3,3,2,4,4,4,2,4,4,2,4,3,3,4,1,3,4,1,2(...TRUNCATED)	{"language":[3,4,2,4,4,2,1,4,2,4,2,2,2,4,2,4,4,1,2,4,2,2,4,1,4,2,4,4,2,4,4,4,2,4,4,2,2,4,2,3,2,4,4,2(...TRUNCATED)	0	D	0	2,200	[ "implementation", "math" ]	false		{ "nanos": 0, "seconds": 5 }	256,000,000
209_B. Pixels	"You are given a sequence of n integers a1, a2, ..., an. \n\nDetermine a real number x such that the(...TRUNCATED)	{"input":["3 2\n2 1\n3 2\n3 1\n","4 3\n4 1\n1 2\n2 2\n3 2\n"],"output":["5.5\n1 3 \n2 1 2 \n","8.0\n(...TRUNCATED)	{"input":["1 1 1 2\n5\n1000000000 1 10000\n19920401 1188 5566\n1000000000 1 10000\n1 1 10000\n5 100 (...TRUNCATED)	{"input":["3 10 10\n1\n1 1 1\n1\n3 3 3\n1\n5 5 5\n0 1 1\n1 0 0\n0 1 0","1 10 3\n3\n1 10 1\n2 20 2\n3(...TRUNCATED)	6	0	{"language":[3,1,1,4,4,3,4,3,1,1,2,2,3,4,3,1,1,3,2,4,4,3,4,2,4,2,4,4,3,3,4,3,4,1,1,2,2,3,3,2,2,4,2,4(...TRUNCATED)	{"language":[2,2,2,3,0,2,2,3,2,2,3,2,3,2,3,3,2,3,2,0,3,2,2,3,3,0,0,2,3,2,2,2,2,2,2,2,2,2,3,3,0,2,2,3(...TRUNCATED)	442	E	500	2,600	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
p00914 Equal Sum Sets	"Problem Desrcription\nShil likes to play with trees a lot.He is playing with an undirected tree con(...TRUNCATED)	{ "input": [ "3\n3\n5\n199\n" ], "output": [ "1.931851653\n3.196226611\n126.687663797\n" ] }	{ "input": [], "output": [] }	{"input":["3 5 999999997\n","1011 1 1000000000\n","1 30 33\n","29 3 1000000000\n","3 2 31\n","2 2 85(...TRUNCATED)	2	9	{"language":[2,2,2,2,2,2,2,4,2,2,2,4,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,4,2,2(...TRUNCATED)	{"language":[4,4,3,2,2,4,3,1,4,2,4,2,1,2,4,2,2,4,2,4,4,2,2,3,2,3,2,4,4,4,2,2,4,2,2,4,2,4,4,2,2,3,3,2(...TRUNCATED)	167	A	0	0	[ "constructive algorithms", "graphs", "implementation" ]	false		null	268,435,456
1140_B. Good String	"You are given a simple connected undirected graph G consisting of N vertices and M edges. The verti(...TRUNCATED)	{ "input": [ "4 1 2 3 4\n", "5 5 46 372 81 9\n" ], "output": [ "5 3 5 7 ", "14 51 418 453 90 " ] }	{"input":["2\n1 1 3 1\n3\n0 1 2\n"],"output":[" (...TRUNCATED)	{"input":["5 0\n884430748 884430748 182474629 708433020 708433020\n","5 2\n65390026 1454694739 65390(...TRUNCATED)	3	7	{"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":[3,2,3,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)	0		0	3,000	[ "implementation", "strings" ]	false		{ "nanos": 0, "seconds": 8 }	256,000,000
insect-colony-2	"James Bond has a new plan for catching his enemy. There are some cities and directed roads between (...TRUNCATED)	{ "input": [ "0 1 1 1 1 0\n", "1 1 0 0 1000 1000\n" ], "output": [ "Yes\n", "No\n" ] }	{ "input": [], "output": [] }	{"input":["6 6\n1 6\n1 4\n1 2 1\n2 3 1\n2 5 1\n2 4 3\n4 5 2\n5 6 1","11 6\n1 6\n1 4\n1 2 1\n4 3 1\n2(...TRUNCATED)	5	0	{"language":[2,3,2,4,3,4,3,4,4,3,3,2,2,4,3,4,4,4,2,4,2,2,4,3,3,3,3,2,3,1,4,3,3,2,4,2,4,2,4,2,3,3,3,2(...TRUNCATED)	{ "language": [], "solution": [] }	784		0	2,100	[ "" ]	false	"あなたは友人と旅行に行きたいと考えています。ところが、浪費癖のある(...TRUNCATED)	{ "nanos": 0, "seconds": 1 }	268,435,456
1334_A. Level Statistics	"Problem\n\nKND is a student programmer at the University of Aizu. His chest is known to be very sex(...TRUNCATED)	{ "input": [ "1\n", "4\n", "6\n", "2\n" ], "output": [ "1 1\n", "1 4\n", "2 3\n", "1 2\n" ] }	{"input":["1 999999999 29983 29989\n","9999999 10000 29983 29989\n","808351 17767 433 509\n","197 2 (...TRUNCATED)	{"input":["4\naaa\nabc\nabdbca\nabca","4\naaa\nabc\nabdbc`\naaca","4\naab\nacc\n`bd`cb\naaad","4\nba(...TRUNCATED)	5	8	{"language":[2,2,4,1,1,2,4,1,4,2,2,2,2,4,2,2,2,2,3,1,4,2,4,2,1,4,2,2,2,1,1,2,2,2,1,4,1,4,4,2,1,4,2,4(...TRUNCATED)	{"language":[2,1,4,2,2,2,4,2,3,2,2,2,2,4,2,2,2,2,2,2,3,4,2,4,4,4,2,3,4,3,2,3,4,3,2,2,3,2,2,4,2,2,4,2(...TRUNCATED)	0	A	3,000	1,800	[ "" ]	false	"r × c の2次元グリッド上の２つの座標 (a1,a2) と (b1,b2) が与えられる。ある(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	268,435,456
p03819 AtCoder Regular Contest 068 - Snuke Line	"Chef loves lucky numbers. Everybody knows that lucky numbers are positive integers whose decimal re(...TRUNCATED)	{"input":["10 9 3 1\n10 9 11\n9 2 37\n2 4 4\n4 1 8\n1 5 2\n5 7 3\n7 3 2\n3 8 4\n8 6 13\n2 3\n","9 11(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1 36 0\n-1 -1 -1","0 30 0\n-1 -1 -1","0 32 0\n-1 -1 -1","1 16 0\n-1 -1 -1","0 36 0\n-1 -1(...TRUNCATED)	2	0	{"language":[1,1,1],"solution":["for _ in range(input()):\n try:\n eval(raw_input())\n (...TRUNCATED)	{ "language": [], "solution": [] }	0		1,000	2,100	[ "binary search", "dsu", "graphs", "shortest paths", "trees" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000