Datasets:

TheFactoryX
/

edition_0526_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
p00638 Old Bridges	"You are given a permutation p_1, p_2, …, p_n.\n\nIn one move you can swap two adjacent values.\n\(...TRUNCATED)	{ "input": [ "3\n25\n46\n99" ], "output": [ "2\n1\n2\n" ] }	{ "input": [], "output": [] }	{"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)	2	8	{"language":[4,3,1,3,2,2,4,2,4,2,4,2,3,2,3,2,2,3,3,2,3,3,2,3,4,2,2,4,3,2,4,2,3,2,3,2,2,4,4,3,2,3,2,3(...TRUNCATED)	{"language":[2,0,3,3,2,2,3,2,3,2,3,2,3,3,2,3,2,0,2,4,2,3,2,3,3,0,2,2,2,2,2,2,0,0,2,3,0,2,2,2,2,3,2,2(...TRUNCATED)	378	A	1,000	1,400	[ "*special", "data structures", "dsu", "implementation", "math", "sortings" ]	false	{ "nanos": 0, "seconds": 8 }	256,000,000
1391_C. Cyclic Permutations	"The nation of Panel holds an annual show called The Number Games, where each district in the nation(...TRUNCATED)	{ "input": [ "3\n3 4 5\n1 0 5\n5 3 2\n" ], "output": [ "9\n0\n6\n" ] }	{"input":["10 16\n9 8\n1 2\n9 5\n5 4\n9 2\n3 2\n1 6\n5 10\n7 2\n8 2\n3 7\n4 9\n5 7\n10 3\n10 9\n7 8\(...TRUNCATED)	{"input":["4 3\n1 3 2 7","4 4\n1 3 2 4","4 4\n1 0 2 4","4 3\n1 3 2 8","2 4\n1 3 2 4","4 4\n1 -1 2 4"(...TRUNCATED)	3	9	{"language":[3,4,4,4,3,3,3,3,2,3,3,3,4,3,2,2,3,4,3,3,4,3,3,2,4,3,3,4,2,3,3,2,3,3,3,3,3,3,4,3,3,3,3,2(...TRUNCATED)	{ "language": [], "solution": [] }	5		0	1,800	[ "dp", "implementation" ]	false	{ "nanos": 0, "seconds": 3 }	1,073,741,824
1046_D. Interstellar battle	"We know that lucky digits are digits 4 and 7, however Vasya's got another favorite digit 0 and he a(...TRUNCATED)	{ "input": [ "??00????0??0????0?0??00??1???11?1?1???1?11?111???1", "0??0", "0??" ], "output": [ "4", "2", "1" ] }	{"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": [] }	5	7	{"language":[2,2,4,2,2,2,3,3,4,3,2,3,3,3,2,2,3,4,2,2,3,4,3,3,2,3,2,3,2,3,4,3,3,2,3,3,2,4,2,2,2,4,3,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,170	F	750	1,400	[ "" ]	false	null	256,000,000
1250_B. The Feast and the Bus	"You are given an infinite checkered field. You should get from a square (x1; y1) to a square (x2; y(...TRUNCATED)	{ "input": [ "3 4\n0110\n1010\n0111\n" ], "output": [ "2\n" ] }	{ "input": [], "output": [] }	{"input":["728961319347 41296937719710726 52437 42819\n","567018385179 15765533940665693 70514 13819(...TRUNCATED)	1	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],"solution":["a,b=raw_input().spl(...TRUNCATED)	{"language":[2,0,2,2,2,2,0,2,4,2,2,2,0,0,2,2,2,2,2,2,2,0,2,2,2,2,2,2,0,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	E	2,000	0	[ "implementation" ]	false	null	0
188_D. Asterisks	"You and your friend are participating in a TV show \"Run For Your Prize\".\n\nAt the start of the s(...TRUNCATED)	{ "input": [ "16\n.*......\n", "11\n.......\n" ], "output": [ "yes", "no" ] }	{ "input": [ "2\nacxz\nbcxz" ], "output": [ "Funny\nNot Funny\n" ] }	{"input":["bcccccccccccaaacaaaaccccccbaaaaaabbbccbbbbbbaaaaaaaaaccccccccaaaaaaaaaaaaaaccccccaaaaaaaa(...TRUNCATED)	2	7	{"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,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,239	E	500	0	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
p00991 Grid	"Roy is looking for Wobbly Numbers. \n\nAn N-length wobbly number is of the form \"ababababab...\" (...TRUNCATED)	{ "input": [ "4\n62 96 82 55\n\nSAMPLE" ], "output": [ "3 1 2 4\n" ] }	{ "input": [], "output": [] }	{"input":["3\nbba\nabb\nabc\n\nSAMPLE","3\nbba\nabb\nabb\n\nSAMPLF","3\nbba\nbba\nabc\n\nSAMPLE","3\(...TRUNCATED)	2	0	{"language":[2,2,2,2,2,2,2,2,2,3,3,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,4,2,2,2,2,2,4,2,3(...TRUNCATED)	{"language":[2,2,2,2,4,2,4,2,4,2,2,2,4,2,2,2,3,2,2,2,2,2,0,2,2,2,4,2,2,4,2,0,2,2,2,2,1,0,2,2,1,2,2,2(...TRUNCATED)	730		500	2,500	[ "brute force", "math", "number theory" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
once-upon-a-time-in-time-land	"Hasan loves playing games and has recently discovered a game called TopScore. In this soccer-like g(...TRUNCATED)	{ "input": [ "1\n1" ], "output": [ "4" ] }	{ "input": [ "5\n90 94\n26 25\n64 84\n14 6\n20 96\n" ], "output": [ "1842\n12\n1015\n3\n1908\n" ] }	{"input":["4\naaa\nabc\nabdbca\nabca","4\naaa\nabc\nabdbc`\naaca","4\naab\nacc\n`bd`cb\naaad","4\nba(...TRUNCATED)	2	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": [], "solution": [] }	153	C2	0	0	[ "data structures", "greedy", "two pointers" ]	true	{ "nanos": 0, "seconds": 6 }	536,870,912
p02741 Panasonic Programming Contest 2020 - Kth Term	"D: The Diversity of Prime Factorization\n\nProblem\n\nEbi-chan has the FACTORIZATION MACHINE, which(...TRUNCATED)	{ "input": [ "3 1 8 10\n10 8\n5 7\n11 9\n3\n", "2 2 10 18\n10 4\n20 6\n5 3\n" ], "output": [ "10\n", "20\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":["1\n5 3\n200 12 9","1\n9 3\n200 12 9","1\n7 3\n200 12 9","1\n7 3\n141 12 9","1\n9 0\n141 1(...TRUNCATED)	2	10	{"language":[4,3,2,2,2,2,2,4,2,2,2,2,2,4,4,2,4,2,2,2,2,2,2,2,2,1,4,4,4,2,4,2,3,4,2,2,4,4,4,2,3,4,4,2(...TRUNCATED)	{"language":[4,3,1,4,1,4,3,2,2,2,4,3,3,2,4,3,2,2,2,2,4,4,2,2,2,4,2,3,4,4,2,3,3,2,3,4,3,3,2,4,2,2,3,4(...TRUNCATED)	0	C1	0	0	[ "" ]	false	{ "nanos": 0, "seconds": 8 }	0
p03010 diverta 2019 Programming Contest 2 - Diverta City	"Problem:\n\nRani and Nandu decide to play a number game. Both play alternately, Rani playing the fi(...TRUNCATED)	{"input":["3 5 4\nabacc\nccbba\nccabc\nabacc\nacbbc\nababa\nacbbc\n","6 4 4\ndaac\nbcba\nacad\ncbdc\(...TRUNCATED)	{"input":["228\n1 3 1 7 1 3 1 15 1 3 1 7 1 3 1 31 1 3 1 7 1 3 1 15 1 3 1 7 1 3 1 63 1 3 1 7 1 3 1 15(...TRUNCATED)	{"input":["1 1\n4 10 0 0 9 0 10 10 0 10\n-5 -20 30 15\n135 45\n0 -15 15 0\n0 0","1 1\n4 10 0 0 9 0 1(...TRUNCATED)	2	0	{"language":[2,2,2,2,2,2,2,2,2,4,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,4,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[3,4,3,4,4,2,2,2,4,3,2,3,1,4,2,4,4,2,3,2,3,2,3,2,2,3,2,2,2,4,4,2,2,3,4,2,1,3,4,3,3,3,4,1(...TRUNCATED)	0	F	500	1,900	[]	false	{ "nanos": 0, "seconds": 3 }	134,217,728
415_E. Mashmokh and Reverse Operation	"This problem differs from the previous one only in the absence of the constraint on the equal lengt(...TRUNCATED)	{"input":["4\nsword weapon 10 2 3 2\npagstarmor armor 0 15 3 1\niceorb orb 3 2 13 2\nlongbow weapon (...TRUNCATED)	{"input":["bbcbccbabcbabcbaaccccaaabcbcaacacbabbbbcabcbbbbacbcaccccbcccbccaaabcabacccbaccccbbababccb(...TRUNCATED)	{"input":["2\n1 0\n50 50\n50","4\n2 3 4 1\n13 5 1 24\n45 9 15","4\n2 3 4 1\n13 5 1 24\n45 9 16","4\n(...TRUNCATED)	2	9	{"language":[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,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2(...TRUNCATED)	{"language":[2,3,4,2,4,2,2,3,1,2,3,2,4,2,3,3,4,2,2,4,4,2,2,4,3,2,2,4,4,4,3,4,4,2,2,4,4,3,2,3,2,4,2,1(...TRUNCATED)	40	C	1,000	3,200	[ "brute force", "implementation" ]	false	{ "nanos": 0, "seconds": 1 }	0