Datasets:

TheFactoryX
/

edition_0494_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
1301_B. Motarack's Birthday	"In PrimeLand, there existed a very handsome young prince named Prima. He greatly desired the Prince(...TRUNCATED)	{"input":["3\n4 2\nabca\n1 3\n10 5\ncodeforces\n2 8 3 2 9\n26 10\nqwertyuioplkjhgfdsazxcvbnm\n20 10 (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["81\n9 4\n6 8\n6 4\n4 6\n4 8\n9 10\n0 2\n5 4\n8 9\n7 7\n10 5\n4 4\n7 8\n3 7\n2 1\n5 5\n2 7(...TRUNCATED)	2	9	{"language":[3,3,3,3,3,3,3,1,1,3,3,4,3,3,3,2,1,2,3,3,3,2,3,3,3,3,4,3,2,3,3,3,3,3,3,4,3,3,3,2,3,3,3,3(...TRUNCATED)	{ "language": [], "solution": [] }	1,281	D	0	1,600	[ "constructive algorithms", "greedy", "implementation" ]	false	{ "nanos": 0, "seconds": 1 }	0
p01086 Short Phrase	"Malek has recently found a treasure map. While he was looking for a treasure he found a locked door(...TRUNCATED)	{"input":["3 2\n0 0 0\n1 1 1\n","4 3\n0 0 2 1\n2 0 1 1\n","5 10\n0 0 0 1 2\n2 1 0 0 0\n"],"output":[(...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": [], "output": [] }	5	1	{"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,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)	1,158	F	30	1,100	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
19_B. Checkout Assistant	"Draco Malfoy and Hermione Granger have gotten into a \"battle of brains\". Draco was foolish enough(...TRUNCATED)	{ "input": [ "3 2\n1 2\n2 3\n" ], "output": [ "YES\n1\n1 3\n" ] }	{"input":["3 3 1\n","300 2 300\n","4000 4000 1\n","4000 4000 100\n","4 2 3\n","3 300 300\n","4000 10(...TRUNCATED)	{"input":["1\n656 281\n","1\n666 760\n","2\n10 4\n1 5\n","1\n33993 6\n","1\n1656 9\n","1\n1425 1777\(...TRUNCATED)	6	7	{"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,4,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2(...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	A	0	1,100	[ "binary search", "brute force", "implementation" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1065_F. Up and Down the Tree	"Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles.\n(...TRUNCATED)	{"input":["7 13 5\n2 3 10 7\n3 5 10 10\n1 2 10 6\n4 5 10 9\n3 4 10 8\n","4 100 3\n3 3 2 5\n1 1 3 2\n(...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":["2\n1 1 1 1 1 0 0 0 0 0\n0 0 0 0 0 1 1 1 1 1\n0 -2 -2 -2 -2 -2 -1 -1 -1 -1 -1\n0 -2 -2 -2 (...TRUNCATED)	2	8	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\n\nusing names(...TRUNCATED)	{"language":[2,4,4,3,4,2,3,4,1,2,4,2,4,4,4,4,2,3,4,3,3,2,3,4,3,3,3,2,4,2,2,4,4,2,4,4,2,3,2,2,4,2,2,3(...TRUNCATED)	1,257	C	0	0	[ "*special", "implementation" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
985_A. Chess Placing	"Print the K-th element of the following sequence of length 32:\n\n\n1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1(...TRUNCATED)	{ "input": [ "16\n.*......\n", "11\n.......\n" ], "output": [ "yes", "no" ] }	{"input":["99\n1\n3\n2\n2\n3\n1\n1\n3\n3\n3\n3\n3\n3\n1\n1\n3\n3\n3\n3\n1\n1\n3\n2\n1\n1\n1\n1\n1\n1(...TRUNCATED)	{"input":["5\n1 2 0\n1 3 0\n3 5 0\n3 4 0\n3\n3\n4\n1\n3\n4\n","20\n9 11 0\n1 5 0\n1 14 0\n5 17 0\n14(...TRUNCATED)	2	8	{"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":[2,2,2,2,0,2,0,2,2,2,2,2,0,2,0,1,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,0,2,2(...TRUNCATED)	195		500	1,700	[ "data structures", "math" ]	true	null	256,000,000
1110_E. Magic Stones	"Easy and hard versions are actually different problems, so read statements of both problems complet(...TRUNCATED)	{ "input": [ "4\n62 96 82 55\n\nSAMPLE" ], "output": [ "3 1 2 4\n" ] }	{"input":["5 3\n","1500 2000\n","500 1000\n","1000 1000\n","5 5\n","2000 2\n","1000 500\n","3 1000\n(...TRUNCATED)	{ "input": [], "output": [] }	2	7	{"language":[2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,1,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,1,2,2,2,2,2,2(...TRUNCATED)	1,081	E	0	2,300	[ "data structures" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1397_C. Multiples of Length	"Problem description.\n The problem statement is simple , you are given an array and you have to p(...TRUNCATED)	{ "input": [ "4\n1 3 2 4\n" ], "output": [ "1 1\n-1\n2 4\n9 6 12 \n1 4\n0 -12 -8 -16 \n" ] }	{ "input": [], "output": [] }	{"input":["10 9 5\n0 0 0 0 0 0 0 -1 0 4\n10 3\n10 7\n10 5\n10 8\n10 9\n10 1\n10 4\n10 6\n10 2\n","10(...TRUNCATED)	2	7	{"language":[3,2,3,2,4,2,4,4,2,4,4,4,4,3,4,4,4,4,1,4,2,2,2,4,2,3,1,4,3,4,2,4,3,2,2,3,2,4,4,4],"solut(...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)	0		2,000	0	[ "constructive algorithms", "graphs" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1180_E. Serge and Dining Room	"The Berland capital (as you very well know) contains n junctions, some pairs of which are connected(...TRUNCATED)	{ "input": [ "3", "100", "1000000" ], "output": [ "3", "473", "13969985" ] }	{"input":["2 2 5\n","9 9 1000000000\n","3 17 999999997\n","3 3 64\n","5 1 64\n","29 2 1000000000\n",(...TRUNCATED)	{"input":["4 4 3\n1 2 3\n1 2 1\n2 3 3\n1 3 3\n1 4 4\n","5 4 2\n4 5\n1 2 100\n1 3 100\n3 4 10\n3 5 20(...TRUNCATED)	3	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,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,0,2,2,2,0,3,2,2,3,2,4,0,2,2,2,2,0,2,2,2,2,4,2,2,2,2,2,0,2,2,2,2,2,2,3,2,2(...TRUNCATED)	0		0	0	[ "" ]	false	null	512,000,000
p03819 AtCoder Regular Contest 068 - Snuke Line	"Roy is looking for Wobbly Numbers. \n\nAn N-length wobbly number is of the form \"ababababab...\" (...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": [], "output": [] }	{"input":["4 4","1 15","2 4","2 15","3 0","2 26","3 -1","2 32","0 -1","1 32","0 -2","1 17","-1 -2","(...TRUNCATED)	2	7	{"language":[1,1],"solution":["def isvalid(s, c):\n if c.difference(s):\n return False\n (...TRUNCATED)	{ "language": [], "solution": [] }	582	D	1,750	800	[ "greedy", "strings" ]	false	{ "nanos": 0, "seconds": 1 }	268,435,456
p00320 Cuboid	"The russian intelligence agency KGB make an encryption technique to send their passwords. Originall(...TRUNCATED)	{"input":["5\n\n3 2 2\n2 0\n0 5\n\n4 3 2\n2 0 5\n0 6\n\n0 2 2\n1 0\n2 3\n\n5 4 4\n6 0 8 0\n0 7 0 9\n(...TRUNCATED)	{"input":["+adabacaba\n-adabacaba\n+aca\naca:caba\n-aca\n+bacaba\n-bacaba\n+aba\n-aba\n+bad\n","+cab(...TRUNCATED)	{"input":["5\nFFFAF\n","5\nIIAAF\n","5\nAAFFA\n","6\nAAAFFA\n","2\nAF\n","8\nIFFFIAAI\n","3\nFFA\n",(...TRUNCATED)	3	11	{"language":[4,2,1,3,3,3,2,3,3,3,3,3,2,4,4,3,3,4,4,2,4,3,1,4,2,3,3,3,3,4,4,2,3,4,2,3,2,1,3,2,3,4,4,2(...TRUNCATED)	{"language":[4,2,4,2,2,2,2,2,2,1,4,2,2,2,2,1,4,2,2,3,2,2,2,2,2,2,4,2,2,2,1,2,1,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED)	1,525	F	0	0	[ "data structures", "greedy", "two pointers" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000