Datasets:

TheFactoryX
/

edition_0822_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
76_B. Mice	"Andrew plays a game called \"Civilization\". Dima helps him.\n\nThe game has n cities and m bidirec(...TRUNCATED)	{ "input": [ "2\n2 6\n10 11" ], "output": [ "2\n1\n" ] }	{"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":["15 6\n1 6 6 5 2 10 4 4 14 8 7 3 5 1 2\n","65 7\n1 5 4 1 4 11 9 1 11 7 6 11 9 4 2 6 10 11 (...TRUNCATED)	2	9	{"language":[2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,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,4(...TRUNCATED)	909	B	0	900	[ "dp", "math", "number theory" ]	false	{ "nanos": 0, "seconds": 8 }	256,000,000
1155_A. Reverse a Substring	"problem\n\nGiven $ N $ different natural numbers $ a_i $. I decided to make a pair by choosing a di(...TRUNCATED)	{"input":["3 2\n1 2\n2 3\n","3 3\n1 2\n2 3\n3 1\n","8 12\n1 2\n2 3\n3 4\n4 1\n1 3\n2 4\n3 5\n3 6\n5 (...TRUNCATED)	{"input":["3\n121339 121339 121339 55451923 531222142 121339 121339 435485671 121339\n","3\n1 7 9232(...TRUNCATED)	{"input":["5 2\nbacba","10 2\nbbbabbbaaa","10 3\nbbaabbbaab","5 2\nbacaa","10 2\nbaabbbaabb","10 2\n(...TRUNCATED)	6	0	{"language":[2,4,2,2,2,1,2,2,4,2,2,2,4,2,2,2,4,2,4,2,2,2,4,2,2,3,3,4,2,1,2,2,4,4,4,4,2,2,1,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	851	E	0	0	[ "data structures", "implementation", "math" ]	false	null	268,435,456
mind-palaces-3	"Alex, Bob and Carl will soon participate in a team chess tournament. Since they are all in the same(...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": [], "output": [] }	{"input":["81\n9 4\n6 8\n6 4\n4 6\n4 8\n9 10\n0 2\n5 4\n8 9\n7 7\n10 5\n4 4\n7 8\n3 7\n2 1\n5 5\n2 7(...TRUNCATED)	2	8	{"language":[2,4,4,4,4,4,4,2,4,4,2,2,4,4,3,3,1,4,4,3,2,2,3,4,4,2,2,4,4,4,4,2,2,4,2,2,2,2,2,2,2,4,2,4(...TRUNCATED)	{"language":[3,2,2,2,3,3,2,2,3,0,3,2,3,2,3,3,0,4,2,2,2,3,2,2,0,2,4,4,0,2,0,3,2,2,3,3,3,3,2,2,0,0,2,2(...TRUNCATED)	963	A	0	1,600	[ "greedy", "implementation" ]	false	{ "nanos": 0, "seconds": 4 }	256,000,000
89_C. Chip Play	"Little Petya likes arrays of integers a lot. Recently his mother has presented him one such array c(...TRUNCATED)	{"input":["5\n1 2\n2 1\n5 10\n10 9\n20 1\n","5\n1 2\n2 1\n5 10\n10 9\n19 1\n"],"output":["4\n","3\n"(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\n3 2 0\n","3\n1 2 0\n","3\n2 0 2\n","11\n1 1 1 1 1 2 4 2 2 2 1\n","5\n1 1 2 1 2\n","5\n(...TRUNCATED)	6	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":[0,0,0,0,2,0,0,2,2,1,1,0,2,4,0,2,0,0,0,0,0,0,2,2,0,0,0,2,2,2,3,2,2,2,1,3,4,2,0,2,2,0,2,2(...TRUNCATED)	626	C	500	3,000	[ "*special", "implementation" ]	false	null	0
545_C. Woodcutters	"Vasya has a very beautiful country garden that can be represented as an n × m rectangular field di(...TRUNCATED)	{ "input": [ "5 5 10 5 4\n", "12 4 12 4 1\n", "15 1 100 0 0\n" ], "output": [ "1\n", "3\n", "15\n" ] }	{ "input": [], "output": [] }	{"input":["2 5 1\n0 4 6\n0 2 7\n","1 1 1000000000\n0 0 1\n","5 200 10\n1 1 1\n1000000000 200 1000000(...TRUNCATED)	2	11	{"language":[1,2,3,2,2,2,4,4,3,4,4,3,2,2,2,2,2,3,2,2,2,1,2,2,2,4,4,1,2,2,2,2,2,4,2,2,2,4,2,4,2,2,2,1(...TRUNCATED)	{"language":[2,2,4,2,3,4,4,3,4,1,3,3,2,3,2,2,1,3,3,3,2,3,4,3,4,2,2,3,4,3,2,4,4,3,4,4,4,3,4,2,3,4,3,2(...TRUNCATED)	188	D	1,500	0	[ "combinatorics", "dp", "trees" ]	false	null	256,000,000
golu-and-coins-1	"Mister B once received a gift: it was a book about aliens, which he started read immediately. This (...TRUNCATED)	{ "input": [ "4\nRRBR", "4\nBRBR" ], "output": [ "Yes", "No" ] }	{ "input": [], "output": [] }	{"input":["10 23\n6 9 8 10 4 3 7 1 5 2\n7 2\n3 2\n2 4\n2 6\n7 5\n6 4\n10 7\n7 1\n6 8\n6 2\n8 10\n3 5(...TRUNCATED)	6	8	{"language":[4,4,3,2,4,2,1,3,2,3,1,4,4,3,1,2,1,4,2,3,2,4,4,2,4,3,3,1,4,2,2,2,3,1,3,2,4,3,4,4,4,1,1,2(...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)	0		0	2,200	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
765_D. Artsem and Saunders	"This is the easy version of the problem. The only difference is that in this version q = 1. You can(...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":["2 2\n2 3\n2 3\n2 3\n2 2\n5 2","2 2\n2 3\n2 2\n2 3\n2 2\n2 2","2 2\n2 3\n2 3\n2 2\n2 2\n5 (...TRUNCATED)	1	11	{"language":[2,2,2,2,2,2,2,4,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,4,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,3,4,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,4,2(...TRUNCATED)	433	A	0	0	[ "data structures", "greedy", "implementation" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
272_B. Dima and Sequence	"Polycarp has recently created a new level in this cool new game Berlio Maker 85 and uploaded it onl(...TRUNCATED)	{ "input": [ "3\n1 2 3\n", "3\n2 2 2\n", "2\n2 1\n" ], "output": [ "3\n1 2 3 \n1 2 3 ", "1\n1 1 1 \n2 ", "-1" ] }	{"input":["3\n3 2 3\n","3\n1 3 1\n","5\n1 1 2 1 1\n","5\n1 1 1 1 2\n","4\n562617869 562617869 562617(...TRUNCATED)	{"input":["15\nxxtxttxxttxtxxt\n","3\nymw\n","127\nxixtxixnxixtxixlxixtxixnxixtxixoxixtxixnxhxtxixlx(...TRUNCATED)	2	7	{"language":[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,4,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,1,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,4,2,2,2,2,2,1,2,4,2,2,1,2(...TRUNCATED)	0		0	1,600	[ "data structures", "dfs and similar", "dp", "graphs", "greedy", "trees" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
p01123 Let's Move Tiles!	"You are given a square board, consisting of n rows and n columns. Each tile in it should be colored(...TRUNCATED)	{ "input": [ "8 2\n1 1 2 3 4 5 5\n", "7 1\n1 1 3 3 4 4\n" ], "output": [ "2", "4" ] }	{"input":["10 10\n.L.....R..\n.........U\n..D....D..\n.R......L.\n....L.....\n.........D\n......U...(...TRUNCATED)	{"input":["5\n3\n1\n1\n3\n4\n5\n\nSAMPLE","5\n3\n1\n3\n3\n4\n5\n\nSAMPLE","5\n4\n1\n1\n3\n5\n5\n\nSA(...TRUNCATED)	2	12	{"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,155	A	1,750	0	[ "brute force", "sortings" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
985_A. Chess Placing	"Joisino is planning to open a shop in a shopping street.\n\nEach of the five weekdays is divided in(...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":["brtakoktrosttttttttttosafasfkalsfkodfdasiofhadfhasdsajfdsafoasodsafahaihfdisoadspapsapios(...TRUNCATED)	2	2	{"language":[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,4,2,4,4,2,2,2,2,4,2,2,2,2,2,2,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)	483		0	2,500	[ "greedy" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000