Datasets:

TheFactoryX
/

edition_1270_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
subtraction-game-theory-1	"Problem\n\nKND is a student programmer at the University of Aizu. His chest is known to be very sex(...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":["8587340257\n","9\n","81\n","27\n","1408514752349\n","25\n","49380563\n","266418\n","31975(...TRUNCATED)	{"input":["9 10\n1 2 3 4 5 6 7 8 9\n1 2\n2 1\n2 4\n3 4\n4 5\n4 6\n2 7\n7 8\n7 9\n9 1","16 19\n1 2 3 (...TRUNCATED)	2	10	{"language":[4,3,1,2,2,3,2,3,3,3,3,3,3,3,3,3,3,3,3,2,3,1,2,1,3,3,2,3,4,3,4,4,2,4,2,3,3,3,3,3,3,2,2,3(...TRUNCATED)	{"language":[2,2,2,2,2,3,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	A	0	0	[ "binary search", "data structures", "hashing" ]	false	null	256,000,000
1354_F. Summoning Minions	"Story\n\nAt UZIA High School in the sky city AIZU, the club activities of competitive programming a(...TRUNCATED)	{ "input": [ "7 4\n4 2 3 1 2 4 3\n", "4 3\n2 1 3 1\n" ], "output": [ "18\n", "5\n" ] }	{ "input": [], "output": [] }	{"input":["6\n773209925 62005863 473635171 329666981 510631133 207643327\n","1\n2\n","7\n481003311 5(...TRUNCATED)	3	11	{"language":[4,3,2,4,3,4,2,4,4,2,3,3,2,3,3,3,3,3,4,2,3,2,3,2,4,4,2,4,3,2,4,3,2,4,4,3,2,2,4,3,3,4,2,4(...TRUNCATED)	{"language":[2,2,2,2,2,3,2,2,3,2,2,2,2,4,3,3,2,4,2,2,2,2,4,2,3,4,2,2,2,2,2,2,4,2,2,2,2,2,3,2,2,2,2,2(...TRUNCATED)	323	D	0	0	[]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
p02744 Panasonic Programming Contest 2020 - String Equivalence	"<!--\n\nProblem G\n\n-->\n\nLet's Move Tiles!\n\nYou have a framed square board forming a grid of s(...TRUNCATED)	{"input":["1000 999\n10 20 30 40\n","7 11\n2 4 7 3\n"],"output":["-1","2 7 1 5 6 3 4 \n7 2 1 5 6 4 3(...TRUNCATED)	{"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":["7 6\nalloc 2\nalloc 2\nalloc 3\nerase 1\ndefragment\nerase 3\nalloc 4\n","8 50\nalloc 51\(...TRUNCATED)	2	13	{"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,1,1,1,1,1],"sol(...TRUNCATED)	{"language":[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,2,2,2,2,2,2,4,2,2,2,2,2(...TRUNCATED)	909	B	1,500	1,300	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
290_D. Orange	"An elementary school student Takahashi has come to a variety store.\n\nHe has two coins, A-yen and (...TRUNCATED)	{ "input": [ "" ], "output": [ "" ] }	{"input":["5\n1000000000000000000 352839520853234088 175235832528365792 753467583475385837 895062156(...TRUNCATED)	{"input":["10 1000000\n1 2 3 4 8 5 6 7 8 9\n","13 666\n84 89 29 103 128 233 190 122 117 208 119 97 3(...TRUNCATED)	6	7	{"language":[2,2,4,2,4,2,3,4,2,4,2,4,2,4,2,2,4,2,2,2,2,4,2,2,2,4,2,4,2,4,4,2,2,4,1,2,2,2,2,2,2,2,2,3(...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)	1,354	H	0	800	[ "data structures", "dfs and similar", "dp", "trees" ]	false	null	256,000,000
754_E. Dasha and cyclic table	"Continuing from previous version of codeXplod series i.e. CodeXplod 1.0,Chandu and daspal are still(...TRUNCATED)	{ "input": [ "2\n5 10\n3 4 6 1 9\n3 2\n1 3 4" ], "output": [ "1\n0" ] }	{"input":["4\n3 4\n1 2\n3 4\n1 2\n","4\n2 4\n1 3\n4 4\n1 1\n","10\n6 6\n1 2\n2 2\n6 7\n8 8\n3 5\n5 5(...TRUNCATED)	{"input":["100\n92 53 86 41 77 68 80 54 17 96 89 53 64 55 2 80 28 58 77 43 70 91 71 71 78 3 25 2 15 (...TRUNCATED)	2	0	{ "language": [], "solution": [] }	{"language":[4,2,2,4,4,2,2,4,2,2,4,2,2,4,2,2,3,2,3,4,2,2,1,4,3,4,3,4,4,3,2,1,1,2,3,2,4,3,2,4,4,4,2,3(...TRUNCATED)	0		0	0	[ "dfs and similar", "dp", "dsu", "ternary search", "trees" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1012_B. Chemical table	"You are given a permutation p_1,p_2,...,p_N consisting of 1,2,..,N. You can perform the following o(...TRUNCATED)	{"input":["10\n1\n248618\n3\n12 10 8\n6\n100 11 15 9 7 8\n4\n0 1 1 0\n2\n0 0\n2\n0 1\n2\n1 0\n2\n1 1(...TRUNCATED)	{"input":["1 10\n8\n1\n2\n3\n4\n5\n6\n7\n8\n9\n16\n","1 10\n4\n1\n2\n3\n4\n5\n6\n7\n8\n9\n16\n","1 1(...TRUNCATED)	{"input":["2 7\n4\n2\n1\n0\n-1\n-2\n-4\n131\n137\n2 7\n4\n2\n1\n0\n-1\n-2\n-4\n124\n123\n10 7\n-4\n-(...TRUNCATED)	2	0	{ "language": [], "solution": [] }	{"language":[2,0,3,3,2,2,3,2,3,2,3,2,3,3,2,3,2,0,2,4,2,3,2,3,3,0,2,2,2,2,2,2,0,0,2,3,0,2,2,2,2,3,2,2(...TRUNCATED)	893		0	0	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1470_E. Strange Permutation	"A permutation — is a sequence of length n integers from 1 to n, in which all the numbers occur ex(...TRUNCATED)	{ "input": [ "1\n3 3\n1 2\n2 3\n1 3\n\nSAMPLE" ], "output": [ "2\n" ] }	{ "input": [], "output": [] }	{"input":["100 10000\n337491026 878382762 942177429 998998997 292784016 407647544 813626083 20338593(...TRUNCATED)	6	8	{"language":[2,4,3,4,2,4,4,2,2,2,3,2,2,3,4,3,2,2,3,4,2,4,3,2,2,4,2,2,2,2,4,2,2,3,2,3,2,4,2,4,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0	C2	1,000	0	[]	false	{ "nanos": 0, "seconds": 4 }	256,000,000
1091_G. New Year and the Factorisation Collaboration	"Let's consider the following game. We have a rectangular field n × m in size. Some squares of the (...TRUNCATED)	{"input":["10\n1 10 2 9 3 8 4 7 5 6\n","4\n1 2 3 4\n","3\n1 2 3\n"],"output":["4.500000000000024\n",(...TRUNCATED)	{"input":["10\ntypedef errtype ucywcaykzh\ntypeof &ucywcaykzh*****\ntypedef &&&&&&void******(...TRUNCATED)	{"input":["11--01--2013-02-2013-01--01--2013\n","00-12-2014-00-12-2013-00-12-2014-12-12-2014\n","23-(...TRUNCATED)	2	0	{"language":[2,2,3,3,2,3,1,4,3,4,2,4,1,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,3,2,3,3,2,2,4,2,4,2,4,4,2,3,4(...TRUNCATED)	{"language":[4,2,4,3,2,2,3,4,2,4,3,3,3,4,2,2,4,3,4,2,2,2,3,4,2,2,2,2,4,3,4,2,2,4,2,2,4,3,2,3,4,2,2,2(...TRUNCATED)	319		0	1,800	[]	false	null	512,000,000
1547_C. Pair Programming	"Sherlock Holmes has decided to start a new academy to some of the young lads. He has conducted seve(...TRUNCATED)	{ "input": [ "3\n1 1 1\n", "1\n1\n", "2\n1 2\n", "4\n1 2 3 4\n" ], "output": [ "-1\n", "-1\n", "-1\n", "1 2\n" ] }	{"input":["30\n10 1 8 10 2 6 45 7 3 7 1 3 1 1 14 2 5 19 4 1 13 3 5 6 1 5 1 1 23 1\n98 4 43 41 56 58 (...TRUNCATED)	{"input":["3\n6 13 24","3\n6 4 30","3\n12 11 12","3\n6 20 24","3\n6 7 30","3\n11 20 24","3\n10 7 30"(...TRUNCATED)	6	9	{"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,1,1,1,1,1,1,1,1(...TRUNCATED)	{"language":[2,4,0,2,2,0,2,2,2,2,2,2,2,2,2,2,2,4,2,0,2,2,2,4,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,4(...TRUNCATED)	560	E	0	1,900	[ "implementation" ]	false	null	256,000,000
1053_C. Putting Boxes Together	"Easy and hard versions are actually different problems, so read statements of both problems complet(...TRUNCATED)	{ "input": [ "0 1 1 1 1 0\n", "1 1 0 0 1000 1000\n" ], "output": [ "Yes\n", "No\n" ] }	{"input":["10 10\n5 9 1 3 5 8 3 4 7\n2 0 4 7 1 0 0 0 7 0\n5 7 -7 3 10 4 7 2 9 -9\n","2 2\n1\n0 0\n1 (...TRUNCATED)	{"input":["pH\n2\n","nifzlTLTeWxaD\n0\n","ysBKLtQXvmnCrldEceqXKkaZOrvjRbwlW\n5\n","LiqWMLEVLRhW\n1\n(...TRUNCATED)	3	0	{"language":[3,3,3,3,4,1,3,3,1,4,4,2,4,3,3,3,3,3,2,2,2,1,4,1,2,1,3,3,1,3,1,3,3,2,1,1,3,4,1,3,1,2,2,4(...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,2,2,2,2,2,2,2,3,2,2,2,2,2,3,4,2,2,2,2,2,4(...TRUNCATED)	1,003	F	0	0	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000