Datasets:

TheFactoryX
/

edition_1654_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
754_E. Dasha and cyclic table	A chessboard n × m in size is given. During the zero minute we repaint all the black squares to the 0 color. During the i-th minute we repaint to the i color the initially black squares that have exactly four corner-adjacent squares painted i - 1 (all such squares are repainted simultaneously). This process continues a...	{ "input": [ "2 1\n1 2\n", "3 3\n1 2\n1 3\n2 3\n" ], "output": [ "1\n1 \n1 2 0\n", "0\n\n1 2 0\n1 3 2\n2 3 1\n" ] }	{ "input": [], "output": [] }	{ "input": [ "5\n5\n3\n2\n1\n7\n6\n1\n2\n3\n4\n5\n6\n3\n3\n2\n1\n0", "5\n5\n3\n2\n1\n7\n6\n1\n2\n3\n4\n0\n6\n3\n3\n2\n1\n0", "5\n5\n3\n2\n1\n4\n6\n1\n2\n2\n4\n5\n6\n3\n3\n2\n1\n0", "5\n5\n3\n2\n1\n7\n6\n1\n2\n3\n4\n5\n6\n3\n3\n3\n1\n0", "5\n5\n3\n2\n1\n7\n6\n1\n2\n3\n8\n5\n6\n3\n3\n3\n1\n0", "...	2	11	{ "language": [], "solution": [] }	{ "language": [], "solution": [] }	0		1,000	1,300	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
p01878 Destiny Draw	"In the rush of modern life, people often forget how beautiful the world is. The time to enjoy those(...TRUNCATED)	{ "input": [ "3\n1 2 3\n", "5\n5 4 3 2 1\n" ], "output": [ "0 0 0\n", "0 1 3 6 10\n" ] }	{ "input": [], "output": [] }	{"input":["1\n2","1\n0","1\n-1","1\n-2","1\n-4","1\n-5","1\n-8","1\n-11","1\n3","1\n4","1\n6","1\n10(...TRUNCATED)	2	0	{"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,0,2,0,3,2,0,2,2,2,2,2,0,3,2,2,2,3,2,2,4,2,2,2,2,2,2,2,0,3,4,2,2,2,2,2,2,2,2,0,2,0,0,2(...TRUNCATED)	556	E	1,750	2,200	[]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
p02679 AtCoder Beginner Contest 168 - ∙ (Bullet)	"Polycarp has n coins, the value of the i-th coin is a_i. It is guaranteed that all the values are i(...TRUNCATED)	{ "input": [ "10\n2 3 1 5 6 4 2 10 7 7\n5\n10 1\n5 7\n10 6\n1 1\n10 8\n" ], "output": [ "3\n0\n1\n1\n0\n" ] }	{"input":["99 100 100 100 100\n","57 83 11 4 93\n","99 99 99 99 99\n","100 0 0 0 0\n","0 1 2 3 4\n",(...TRUNCATED)	{"input":["280 2\n","0 2\n","99900 2\n","79086 1\n","1 5\n","100000 96\n","2523 22\n","100000 2\n","(...TRUNCATED)	2	11	{"language":[2,2,4,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,1,2,2,2,2,2,2,2,4,2,2,2,2,4,2(...TRUNCATED)	{"language":[4,2,2,2,1,2,1,3,2,4,3,4,2,4,2,2,2,2,4,3,4,4,4,2,2,4,1,4,4,4,2,4,2,4,2,2,2,2,3,1,2,2,2,4(...TRUNCATED)	478		0	2,300	[ "binary search", "math" ]	false		{ "nanos": 0, "seconds": 1 }	0
p00781 Lattice Practices	"There are N people standing on the x-axis. Let the coordinate of Person i be x_i. For every i, x_i (...TRUNCATED)	{ "input": [ "1 30 0\n-1 -1 -1" ], "output": [ "00:30:00\n01:30:00" ] }	{ "input": [], "output": [] }	{"input":["5\n5 7\n5 3 2 1 4\n2 1 1 2 1\n1 3\n2\n1\n5 10\n2 3 2 3 2\n1 1 1 2 1\n4 10\n5 1 3 4\n1 2 1(...TRUNCATED)	2	10	{"language":[3,2,4,2,3,2,2,2,2,4,4,4,3,3,4,3,3,3,4,3,3,4,2,2,3,3,2,2,4,3,3,2,2,2,3,2,4,3,2,2,3,4,4,2(...TRUNCATED)	{"language":[4,2,2,2,2,1,4,2,3,3,4,1,4,1,2,2,2,2,2,2,3,2,1,3,3,2,2,1,2,2,4,3,1,4,1,1,3,4,4,3,2,3,4,3(...TRUNCATED)	0		2,250	0	[ "combinatorics", "dfs and similar", "dsu", "graphs" ]	false		{ "nanos": 0, "seconds": 2 }	134,217,728
1466_C. Canine poetry	"Alice received a set of Toy Train™ from Bob. It consists of one train and a connected railway net(...TRUNCATED)	{ "input": [ "1\n9\n10\n1\n\nSAMPLE" ], "output": [ "10" ] }	{ "input": [], "output": [] }	{"input":["72\n909 34\n420 51\n621 76\n65 48\n82 41\n665 53\n43 33\n309 21\n942 51\n156 13\n997 11\n(...TRUNCATED)	2	11	{"language":[2,2,4,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,4,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,4,2,3,2,4,2,3,4,3,3,2,2,4,2,3,4,2,2,3,3,3,1,4,4,3,4,4,2,1,2,1,2,3,2,2,4,3,2,2,3,2,1,2(...TRUNCATED)	643		0	1,200	[ "" ]	true	"Problem\n\n$n$枚のカードからなる束があり、下から$i$番目のカードには$i$が(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	512,000,000
702_E. Analysis of Pathes in Functional Graph	"Your friend Jeff Zebos has been trying to run his new online company, but it's not going very well.(...TRUNCATED)	{ "input": [ "keyence", "ashlfyha", "keyofscience", "mpyszsbznf" ], "output": [ "YES", "NO", "YES", "NO" ] }	{"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":["16","19","8","24","32","28","-22","1","15","5","-9","-27","-13","29","-20","001","8","1",(...TRUNCATED)	2	0	{"language":[2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2(...TRUNCATED)	{"language":[4,1,3,2,2,4,2,4,2,4,3,1,4,3,1,2,4,4,2,1,2,4,2,2,2,2,4,2,1,2,3,2,4,4,3,4,2,2,2,3,2,2,4,1(...TRUNCATED)	0		500	2,200	[]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
893_A. Chess For Three	"PowerShell had N natural numbers. He wanted to test Xenny's speed in finding the sum and difference(...TRUNCATED)	{ "input": [ "5 3\n5 5 7 3 1\n", "4 2\n1 2 3 4\n", "2 3\n1 2\n" ], "output": [ "15\n", "8\n", "0\n" ] }	{"input":["78 78\n-645462 -187679 693035 927066 431506 16023 -173045 698159 -995400 -687770 -747462 (...TRUNCATED)	{"input":["2\nacxz\nzxcb","2\nzxda\nzxcb\n\nSAMPLE","2\nzwac\nbcyz","2\nywac\nbcyz","2\nzxca\nbcxz\n(...TRUNCATED)	2	8	{"language":[1,1],"solution":["def CheckIfProbablyPrime(x):\n return (2 << x - 2) % x\ndef primes(...TRUNCATED)	{"language":[4,4,4],"solution":["import java.io.IOException;\nimport java.io.InputStream;\nimport ja(...TRUNCATED)	343	C	0	0	[ "brute force", "sortings" ]	false		null	0
724_F. Uniformly Branched Trees	"We have a string X, which has an even number of characters. Half the characters are `S`, and the ot(...TRUNCATED)	{"input":["5 4\n#.##\n.##.\n#...\n..##\n...#","13 27\n......#.........#.......#..\n...#.....###..\n.(...TRUNCATED)	{"input":["7\n","2000000000000000000\n","1000000000000000000\n","987654321012345678\n"],"output":["2(...TRUNCATED)	{"input":["pH\n2\n","nifzlTLTeWxaD\n0\n","ysBKLtQXvmnCrldEceqXKkaZOrvjRbwlW\n5\n","LiqWMLEVLRhW\n1\n(...TRUNCATED)	2	0	{"language":[4,2,2,4,2,2,2,2,4,2,3,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,1,4,2,2,2,4,2,2,4,2,2,2,2,2,2,4,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,4,4,4,4,3,2,3,4,3,4,3,4,3,2,4,2,2,4,3,3,4,3,2,2,2,1,4,3,4,2,3,4,3,1,4,3,3,4,2(...TRUNCATED)	0	E	0	1,900	[ "dp", "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
990_E. Post Lamps	"Some country is populated by wizards. They want to organize a demonstration.\n\nThere are n people (...TRUNCATED)	{ "input": [ "4\n1 14\n1 50\n4 28\n5 700\n\nSAMPLE" ], "output": [ "1\n10\n3\n32491" ] }	{"input":["1\n1\n1\n1\n1\n1\n1\n","1\n3\n2 3 1\n1 2\n2 3\n1\n1\n1\n2\n","2\n6\n5 3 2 4 1 6\n1 2\n1 3(...TRUNCATED)	{"input":["4\n47\n47\n477\n4747477","4\n7\n47\n477\n4747477","4\n4\n47\n477\n4747477","4\n7\n7\n477\(...TRUNCATED)	2	2	{"language":[2,2,3,2,2,2,4,4,2,3,2,2,3,3,2,2,1,2,3,2,2,3,3,3,4,3,3,3,4,4,2,3,3,3,4,3,2,2,3,4,4,3,2,2(...TRUNCATED)	{"language":[3,3,2,1,4,1,2,4,3,2,2,2,3,3,2,2,3,3,3,2,4,2,2,1,4,4,2,3,2,2,2,2,3,3,2,3,2,4,2,2,2,2,3,4(...TRUNCATED)	614	A	0	2,100	[ "binary search", "bitmasks", "combinatorics", "data structures", "divide and conquer" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
anuwta	"Tree is a connected acyclic graph. Suppose you are given a tree consisting of n vertices. The verte(...TRUNCATED)	{"input":["12\n1\n2\n3\n4\n5\n6\n7\n8\n9\n10\n39\n691\n"],"output":["\n1\n-1\n2\n3\n-1\n5\n4\n7\n-1\(...TRUNCATED)	{"input":["48 1976\n30 97 84\n80 81 84\n41 70 86\n23 57 80\n17 60 85\n36 48 81\n51 87 81\n38 85 81\n(...TRUNCATED)	{"input":["4 6 0\n0 1 3\n0 2 2\n2 0 1\n2 3 2\n3 0 1\n3 1 5","6 10 0\n0 2 7\n0 1 1\n0 3 5\n1 4 9\n2 1(...TRUNCATED)	2	8	{"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,4,4,4,2,2,4,4,1,2,2,2,2,4,4,2,2,4,2,4,1,4,2,4,2,2,2,2,4,4,2,4,4,1,4,4,4,4,1,2,2,4,4(...TRUNCATED)	1,391		0	1,200	[ "data structures", "divide and conquer", "dp" ]	false		{ "nanos": 0, "seconds": 3 }	134,217,728