Datasets:

TheFactoryX
/

edition_2730_deepmind-code_contests-readymade

name large_stringlengths 4 70	description large_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 large_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 large_stringclasses 36 values	time_limit dict	memory_limit_bytes int64 0 1.07B
167_C. Wizards and Numbers	"A and B are preparing themselves for programming contests.\n\nB loves to debug his code. But before(...TRUNCATED)	{"input":["3\nTroll likes Dracul\nDracul likes Anka\nSnowy likes Hexadecimal\n210 200 180\n","2\nAnk(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1000\nspnogbxcrp\nbaukbqnmyu\nogxdxhtcwz\nbsjufplykz\nkhicdrdixl\nzookiqggel\nfczygjfhfa\(...TRUNCATED)	2	0	{"language":[1,3,2,2,2,3,4,2,4,3,3,3,2,3,1,3,3,3,3,3,3,2,3,4,3,3,4,3,3,3,3,3,4,3,4,2,3,3,2,3,4,3,3,3(...TRUNCATED)	{"language":[0,2,2,0,2,2,2,0,2,0,2,2,2,2,2,0,0,2,3,2,0,2,2,0,0,2,4,2,2,2,2,2,2,2,2,0,2,0,2,0,2,2,1,0(...TRUNCATED)	306	E	50	0	[ "data structures" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
784_B. Kids' Riddle	"The black king is standing on a chess field consisting of 109 rows and 109 columns. We will conside(...TRUNCATED)	{"input":["? - ? = 1\n","? + ? - ? + ? + ? = 42\n","? = 1000000\n"],"output":["Impossible\n","Possib(...TRUNCATED)	{"input":["20 20\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n","10 4\n0 1 4 2 7 0 10 0 5 8\n","10 7\n1(...TRUNCATED)	{"input":["3\n3 0 2 5\n1 1 1 6\n3 2 1 10\n1 -2 3 6\n2\n1 2\n3 3\n1\n2\n3\n0\n3 0 2 5\n1 1 1 6\n3 2 1(...TRUNCATED)	2	0	{"language":[3,2,2,2,3,3,4,3,3,4,2,3,2,4,2,2,4,2,2,2,2,4,3,2,3,2,2,4,4,4,2,2,2,3,3,2,3,3,2,3,2,2,3,2(...TRUNCATED)	{"language":[2,2,2,2,4,2,4,2,4,2,2,2,4,2,2,2,3,2,2,2,2,2,0,2,2,2,4,2,2,4,2,0,2,2,2,2,1,0,2,2,1,2,2,2(...TRUNCATED)	1,466	B	0	3,200	[]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
868_A. Bark to Unlock	"One day, Taro received a strange email with only the number \"519345213244\" in the text. The email(...TRUNCATED)	{ "input": [ "2\n27 25 4\n25 26 16\n\nSAMPLE" ], "output": [ "K-G-B\nX-Y-B" ] }	{"input":["6\nc armor 0 13 0 3\na weapon 23 0 0 3\nb weapon 20 0 0 4\ne orb 0 0 13 3\nd armor 0 15 0(...TRUNCATED)	{"input":["5\n10 50\n11 50\n10 50\n10 50\n10 50\n","3\n1000 3000\n1500 1302\n3000 1000\n","43\n75 16(...TRUNCATED)	2	9	{"language":[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,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,397		500	2,400	[ "bitmasks", "combinatorics", "dp" ]	false	"\n\n問題\n\nあなたは星空の写真の中から星座を探している．写真には必ず(...TRUNCATED)	{ "nanos": 0, "seconds": 1 }	256,000,000
1070_C. Cloud Computing	"Continuing from previous version of codeXplod series i.e. CodeXplod 1.0,Chandu and daspal are still(...TRUNCATED)	{"input":["3 2 998244353\n","9 3 998244353\n","3 1 998244353\n","9 4 998244353\n"],"output":["665496(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\n9 5 8\n8 9 3\n9 5 2\n","50\n48 45 42\n32 45 8\n15 41 47\n32 29 38\n7 16 48\n19 9 21\n1(...TRUNCATED)	2	7	{"language":[3,2,4,3,3,3,3,3,3,2,4,3,4,4,3,2,3,2,2,3,4,2,3,2,4,4,4,3,2,3,2,4,3,2,3,4,4,3,2,2,4,2,2,4(...TRUNCATED)	{ "language": [], "solution": [] }	1,420		0	0	[ "greedy" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
789_A. Anastasia and pebbles	"Takahashi went to an all-you-can-eat buffet with N kinds of dishes and ate all of them (Dish 1, Dis(...TRUNCATED)	{ "input": [ "3\n0 1 1\n1 0 4\n1 4 0\n", "4\n0 1 2 3\n1 0 4 5\n2 4 0 6\n3 5 6 0\n" ], "output": [ "2", "5" ] }	{ "input": [], "output": [] }	{"input":["+dab\n+abac\n-abac\n+baca\n","+Dmitry\n+Mike\nDmitry:All letters will be used\nDmitry:qwe(...TRUNCATED)	2	11	{"language":[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,3,2,4,2,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,4,4,2,2,2,2,2,2,4,2,2,4,2,4,2,2,2,2,2(...TRUNCATED)	361	A	0	900	[ "math", "number theory", "sortings" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
discover-the-monk	"You are given a table consisting of n rows and m columns. Each cell of the table contains either 0 (...TRUNCATED)	{ "input": [ "3\n4251\n52310\n00006\n\nSAMPLE" ], "output": [ "12\n56\nunlucky" ] }	{"input":["447244\n","958507\n","816923\n","836603\n","862795\n","756604\n","1000000\n","4\n","66882(...TRUNCATED)	{"input":["2\n999999\n1000100","3\n9\n99\n238","2\n999999\n1010100","3\n9\n99\n39","2\n999999\n10101(...TRUNCATED)	2	9	{"language":[3,3,3,3,3,2,3,3,3,3,3,4,4,4,3,2,3,3,3,2,3,2,2,3,2,4,2,3,3,3,4,2,2,3,2,2,2,3,3,3,3,2,2,2(...TRUNCATED)	{"language":[4,0,0,2,2,2,3,3,2,3,2,3,2,3,1,3,2,2,2,2,4,2,2,3,0,2,3,3,2,2,3,3,2,2,4,3,2,2,2,2,2,3,3,2(...TRUNCATED)	371	D2	0	0	[ "combinatorics", "divide and conquer" ]	true		{ "nanos": 0, "seconds": 1 }	256,000,000
lucky5	"You are given a string s consisting of n lowercase Latin letters.\n\nLet's define a substring as a (...TRUNCATED)	{"input":["1\n3\n1 2\n2 3\n1\n1\n1\n2\n2\n1\n","2\n6\n1 2\n1 3\n1 4\n4 5\n4 6\n4\n1 3 4 5\n3\n3 5 2\(...TRUNCATED)	{"input":["4 10\n1 333333333 666666666 1000000000\n1000000000 1000000000 1000000000 1000000000\n1 1\(...TRUNCATED)	{"input":["100\n95 54 23 27 51 58 94 34 29 95 53 53 8 5 64 32 17 62 14 37 26 95 27 85 94 37 85 72 88(...TRUNCATED)	2	11	{"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,1,1,1,1,1,1,1,1,1(...TRUNCATED)	{"language":[1,2,2,2,2,3,2,4,2,1,2,4,2,3,4,2,2,3,3,3,4,2,4,2,2,2,2,3,2,1,4,2,2,2,2,4,2,1,2,2,2,4,4,2(...TRUNCATED)	0	F	2,750	1,900	[ "constructive algorithms" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
1328_F. Make k Equal	"In the previous problem Chandu bought some unsorted arrays and sorted them (in non-increasing order(...TRUNCATED)	{ "input": [ "2\n2 1\n5 4\n3 2\n1 0 2\n\nSAMPLE" ], "output": [ "9\n1\n" ] }	{ "input": [], "output": [] }	{"input":["16 20 2\n10 3\n5 3\n10 5\n12 7\n7 6\n9 10\n9 6\n1 10\n11 16\n11 1\n16 2\n10 2\n14 4\n15 1(...TRUNCATED)	6	9	{"language":[2,2,2,4,2,2,3,4,2,4,2,2,3,2,4,2,2,2,4,2,2,4,2,4,2,4,2,4,2,2,4,2,2,4,2,4,2,4,2,2,4,3,4,2(...TRUNCATED)	{"language":[4,4,4,4,3,2,2,2,1,2,2,2,2,4,4,2,2,4,2,4,4,2,2,3,2,1,3,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,046		1,750	800	[ "constructive algorithms", "greedy", "number theory" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1428_D. Bouncing Boomerangs	"E --Disappear Drive\n\nStory\n\nThe person in D likes basketball, but he likes shooting, so other t(...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":["10 7\n1 10\n2 10\n3 19\n4 10\n5 10\n1 2\n1 3\n1 4\n1 5\n1 6\n","20 7\n6047 35038\n15816 3(...TRUNCATED)	2	0	{"language":[3,2,3,2,2,3,3,3,3,4,4,2,3,3,4,2,3,4,2,3,2,2,3,2,2,3,4,2,2,3,3,3,3,3,2,2,2,3,4,3,3,2,1,2(...TRUNCATED)	{"language":[3,2,2,4,1,2,2,2,2,4,4,2,2,2,4,4,2,3,2,1,2,2,2,4,4,2,4,2,2,1,2,2,2,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED)	0	E	0	1,500	[ "dp", "games" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1180_E. Serge and Dining Room	"Professor Sharma gives the following problem to his students: given two integers X( ≥ 2) and Y( (...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":["6 4 3\n0 1 2\n1 3 0\n0 4 5\n1 4 4\n1 2 2\n0 4 2\n","50 69 6\n62 91 5\n35 35 53\n85 26 1\n(...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)	2	10	{"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":[2,3,2,4,4,1,4,2,3,4,2,2,4,2,2,4,1,2,2,4,3,2,4,2,3,1,4,4,4,2,1,3,1,2,2,4,3,2,2,2,4,1,2,2(...TRUNCATED)	0		0	2,600	[ "data structures", "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000