Datasets:

TheFactoryX
/

edition_1495_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
488_C. Fight the Monster	"Two coordinates (a1, a2) and (b1, b2) on a two-dimensional grid of r × c are given. The cost of mo(...TRUNCATED)	{"input":["6 7\n2 3\n3 4\n4 2\n1 2\n1 5\n5 6\n6 1\n","3 3\n1 2\n2 3\n3 1\n","5 6\n1 2\n2 3\n2 4\n4 3(...TRUNCATED)	{"input":["21\n11 19 4 19 6 0 13 7 6 2 5 3 16 10 1 9 15 21 9 21 2\n","100\n57 85 27 81 41 27 73 10 7(...TRUNCATED)	{"input":["3 10 10\n1\n1 1 1\n1\n3 3 3\n1\n5 5 5\n0 1 1\n1 0 0\n0 1 0","1 10 3\n3\n1 10 1\n2 20 2\n3(...TRUNCATED)	3	11	{"language":[2,2,2,2,2,2,2,4,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,4,2,2(...TRUNCATED)	{"language":[2,1,4,4,2,2,3,2,4,2,2,2,4,2,2,4,4,2,4,2,2,2,2,3,2,2,2,2,2,2,2,4,3,4,2,1,2,2,4,2,2,4,4,2(...TRUNCATED)	29	D	750	1,600	[ "constructive algorithms", "greedy", "number theory" ]	true	{ "nanos": 0, "seconds": 2 }	0
p02744 Panasonic Programming Contest 2020 - String Equivalence	"Problem\n\nA large-scale cluster † type supercomputer (commonly known as \"SAKURA\") cluster at M(...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":["3 1 2\n2\n1 1\n","3 1 2\n1\n8 61\n","3 0 3\n\n334 500 1001\n","20 16 16\n1 2 3 4 5 6 8 9 (...TRUNCATED)	{"input":["1000 1001\n82 636 713 516\n","1000 1998\n316 681 19 233\n","4 8\n1 3 4 2\n","5 6\n4 3 2 1(...TRUNCATED)	2	7	{"language":[3,4,3,4,3,2,2,3,3,3,4,3,3,2,3,2,1,2,3,3,2,3,3,2,4,4,4,2,3,3,3,3,3,4,3,3,2,3,3,3,2,3,3,4(...TRUNCATED)	{"language":[4,4,2,1,2,3,2,4,3,4,3,3,4,2,3,3,3,3,2,4,3,3,3,4,4,2,3,2,3,4,2,2,2,4,2,3,2,3,4,3,2,3,3,3(...TRUNCATED)	1,424		0	0	[ "brute force", "math" ]	false	{ "nanos": 0, "seconds": 1 }	1,073,741,824
592_E. BCPC	Example Input 2 -3 4 L 2 5 ? 3 5 Output 2 L 4 L 3	{ "input": [ "6 0 6\n2 1 2\n2 3 4\n2 5 6\n2 3 2\n2 5 3\n1 1\n" ], "output": [ "4\n" ] }	{"input":["42 28\n7 19\n15 24\n3 42\n18 5\n32 27\n26 20\n40 30\n35 2\n14 8\n22 10\n36 4\n16 14\n21 2(...TRUNCATED)	{"input":["10 1\n1 0 1 1 1 1 1 1 1 1\n","3 87\n78 165 54\n","9 13\n132 166 200 62 168 51 185 192 118(...TRUNCATED)	2	0	{"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":[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	E	2,500	2,000	[]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
1513_C. Add One	"You are given a matrix consisting of n rows and m columns. The matrix contains lowercase letters of(...TRUNCATED)	{ "input": [ "2\n17 25\n4\n17 45\n4\n17 25\n7\n19 35\n0" ], "output": [ "250\n1300" ] }	{ "input": [], "output": [] }	{"input":["20\n............./.\n","97\n.**..**..*....*..**..............(...TRUNCATED)	2	10	{"language":[2,4,4,4,2,2,2,4,3,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,4,2,2,2,2,2,2,2,3,2,2,2,2,2,2,3,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)	958	E	0	0	[ "dfs and similar", "graphs", "hashing", "shortest paths" ]	false	{ "nanos": 0, "seconds": 1 }	512,000,000
1408_A. Circle Coloring	"Two little greedy bears have found two pieces of cheese in the forest of weight a and b grams, corr(...TRUNCATED)	{"input":["2\n1 1\n100 100\n","5\n10 30 5 6 24\n10 41 7 8 24\n","4\n3 3 4 3\n4 7 6 5\n"],"output":["(...TRUNCATED)	{"input":["1 10\n8\n1\n2\n3\n4\n5\n6\n7\n8\n9\n16\n","1 10\n4\n1\n2\n3\n4\n5\n6\n7\n8\n9\n16\n","1 1(...TRUNCATED)	{"input":["2\n1 20\n","10\n450661 128600 993228 725823 293549 33490 843121 528432 556169 448234\n","(...TRUNCATED)	2	2	{"language":[3,2,3,3,3,2,2,2,3,4,4,3,3,3,3,4,3,3,3,4,2,3,2,3,3,3,3,4,3,3,4,3,4,3,3,3,3,3,3,3,2,3,3,3(...TRUNCATED)	{"language":[1,2,2,4,2,2,2,1,2,2,2,2,2,2,2,2,2,2,4,2,4,1,3,2,4,4,4,2,2,2,2,4,2,4,2,2,2,2,3,2,4,4,1,2(...TRUNCATED)	0		1,000	1,400	[ "binary search", "math" ]	false	{ "nanos": 500000000, "seconds": 0 }	268,435,456
p01931 Check answers	"There are n cities in Berland and some pairs of them are connected by two-way roads. It is guarante(...TRUNCATED)	{"input":["5 9\n10345\n23456\n34567\n45678\n56789\n","2 10\n12\n43\n","3 12\n1423\n6624\n6625\n"],"o(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["11\nadd 1\nsum\nadd 2\nsum\nadd 3\nsum\nadd 4\nsum\nadd 6\nsum\nadd 6\n","6\nadd 4\nadd 7(...TRUNCATED)	2	15	{"language":[2,2,2,2,2,2,2,2,2,3,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,2,2,2,2,2,2,4,2(...TRUNCATED)	{"language":[4,2,2,4,4,4,4,2,3,2,4,1,4,4,2,4,4,2,4,3,2,2,3,3,2,2,1,4,2,3,4,3,2,2,1,2,2,2,4,2,2,4,2,2(...TRUNCATED)	161		0	0	[ "" ]	false	{ "nanos": 0, "seconds": 5 }	512,000,000
19_B. Checkout Assistant	"You may know that Euclid was a mathematician. Well, as it turns out, Morpheus knew it too. So when (...TRUNCATED)	{"input":["1\nindex.dml\n<dml><title>Markup language has Declined</title><br>Programmers world</dml>(...TRUNCATED)	{ "input": [ "60 0 58", "7 3 7" ], "output": [ "630738177", "195634923" ] }	{"input":["5 7\n2 2\n2 3\n3 4\n1 5\n2 5\n3 5\n4 5\n","4 0\n","6 9\n1 2\n1 4\n1 5\n2 6\n2 5\n2 6\n3 5(...TRUNCATED)	2	10	{"language":[3,2,2,4,2,2,2,4,3,3,4,4,4,4,2,2,4,2,1,2,2,3,3,4,1,4,4,4,3,3,3,4,3,3,2,2,2,2,2,2,3,4,2,2(...TRUNCATED)	{"language":[2,2,2,4,2,2,2,2,2,2,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,2,2,2,2,2(...TRUNCATED)	284		0	2,600	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
720_C. Homework	"In some country live wizards. They love playing with numbers. \n\nThe blackboard has two numbers wr(...TRUNCATED)	{"input":["2\n3 3 2\n8 3 2\n3 0\n3 7\n8 0\n8 7","2\n3 3 2\n8 3 2\n0 3\n3 7\n8 0\n8 7","1\n10 10 10\n(...TRUNCATED)	{"input":["777 2\n","2 2\n","99900 1\n","50000 1\n","2 5\n","100000 99\n","22222 22\n","100000 4\n",(...TRUNCATED)	{"input":["3\n1\n2 3\n2\n4 5\n5 6\n2\n2 3\n1 5","3\n1\n2 3\n2\n4 5\n5 6\n1\n2 3\n3 5","3\n1\n1 3\n2\(...TRUNCATED)	3	0	{"language":[2,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,4,4,4,3,2,2,3,2,4,4,2,3,4,4,2,4,4,2,2,2,2,2,4,2,2,4,4,4,2,4,2,2,4,4,2,2,2,2,2(...TRUNCATED)	44	A	250	2,100	[ "" ]	false	{ "nanos": 0, "seconds": 4 }	256,000,000
209_B. Pixels	"At the big break Nastya came to the school dining room. There are n pupils in the school, numbered (...TRUNCATED)	{"input":["6 7\n1 2\n2 3\n3 4\n4 6\n6 5\n4 4\n3 6\n4 2 2\n1 10 2 5\n3 8 2 7\n5 1 0 2\n6 5 4 1\n3 7 6(...TRUNCATED)	{"input":["10 9\n7 9\n8 9\n8 2\n10 6\n8 3\n9 4\n2 6\n8 5\n9 1\n","2 1\n1 2\n","20 20\n1 9\n11 9\n3 5(...TRUNCATED)	{"input":["3\n2\n1 5 10\n2 15 5\n3\n2 93 78\n1 71 59\n3 57 96\n19\n19 23 16\n5 90 13\n12 85 70\n19 6(...TRUNCATED)	2	6	{"language":[4,1,4,3,1,4,4,2,2,4,2,2,2,2,4,1,2,1,4,4,2,4,4,4,4,4,4,2,4,2,2,2,4,2,4,2,4,2,4,2,2,4,2,4(...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)	621		1,500	0	[ "greedy", "implementation", "sortings" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
p01538 Kakezan	"Sereja has painted n distinct points on the plane. The coordinates of each point are integers. Now (...TRUNCATED)	{"input":["4\n..E.\n.AD.\nB...\n..C.\nD\n4\n..E.\n.AD.\nB...\n..C.\nDR\n3\n...\n.A.\nBC.\n((URD)3L)2(...TRUNCATED)	{"input":["1 100000 100000 100000 -100000\n","46456 -2621 -23623 -98302 -99305\n","9 20 0 40 0\n","1(...TRUNCATED)	{"input":["5\n90 94\n26 25\n64 84\n18 6\n20 96\n","5\n1912 1\n5 6\n999 1\n88 2\n11 100\n","5\n90 94\(...TRUNCATED)	6	10	{"language":[4,2,2,2,2,4,2,4,2,2,2,2,4,4,4,2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,4,4,4,4,2,2,2,2,2,4,2,2(...TRUNCATED)	{"language":[2,2,4,2,4,2,2,4,4,4,4,2,2,2,2,2,2,2,2,2,2,4,4,1,2,2,2,3,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)	147	A	1,000	2,500	[ "brute force", "geometry", "math" ]	false	{ "nanos": 0, "seconds": 3 }	0