Datasets:

TheFactoryX
/

edition_1189_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
p00032 Plastic Board	"Given an n × n table T consisting of lowercase English letters. We'll consider some string s good (...TRUNCATED)	{"input":["4\nsword weapon 10 2 3 2\npagstarmor armor 0 15 3 1\niceorb orb 3 2 13 2\nlongbow weapon (...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":["2 2 1\n2 3 1\n3 2 3\n1 3 5","4 2 1\n2 3 1\n3 2 3\n1 3 5","2 2 1\n2 3 1\n3 2 5\n1 3 5","2 (...TRUNCATED)	2	8	{"language":[2,4,3,2,3,1,3,4,3,2,4,4,3,3,2,2,2,3,1,1,1,2,2,3,4,4,3,4,1,1,2,3,1,2,4,2,3,4,3,3,3,2,1,4(...TRUNCATED)	{"language":[4,3,3,3,2,3,2,2,1,4,3,4,3,2,3,2,2,2,4,2,2,2,2,2,2,3,3,4,3,3,2,3,2,4,1,4,4,4,4,2,4,2,2,4(...TRUNCATED)	1,398	C	0	0	[]	false	{ "nanos": 500000000, "seconds": 0 }	268,435,456
25_D. Roads not only in Berland	"Linda likes to change her hair color from time to time, and would be pleased if her boyfriend Archi(...TRUNCATED)	{"input":["1 5 3\n1 3\n1 1\n1 5\n","2 2 3\n1 2\n2 2\n2 1\n","4 3 6\n1 2\n1 3\n2 2\n2 3\n3 1\n3 3\n"](...TRUNCATED)	{"input":["10\n100000000 200000000 300000000 20 500000000 600000000 700000000 800000000 900000000 10(...TRUNCATED)	{"input":["3\n7\n4 6 11 11 15 18 34\n4\n10 10 10 11\n3\n1 1 1000000000\n","1\n3\n39 78868 80000\n","(...TRUNCATED)	2	0	{"language":[2,2,2,1,2,3,2,4,2,4,4,4,2,4,2,4,2,2,2,2,4,2,4,3,2,4,2,2,4,4,2,4,3,4,3,2,4,4,1,4,3,2,4,4(...TRUNCATED)	{"language":[3,2,1,2,3,2,2,3,4,2,2,2,2,3,2,2,2,2,4,2,4,2,2,2,3,3,2,2,3,4,4,4,1,4,2,2,3,2,4,2,2,2,4,4(...TRUNCATED)	0		0	0	[]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
p02117 Picnic	"PowerShell had N natural numbers. He wanted to test Xenny's speed in finding the sum and difference(...TRUNCATED)	{ "input": [ "2 1\n", "1 3\n", "10 2\n" ], "output": [ "2.333333333", "1.000000000", "15.938076892" ] }	{"input":["15\nMIRZOYANOVECLOX\n","23\nAABBBAAACCCCCAAADDDDDDD\n","2\nQA\n","11\nGGRRAATTZZZ\n","6\n(...TRUNCATED)	{"input":["100 5\n1\n23\n45\n47\n89","10 2\n4\n1","4 1\n3","100 3\n1\n23\n45\n47\n89","100 0\n1\n23\(...TRUNCATED)	2	10	{"language":[4,3,2,2,3,2,4,3,3,2,2,4,2,2,4,3,3,3,2,2,4,3,4,3,3,3,3,3,3,4,1,4,4,2,3,4,1,2,2,2,3,2,3,3(...TRUNCATED)	{"language":[2,3,2,2,0,2,2,2,4,2,2,2,2,1,2,2,2,4,2,3,2,2,2,2,2,2,2,2,0,4,0,2,1,2,3,2,2,2,3,3,2,2,2,2(...TRUNCATED)	582	D	0	0	[ "constructive algorithms", "dfs and similar", "dp", "greedy", "trees" ]	false	{ "nanos": 0, "seconds": 1 }	268,435,456
483_B. Friends and Presents	"Buber is a Berland technology company that specializes in waste of investor's money. Recently Buber(...TRUNCATED)	{ "input": [ "3 2 0 2\n0 1 3\n2 5\n" ], "output": [ "1\n" ] }	{ "input": [], "output": [] }	{"input":["15\nLIRZOYANOVECLOX\n","23\nAACBBAAACCCCBAAADDDDDDD\n","2\nAQ\n","11\nAGRRGATTZZZ\n","3\n(...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],"solution":["for q in range((...TRUNCATED)	{"language":[2,3,4,3,0,2,2,4,2,0,3,0,3,0,3,3,2,0,2,2,2,2,2,0,0,3,2,2,2,2,2,2,3,2,3,2,4,2,2,3,0,2,2,3(...TRUNCATED)	526		0	1,900	[ "flows", "shortest paths" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
920_E. Connected Components?	"Roy is going through the dark times of his life. Recently his girl friend broke up with him and to (...TRUNCATED)	{ "input": [ "3\n1 1 1\n", "1\n1\n", "2\n1 2\n", "4\n1 2 3 4\n" ], "output": [ "-1\n", "-1\n", "-1\n", "1 2\n" ] }	{ "input": [], "output": [] }	{"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)	1	9	{"language":[1,3,2,2,2,4,1,4,4,2,4,3,4,4,4,4,2,2,1,4,2,2,4,2,2,4,1,4,4,2,2,2,2,2,4,4,3,2,4,4,4,3,2,2(...TRUNCATED)	{"language":[4,3,3,1,2,4,2,2,3,3,4,3,4,3,2,2,4,3,3,3,4,2,2,2,4,3,2,2,3,3,4,4,4,1,1,4,1,1,1,3,2,4,2,1(...TRUNCATED)	0	D	0	0	[ "" ]	false	{ "nanos": 0, "seconds": 3 }	0
323_C. Two permutations	"You are running through a rectangular field. This field can be represented as a matrix with 3 rows (...TRUNCATED)	{"input":["15 22\n8 13 33418\n14 15 55849\n7 10 15207\n4 6 64328\n6 9 86902\n15 7 46978\n8 14 53526\(...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":["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)	3	10	{"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":[3,2,0,2,3,0,0,2,0,0,2,2,0,0,3,0,0,0,2,3,2,0,2,2,0,2,2,2,0,0,0,0,2,3,3,0,0,2,0,0,0,2,3,3(...TRUNCATED)	0	A	1,000	0	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
442_C. Artem and Array	"There are three arrays a, b and c. Each of them consists of n integers. SmallY wants to find three (...TRUNCATED)	{"input":["9 10\n1 2 3 4 5 6 7 8 9\n1 2\n2 3\n2 4\n3 4\n4 5\n4 6\n2 7\n7 8\n7 9\n9 1","2 1\n1 2\n1 2(...TRUNCATED)	{"input":["15\ntxxtxttxxttxtxx\n","3\nmyw\n","127\nxixtxixnxixtxixlxixtxixnxixtxixoxixtxixnxixtxixlx(...TRUNCATED)	{"input":["2\n\nSBMPLE","2\n\nSBPMLE","2\n\nELMPBS","2\n\nELMPAS","2\n\nSAPMLE","2\n\nSAQMLE","2\n\n(...TRUNCATED)	2	3	{"language":[1,1,1,1,1],"solution":["n = input()\nfor i in range(n):\n str = raw_input()\n l =(...TRUNCATED)	{"language":[2,2,2,0,2,2,2,2,0,2,2,0,2,2,2,0,0,2,0,0,2,0,2,2,2,2,0,0,0,2,0,2,2,2,2,2,2,2],"solution"(...TRUNCATED)	425	E	1,000	900	[]	false	null	256,000,000
trailing-zero-problem-1	"To celebrate the opening of the Winter Computer School the organizers decided to buy in n liters of(...TRUNCATED)	{ "input": [ "4 1 2 3 4\n", "5 5 46 372 81 9\n" ], "output": [ "5 3 5 7 ", "14 51 418 453 90 " ] }	{"input":["3\n500000 500001 500002\n","1\n505050\n","2\n999998 999999\n","2\n500000 500001\n","1\n99(...TRUNCATED)	{"input":["2\n1\n3\n\n\nSAMPLE","2\n2\n3\n\n\nSBMPLE","2\n2\n2\n\n\nELPMBS","2\n4\n2\n\n\nELPMBS","2(...TRUNCATED)	2	2	{"language":[2,2,2,2,2,2,2,2,4,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,2,2,3,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,4,4,2,3,2,2,2,3,3,4,3,4,2,2,3,4,4,2,2,2,2,2,3,2,3,3,4,4,2,3,2,3,2,3,2,4,4,4,4,2,4,2,2(...TRUNCATED)	0	A	2,500	3,100	[ "greedy", "sortings" ]	false	{ "nanos": 0, "seconds": 3 }	256,000,000
1344_A. Hilbert's Hotel	"Polycarp starts his own business. Tomorrow will be the first working day of his car repair shop. Fo(...TRUNCATED)	{ "input": [ "2\n4 1\n2 15 36 43 \n3 2\n27 30 35 \n\nSAMPLE" ], "output": [ "41\n5\n" ] }	{"input":["20 20 20\n18 16\n4 20\n2 5\n7 4\n11 13\n6 10\n20 8\n14 6\n3 12\n5 1\n16 7\n10 9\n1 11\n12(...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)	5	10	{"language":[3,2,4,2,2,2,3,3,3,4,3,3,3,2,4,3,2,4,2,3,2,2,3,2,2,4,2,2,3,3,4,3,3,2,2,2,4,3,3,3,3,3,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	19	B	500	1,100	[ "bitmasks", "dp" ]	false	{ "nanos": 0, "seconds": 3 }	256,000,000
228_D. Zigzag	"You are given a permutation p_1, p_2, …, p_n.\n\nIn one move you can swap two adjacent values.\n\(...TRUNCATED)	{ "input": [ "ppqb", "pdbq" ], "output": [ "No", "Yes" ] }	{"input":["#(#(#((##((()))(((#)(#()#(((()()(()#(##(((()(((()))#(((((()(((((((()#((#((()(#(((()(()##((...TRUNCATED)	{"input":["11 7 5\n24979445 861648772 623690081 433933447 476190629 262703497 147009374 971407775 62(...TRUNCATED)	2	11	{"language":[1,2,2,2,2,4,2,4,4,2,2,3,2,4,2,2,1,2,2,4,4,2,2,3,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,3,2,2,3,0,3,2,2,2,2,2,2,3,2,2,2,4,2,2,2,2,2,2,3,3,3,2,4,2,4,3,3,2,3,2,0,2,2,2,3,2,2,3(...TRUNCATED)	348	C	1,000	1,500	[ "brute force", "implementation", "strings" ]	false	{ "nanos": 0, "seconds": 5 }	0