Datasets:

TheFactoryX
/

edition_2849_deepmind-code_contests-readymade

name large_stringlengths 4 70	description large_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 large_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 large_stringclasses 36 values	time_limit dict	memory_limit_bytes int64 0 1.07B
monks-birthday-party	"Levko loves array a1, a2, ... , an, consisting of integers, very much. That is why Levko is playing(...TRUNCATED)	{"input":["4\nlu ru ld rd\n4\nlu ld lu ru\n1\nlu\n10\nru lu ld rd ru rd ru lu rd ld\n0"],"output":["(...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":["8 12\n1 2\n2 3\n4 5\n5 6\n6 7\n7 8\n1 4\n4 7\n2 5\n5 8\n3 6\n6 9\n","7 3\n3 2\n2 1\n1 4\n(...TRUNCATED)	3	0	{"language":[2,1,3,4,1,4,1,4,2,3,4,2,4,1,2,3,2,2,4,3,2,4,2,2,2,4,4,3,2,4,4,4,4,1,1,3,2,2,2,4,1,4,1,2(...TRUNCATED)	{"language":[2,4,2,4,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,4,4,2,4,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2(...TRUNCATED)	1,189	C	2,000	2,200	[ "greedy" ]	false		{ "nanos": 0, "seconds": 4 }	256,000,000
223_C. Partial Sums	"The bear decided to store some raspberry for the winter. He cunningly found out the price for a bar(...TRUNCATED)	{ "input": [ "2\n2 999995\n", "3\n2 3 9\n" ], "output": [ "5\n", "8\n" ] }	{ "input": [], "output": [] }	{"input":["9 1004498469 6\n","1 0 10\n","1944219055 33463955 1369298327\n","914835 4386500 9234739\n(...TRUNCATED)	2	0	{"language":[2,2,2,2,2,4,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,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	925	D	2,000	1,800	[ "math" ]	false		null	1,073,741,824
392_D. Three Arrays	"Note that this is the first problem of the two similar problems. You can hack this problem only if (...TRUNCATED)	{ "input": [ "1\n", "4\n", "6\n", "2\n" ], "output": [ "1 1\n", "1 4\n", "2 3\n", "1 2\n" ] }	{ "input": [], "output": [] }	{"input":["6\nc armor 0 13 0 3\na weapon 23 0 0 3\nb weapon 20 0 0 4\ne orb 0 0 13 3\nd armor 0 15 0(...TRUNCATED)	2	0	{"language":[4,4,4,4,3,3,2,2,4,3,4,2,4,4,4,2,3,2,4,3,3,2,4,3,2,1,2,2,4,4,2,3,3,2,3,2,3,3,2,3,3,4,1,4(...TRUNCATED)	{"language":[2,2,2,3,2,4,3,2,2,2,2,2,2,3,4,2,2,2,0,2,0,2,2,2,2,2,3,2,2,2,2,2,0,2,2,2,2,2,2,4,2,1,1,3(...TRUNCATED)	670		1,750	1,100	[ "brute force", "data structures", "dp", "greedy", "implementation", "math", "strings" ]	false		null	0
366_D. Dima and Trap Graph	"We know that lucky digits are digits 4 and 7, however Vasya's got another favorite digit 0 and he a(...TRUNCATED)	{ "input": [ "11 5 2\n11010100101\n", "11 5 1\n11010100101\n" ], "output": [ "1\n", "3\n" ] }	{ "input": [], "output": [] }	{"input":["10\n4643665 282618243 791521863 214307200 976959598 590907019 166397456 708291256 8537738(...TRUNCATED)	3	0	{"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],"s(...TRUNCATED)	{"language":[0,2,2,0,2,3,2,3,4,0,3,2,2,2,2,2,2,3,0,2,0,2,3,4,0,2,2,0,2,2,2,2,2,2,3,0,3,2,2,0,0,2,2,2(...TRUNCATED)	1,475	E	1,250	1,800	[ "games", "math", "number theory" ]	false	"JOI 君が住む都市にはN 個の駅があり，それぞれ1, 2, ..., N の番号が付けら(...TRUNCATED)	null	256,000,000
p01422 Beautiful Currency	"As technologies develop, manufacturers are making the process of unlocking a phone as user-friendly(...TRUNCATED)	{"input":["3 5 4\nabacc\nccbba\nccabc\nabacc\nacbbc\nababa\nacbbc\n","6 4 4\ndaac\nbcba\nacad\ncbdc\(...TRUNCATED)	{"input":["20 20\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n","10 4\n0 1 4 2 7 0 10 0 5 8\n","10 7\n1(...TRUNCATED)	{"input":["14 2 2012","14 4 2012","14 4 1177","20 4 1177","20 4 1433","20 3 1433","14 3 1433","14 3 (...TRUNCATED)	5	0	{"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,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	361	E	0	2,400	[ "dfs and similar", "graphs" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
p03294 AtCoder Beginner Contest 103 - Modulo Summation	"Two-gram is an ordered pair (i.e. string of length two) of capital Latin letters. For example, \"AZ(...TRUNCATED)	{ "input": [ "2\n1\n3\n\nSAMPLE" ], "output": [ "1\n26\n" ] }	{"input":["20 101 100\n1 14 20 3 19 10 12 18 4 17 13 6 8 5 2 15 7 16 9 11\n69 53 101 100 41 38 63 84(...TRUNCATED)	{"input":["2\n1 0\n50 50\n50","4\n2 3 4 1\n13 5 1 24\n45 9 15","4\n2 3 4 1\n13 5 1 24\n45 9 16","4\n(...TRUNCATED)	1	10	{"language":[3,4,3,4,3,2,2,3,3,3,4,3,3,2,3,2,1,2,3,3,2,3,3,2,4,4,4,2,3,3,3,3,3,4,3,3,2,3,3,3,2,3,3,4(...TRUNCATED)	{"language":[4,2,2,2,1,2,1,3,2,4,3,4,2,4,2,2,2,2,4,3,4,4,4,2,2,4,1,4,4,4,2,4,2,4,2,2,2,2,3,1,2,2,2,4(...TRUNCATED)	0	E	0	2,200	[]	false		null	256,000,000
1053_C. Putting Boxes Together	"you are given an array of size N. You need to select K elements from the array such that the differ(...TRUNCATED)	{"input":["5\n7\n1\n9\n7\n3\n","10\n100\n1\n100\n1\n100\n1\n100\n1\n100\n1\n"],"output":["1 3 7 7 9 (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["48 1976\n30 97 84\n80 81 84\n41 70 45\n23 57 80\n17 60 85\n36 48 81\n51 87 81\n38 85 81\n(...TRUNCATED)	2	0	{"language":[2,4,2,4,4,2,2,2,4,4,3,2,4,3,3,4,2,4,2,4,3,4,3,4,3,2,1,4,3,1,3,3,2,2,3,3,2,4,2,3,2,2,4,4(...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	2,100	[ "greedy", "implementation", "sortings" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
1165_A. Remainder	"An established group of scientists are working on finding solution to NP hard problems. They claim (...TRUNCATED)	{ "input": [ "5 10\n2 1 2 1 2\n2\n2 4\n4 5\n" ], "output": [ "3\n3\n" ] }	{ "input": [], "output": [] }	{"input":["10 10\n4 5 6 7 8 11 14 15 17 19\n1 4 12 10 13 20 14 20 13 16\n-7 16\n1 1\n7 9\n1 4\n4 8\n(...TRUNCATED)	2	1	{"language":[4,4,4,4,2,1,3,1,3,4,4,2,3,4,3,4,4,1,3,2,4,2,2,2,3,4,1,2,2,2,2,2,2,4,4,2,4,4,1,4,3,1,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,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,149		0	0	[ "implementation" ]	false		{ "nanos": 0, "seconds": 1 }	1,073,741,824
p02744 Panasonic Programming Contest 2020 - String Equivalence	"Bosky is a very curious child who turned 13 yesterday. His parents gifted him a digital watch which(...TRUNCATED)	{ "input": [ "1 0\n25 47 10" ], "output": [ "96.2027355887" ] }	{"input":["3\n7089544 9134148 -5332724\n368810 1638695 7889905\n-3866235 -4257263 5802154\n","16\n-3(...TRUNCATED)	{"input":["10\n-1 -1\n1 1\n1 1\n3 0\n4 1\n2 0\n3 1\n2 1\n5 0\n5 0\n8\n1 2 6\n2 3 7\n2 4 7\n1 3 4\n2 (...TRUNCATED)	2	7	{"language":[2,2,2,4,2,2,3,4,2,4,2,2,3,2,4,2,2,2,4,2,2,4,2,4,2,4,2,4,2,2,4,2,2,4,2,4,2,4,2,2,4,3,4,2(...TRUNCATED)	{"language":[4,2,2,4,2,2,2,2,2,2,2,4,2,4,4,4,4,2,2,2,2,2,4,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,4(...TRUNCATED)	643	D	1,000	0	[]	false		{ "nanos": 0, "seconds": 1 }	0
1490_G. Old Floppy Drive	"problem\n\nChairman K is a regular customer of the JOI pizza shop in the center of JOI city. For so(...TRUNCATED)	{"input":["4\ncba\ncab\nb\na\n3\nbca\nab\na\n5\nabc\nacb\nb\nc\nc\n5\nabc\nacb\nc\nb\nb\n0"],"output(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["10000\n5000 3150\n5000 5000\n0 0\n5000 1050\n5000 3980\n5000 210\n5000 5000\n5000 5000\n0(...TRUNCATED)	6	8	{"language":[3,3,2,4,4,3,2,3,4,4,1,4,3,1,3,1,2,4,3,1,3,4,2,1,2,2,2,3,3,3,3,4,3,2,4,4,2,4,2,3,2,2,1,1(...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,081	C	2,500	2,000	[]	false		{ "nanos": 0, "seconds": 1 }	256,000,000