Datasets:

TheFactoryX
/

edition_2005_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
p02943 AtCoder Grand Contest 037 - Reversing and Concatenating	"Let us consider sets of positive integers less than or equal to n. Note that all elements of a set (...TRUNCATED)	{"input":["8 4\n7 1 1\n2 1 1\n4 0 1\n8 1 1\n1 0 1\n1 1 1\n1 0 1\n3 0 0\n","5 2\n6 0 0\n9 0 0\n1 0 1\(...TRUNCATED)	{"input":["10\n5 7 0\n2 10 1\n1 5 0\n6 8 0\n4 9 1\n2 5 1\n10 8 0\n2 3 1\n4 2 1\n10\n9\n9\n9\n5\n2\n5(...TRUNCATED)	{"input":["10 4\n0 1 4 2 3 0 10 0 5 8\n","6 3\n0 0 1 0 4 5\n","6 1\n0 0 4 0 6 0\n","4 1\n0 1 0 0\n",(...TRUNCATED)	2	10	{"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,2,2,2,4,2,2,2,2,2,2,0,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(...TRUNCATED)	938		0	0	[ "data structures", "implementation" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
662_C. Binary Table	"You've got an array a, consisting of n integers. The array elements are indexed from 1 to n. Let's (...TRUNCATED)	{ "input": [ "4 4\n1 2\n2 3\n3 4\n4 1\n", "3 0\n" ], "output": [ "\n0 1 0 1 \n", "\n0 0 0 \n" ] }	{ "input": [], "output": [] }	{"input":["8 9\n6 -1 5 -5 -1 -7 -8 -7\n","10 7\n-9 3 -4 -22 4 -17 1 -14 3 -2\n","5 10\n-8 -24 0 -5 1(...TRUNCATED)	3	12	{"language":[2,2,4,2,4,2,3,4,2,4,2,4,2,4,2,2,4,2,2,2,2,4,2,2,2,4,2,4,2,4,4,2,2,4,1,2,2,2,2,2,2,2,2,3(...TRUNCATED)	{"language":[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,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	415	D	0	0	[]	false	{ "nanos": 0, "seconds": 3 }	256,000,000
1165_A. Remainder	"Problem description.\n The problem statement is simple , you are given an array and you have to p(...TRUNCATED)	{"input":["3 3\n1 2\n2 3\n3 3","7 9\n1 7\n5 9\n5 7\n5 9\n1 1\n6 8\n3 4"],"output":["3\n2\n2","7\n6\n(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["4\n47\n47\n477\n4747477","4\n7\n47\n477\n4747477","4\n4\n47\n477\n4747477","4\n7\n7\n477\(...TRUNCATED)	2	9	{"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],"solution":["t = int(raw_input())\nf(...TRUNCATED)	{ "language": [], "solution": [] }	512	B	0	2,800	[ "implementation", "math" ]	false	{ "nanos": 0, "seconds": 8 }	256,000,000
p00127 Pocket Pager Input	"Every day Kotlin heroes analyze the statistics of their website. For n days, they wrote out n numbe(...TRUNCATED)	{ "input": [ "3\n3 2 2\n", "4\n2 2 2 2\n" ], "output": [ "4\n", "3\n" ] }	{"input":["? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ?(...TRUNCATED)	{"input":["3 5 999999997\n","1011 1 1000000000\n","1 30 33\n","29 3 1000000000\n","3 2 31\n","2 2 85(...TRUNCATED)	2	6	{"language":[2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,4,4,4,2,2,4,2,4,2],"solut(...TRUNCATED)	{ "language": [], "solution": [] }	1,100	A	0	900	[ "constructive algorithms", "expression parsing", "greedy", "math" ]	false	null	256,000,000
578_C. Weakness and Poorness	"Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex (...TRUNCATED)	{"input":["4 4\n1 2\n3 2\n3 4\n1 3","15 28\n10 7\n5 9\n2 13\n2 14\n6 1\n5 12\n2 10\n3 9\n10 15\n11 1(...TRUNCATED)	{"input":["5\n3\n1 1\n1 1\n1 1\n3\n1 1\n1 1\n1 1\n3\n1 1\n1 1\n1 1\n3\n1 1\n1 1\n1 1\n3\n1 100\n1 1\(...TRUNCATED)	{"input":["3 1\n2 100 1","12 5\n43 94 27 3 69 99 56 25 15 15 46 8","3 1000\n1 101 1","6 24\n25 171 7(...TRUNCATED)	6	17	{"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":[3,4,3,3,2,3,2,4,2,3,2,2,4,3,2,2,4,3,4,4,4,3,2,2,4,3,1,2,3,2,4,4,4,3,4,3,3,2,4,2,4,3,3,4(...TRUNCATED)	0	C	0	0	[ "combinatorics", "dp", "math" ]	false	{ "nanos": 0, "seconds": 2 }	512,000,000
p02211 Apple Adventure	"You are given a permutation p_1, p_2, …, p_n.\n\nIn one move you can swap two adjacent values.\n\(...TRUNCATED)	{"input":["4 5 3\n1 2 3\n1 2 5\n4 2 1\n2 3 2\n1 4 4\n1 3 3\n","2 3 2\n2 1\n1 2 3\n1 2 2\n2 2 1\n"],"(...TRUNCATED)	{"input":["3 14\n8 9\n10 7\n","12 11\n11 12\n16 7\n","12 17\n10 19\n13 16\n","9 12\n3 17\n10 10\n","(...TRUNCATED)	{"input":["50 5000\n2 35 46\n2 43 92\n2 16 88\n2 67 99\n2 36 93\n2 12 20\n2 33 96\n2 55 82\n2 18 32\(...TRUNCATED)	2	0	{"language":[2,2,2,2,4,4,2,2,2,2,3,2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,1,2,2,2,2,2,2,2,2,2,2,4(...TRUNCATED)	{"language":[4,2,3,3,4,4,2,3,3,2,2,4,4,3,3,2,3,4,2,4,2,3,3,1,2,2,2,3,3,4,2,4,3,4,2,2,2,4,2,4,1,3,4,4(...TRUNCATED)	366	A	750	2,100	[ "data structures", "string suffix structures" ]	false	{ "nanos": 500000000, "seconds": 1 }	0
1149_B. Three Religions	"PowerShell had N natural numbers. He wanted to test Xenny's speed in finding the sum and difference(...TRUNCATED)	{ "input": [ "1\n\n7\n\n1\n\n1\n\n0\n\n0\n\n1\n" ], "output": [ "? 3\n? 6\n? 5\n? 7\n= 3\n" ] }	{"input":["3\n1000000000 1000000000 10000000\n","3\n1 2 1\n","3\n4 10 11\n","5\n1000000000 5 5 4 4\n(...TRUNCATED)	{"input":["5\n0 968804136\n0 736567537\n2 343136264\n0 259899572\n1 103950505\n","5\n0 51690939\n0 6(...TRUNCATED)	6	7	{"language":[1,1,1,1,1,1,1,1,1,1,1],"solution":["def gcd(x,y):\n if y==0: return x\n else: ret(...TRUNCATED)	{"language":[4,3,4,1,2,4,3,2,2,4,4,4,1,4,4,3,4,3,4,1,2,2,4,4,2,3,4,2,4,2,4,2,2,4,2,4,3,2,2,4,4,2,4,2(...TRUNCATED)	925	A	0	1,400	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	536,870,912
p00950 Infallibly Crack Perplexing Cryptarithm	"Ringo Mart, a convenience store, sells apple juice.\n\nOn the opening day of Ringo Mart, there were(...TRUNCATED)	{"input":["3 4 3 10\n3\n3 1 4\n4 5 9\n3 10 10\n","1 1 2 10\n2\n1 1 3\n2 6 10\n","5 7 6 11\n3\n5 3 8\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["10\n1 3\n3 9\n27 81\n2187 6561\n9 27\n12641 19683\n81 243\n729 2187\n59049 177147\n531441(...TRUNCATED)	2	10	{"language":[3,4,4,4,1,3,4,3,2,4,3,3,3,4,3,2,3,3,4,3,4,4,4,2,3,2,4,3,3,4,4,3,3,3,2,2,3,4,2,4,2,3,2,3(...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)	519		0	1,500	[ "dsu", "graphs", "trees" ]	false	{ "nanos": 0, "seconds": 8 }	256,000,000
235_A. LCM Challenge	"You are given an integer n. In one move, you can either multiply n by two or divide n by 6 (if it i(...TRUNCATED)	{"input":["5 3\n00011\n3\n1 2 3\n1\n4\n3\n3 4 5\n","8 6\n00110011\n3\n1 3 8\n5\n1 2 5 6 7\n2\n6 8\n2(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["100\n5\n48 141 231 554 425\n7\n0 19\n50 98\n143 30\n231 55\n342 0\n365 100\n600 10","180\(...TRUNCATED)	6	9	{"language":[2,4,2,4,1,2,2,2,2,2,3,3,2,2,3,2,4,3,2,4,2,4,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0		1,250	0	[ "brute force", "dp", "strings", "two pointers" ]	false	null	256,000,000
p01484 Icy Composer	"To improve the boomerang throwing skills of the animals, Zookeeper has set up an n × n grid with s(...TRUNCATED)	{ "input": [ "7\nabacaba\n", "6\naabcfg\n" ], "output": [ "YES\n2 3\n", "NO\n" ] }	{ "input": [], "output": [] }	{"input":["20\n9 4 8\n10 6 7\n4 6 0\n7 7 6\n3 6 10\n4 2 1\n4 4 0\n2 0 0\n8 8 7\n3 1 7\n3 10 7\n1 7 3(...TRUNCATED)	2	0	{"language":[2,2,2,4,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,4,2,2,4,2,2,2,2,2,2,2,2,4,4(...TRUNCATED)	{"language":[2,2,4,2,2,2,2,3,3,2,3,3,4,2,2,3,2,3,2,2,2,2,2,2,2,3,2,4,2,4,1,2,4,3,2,4,4,2,2,3,4,2,2,2(...TRUNCATED)	1,428	D	0	1,100	[ "greedy", "implementation" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000