Datasets:

TheFactoryX
/

edition_1063_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
p03452 AtCoder Regular Contest 090 - People on a Line	"You are given a tree (a graph with n vertices and n - 1 edges in which it's possible to reach any v(...TRUNCATED)	{"input":["abbbbbbaaa baababaaab 10\n1 2 1 0 0\n2 7 8 4 7\n2 3 9 2 8\n3 4 6 1 1\n0 8 5 2 4\n2 8 10 4(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["51 89 97\n18 25 63\n41 91 74\n","1 100 1\n100 100 000\n1 100 100\n","2 10 29\n1 1 43\n1 1(...TRUNCATED)	5	9	{"language":[3,2,4,4,2,4,4,4,3,3,3,2,3,3,4,3,3,2,4,4,2,4,4,1,3,1,4,3,1,1,2,3,3,4,2,1,2,2,4,2,2,4,2,2(...TRUNCATED)	{"language":[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,2,2,2,2,2],"solutio(...TRUNCATED)	0	A	0	0	[ "geometry", "math" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
252_B. Unsorting Array	"Geometric progression with the first element a and common ratio b is a sequence of numbers a, ab, a(...TRUNCATED)	{"input":["ababababa\n3\n2 1 7 aba\n1 5 c\n2 1 7 aba\n","abcdcbc\n5\n2 1 7 bc\n1 4 b\n2 4 7 bc\n1 2 (...TRUNCATED)	{"input":["1 0\n","2 1\n1 2 0\n","5 4\n1 2 3 3 1 2\n5 4 0\n4 3 0\n3 1 2 5 4\n","3 3\n1 2 2 3 2\n1 3 (...TRUNCATED)	{"input":["5 7\nqcezchs\nhhedywq\nwikywqy\nqckrpzt\nbqexcxz\n3 2\n??\nyw\n?q\n","8 10\ncwcwcwcwcw\nc(...TRUNCATED)	6	7	{"language":[2,3,4,3,3,4,1,3,3,2,4,4,3,3,1,3,2,3,3,2,3,4,3,3,3,2,3,4,4,3,3,3,2,3,3,3,2,3,2,3,3,3,3,3(...TRUNCATED)	{"language":[2,2,2,4,4,4,2,4,2,2,1,4,4,2,1,2,2,4,4,2,2,2,4,4,2,2,2,3,4,2,2,2,4,2,2,4,3,2,2,2,4,2,3,2(...TRUNCATED)	1,431	A	0	1,300	[ "combinatorics", "math", "number theory" ]	false	null	268,435,456
p03080 ExaWizards 2019 - Red or Blue	"In late autumn evening n robots gathered in the cheerful company of friends. Each robot has a uniqu(...TRUNCATED)	{ "input": [ "2 -3 4\nL 2 5\n? 3 5" ], "output": [ "2\nL 4\nL 3" ] }	{ "input": [ "3\n1234567\n1268501\n1268499\n" ], "output": [ "788765312\n999997375\n999999350\n" ] }	{"input":["16\nFFC0\nFFC0\nFFC0\nFFC0\nFFC0\nFFD0\nFFC0\nFFC0\nFFC0\nFFC0\nFFC0\nFFC0\nFFC0\nFFC0\nF(...TRUNCATED)	2	8	{"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": [], "solution": [] }	1,149		750	0	[ "*special", "implementation", "strings" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
p03771 AtCoder Grand Contest 012 - Camel and Oases	"Polycarpus is sure that his life fits the description: \"first there is a white stripe, then a blac(...TRUNCATED)	{ "input": [ "0 1 1 1 1 0\n", "1 1 0 0 1000 1000\n" ], "output": [ "Yes\n", "No\n" ] }	{"input":["1 10\n778084 -205153\n778001 -205093\n778155 -205118\n778168 -204997\n778066 -205141\n778(...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	9	{"language":[2,2,2,4,2,2,3,3,4,3,4,3,3,2,4,4,1,3,4,4,1,3,2,4,2,2,2,4,3,3,3,2,4,2,2,3,1,2,2,4,3,4,4,3(...TRUNCATED)	{"language":[2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,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)	248		0	2,600	[ "binary search", "greedy", "sortings" ]	false	{ "nanos": 0, "seconds": 3 }	512,000,000
702_E. Analysis of Pathes in Functional Graph	"Polycarp starts his own business. Tomorrow will be the first working day of his car repair shop. Fo(...TRUNCATED)	{ "input": [ "4 5 3 1 5\n", "5 1 2 1 2\n", "3 3 1 1 1\n" ], "output": [ "Friendship\n", "First\n", "Second\n" ] }	{ "input": [], "output": [] }	{"input":["30\n16 3\n-334 -500 -169 -724 -478 -358 -962 -464 -705 -145 -281 -827 -961 -491 -995 -942(...TRUNCATED)	2	11	{"language":[2,2,2,2,2,2,4,4,2,2,4,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,3,2,2,2,1,4,3,2,2,1,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,257	E	2,000	1,600	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	134,217,728
1301_B. Motarack's Birthday	"A substring of some string is called the most frequent, if the number of its occurrences is not les(...TRUNCATED)	{"input":["5\n0 0\n0 2\n2 0\n2 2\n1 1\n","9\n0 0\n1 1\n2 2\n0 1\n1 0\n0 2\n2 0\n1 2\n2 1\n"],"output(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1 100000 100000 110000 -100000\n","46456 -250 -23623 -98302 -99305\n","10 6 3 7 2\n","1 -(...TRUNCATED)	2	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],"solution":["for(...TRUNCATED)	{"language":[1,3,2,2,2,4,4,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2,4,4,2,4,3,1,2,1,2,1,2,4,4,2,2,2,4,4,2,4,4(...TRUNCATED)	1,525		2,250	2,000	[ "*special" ]	false	null	134,217,728
530_C. Diophantine equation	"This is a simple game you must have played around with during your school days, calculating FLAMES (...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":["9\n100 100 100 200 100 100 200 100 200\n","3\n100 100 100\n","7\n200 200 200 100 200 200 (...TRUNCATED)	{"input":["8 61 898\n315 230\n524 559\n612 425\n577 542\n220 280\n560 880\n297 626\n381 24\n","32 79(...TRUNCATED)	5	9	{"language":[4,1,4,3,1,4,4,2,2,4,2,2,2,2,4,1,2,1,4,4,2,4,4,4,4,4,4,2,4,2,2,2,4,2,4,2,4,2,4,2,2,4,2,4(...TRUNCATED)	{"language":[2,2,3,0,3,2,0,3,0,2,2,3,2,3,2,2,0,2,0,3,0,3,3,2,3,2,2,0,2,2,3,3,2,2,2,3,3,3,2,2,4,3,4,2(...TRUNCATED)	1,170	A	0	800	[]	false	{ "nanos": 0, "seconds": 1 }	536,870,912
846_B. Math Show	"Harry, upon inquiring Helena Ravenclaw's ghost, came to know that she told Tom Riddle or You-know-w(...TRUNCATED)	{ "input": [ "6 6\n1 6\n1 4\n1 2 1\n2 3 1\n3 5 1\n2 4 3\n4 5 2\n5 6 1" ], "output": [ "2" ] }	{"input":["7\n576460752303423487 2\n82 9\n101 104\n10 21\n31 10\n0 1\n10 30\n","1\n12881797281728299(...TRUNCATED)	{"input":["5\n1 4 4 5 2","9\n1 2 4 9 5 8 7 6 6","9\n1 2 4 9 5 8 4 6 6","5\n0 4 4 5 1","2\n1 0","2\n1(...TRUNCATED)	2	10	{"language":[2,2,2,3,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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0	B3	0	1,700	[ "*special" ]	false	{ "nanos": 0, "seconds": 2 }	1,073,741,824
p03986 AtCoder Grand Contest 005 - STring	"KM country has N kinds of coins and each coin has its value a_i.\n\nThe king of the country, Kita_m(...TRUNCATED)	{"input":["5\n4\n1 2 3 4\n5 10 15 20\n4\n1 2 1 2\n5 10 15 20\n4\n2 2 4 1\n2 8 19 1\n2\n1 1\n6 9\n1\n(...TRUNCATED)	{"input":["919536000 993098880\n","691200 583200\n","5 1000000000\n","100 10\n","537814642 537814642(...TRUNCATED)	{"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)	6	0	{"language":[2,4,4,2,3,4,4,4,4,2,2,3,4,3,3,3,3,3,4,2,2,4,3,3,4,3,2,3,4,2,3,3,2,3,3,4,3,3,2,2,3,4,3,2(...TRUNCATED)	{ "language": [], "solution": [] }	0	F	250	1,600	[ "data structures" ]	false	{ "nanos": 0, "seconds": 2 }	0
1311_C. Perform the Combo	"Jiro is a fun loving lad. His classmates are very competitive and are striving for getting a good r(...TRUNCATED)	{ "input": [ "3 2\n2 1 2\n1 3\n", "7 3\n3 1 3 7\n2 2 5\n2 4 6\n" ], "output": [ "1\n", "10\n" ] }	{"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":["341143514535\n158\n143565553551655311343411652235654535651124615163\n551544654451431564\n(...TRUNCATED)	1	0	{"language":[2,3,3,2,3,3,3,3,3,4,4,4,3,3,1,3,4,4,4,4,3,1,3,4,2,4,3,4,3,3,1,1,4,3,2,4,3,2,4,3,3,3,3,3(...TRUNCATED)	{"language":[1,2,2,2,2,2,2,2,4,4,2,4,2,2,4,2,4,2,2,2,2,4,4,2,3,2,4,2,2,2,4,2,2,2,3,4,4,2,2,2,4,4,4,3(...TRUNCATED)	0		0	0	[ "data structures", "trees" ]	false	{ "nanos": 0, "seconds": 4 }	256,000,000