Datasets:

TheFactoryX
/

edition_2146_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
class-homework	"A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang (...TRUNCATED)	{ "input": [ "2\n5\n2 3 5 1 2\n3\n1 2 3" ], "output": [ "3\n3" ] }	{"input":["20 10 3\nebebccacdb\neeebccddeT\neadebecaac\nadeeeaccbc\nbaccccdaed\ndeabceabba\ndadbecba(...TRUNCATED)	{"input":["42 28\n7 19\n15 24\n3 42\n18 5\n32 27\n26 20\n40 30\n35 2\n14 8\n22 8\n36 4\n16 14\n21 29(...TRUNCATED)	6	0	{"language":[3,2,4,2,2,2,2,4,3,2,2,3,2,1,4,2,4,3,4,4,2,1,4,3,2,3,4,2,3,4,2,2,4,4,2,2,4,3,3,2,4,3,4,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,421		1,750	2,100	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	268,435,456
223_C. Partial Sums	"Luba thinks about watering her garden. The garden can be represented as a segment of length k. Luba(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["5 4\n1 2 1 -1\n2 3 1 -1\n3 1 1 -1\n4 5 2 -1\n","3 3\n1 2 -10 30\n1 3 1 1\n2 3 -10 -1\n","(...TRUNCATED)	{"input":["11 11\n6 2\n6 2\n1 2\n3 2\n3 1\n6 2\n1 1\n1 1\n3 1\n3 1\n6 2\n","21 7\n14 1\n882797755 2\(...TRUNCATED)	6	0	{"language":[4,2,2,2,2,2,4,4,2,2,4,4,2,4,2,2,2,2,2,2,2,4,4,2,4,2,4,4,2,2,2,4,4,2,2,2,4,2,4,2,2,2,2,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)	339	C	0	2,300	[ "combinatorics", "math", "number theory" ]	false	null	256,000,000
168_A. Wizards and Demonstration	"During the archaeological research in the Middle East you found the traces of three ancient religio(...TRUNCATED)	{ "input": [ "3 2 1\n", "3 2 2\n", "4 2 2\n" ], "output": [ "2\n", "4\n", "4\n" ] }	{"input":["1\n1\n","100\n98 52 63 2 18 96 31 58 84 40 41 45 66 100 46 71 26 48 81 20 73 91 68 76 13 (...TRUNCATED)	{"input":["1000 4 750160753\n","2 7 727733989\n","994 9 410957831\n","269 4 817408561\n","386 5 4292(...TRUNCATED)	2	12	{"language":[1,1,1,1,1],"solution":["n = input()\nfor i in range(n):\n str = raw_input()\n l =(...TRUNCATED)	{"language":[4,2,2,4,4,2,2,4,2,2,4,2,2,4,2,2,3,2,3,4,2,2,1,4,3,4,3,4,4,3,2,1,1,2,3,2,4,3,2,4,4,4,2,3(...TRUNCATED)	0		0	800	[ "constructive algorithms", "graphs", "greedy", "sortings" ]	true	{ "nanos": 0, "seconds": 4 }	268,435,456
anuwta	"Polycarp is working on a new project called \"Polychat\". Following modern tendencies in IT, he dec(...TRUNCATED)	{"input":["1\n3\n1 2\n2 3\n1\n1\n1\n2\n2\n1\n","2\n6\n1 2\n1 3\n1 4\n4 5\n4 6\n4\n1 3 4 5\n3\n3 5 2\(...TRUNCATED)	{"input":["10\n3\n-15 -33 79\n16\n45 -84 19 85 69 -64 93 -70 0 -53 2 -52 -55 66 33 -60\n2\n14 -2\n4\(...TRUNCATED)	{"input":["3\nbba\nabb\nabc\n\nSAMPLE","3\nbba\nabb\nabb\n\nSAMPLF","3\nbba\nbba\nabc\n\nSAMPLE","3\(...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,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,1,2,2,2,4,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2(...TRUNCATED)	25	F	0	1,800	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
p01083 RedBlue	"Tree is a connected acyclic graph. Suppose you are given a tree consisting of n vertices. The verte(...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":["4\n439 79\n991800654 985952720 985538124 983840231 983710443 982377023 981242112 98021743(...TRUNCATED)	{ "input": [], "output": [] }	2	10	{"language":[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,2,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED)	{"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	519	E	0	0	[ "*special", "implementation", "strings" ]	true	{ "nanos": 0, "seconds": 1 }	256,000,000
1012_E. Cycle sort	"Panda has a thing for palindromes. Hence he was a given a problem by his master. The master will g(...TRUNCATED)	{"input":["5\n0.50 0.29 0.49 0.95 0.83\n2 3\n0 3\n3 4\n2 1\n3\n4 0.66\n1 0.69\n0 0.36\n"],"output":[(...TRUNCATED)	{"input":["10000 10 100\n2339 4118 4595 5499 5582 6055 8693 9002 9190 9658\n10 75 82 5 14 55 64 68 4(...TRUNCATED)	{"input":["100\n591 417 888 251 792 847 31 3 182 461 102 348 555 956 771 901 712 878 580 631 342 333(...TRUNCATED)	2	11	{"language":[2,2,2,2,2,2,4,4,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,2,2,2,2,2,4,2(...TRUNCATED)	{"language":[4,2,1,4,3,3,4,3,3,2,2,4,3,4,1,4,1,2,2,4,4,4,2,2,3,1,3,4,3,3,2,2,4,3,4,4,2,2,1,3,4,4,4,3(...TRUNCATED)	385	B	0	0	[ "binary search", "geometry", "two pointers" ]	true	{ "nanos": 0, "seconds": 1 }	256,000,000
958_E2. Guard Duty (medium)	"You've got an array a, consisting of n integers. The array elements are indexed from 1 to n. Let's (...TRUNCATED)	{ "input": [ "3\n3 2 2\n", "4\n2 2 2 2\n" ], "output": [ "4\n", "3\n" ] }	{"input":["728961319347 33282698448966372 52437 42819\n","461788563846 36692905412962338 93797 64701(...TRUNCATED)	{"input":["5\n1 4 4 5 2","9\n1 2 4 9 5 8 7 6 6","9\n1 2 4 9 5 8 4 6 6","5\n0 4 4 5 1","2\n1 0","2\n1(...TRUNCATED)	2	0	{"language":[2,4,4,2,4,2,4,2,4,4,2,2,4,4,2,2,3,4,4,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)	{"language":[2,2,2,0,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,0,0,0,2,0,2,2,2,2,0,2,2,0,2,2,0,2,2,2,2,0,2,0,2,2(...TRUNCATED)	1,446		0	0	[ "" ]	false	{ "nanos": 0, "seconds": 4 }	256,000,000
1144_B. Parity Alternated Deletions	"We have a tree with N vertices. The i-th edge connects Vertex A_i and B_i bidirectionally.\n\nTakah(...TRUNCATED)	{ "input": [ "2\n3\n3 2 1\n6\n3 1 4 1 5 9\n" ], "output": [ "3\n5\n" ] }	{"input":["20 18 1 2\n-9999944 -9999861 -9999850 -9999763 -9999656 -9999517 -9999375 -9999275 -99992(...TRUNCATED)	{"input":["5 6\n#.##\n.##.\n#...\n..##\n...#","13 27\n......#.........#.......#..\n...#.....###..\n.(...TRUNCATED)	5	11	{"language":[1,1],"solution":["from collections import defaultdict\n\ndef solve(S):\n # Reverse S(...TRUNCATED)	{"language":[2,2,2,4,4,4,2,4,2,2,1,4,4,2,1,2,2,4,4,2,2,2,4,4,2,2,2,3,4,2,2,2,4,2,2,4,3,2,2,2,4,2,3,2(...TRUNCATED)	937	B	500	0	[ "" ]	false	{ "nanos": 500000000, "seconds": 2 }	134,217,728
bhavanas-and-bhuvanas-bet	"As usual, Sereja has array a, its elements are integers: a[1], a[2], ..., a[n]. Let's introduce not(...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":["1\n2\n905303520 999999998\n999999999 1000000000\n","1\n10\n132182352 630066892\n323711215(...TRUNCATED)	2	9	{"language":[2,4,4,2,2,2,4,2,3,2,2,2,4,3,2,4,3,1,1,2,3,4,2,2,4,2,3,3,1,4,4,3,1,3,1,2,2,2,1,4,4,4,3,3(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,4,2,4,2,1,2,2,1,2,1,4,4,2,2,2,2,2,2,2,1,2,2,2,1,2,2,2,2,4,2,3,4,2,2,2(...TRUNCATED)	1,264	E	500	0	[ "data structures", "greedy", "sortings" ]	false	null	1,073,741,824
39_H. Multiplication Table	"Given a string s, process q queries, each having one of the following forms:\n\n * 1 i c — Chang(...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":["188\n99\n","352\n139\n","596\n845\n","285\n2\n","892\n319\n","138\n293\n","967\n102\n","9(...TRUNCATED)	6	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":["b=\"AEIOUaeiou\"\nt(...TRUNCATED)	{"language":[2,2,4,4,3,3,4,2,3,3,2,3,2,3,4,3,4,2,4,4,3,2,3,3,2,1,4,3,2,3,4,4,3,3,3,3,3,3,2,4,4,2,2,4(...TRUNCATED)	1,250	E	0	1,800	[]	false	{ "nanos": 0, "seconds": 3 }	256,000,000