Datasets:

TheFactoryX
/

edition_1164_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
1155_A. Reverse a Substring	"Background\n\nThe kindergarten attached to the University of Aizu is a kindergarten where children (...TRUNCATED)	{"input":["10000\n5000 3150\n5000 5000\n0 0\n5000 1050\n5000 3980\n5000 210\n5000 5000\n5000 5000\n0(...TRUNCATED)	{"input":["4\n889308 0\n110692 0\n0 461939\n146447 815492\n","5\n0 4\n3 4\n2 2\n2 0\n0 0\n","5\n0 10(...TRUNCATED)	{"input":["4\ncba\ncab\nb\na\n3\nbca\nab\na\n5\nabc\nacb\nb\nc\nc\n5\nabc\nacc\nc\nb\nb\n0","4\ncba\(...TRUNCATED)	2	9	{"language":[3,4,4,4,1,3,4,3,2,4,3,3,3,4,3,2,3,3,4,3,4,4,4,2,3,2,4,3,3,4,4,3,3,3,2,2,3,4,2,4,2,3,2,3(...TRUNCATED)	{"language":[2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,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(...TRUNCATED)	0		0	0	[ "dp", "math", "number theory" ]	false	{ "nanos": 0, "seconds": 2 }	268,435,456
937_D. Sleepy Game	"Ivan on his birthday was presented with array of non-negative integers a_1, a_2, …, a_n. He immed(...TRUNCATED)	{ "input": [ "4\n1 3 2 4\n" ], "output": [ "1 1\n-1\n2 4\n9 6 12 \n1 4\n0 -12 -8 -16 \n" ] }	{ "input": [ "5\n90 94\n26 25\n64 84\n14 6\n20 96\n" ], "output": [ "1842\n12\n1015\n3\n1908\n" ] }	{"input":["3 313 856 964 421\n","3 3 1 11 9\n","2 2 9 8 1\n","61 538 623 89 548\n","7 202 512 995 37(...TRUNCATED)	6	10	{"language":[1,1],"solution":["t = int(raw_input())\n\nd = {}\n\nfor i in range(t):\n\t\n\ts = raw_i(...TRUNCATED)	{"language":[4,4,4,1,3,4,4,4,2,2,2,4,2,3,4,4,4,2,1,3,4,4,2,2,2,4,2,4,4,3,2,4,2,1,3,3,1,4,3,4,2,3,2,2(...TRUNCATED)	188	C	0	0	[ "data structures", "greedy", "implementation" ]	false	null	256,000,000
1250_B. The Feast and the Bus	"The time has arrived when the world is going to end. But don't worry, because the new world yuga wi(...TRUNCATED)	{"input":["6 5\n20 15 10 15 20 25\n","7 1\n101 53 42 102 101 55 54\n","7 1000000\n1 1 1 1 1 1 1\n"],(...TRUNCATED)	{"input":["10 16\n9 8\n1 2\n9 5\n5 4\n9 2\n3 2\n1 6\n5 10\n7 2\n8 2\n3 7\n4 9\n5 7\n10 3\n10 9\n7 8\(...TRUNCATED)	{"input":["10\n669924290 408119795 283272835\n663737793 250734602 29671646\n431160679 146708815 2894(...TRUNCATED)	2	0	{"language":[2,4,4,2,2,2,4,2,3,2,2,2,4,3,2,4,3,1,1,2,3,4,2,2,4,2,3,3,1,4,4,3,1,3,1,2,2,2,1,4,4,4,3,3(...TRUNCATED)	{"language":[2,2,3,2,0,3,0,3,2,0,3,4,3,4,3,3,0,2,3,2,2,2,2,2,3,4,3,2,3,0,3,2,2,0,2,3,3,3,2,3,4,3,0,3(...TRUNCATED)	687		0	2,600	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
235_D. Graph Game	"New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has n (...TRUNCATED)	{"input":["3\nTroll likes Dracul\nDracul likes Anka\nSnowy likes Hexadecimal\n210 200 180\n","2\nAnk(...TRUNCATED)	{"input":["1000 1001\n217 636 713 516\n","1000 1998\n833 681 19 233\n","4 5\n1 3 4 2\n","6 7\n3 1 2 (...TRUNCATED)	{"input":["8 9\n6 -1 5 -5 -1 -7 -8 -7\n","10 7\n-9 3 -4 -22 4 -17 1 -14 3 -2\n","5 10\n-8 -24 0 -5 1(...TRUNCATED)	2	8	{"language":[2,4,2,2,2,3,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,3,2,2,2,2,2,3,2,4(...TRUNCATED)	{"language":[2,4,4,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,4,2,2,4,2,2,4,2,4,2,2,2,2,2,2,2,2,2,4,2,4,2(...TRUNCATED)	153	A	1,500	800	[ "dp", "implementation", "strings" ]	false	null	256,000,000
720_C. Homework	"Mashmokh's boss, Bimokh, didn't like Mashmokh. So he fired him. Mashmokh decided to go to universit(...TRUNCATED)	{ "input": [ "5\nabvzx\n\nSAMPLE" ], "output": [ "zx\n" ] }	{ "input": [], "output": [] }	{"input":["1 100000 100000 110000 -100000\n","46456 -250 -23623 -98302 -99305\n","10 6 3 7 2\n","1 -(...TRUNCATED)	3	0	{ "language": [], "solution": [] }	{"language":[3,1,3,2,1,2,2,2,4,2,3,4,2,4,2,4,2,3,1,3,4,3,2,2,4,3,2,2,1,2,4,2,4,3,4,2,4,2,4,4,4,3,2,4(...TRUNCATED)	814	A	0	2,500	[ "implementation" ]	false	{ "nanos": 0, "seconds": 6 }	0
1189_D1. Add on a Tree	"Malek has recently found a treasure map. While he was looking for a treasure he found a locked door(...TRUNCATED)	{ "input": [ "11\n1 2 3 4 5 6 7 8 9 10 11\n1\n1 4 7" ], "output": [ "1 8 9 10 5 6 7 2 3 4 11" ] }	{"input":["3\n1 2 6\n","10\n7 7 7 7 7 7 7 7 7 7\n","76\n13 13 5 6 20 20 6 1 18 18 13 15 20 3 9 11 3 (...TRUNCATED)	{ "input": [], "output": [] }	2	15	{"language":[2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,4,2(...TRUNCATED)	{ "language": [], "solution": [] }	0	D	0	1,000	[ "brute force" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
trailing-zero-problem-1	"Ori and Sein have overcome many difficult challenges. They finally lit the Shrouded Lantern and fou(...TRUNCATED)	{ "input": [ "2\n5\n6 5 4 3 2\n5\n3 4 3 1 1" ], "output": [ "6\n5\n" ] }	{"input":["3\n7089544 9134148 -5332724\n368810 1638695 7889905\n-3866235 -4257263 5802154\n","16\n-3(...TRUNCATED)	{"input":["5\n2 3 0 6 8","5\n2 3 4 6 5","5\n2 3 4 6 7","5\n2 3 0 6 7","5\n2 -1 8 6 4","5\n6 0 8 5 2"(...TRUNCATED)	6	0	{"language":[1,2,4,3,2,2,2,3,4,2,3,1,2,2,4,2,4,4,2,2,1,4,4,2,4,2,2,2,2,2,3,1,2,2,4,4,4,1,2,2,3,4,2,3(...TRUNCATED)	{"language":[2,4,2,2,2,2,4,2,2,2,2,4,2,2,2,3,4,2,1,2,4,2,2,4,3,2,3,3,2,4,4,2,2,2,4,4,2,1,4,2,2,2,3,2(...TRUNCATED)	0		2,000	0	[ "binary search", "data structures", "divide and conquer", "greedy", "implementation" ]	false	{ "nanos": 0, "seconds": 3 }	268,435,456
1348_F. Phoenix and Memory	"George is getting tired of the decimal number system. He intends to switch and use the septenary ((...TRUNCATED)	{"input":["5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\(...TRUNCATED)	{"input":["99 100 100 100 100\n","57 83 11 4 93\n","99 99 99 99 99\n","100 0 0 0 0\n","0 1 2 3 4\n",(...TRUNCATED)	{"input":["3703 4549\n433\n","2931 2881\n710\n","3762 947\n1073\n","4583 2774\n986\n","7 10\n1\n","1(...TRUNCATED)	2	6	{"language":[2,3,2,2,4,3,3,3,3,4,4,4,3,4,2,3,3,2,3,3,2,4,3,3,3,2,2,1,3,3,3,3,4,3,1,4,3,3,3,2,3,2,3,3(...TRUNCATED)	{"language":[3,3,2,0,0,3,2,2,4,2,0,4,0,0,0,0,2,0,2,0,2,2,0,0,0,2,2,1,2,3,2,2,0,4,2,4,2,2,2,2,2,2,3,0(...TRUNCATED)	0		0	2,100	[ "data structures" ]	false	{ "nanos": 0, "seconds": 5 }	0
1227_D1. Optimal Subsequences (Easy Version)	"In the previous problem Chandu bought some unsorted arrays and sorted them (in non-increasing order(...TRUNCATED)	{ "input": [ "10 3 2\n", "13 12 1\n", "4 1 1\n" ], "output": [ "5\n", "1\n", "3\n" ] }	{ "input": [], "output": [] }	{"input":["14\n4 9\n3 7\n4 1\n3 2\n14 9\n7 6\n10 13\n8 7\n5 7\n7 10\n1 3\n12 3\n7 11\n20\n13 6 14 9 (...TRUNCATED)	2	7	{"language":[2,3,1,2,4,2,4,2,2,4,4,2,2,4,4,2,1,2,4,2,2,4,2,2,2,4,2,4,2,2,4,2,2,4,4,4,4,4,2,2,2,2,3,2(...TRUNCATED)	{"language":[2,2,4,3,4,2,4,4,4,4,4,2,1,4,2,4,2,2,2,4,2,2,2,4,1,4,2,4,4,1,4,2,2,2,1,2,2,2,3,4,4,3,3,2(...TRUNCATED)	272		0	2,400	[]	false	{ "nanos": 500000000, "seconds": 0 }	256,000,000
691_D. Swaps in Permutation	"You are given an array a of n integers and an integer s. It is guaranteed that n is odd.\n\nIn one (...TRUNCATED)	{ "input": [ "100 5\n1\n23\n45\n67\n89", "10 2\n4\n5", "6 1\n3" ], "output": [ "608200469", "0", "4" ] }	{"input":["4\n14723\n5512\n100\n28436\n33903\n100\n84816\n75747\n100\n92281\n31380\n100","1\n45819\n(...TRUNCATED)	{"input":["2\n1 10\n2\n2 2\n2 1\n1 1\n","2\n3922 3922\n1\n2 2\n2 1\n1 1\n","1\n1\n2\n1 1\n1 1\n1 1\n(...TRUNCATED)	2	12	{"language":[2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,4,4,4,2,2,4,2,4,2],"solut(...TRUNCATED)	{"language":[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,4,2,2,2,2,2,0,2,2,2,0,0,2,4,2,2,3,2(...TRUNCATED)	0	E	0	0	[ "brute force" ]	false	{ "nanos": 0, "seconds": 2 }	268,435,456