Datasets:

TheFactoryX
/

edition_1464_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
784_B. Kids' Riddle	"Professor just has checked all the N students tests. Everything was fine but then he realised that(...TRUNCATED)	{ "input": [ "5\n3\n1\n2\n3\n4\n5\n\nSAMPLE" ], "output": [ "2\n" ] }	{"input":["1\n2\n110 2\n115 112\n","10\n5\n88 60\n10 3\n48 21\n90 70\n40 88\n5\n20 81\n39 98\n34 87\(...TRUNCATED)	{"input":["5\n1 4 5 4 4\n","4\n3 2 3 2\n","3\n1 1 3\n","4\n1 1 3 1\n","6\n1 2 5 4 5 5\n","5\n1 2 3 4(...TRUNCATED)	2	10	{"language":[2,1,3,3,3,4,2,3,1,1,2,4,2,3,4,4,3,1,1,3,4,4,3,3,2,3,3,4,2,3,2,2,3,3,4,3,3,3,1,2,3,2,2,3(...TRUNCATED)	{"language":[2,2,4,3,4,2,4,4,4,4,4,2,1,4,2,4,2,2,2,4,2,2,2,4,1,4,2,4,4,1,4,2,2,2,1,2,2,2,3,4,4,3,3,2(...TRUNCATED)	1,208		3,000	0	[ "trees" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
494_A. Treasure	"We have N camels numbered 1,2,\\ldots,N. Snuke has decided to make them line up in a row.\n\nThe ha(...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":["1\n2\n999999997 999999998\n999999999 1000000000\n","4\n1\n1 1000000000\n5\n1 1\n12 18\n10(...TRUNCATED)	{"input":["3 4\n3 2 1\n","5 97\n1 10 76 97 2\n","2 16\n12 4\n","2 100\n132 1\n","5 76\n1 10 50 100 2(...TRUNCATED)	2	0	{"language":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"solution":["n=int(raw_input())\nin_array=[]\nfo(...TRUNCATED)	{"language":[3,2,2,2,2,1,2,2,2,4,1,2,3,4,2,2,3,1,2,2,2,2,2,3,2,1,4,3,2,4,3,1,2,4,3,2,4,3,2,3,2,2,4,2(...TRUNCATED)	0	D	70	2,400	[]	false		null	256,000,000
cost-of-data-11	"Integer factorisation is hard. The RSA Factoring Challenge offered $100 000 for factoring RSA-1024,(...TRUNCATED)	{"input":["5 5 13 0 4\n0 1 5\n2 1 2\n3 2 3\n1 4 0\n4 3 4\n","2 1 123456789 0 1\n0 1 0\n","2 1 999999(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	6	7	{"language":[2,3,2,4,3,4,3,4,4,3,3,2,2,4,3,4,4,4,2,4,2,2,4,3,3,3,3,2,3,1,4,3,3,2,4,2,4,2,4,2,3,3,3,2(...TRUNCATED)	{"language":[4,4,4,3,2,4,4,2,2,4,2,4,2,4,4,3,4,2,2,4,2,2,4,1,2,4,2,4,4,2,2,2,2,2,3,4,3,4,2,3,2,3,3,4(...TRUNCATED)	89	J	0	0	[ "implementation", "math" ]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
1408_A. Circle Coloring	"Roy is looking for Wobbly Numbers. \n\nAn N-length wobbly number is of the form \"ababababab...\" (...TRUNCATED)	{ "input": [ "5 0\n3 14 15 92 6\n", "3 1\n1 2 3\n" ], "output": [ "3 14 15 92 6 ", "1 3 6 " ] }	{"input":["89 1\n50 53 97 41 68 27 53 66 93 19 11 78 46 49 38 69 96 9 43 16 1 63 95 64 96 6 34 34 45(...TRUNCATED)	{"input":["10 2 6\n1 2\n1 4\n2 1 8\n2 9 2\n1 2\n1 9\n2 3 5\n1 8\n","10 5 2\n1 2\n1 3\n2 4\n2 5\n1 6\(...TRUNCATED)	2	6	{"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,4,2,2,2,2,2,1,2,2,4,2,2,2,2,1,2,2,4,2,4,1,2,2,2,4,2,2,2,2,2,2,2,2,1,2,2,2,2,3,2,2,2,2(...TRUNCATED)	1,244	B	0	1,400	[ "binary search", "dsu", "graphs", "shortest paths", "trees" ]	false	"Problem\n\nマイヅ大学にある大規模クラスタ†型スーパーコンピュータ（通(...TRUNCATED)	null	256,000,000
39_H. Multiplication Table	"One day n friends gathered together to play \"Mafia\". During each round of the game some player mu(...TRUNCATED)	{ "input": [ "3 2\n1 2\n2 3\n" ], "output": [ "YES\n1\n1 3\n" ] }	{"input":["qH\n2\n","nifzlTLaeWxTD\n0\n","WlwbRjvrOZakKXqecEdlrCnmvXQtLKBsy\n5\n","LiqWMLEULRhW\n1\n(...TRUNCATED)	{"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":[1,1,1,1,1,1,1,1],"solution":["a=[]\nt,k=input(),input()\nfor _ in xrange(t):\n\ta.appen(...TRUNCATED)	{ "language": [], "solution": [] }	70	C2	0	1,600	[]	false		{ "nanos": 0, "seconds": 1 }	1,073,741,824
1208_D. Restore Permutation	"You are given a tree with n vertices; its root is vertex 1. Also there is a token, initially placed(...TRUNCATED)	{"input":["5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\(...TRUNCATED)	{"input":["5 1\n3 2\n","3 3\n1 2\n1 2\n1 2\n","5 3\n2 4\n5 4\n3 2\n","20 5\n3 12\n5 20\n16 4\n13 3\n(...TRUNCATED)	{"input":["25\n91 57\n2 73\n54 57\n2 57\n23 57\n2 6\n57 54\n57 23\n91 54\n91 23\n57 23\n91 57\n54 2\(...TRUNCATED)	2	10	{"language":[2,3,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,3,2,4,2,4,2,3,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,1,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)	319	A	0	2,400	[ "brute force", "implementation" ]	true		{ "nanos": 0, "seconds": 2 }	256,000,000
571_B. Minimization	"Tavas is a cheerleader in the new sports competition named \"Pashmaks\".\n\n<image>\n\nThis competi(...TRUNCATED)	{ "input": [ "2 3\n", "1 1\n", "49 1808\n" ], "output": [ "6\n", "0\n", "359087121\n" ] }	{"input":["20\naaaaaaaaaaaaaaaaaaaa\n1\n11 a\n","4\ncbcc\n12\n4 b\n4 c\n1 b\n2 a\n3 b\n2 c\n4 a\n1 a(...TRUNCATED)	{"input":["SSTTTSST","STTTSS","SSSTTT","TTTSSS","TTTTSSSS","TSTSST","SSTTTS","TSSTST","STTSST","TSSS(...TRUNCATED)	2	10	{"language":[2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,3,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(...TRUNCATED)	{ "language": [], "solution": [] }	0	B	0	800	[ "binary search", "brute force", "dp", "greedy", "sortings" ]	false		{ "nanos": 0, "seconds": 5 }	0
1170_B. Bad Days	"In the rush of modern life, people often forget how beautiful the world is. The time to enjoy those(...TRUNCATED)	{"input":["1500 2000 1600 3 2","1500 2000 500 90000 100000","1500 2000 1900 3 2"],"output":["7900","(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1\n297754\n","16\n2 2 2 3 5 3 5 5 5 7 7 7 11 11 13 17\n","16\n2 2 2 2 2 3 3 5 5 5 5 7 7 1(...TRUNCATED)	3	10	{"language":[2,4,2,3,1,4,1,2,4,3,4,1,3,3,3,3,4,1,2,3,4,2,2,3,3,4,3,3,3,1,1,2,4,2,1,1,3,3,3,1,2,4,1,1(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,4,2,2,2,2,0,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,0(...TRUNCATED)	252	D	0	2,500	[]	false		{ "nanos": 0, "seconds": 2 }	0
1402_A. Fancy Fence	"You are given a string S consisting of letters `b`, `d`, `p` and `q`. Determine whether S is a mirr(...TRUNCATED)	{"input":["3\n6 11 24","3\n6 11 30","3\n6 11 12"],"output":["0.090909090909","0.166666666667","0.090(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["qqqqqqqqqq qqqqqqqq\n3\nqqqqqqqq qqqqqqqqq\nqqqqqqqqq qqqqq\nqqqqq p\n","wwwww w\n8\nwwww(...TRUNCATED)	2	0	{"language":[1,1,1],"solution":["t=input()\nfrom fractions import gcd\nfor x in range(t):\n\tn1=inpu(...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)	1,334		0	1,600	[]	false		{ "nanos": 500000000, "seconds": 2 }	134,217,728
p02298 Is-Convex	"You are given a complete undirected graph. For each pair of vertices you are given the length of th(...TRUNCATED)	{"input":["3 2\n1 3\n1 1\n0\n2\n","2 2\n1 2\n1 1\n1\n","5 6\n2 2 3\n2 4 5\n1 4\n1 5\n0\n1\n"],"outpu(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["5\n5 4 3 1 2\n","3\n3 2 1\n","3\n2 3 1\n","10\n5 1 6 2 8 4 3 10 9 7\n","3\n3 1 2\n","3\n2(...TRUNCATED)	1	8	{"language":[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,2,4,2,2,2,2,2,2,2,2,2,2,4(...TRUNCATED)	{"language":[0,0,0,0,2,0,2,0,2,2,2,1,2,4,2,2,1,4,2,2,0,2,0,4,2,0,0,0,2,0,2,0,3,0,0,2,2,0,2,3,0,2,4,2(...TRUNCATED)	1,075		0	2,300	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	134,217,728