Datasets:

TheFactoryX
/

edition_0809_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	untranslated_description stringclasses 36 values	time_limit dict	memory_limit_bytes int64 0 1.07B
235_A. LCM Challenge	"The Chef likes to stay in touch with his staff. So, the Chef, the head server, and the sous-chef al(...TRUNCATED)	{ "input": [ "2\n2\n5" ], "output": [ "2\n3\n" ] }	{ "input": [ "abcdabcdab\n5\n2 2 8 ab\n2 1 10 ab\n1 3 a\n1 4 b\n2 1 4 ab\n" ], "output": [ "1\n3\n2\n" ] }	{"input":["2\n1 20\n","10\n450661 128600 993228 725823 293549 33490 843121 528432 556169 448234\n","(...TRUNCATED)	2	10	{"language":[1,1,1],"solution":["t = int(input())\nfor i in range(t):\n n = int(input())\n pri(...TRUNCATED)	{"language":[2,4,2,2,0,2,4,2,3,2,3,2,2,2,2,2,2,0,2,2,2,3,2,2,2,2,2,3,2,0,0,2,2,0,3,0,2,2,2,2,2,2,2,2(...TRUNCATED)	0	A	2,000	2,100	[ "dfs and similar", "divide and conquer", "implementation" ]	false		null	256,000,000
p03150 KEYENCE Programming Contest 2019 - KEYENCE String	"The time has arrived when the world is going to end. But don't worry, because the new world yuga wi(...TRUNCATED)	{"input":["4\n4 3 2 1\n2 3 4 1\n3\n1 2 3 4\n1 3 2 1\n1 4 2 3\n","3\n3 1 2\n3 2 1\n1\n1 2 3 3\n"],"ou(...TRUNCATED)	{"input":["100 1 7\n83\n174\n191\n145\n167\n55\n232\n157\n51\n209\n85\n73\n216\n39\n72\n76\n132\n70\(...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)	5	9	{"language":[4,2,2,2,2,2,4,2,4,2,2,4,2,4,2,2,4,4,2,3,2,2,2,4,4,4,2,2,2,2,4,4,2,2,4,2,4,3,2,2,4,4,4,2(...TRUNCATED)	{ "language": [], "solution": [] }	283	A	0	2,100	[ "strings" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
85_D. Sum of Medians	"Flatland is inhabited by pixels of three colors: red, green and blue. We know that if two pixels of(...TRUNCATED)	{"input":["3 3 2\n1 2 3\n1 2 3\n1 2 3\n1 2\n3 3\n","4 5 4\n1 4 5 1 2\n2 2 2 2 7\n2 4 1 4 5\n3 2 1 7 (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["5\n5\n1 3\n1 4\n2 2\n3 5\n1 1\n5\n1 3\n3 5\n3 5\n1 4\n4 5\n","1\n0\n1 1\n1\n1 1\n","10\n1(...TRUNCATED)	2	12	{"language":[2,2,2,1,2,2,2,2,3,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,3,2,4,4,4,2,2,2,4,2,2,2,2,4,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)	1,466	E	3,000	1,000	[ "" ]	false	"差分パルス符号変調は主に音声信号を圧縮する際に用いられる圧縮手法の(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	256,000,000
stadium	"Yesterday Oz heard a story about insect colony. The specialty of insects is that they splits someti(...TRUNCATED)	{ "input": [ "3\n1 2\n1 1\n2 1\n", "3\n1 3\n2 2\n3 1\n" ], "output": [ "1 3\n", "1 2 3\n" ] }	{"input":["3 14\n8 9\n10 7\n","12 11\n11 12\n16 7\n","12 17\n10 19\n13 16\n","9 12\n3 17\n10 10\n","(...TRUNCATED)	{"input":["9\n72 49 39 50 68 35 75 158 56\n","4\n2 4 1 2\n","8\n3 4 3 1 1 3 6 1\n","1\n1\n","7\n2 1 (...TRUNCATED)	2	0	{"language":[2,4,2,4,1,2,2,2,2,2,3,3,2,2,3,2,4,3,2,4,2,4,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,451		2,000	900	[ "bitmasks", "brute force", "dp", "math" ]	false		{ "nanos": 0, "seconds": 5 }	512,000,000
the-strongest-string-1-1	"Arpa is taking a geometry exam. Here is the last problem of the exam.\n\nYou are given three points(...TRUNCATED)	{ "input": [ "2\n5 156\n16 40\n\nSAMPLE" ], "output": [ "Case 1: 6\nCase 2: 3\n" ] }	{"input":["7 9 999999999 0 3\n0 1 0\n1 2 0\n2 3 0\n0 4 1\n4 1 1\n1 5 499999999\n5 2 499999999\n2 6 1(...TRUNCATED)	{"input":["7 9\n1 9\n5 9\n5 7\n5 9\n1 1\n6 8\n3 4","7 9\n1 9\n9 9\n5 7\n5 9\n1 1\n6 8\n3 4","7 11\n1(...TRUNCATED)	2	10	{"language":[1,4,1,2,2,2,2,2,2,2,4,3,2,4,2,4,2,2,2,2,2,2,4,4,2,2,4,2,2,2,2,2,4,3,4,2,2,2,4,2,4,4,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)	0		0	1,000	[ "data structures", "dp", "greedy" ]	false		{ "nanos": 0, "seconds": 1 }	0
702_E. Analysis of Pathes in Functional Graph	"Long long ago, there was a thief. Looking for treasures, he was running about all over the world. O(...TRUNCATED)	{ "input": [ "2\naazz\n", "3\nabcabcabz\n" ], "output": [ "azaz", "-1\n" ] }	{ "input": [], "output": [] }	{"input":["3\n6 13 24","3\n6 4 30","3\n12 11 12","3\n6 20 24","3\n6 7 30","3\n11 20 24","3\n10 7 30"(...TRUNCATED)	5	0	{"language":[2,2,3,2,2,2,4,4,2,2,2,3,2,2,4,2,2,2,4,2,2,3,4,2,2,4,2,2,2,2,2,4,2,2,2,3,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	C	0	1,400	[ "implementation", "math" ]	false		{ "nanos": 0, "seconds": 2 }	512,000,000
p00638 Old Bridges	"Takahashi went to an all-you-can-eat buffet with N kinds of dishes and ate all of them (Dish 1, Dis(...TRUNCATED)	{"input":["2 2 1\n2 3 1\n3 2 3\n2 3 5"],"output":["3.9681187851\n6.7970540913\n6.5668891783\n13.9527(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["4","6","3","7","5","8","4","3","5","6","8","7"],"output":["aaaa\naaab\naaba\naabb\naabc\n(...TRUNCATED)	5	8	{"language":[1,1],"solution":["t = int(raw_input())\n\nd = {}\n\nfor i in range(t):\n\t\n\ts = raw_i(...TRUNCATED)	{"language":[2,2,4,4,4,3,2,4,4,4,3,2,2,2,4,4,3,3,3,2,2,4,4,4,2,3,3,2,2,2,4,2,3,3,3,2,4,4,3,3,4,4,2,2(...TRUNCATED)	1,369	D	2,000	1,600	[ "binary search", "data structures", "sortings", "two pointers" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
cdva1502	"Polycarp is working on a new project called \"Polychat\". Following modern tendencies in IT, he dec(...TRUNCATED)	{"input":["4 2 3 1","7834164883628 15 2189823423122 5771212644938","4 2 1 1","4 1 1 4"],"output":["0(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["0\n2130761060 2000000000 1\n","0\n1 1723177055 2000000000\n","12\nAnka likes Dracul\nDrac(...TRUNCATED)	2	10	{"language":[2,2,2,2,4,2,2,4,2,4,2,2,2,2,2,2,4,2,2,2,4,2,2,2,4,2,2,2,2,3,2,4,4,2,4,2,2,2,4,4,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,4,1,2,2,2,2(...TRUNCATED)	0	C	0	1,800	[ "dfs and similar", "dp", "games", "graphs" ]	false		{ "nanos": 0, "seconds": 2 }	0
949_C. Data Center Maintenance	"Continuing from previous version of codeXplod series i.e. CodeXplod 1.0,Chandu and daspal are still(...TRUNCATED)	{"input":["3\n7\n4 6 11 11 15 18 20\n4\n10 10 10 11\n3\n1 1 1000000000\n"],"output":["1 2 7\n-1\n1 2(...TRUNCATED)	{"input":["10 1\n1 1 1 1 1 1 1 1 1 1\n","3 57\n78 165 54\n","1 1\n10000\n","2 2\n2 2\n","9 13\n132 8(...TRUNCATED)	{"input":["1 36 0\n-1 -1 -1","0 30 0\n-1 -1 -1","0 32 0\n-1 -1 -1","1 16 0\n-1 -1 -1","0 36 0\n-1 -1(...TRUNCATED)	6	0	{"language":[1,1,1,1],"solution":["M,N=map(int,raw_input().split())\nL=[]\nfor i in range(M):\n L(...TRUNCATED)	{ "language": [], "solution": [] }	235	D	2,000	0	[ "implementation", "sortings", "strings" ]	true		null	256,000,000
1189_A. Keanu Reeves	"Disclaimer: there are lots of untranslateable puns in the Russian version of the statement, so ther(...TRUNCATED)	{ "input": [ "1\n1\n", "6\n100011\n", "2\n10\n" ], "output": [ "1\n1\n", "2\n1 00011\n", "2\n1 0\n" ] }	{"input":["4\n3 4\n1 2\n3 4\n1 2\n","4\n2 4\n1 3\n4 4\n1 1\n","10\n6 6\n1 2\n2 2\n6 7\n8 8\n3 5\n5 5(...TRUNCATED)	{"input":["2 2\n1\n0 1\n2 1\n","10 10\n1 8 2 4 1 8 2 6 6\n4 0 0 0 0 0 0 1 0 0\n3 4 9 10 8 1 7 -8 -10(...TRUNCATED)	2	12	{"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":[3,4,3,4,4,2,4,4,3,4,4,3,2,3,4,2,2,2,2,3,4,2,4,4,1,2,4,2,2,4,4,2,3,2,3,1,2,2,4,4,3,3,3,4(...TRUNCATED)	560	E	500	0	[ "*special" ]	false		{ "nanos": 0, "seconds": 2 }	512,000,000