Datasets:

TheFactoryX
/

edition_1140_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
p00163 Highway Toll	"Ehab has an array a of length n. He has just enough free time to make a new array consisting of n c(...TRUNCATED)	{"input":["7 2\n-10 -4 -2 0 2 4 10","16 19\n-49 -48 -33 -30 -21 -14 0 15 19 23 44 52 80 81 82 84","3(...TRUNCATED)	{"input":["10\ntypedef errtype ucywcaykzh\ntypeof &ucywcaykzh*****\ntypedef &&&&&&void******(...TRUNCATED)	{"input":["78 78\n-645462 -187679 693035 927066 431506 16023 -173045 698159 -995400 -687770 -747462 (...TRUNCATED)	2	8	{"language":[2,2,3,2,2,2,4,4,2,3,2,2,3,3,2,2,1,2,3,2,2,3,3,3,4,3,3,3,4,4,2,3,3,3,4,3,2,2,3,4,4,3,2,2(...TRUNCATED)	{"language":[0,2,2,2,2,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,0,2,2,2,2,2],"solution":[(...TRUNCATED)	0	A	0	2,400	[ "greedy", "strings" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
699_F. Limak and Shooting Points	"Some time ago Mister B detected a strange signal from the space, which he started to study.\n\nAfte(...TRUNCATED)	{ "input": [ "4 4\nDRLD\nU.UL\n.UUR\nRDDL\n", "3 5\n.D...\nRRRLL\n.U...\n" ], "output": [ "10 1\n", "6 2\n" ] }	{ "input": [ "1\n3 3\n1 2\n2 3\n1 3" ], "output": [ "2\n" ] }	{ "input": [], "output": [] }	2	0	{"language":[1,1,1,1],"solution":["for t in xrange(input()):\n n, m = map(int, raw_input().strip((...TRUNCATED)	{ "language": [], "solution": [] }	0	B	0	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	0
626_D. Jerry's Protest	"Polycarp has recently created a new level in this cool new game Berlio Maker 85 and uploaded it onl(...TRUNCATED)	{ "input": [ "3\n1 2\n2 3\n", "5\n1 2\n1 3\n1 4\n1 5\n" ], "output": [ "1 1 1\n", "1 0 0 0 0\n" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	6	10	{"language":[4,2,2,2,2,3,2,2,4,2,3,2,2,4,4,2,2,4,2,2,2,4,4,2,2,2,2,3,2,3,4,2,3,4,2,2,2,2,4,4,2,2,2,2(...TRUNCATED)	{"language":[2,2,4,3,2,3,3,0,3,2,2,0,3,4,1,3,2,2,0,0,2,2,3,3,3,3,0,3,4,2,0,3,0,2,0,2,2,2,3,3,4,3,2,2(...TRUNCATED)	0		0	1,500	[ "*special", "implementation" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
prpaln	"In late autumn evening n robots gathered in the cheerful company of friends. Each robot has a uniqu(...TRUNCATED)	{ "input": [ "5\n7 46 11 20 11", "7\n994 518 941 851 647 2 581", "3\n3 4 6" ], "output": [ "90", "4527", "10" ] }	{ "input": [], "output": [] }	{"input":["1 2 101 42 99 -1","1 2 101 42 33 -1","1 2 101 36 33 -1","1 2 101 36 50 -1","0 2 101 36 50(...TRUNCATED)	2	2	{"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,4,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,3,2,2,2,2,2,4,4,4,2,4,2,4,2,2,3,2,2,2,2,2,2,4,4,2,3,2,2,4,2,2,2,2,2,2,3,2,4,4,2,2,4(...TRUNCATED)	776		500	2,400	[ "implementation", "sortings", "strings" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
784_B. Kids' Riddle	"You are given a sequence of n integers a1, a2, ..., an. \n\nDetermine a real number x such that the(...TRUNCATED)	{ "input": [ "6\n1 2 3 4 5 6\n", "10\n10 9 7 8 6 5 3 4 2 1\n" ], "output": [ "0\n", "2\n" ] }	{"input":["1000\nspnogbxcrp\nbaukbqnmyu\nogxdxhtcwz\nbsjufplykz\nkhicdrdixl\nzookiqggel\nfczygjfhfa\(...TRUNCATED)	{"input":["5\n0 0\n2 1\n1 1\n2 2\n0 2","4\n0 0\n3 0\n2 1\n0 3","4\n0 0\n3 1\n2 1\n0 3","5\n0 0\n3 1\(...TRUNCATED)	2	0	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,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,4,2,2(...TRUNCATED)	{"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,4,2,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2(...TRUNCATED)	586	F	3,000	0	[ "math", "probabilities" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
741_E. Arpa’s abnormal DNA and Mehrdad’s deep interest	"Advertising has become part of our routine. And now, in the era of progressive technologies, we nee(...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": [], "output": [] }	{"input":["5\n2 1 1 1 2\n","6\n5 1 3 4 8 3\n","5\n1 5 7 1 2\n","6\n5 1 3 4 5 3\n","2\n1000010 100100(...TRUNCATED)	2	7	{"language":[1],"solution":["digits=[6,2,5,5,4,5,6,3,7,6]\nvalids=[{} for i in xrange(11)]\nst0={}\n(...TRUNCATED)	{"language":[3,2,3,2,4,3,4,2,2,2,4,2,4,2,4,4,1,2,2,2,3,1,4,4,4,2,3,3,2,4,2,3,2,2,4,2,3,3,4,3,3,1,2,2(...TRUNCATED)	203		0	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	134,217,728
915_A. Garden	"Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles.\n(...TRUNCATED)	{ "input": [ "10 3 2\n", "13 12 1\n", "4 1 1\n" ], "output": [ "5\n", "1\n", "3\n" ] }	{"input":["51\n8 10 Chandu\n2 2959 Daspal\n2903 6 Chandu\n9 2938 Daspal\n10 2907 Daspal\n8 2966 Dasp(...TRUNCATED)	{"input":["2 7\n4\n2\n1\n0\n-1\n-2\n-4\n131\n137\n2 7\n4\n2\n1\n0\n-1\n-2\n-4\n124\n123\n10 7\n-4\n-(...TRUNCATED)	2	11	{"language":[2,2,4,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,4,2,2,2,2,2,2,2,2,2,2,2,2,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)	0	A	1,750	0	[ "" ]	false	"踏み台昇降\n\nJAG大学に通う一樹君，通称カー君は，この夏友達であるあ(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	256,000,000
235_A. LCM Challenge	"You are given two permutations p and q, consisting of n elements, and m queries of the form: l1, r1(...TRUNCATED)	{ "input": [ "2008 2 29\n2015 3 1", "1999 9 9\n2001 11 3" ], "output": [ "8", "3" ] }	{"input":["99\n3\n5\n7\n9\n11\n13\n15\n17\n19\n21\n23\n25\n27\n29\n31\n33\n35\n37\n39\n41\n43\n45\n4(...TRUNCATED)	{"input":["5\nabvzx\n\nSAMOLE","5\nxbvza\n\nSAMOLE","5\nxbvya\n\nSAMOLE","5\nabvxz\n\nSAMOLE","5\nay(...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,3,2,2,2,2,2,2],"solutio(...TRUNCATED)	{"language":[1,3,3,2,4,3,2,2,3,3,4,1,4,2,3,4,1,4,2,1,3,2,2,3,2,2,1,4,4,2,2,2,1,2,4,2,2,3,4,4,4,4,2,3(...TRUNCATED)	0		1,500	0	[ "bitmasks", "brute force", "data structures", "string suffix structures", "strings" ]	false	"20XX年に喜多方市熱塩加納町から南会津町までの6区間、総距離58kmの会津中(...TRUNCATED)	{ "nanos": 0, "seconds": 3 }	256,000,000
268_A. Games	"You have a string s — a sequence of commands for your toy robot. The robot is placed in some cell(...TRUNCATED)	{"input":["7\n5\n-1 10 -1 12 -1\n5\n-1 40 35 -1 35\n6\n-1 -1 9 -1 3 -1\n2\n-1 -1\n2\n0 -1\n4\n1 -1 3(...TRUNCATED)	{"input":["8\n1 2\n1 3\n1 4\n1 5\n2 6\n2 7\n2 8\n","9\n9 2\n9 3\n9 4\n9 5\n2 6\n5 7\n7 8\n7 1\n","9\(...TRUNCATED)	{ "input": [], "output": [] }	2	0	{"language":[3,3,2,2,3,2,2,2,3,3,3,2,3,4,3,2,3,2,3,2,2,2,2,3,3,3,3,2,2,3,3,2,3,2,3,4,3,2,3,2,4,1,4,3(...TRUNCATED)	{"language":[2,2,4,2,2,2,2,2,2,1,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)	167	D	0	2,100	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
793_F. Julia the snail	"You are given an undirected graph, consisting of n vertices and m edges. The graph does not necessa(...TRUNCATED)	{"input":["3\n1 2\n-1 1\n2 -1","10\n3 2\n3 2\n-1 1\n2 -1\n-3 -9\n-8 12\n7 7\n8 1\n8 2\n8 4"],"output(...TRUNCATED)	{"input":["3 4\n1 1\n1 2\n1 3\n","1 100\n99 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22(...TRUNCATED)	{"input":["1 1\n2\n2\n","1 1\n2\n1\n","10 10\n1 2 3 4 5 6 7 8 9 10\n6 7 8 9 10 1 0 3 4 5\n","10 10\n(...TRUNCATED)	5	10	{"language":[2,3,2,3,4,3,2,4,4,2,2,2,4,4,3,2,3,3,2,4,4,3,2,2,2,3,4,2,3,2,2,4,2,2,4,2,4,4,3,4,3,2,2,3(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,3,2,3,2,2,3,3,2,3,2,2,2,2,2,2,2,3,2,2,2,3,2,3,2,3,2,3,2,3,2,2,2,2,2,3,2,2(...TRUNCATED)	0	C	0	1,100	[ "dfs and similar", "dp", "dsu", "ternary search", "trees" ]	false		{ "nanos": 0, "seconds": 1 }	0