Datasets:

TheFactoryX
/

edition_2104_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
1149_E. Election Promises	"Sherlock Holmes has decided to start a new academy to some of the young lads. He has conducted seve(...TRUNCATED)	{ "input": [ "3 3\n2 4 1 2 1\nXAX\nB.B\nXAX" ], "output": [ "0.0000000000000" ] }	{"input":["5\n10\nbb\nbb\nab\naa\nbb\nbb\nba\naa\nbb\nab\n10\nbb\nab\nba\nab\nba\nba\nab\nba\nba\nba(...TRUNCATED)	{"input":["20 10 3\nebebccacdb\neeebccddeT\neadebecaac\nadeeeaccbc\nbaccccdaed\nabbaecbaed\ndadbecba(...TRUNCATED)	6	13	{"language":[2,4,4,2,4,2,4,2,4,4,2,2,4,4,2,2,3,4,4,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)	{"language":[2,4,2,2,2,2,2,2,2,2,3,0,2,3,2,2,0,2,2,3,0,2,2,2,2,3,3,2,3,4,3,3,2,3,2,0,2,2,2,0,3,4,0,2(...TRUNCATED)	760	C	0	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	0
1466_F. Euclid's nightmare	"Every day Ruslan tried to count sheep to fall asleep, but this didn't help. Now he has found a more(...TRUNCATED)	{"input":["5\n42\n17\n444\n7\n51\n"],"output":[" (...TRUNCATED)	{"input":["10 3 5\n1 2\n2 3\n1 4\n2 3 6\n1 6\n2 1 6\n2 8 7\n1 10\n","10 2 6\n1 2\n1 3\n2 1 8\n2 9 2\(...TRUNCATED)	{"input":["4\n3 4\n1 2\n3 4\n1 4\n","4\n2 4\n1 3\n3 4\n1 1\n","4\n1 4\n2 4\n2 4\n1 2\n","7\n7 7\n2 3(...TRUNCATED)	6	9	{"language":[4,4,3,2,4,2,1,3,2,3,1,4,4,3,1,2,1,4,2,3,2,4,4,2,4,3,3,1,4,2,2,2,3,1,3,2,4,3,4,4,4,1,1,2(...TRUNCATED)	{ "language": [], "solution": [] }	0	A	0	0	[ "greedy" ]	false		null	256,000,000
331_D2. Escaping on Beaveractor	"During the archaeological research in the Middle East you found the traces of three ancient religio(...TRUNCATED)	{"input":["3 2\n0 0 0\n1 1 1\n","4 3\n0 0 2 1\n2 0 1 1\n","5 10\n0 0 0 1 2\n2 1 0 0 0\n"],"output":[(...TRUNCATED)	{"input":["4 5\n1 2 3 1\n2 1 2 8\n2 3 4 7\n1 1 3 3\n2 3 4 8\n","1 4\n1 1 1 2\n2 1 1 6\n1 1 1 1\n2 1 (...TRUNCATED)	{"input":["2\n2 1\n3 4\n3 2\n1 0 2\n\nSAMPLE","2\n2 1\n5 5\n3 2\n1 0 2\n\nSAMPLE","2\n2 1\n3 0\n3 2\(...TRUNCATED)	3	7	{"language":[3,4,2,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,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,4,2,2,1,3,2,2,2,2,3,2,2,1,2,2,2,4,2,2,2,2,2,4,2,3,2,2,1,4,2,2,2,3,4,1,4,4,2(...TRUNCATED)	931	E	0	0	[]	false		{ "nanos": 0, "seconds": 2 }	1,073,741,824
p03150 KEYENCE Programming Contest 2019 - KEYENCE String	"You are given an array a of n integers.\n\nYou want to make all elements of a equal to zero by doin(...TRUNCATED)	{ "input": [ "2\n5\n5", "3\n1\n4\n3" ], "output": [ "5\n5", "4\n3\n4" ] }	{"input":["20\n9 4 8\n10 6 7\n4 6 0\n7 7 6\n3 3 10\n4 2 1\n4 4 0\n2 0 0\n8 8 7\n3 1 7\n3 10 7\n1 7 3(...TRUNCATED)	{"input":["9 3 23\n9 3 22\n10 3 28\n16 10 107\n20 8 102\n20 10 105\n20 10 155\n3 5 3\n4 2 11\n0 0 0"(...TRUNCATED)	2	12	{"language":[1],"solution":["while True: \n try:\n s = raw_input()\n except: (...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,140		0	1,300	[ "constructive algorithms", "graphs", "greedy", "sortings" ]	false		{ "nanos": 0, "seconds": 2 }	0
867_D. Gotta Go Fast	"James Bond has a new plan for catching his enemy. There are some cities and directed roads between (...TRUNCATED)	{ "input": [ "4\n1 3 2 4\n" ], "output": [ "1 1\n-1\n2 4\n9 6 12 \n1 4\n0 -12 -8 -16 \n" ] }	{"input":["9\n53 80 94 41 58 49 88 24 42\n85 11 32 64 40 56 63 95 73\n17 85 60 41 13 71 54 67 87\n38(...TRUNCATED)	{"input":["4\n1 1 1 1 1 1 1 1 1 1 1 1 3 3 6 3\n","1\n53\n","1\n77\n","1\n20\n","1\n10\n","1\n11\n","(...TRUNCATED)	2	7	{"language":[4,2,4,3,2,4,4,4,4,4,2,4,3,4,3,2,3,2,4,3,2,3,2,3,3,4,3,2,3,4,3,4,2,3,4,2,4,3,4,4,4,2,2,3(...TRUNCATED)	{"language":[2,0,0,2,0,2,0,0,0,2,2,2,2,0,0,0,0,2,0,4,2,0,4,0,0,0,0,0,2,0,4,2,4,2,0,2,0,0,2,2,2,0,0,0(...TRUNCATED)	0		1,250	0	[ "" ]	false	"Background\n\n会津大学付属幼稚園はプログラミングが大好きな子供が集まる(...TRUNCATED)	{ "nanos": 0, "seconds": 1 }	256,000,000
ig01	"You are given a string S consisting of letters `b`, `d`, `p` and `q`. Determine whether S is a mirr(...TRUNCATED)	{ "input": [ "3\n25\n46\n99" ], "output": [ "2\n1\n2\n" ] }	{"input":["100 3\n45 1 2 3 4 5 6 7 8 9 19 21 24 27 28 30 34 35 37 39 40 41 42 43 46 47 48 51 52 55 5(...TRUNCATED)	{"input":["2 2\n2 3\n2 3\n2 3\n2 2\n5 2","2 2\n2 3\n2 2\n2 3\n2 2\n2 2","2 2\n2 3\n2 3\n2 2\n2 2\n5 (...TRUNCATED)	1	7	{"language":[2,3,4,2,3,2,3,4,3,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,3,4,2,2,2,2,2,2,4,2,2,2,3,3,2,3,2,3(...TRUNCATED)	{"language":[4,4,1,3,4,1,4,2,3,4,3,1,3,2,4,4,4,1,1,3,2,4,4,4,2,2,4,2,4,2,4,4,1,2,2,4,1,1,4,4,2,2,4,3(...TRUNCATED)	425	D1	1,750	0	[ "games", "graphs" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
p01535 Markup language has Declined	"Note that this is the first problem of the two similar problems. You can hack this problem only if (...TRUNCATED)	{"input":["4 4\n1 2\n3 2\n3 4\n1 3","15 28\n10 7\n5 9\n2 13\n2 14\n6 1\n5 12\n2 10\n3 9\n10 15\n11 1(...TRUNCATED)	{"input":["7\n5\n-1 10 -1 12 -1\n5\n-1 40 35 -1 35\n6\n-1 -1 9 -1 3 -1\n2\n-1 -1\n2\n0 -1\n4\n1 -1 3(...TRUNCATED)	{"input":["10\n1 3\n3 9\n27 81\n2187 6561\n9 27\n12641 19683\n81 243\n729 2187\n59049 177147\n531441(...TRUNCATED)	2	15	{"language":[4,1,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,4,4,2,2,2,2,2,2,4,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	754	F	2,500	1,400	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	268,435,456
discover-the-monk	"The Berland capital (as you very well know) contains n junctions, some pairs of which are connected(...TRUNCATED)	{ "input": [ "3\n4251\n52310\n00006\n\nSAMPLE" ], "output": [ "12\n56\nunlucky" ] }	{"input":["100\n0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 (...TRUNCATED)	{"input":["10 4\n0 1 4 2 3 0 10 0 5 8\n","6 3\n0 0 1 0 4 5\n","6 1\n0 0 4 0 6 0\n","4 1\n0 1 0 0\n",(...TRUNCATED)	2	0	{"language":[2,2,2,2,2,4,4,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,4,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,3,2,2,4,2,2,2,2,2,2,4,2,2,2,3,2,2,2,2,2,2,2,2,2,2,4,3,2,2,2,3,2,2,4,3,2,2,2,2,2,2,4,2(...TRUNCATED)	875	H	0	2,500	[ "data structures", "graphs" ]	false		null	1,073,741,824
p03153 KEYENCE Programming Contest 2019 - Connecting Cities	"So the Beautiful Regional Contest (BeRC) has come to an end! n students took part in the contest. T(...TRUNCATED)	{ "input": [ "0", "0011", "11011010001011" ], "output": [ "0", "4", "12" ] }	{ "input": [], "output": [] }	{"input":["50\n16 4\n17 9\n31 19\n3 10\n8 1\n40 30\n3 31\n20 29\n47 27\n22 25\n32 34\n12 15\n40 32\n(...TRUNCATED)	2	0	{"language":[2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\n\n#pragma GCC optimize(\"O3\")\(...TRUNCATED)	{"language":[2,1,4,2,4,2,2,4,2,2,4,4,3,2,2,4,2,2,4,3,2,2,4,3,1,4,2,4,4,2,2,3,4,1,3,4,4,4,2,2,2,2,4,4(...TRUNCATED)	0	A2	0	0	[]	false		{ "nanos": 0, "seconds": 2 }	0
p01046 Yu-kun Likes a lot of Money	"Valeric and Valerko missed the last Euro football game, so they decided to watch the game's key mom(...TRUNCATED)	{"input":["4\nsword weapon 10 2 3 2\npagstarmor armor 0 15 3 1\niceorb orb 3 2 13 2\nlongbow weapon (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\n5\n3 5 1 2 4\n1\n1\n4\n4 3 1 2\n","3\n5\n4 5 2 1 3\n1\n1\n4\n4 3 1 2\n","3\n5\n3 4 2 1(...TRUNCATED)	5	12	{"language":[4,2,2,4,2,2,2,2,4,2,3,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,1,4,2,2,2,4,2,2,4,2,2,2,2,2,2,4,2,2(...TRUNCATED)	{"language":[2,3,2,2,0,2,2,2,4,2,2,2,2,1,2,2,2,4,2,3,2,2,2,2,2,2,2,2,0,4,0,2,1,2,3,2,2,2,3,3,2,2,2,2(...TRUNCATED)	1,007	B	3,000	2,100	[ "dfs and similar", "graphs" ]	false		null	1,073,741,824