Datasets:

TheFactoryX
/

edition_0838_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
455_C. Civilization	"We are definitely not going to bother you with another generic story when Alice finds about an arra(...TRUNCATED)	{ "input": [ "2 2 1 0 0 1\n", "2 2 10 11 0 1\n", "2 4 3 -1 3 7\n" ], "output": [ "1", "5", "2" ] }	{"input":["10000 10 100\n2339 4118 4595 5499 5582 6055 8693 9002 9190 9658\n10 75 82 5 14 55 64 68 4(...TRUNCATED)	{"input":["3\nbba\nabb\nabc\n\nSAMPLE","3\nbba\nabb\nabb\n\nSAMPLF","3\nbba\nbba\nabc\n\nSAMPLE","3\(...TRUNCATED)	2	8	{"language":[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,2,2,2,4,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,4,2,4,2,4,4,1,4,3,4,2,4,1,4,3,4,2,3,3,2,4,3,4,3,4,4,2,3,3,1,3,2,2,4,2,2,4,4,1,2,4,3(...TRUNCATED)	0		0	0	[ "dp", "probabilities" ]	false	{ "nanos": 0, "seconds": 8 }	1,073,741,824
1227_A. Math Problem	"At the big break Nastya came to the school dining room. There are n pupils in the school, numbered (...TRUNCATED)	{ "input": [ "2\n1\n2" ], "output": [ "2\n5\n" ] }	{ "input": [], "output": [] }	{"input":["4","101","5","001","8","6","2","110","10","13","111","12","17","9","7","14","16","11","22(...TRUNCATED)	5	0	{"language":[3,2,4,1,1,3,4,2,3,4,2,2,3,2,4,3,2,2,1,2,3,2,3,4,3,3,3,3,4,3,3,1,2,3,3,3,2,2,3,3,2,3,3,2(...TRUNCATED)	{"language":[3,2,1,2,3,2,2,3,4,2,2,2,2,3,2,2,2,2,4,2,4,2,2,2,3,3,2,2,3,4,4,4,1,4,2,2,3,2,4,2,2,2,4,4(...TRUNCATED)	1,413	E	0	1,400	[ "data structures" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
p00819 Unreliable Message	"There are n persons who initially don't know each other. On each morning, two of them, who were not(...TRUNCATED)	{"input":["3 3 5\n4 4 0\n1 3\n3 2\n3 1\n","4 5 4\n2 1 0 3\n4 3\n3 2\n1 2\n1 4\n1 3\n"],"output":["1\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["2\n1 1 6 1\n3\n0 1 2\n","2\n2 0 4 3\n4\n1 2 0 2\n","2\n1 1 6 2\n3\n0 1 2\n","2\n2 0 4 6\n(...TRUNCATED)	2	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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,301	E	0	0	[ "constructive algorithms", "greedy", "sortings" ]	false	{ "nanos": 0, "seconds": 2 }	268,435,456
p03664 AtCoder Regular Contest 078 - Mole and Abandoned Mine	"You are running through a rectangular field. This field can be represented as a matrix with 3 rows (...TRUNCATED)	{"input":["1\nindex.dml\n<dml><title>Markup language has Declined</title><br>Programmers world</dml>(...TRUNCATED)	{"input":["100 10000\n337491026 878382762 942177429 998998997 292784016 407647544 813626083 20338593(...TRUNCATED)	{"input":["36\n2 2 2 8 9 4 8 5\n9 1 7 6 10 6 9 3\n10 2 4 6 6 2 1 1\n9 6 2 3 5 7 7 3\n6 6 3 9 10 9 1 (...TRUNCATED)	2	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,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2(...TRUNCATED)	{ "language": [], "solution": [] }	626		2,500	1,900	[ "" ]	false	{ "nanos": 0, "seconds": 3 }	256,000,000
p01083 RedBlue	"Suppose you have a string S which has length N and is indexed from 0 to N−1. String R is the reve(...TRUNCATED)	{ "input": [ "3\n2 1 3\n3 3 6\n99995 9998900031 9998900031\n" ], "output": [ "1 2 1 \n1 3 2 3 \n1 \n" ] }	{"input":["3\n1000000000 1000000000 10000000\n","3\n1 2 1\n","3\n4 10 11\n","5\n1000000000 5 5 4 4\n(...TRUNCATED)	{"input":["3\n12 2\n200\n50\n300\n110","3\n17 2\n200\n73\n300\n110","3\n12 2\n200\n50\n599\n100","3\(...TRUNCATED)	2	11	{"language":[4,4,4,2,4,1,2,2,2,2,3,2,2,4,3,2,1,3,2,3,2,2,1,2,2,4,2,4,2,4,2,2,1,4,1,2,2,4,2,1,3,4,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0		0	2,400	[ "data structures", "greedy" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
1199_E. Matching vs Independent Set	"The King of a little Kingdom on a little island in the Pacific Ocean frequently has childish ideas.(...TRUNCATED)	{"input":["6 3\n3 1 2 3 2 3\n","10 1\n1 1 1 1 1 1 1 1 1 1\n","12 4\n1 2 3 1 2 3 4 1 2 1 2 1\n"],"out(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["4 3\n1 3 2 7","4 4\n1 3 2 4","4 4\n1 0 2 4","4 3\n1 3 2 8","2 4\n1 3 2 4","4 4\n1 -1 2 4"(...TRUNCATED)	2	11	{"language":[1,3,4,3,4,4,3,1,3,2,1,2,3,4,3,2,1,1,4,4,3,3,3,3,4,2,3,3,4,3,1,2,3,3,4,3,3,3,2,2,4,3,4,4(...TRUNCATED)	{"language":[2,3,4,3,0,2,2,4,2,0,3,0,3,0,3,3,2,0,2,2,2,2,2,0,0,3,2,2,2,2,2,2,3,2,3,2,4,2,2,3,0,2,2,3(...TRUNCATED)	0		500	2,000	[ "implementation" ]	false	{ "nanos": 0, "seconds": 1 }	512,000,000
cost-of-data-11	"Manao works on a sports TV. He's spent much time watching the football games of some country. After(...TRUNCATED)	{"input":["8 4\n7 1 1\n2 1 1\n4 0 1\n8 1 1\n1 0 1\n1 1 1\n1 0 1\n3 0 0\n","5 2\n6 0 0\n9 0 0\n1 0 1\(...TRUNCATED)	{"input":["384\n87 78 16 94 36 87 93 50 22 63 28 91 60 64 27 41 27 73 37 12 69 68 30 83 31 63 24 68 (...TRUNCATED)	{"input":["20 10 3\nebebccacdb\neeebccddeT\neadebecaac\nadeeeaccbc\nbaccccdaed\nabbaecbaed\ndadbecba(...TRUNCATED)	2	2	{"language":[2,2,4,2,2,2,3,4,2,2,2,4,2,4,2,3,2,2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,3,2,3(...TRUNCATED)	{"language":[2,2,2,2,4,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,2,2,2,2,2(...TRUNCATED)	366		2,000	2,000	[ "*special", "binary search", "constructive algorithms", "interactive" ]	false	{ "nanos": 0, "seconds": 2 }	1,073,741,824
290_D. Orange	"So the Beautiful Regional Contest (BeRC) has come to an end! n students took part in the contest. T(...TRUNCATED)	{ "input": [ "7\n1 1 2 2 3 3 3\n", "10\n1 1 1 5 4 1 3 1 2 2\n", "1\n1\n" ], "output": [ "6\n", "7\n", "0\n" ] }	{ "input": [], "output": [] }	{"input":["1\n100010 2","3\n2 1\n1 3\n2 0","1\n100010 3","3\n2 1\n1 3\n2 1","1\n100011 3","3\n2 1\n1(...TRUNCATED)	2	9	{"language":[2,4,3,2,3,2,2,3,2,3,4,3,2,3,3,2,2,2,2,2,2,4,2,4,3,4,3,2,2,2,2,2,2,3,3,3,3,3,2,3,2,3,4,3(...TRUNCATED)	{"language":[4,4,4,1,2,4,1,4,2,4,1,4,2,1,1,2,1,4,2,3,4,3,3,4,2,4,2,2,4,4,3,1,2,2,2,3,4,3,4,2,3,3,2,2(...TRUNCATED)	0		500	0	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
p00032 Plastic Board	"One day n friends gathered together to play \"Mafia\". During each round of the game some player mu(...TRUNCATED)	{ "input": [ "2 -3 4\nL 2 5\n? 3 5" ], "output": [ "2\nL 4\nL 3" ] }	{"input":["1 1\n0\n10000\n","2 3\n1 0\n4 7\n","1 2\n0\n10000\n","3 10\n0 1 2\n9240 5331 6721\n","4 1(...TRUNCATED)	{"input":["100 10000\n337491026 878382762 942177429 998998997 292784016 407647544 813626083 20338593(...TRUNCATED)	2	0	{"language":[3,2,4,4,2,3,3,2,3,3,4,2,2,4,2,2,2,2,4,3,3,2,4,2,2,3,4,3,4,2,3,2,4,2,2,4,2,3,2,4,2,3,3,2(...TRUNCATED)	{"language":[3,1,2,2,1,2,4,3,3,2,2,4,2,4,4,4,2,2,2,1,2,4,2,1,1,4,3,3,3,2,4,2,2,2,2,3,2,4,4,2,2,4,2,2(...TRUNCATED)	0		0	0	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
proposal	"Two-gram is an ordered pair (i.e. string of length two) of capital Latin letters. For example, \"AZ(...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":["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":["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)	2	14	{"language":[2,4,2,3,1,4,1,2,4,3,4,1,3,3,3,3,4,1,2,3,4,2,2,3,3,4,3,3,3,1,1,2,4,2,1,1,3,3,3,1,2,4,1,1(...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)	774		1,000	0	[ "bitmasks", "combinatorics", "dp" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000