Datasets:

TheFactoryX
/

edition_1513_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	time_limit dict	memory_limit_bytes int64 0 1.07B
1547_C. Pair Programming	"You're given an array a_1, …, a_n of n non-negative integers.\n\nLet's call it sharpened if and o(...TRUNCATED)	{"input":["1 5 3\n1 3\n1 1\n1 5\n","2 2 3\n1 2\n2 2\n2 1\n","4 3 6\n1 2\n1 3\n2 2\n2 3\n3 1\n3 3\n"](...TRUNCATED)	{"input":["20\n...............\n","97\n*..*.......**......................(...TRUNCATED)	{"input":["aa\n2\nbb\nbc\n","th\n1\nht\n","bb\n1\nab\n","bn\n100\ndf\nyb\nze\nml\nyr\nof\nnw\nfm\ndw(...TRUNCATED)	1	11	{"language":[2,4,4,4,4,4,4,4,4,4,4,4,2,2,4,4,4,4,2,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,2,4,4,4,4(...TRUNCATED)	{"language":[2,2,2,2,2,2,4,2,1,4,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,4,2,3,2,2,1,2,4,2,2,2,2,2,4,2,2,1(...TRUNCATED)	0		3,000	1,800	[ "dfs and similar", "dp" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1012_E. Cycle sort	"Bearland has n cities, numbered 1 through n. Cities are connected via bidirectional roads. Each roa(...TRUNCATED)	{"input":["1\nindex.dml\n<dml><title>Markup language has Declined</title><br>Programmers world</dml>(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	5	0	{"language":[3,1,1,2,2,4,2,3,4,2,3,4,1,4,1,3,3,2,1,3,3,3,3,2,4,4,2,4,2,4,4,2,4,4,3,3,3,2,4,2,2,4,4,1(...TRUNCATED)	{"language":[2,4,2,2,2,4,2,1,4,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,4,2,2,2(...TRUNCATED)	0		500	2,300	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
proposal	"In the game Lizard Era: Beginning the protagonist will travel with three companions: Lynn, Meliana (...TRUNCATED)	{ "input": [ "1\n5 3\n200 6 9" ], "output": [ "120" ] }	{ "input": [], "output": [] }	{"input":["924896439 993098880\n","1 2\n","1 24\n","1000000000 4\n","396 7128\n","9 6\n","32 30\n","(...TRUNCATED)	3	9	{"language":[4,4,3,4,2,4,3,3,3,3,4,3,2,3,4,3,3,3,3,3,2,4,2,1,2,3,2,4,1,2,2,4,2,3,4,3,4,2,4,2,3,2,3,2(...TRUNCATED)	{"language":[2,2,0,0,0,3,2,2,0,4,0,1,2,0,3,1,0,2,0,2,2,2,4,2,0,0,0,4,2,0,2,0,2,0,2,4,3,0,3,2,3,4,0,0(...TRUNCATED)	0		0	0	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	0
digital-numbers	"Snuke has decided to play a game, where the player runs a railway company. There are M+1 stations o(...TRUNCATED)	{"input":["3 3\n1 3\n2 3\n3 3\n","3 1\n1 1\n2 2\n3 3\n","7 3\n1 7\n3 8\n4 5\n6 7\n1 3\n5 10\n8 9\n",(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1 1 1 2\n5\n1000000000 1 10000\n35510851 1188 5566\n1000000000 1 10000\n1 1 10000\n5 100 (...TRUNCATED)	2	11	{"language":[4,2,3,3,4,2,4,4,2,2,2,3,1,2,4,2,3,4,3,2,3,3,3,3,3,2,3,3,3,2,4,4,2,3,3,2,4,3,2,3,3,2,4,2(...TRUNCATED)	{"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)	0		0	1,400	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1285_C. Fadi and LCM	"problem\n\nYou are looking for a constellation in a picture of the starry sky. The photo always con(...TRUNCATED)	{"input":["1 2\n3 4\n5 6\n","11 10\n13 8\n5 16\n","3 7\n4 6\n5 5\n","10 10\n10 10\n10 10\n"],"output(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1 1 1000000000 1000000100\n100 1000000000\n1\n","1 1 10 18\n3 6\n5\n","4 13 400 600\n13 3(...TRUNCATED)	1	10	{"language":[3,1,2,4,2,2,1,4,1,4,2,4,4,4,2,2,2,2,2,3,2,3,4,4,2,4,3,1,3,2,1,4,3,1,3,1,4,3,4,2,3,2,4,4(...TRUNCATED)	{"language":[2,2,2,2,2,2,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,3,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0		1,500	0	[ "data structures" ]	true	{ "nanos": 0, "seconds": 2 }	0
571_B. Minimization	"Every day Ruslan tried to count sheep to fall asleep, but this didn't help. Now he has found a more(...TRUNCATED)	{ "input": [ "5 5\n1 2\n3 4\n3 2\n4 2\n2 5\n" ], "output": [ "2\n1 4 \n" ] }	{"input":["50 100\n1 71 96\n2 34 52\n2 16 95\n1 54 55\n1 65 85\n1 76 92\n2 19 91\n1 26 43\n2 83 95\n(...TRUNCATED)	{"input":["2","6","7","8","10","1","5","9","001","010","5","6","1","9","7","2","10","8","001","010"](...TRUNCATED)	2	8	{"language":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"solution":["d(...TRUNCATED)	{ "language": [], "solution": [] }	0	D	0	1,700	[ "greedy" ]	false	{ "nanos": 0, "seconds": 5 }	268,435,456
p03150 KEYENCE Programming Contest 2019 - KEYENCE String	"Long long ago, there was a thief. Looking for treasures, he was running about all over the world. O(...TRUNCATED)	{ "input": [ "2\n2 1\n3 2\n\nSAMPLE" ], "output": [ "Rani\nRani\n" ] }	{"input":["1\n2\n999999997 999999998\n999999999 1000000000\n","4\n1\n1 1000000000\n5\n1 1\n12 18\n10(...TRUNCATED)	{"input":["10\n75 995991040 148627929 566366239 458028006 823890903 945174886 530827147 546010999 72(...TRUNCATED)	2	6	{"language":[1],"solution":["t = int(raw_input())\nfor _ in range(t):\n n, m, k = map(int, raw_in(...TRUNCATED)	{"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,4,2,2,2,2,2,2,2,2(...TRUNCATED)	39	D	500	0	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	512,000,000
1027_E. Inverse Coloring	"Friends Alex and Bob live in Bertown. In this town there are n crossroads, some of them are connect(...TRUNCATED)	{"input":["8\n1 2 100\n1 3 20\n2 4 2\n2 5 1\n3 6 1\n3 7 2\n6 8 5\n6\n1 8\n2 3\n5 8\n2 6\n4 7\n6 1\n"(...TRUNCATED)	{"input":["2 2 1\n0 1 1 1\n","5 5 20\n3 1 3 3\n1 2 2 2\n4 3 4 2\n3 2 2 2\n3 4 2 4\n4 1 4 5\n4 3 5 3\(...TRUNCATED)	{"input":["1\n2 2\n1 1\n1 3\n","1\n1 3\n3\n1 2 0\n","5\n4 5\n10 8 6 4\n1 2 3 4 5\n1 1\n3\n3\n1 1\n3\(...TRUNCATED)	1	12	{"language":[4,4,3,4,3,3,3,3,4,4,3,1,4,3,3,3,3,4,2,3,3,3,3,4,3,3,3,3,4,3,3,2,4,3,3,4,2,2,3,3,4,3,3,3(...TRUNCATED)	{"language":[2,4,2,2,2,2,2,2,4,2,2,4,4,2,2,4,2,4,2,4,2,2,2,2,4,4,4,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,4,2(...TRUNCATED)	0	A	0	1,000	[]	false	null	0
p03080 ExaWizards 2019 - Red or Blue	"You are given an equation A * X + B * Y = C, A, B, C are positive integer coefficients, X and Y are(...TRUNCATED)	{"input":["3 2\n1 3\n1 1\n0\n2\n","2 2\n1 2\n1 1\n1\n","5 6\n2 2 3\n2 4 5\n1 4\n1 5\n0\n1\n"],"outpu(...TRUNCATED)	{"input":["1 1 2 2\n1000000000 1000000000\n1\n","1 1 1000000000 1000000000\n100 1000000000\n1\n","1 (...TRUNCATED)	{"input":["1\nindex.dml\n<dml><title>Markup aangulge has Declined</title><br>Programmers world</dml>(...TRUNCATED)	2	11	{"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":[2,2,2,3,2,4,2,2,3,1,3,2,2,2,2,3,4,2,2,2,2,2,3,2,2,4,2,3,2,3,3,4,2,2,2,3,2,3,2,3,2,2,2,3(...TRUNCATED)	1,269		0	800	[ "geometry" ]	false	{ "nanos": 0, "seconds": 5 }	134,217,728
brcktsrm	"Sorting arrays is traditionally associated with high-level languages. How hard can it be in Roco? S(...TRUNCATED)	{ "input": [ "1 0\n25 47 10" ], "output": [ "96.2027355887" ] }	{ "input": [], "output": [] }	{"input":["10\n669924290 408119795 283272835\n663737793 250734602 29671646\n431160679 146708815 2894(...TRUNCATED)	2	0	{"language":[2,2,2,3,4,2,4,4,4,2,2,4,4,4,2,2,2,2,4,2,2,2,4,3,4,2,4,2,2,2,3,2,2,4,2,4,4,2,4,4,2,3,2,2(...TRUNCATED)	{"language":[2,2,3,2,0,3,0,3,2,0,3,4,3,4,3,3,0,2,3,2,2,2,2,2,3,4,3,2,3,0,3,2,2,0,2,3,3,3,2,3,4,3,0,3(...TRUNCATED)	0	C	0	1,300	[ "constructive algorithms", "graphs", "greedy", "sortings" ]	false	{ "nanos": 0, "seconds": 2 }	134,217,728