Datasets:

TheFactoryX
/

edition_1377_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
290_D. Orange	Given is a string S, where each character is `0`, `1`, or `?`. Consider making a string S' by replacing each occurrence of `?` with `0` or `1` (we can choose the character for each `?` independently). Let us define the unbalancedness of S' as follows: * (The unbalancedness of S') = \max \\{ The absolute difference be...	{ "input": [ "3 8\n10 20\n0 0\n20 40\n300 600\n30 60\n170 340\n50 100\n28 56\n90 180\n-4 -8\n-1 -2\n", "2 4\n-2 -1\n4 5\n4 2\n2 1\n4 -1\n1 -1\n" ], "output": [ "5\n", "3\n" ] }	{ "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", "6 15\n1 2 -52 -10\n1 3 2 -72\n1 4 -72 -2\n1 5 6 -100\n1 6 -100 -97\n2 3 -63 -37\n2 4 -99 -55\n2 5 -84 -9\n2 6 -17 -8\n3 4 -16 -57\n3 5 -1 8\n3 6 -22 -88\n4 5 -59 -75\n4 6 -92 -63\n5 6 9 -65\n", "10...	{ "input": [ "3\n5\n3 5 1 2 4\n1\n1\n4\n4 3 1 2\n", "3\n5\n4 5 2 1 3\n1\n1\n4\n4 3 1 2\n", "3\n5\n3 4 2 1 5\n1\n1\n4\n4 3 1 2\n", "3\n5\n2 5 3 1 4\n1\n1\n4\n4 3 1 2\n", "3\n5\n4 5 1 2 3\n1\n1\n4\n4 3 1 2\n" ], "output": [ "1 0 3 2 1\n0\n0 1 3 2\n", "1 0 2 3 1\n0\n0 1 3 2\n", "2 1 2...	3	0	{ "language": [], "solution": [] }	{ "language": [], "solution": [] }	0	D	0	1,500	[ "data structures", "dfs and similar", "dp", "trees" ]	false	{ "nanos": 0, "seconds": 2 }	0
76_B. Mice	"Computation of the date either previous or forthcoming dates is quiet easy. But it is quiet difficu(...TRUNCATED)	{ "input": [ "2 2\n2 3\n2 3\n2 3\n2 2\n3 2", "2 2\n2 3\n2 3\n2 3\n2 2\n2 2" ], "output": [ "yes", "no" ] }	{"input":["1 0\n23333\n","3 3\n1 1 1\n1 2\n2 3\n3 1\n","5 4\n1 2 2 2 2\n1 2\n1 3\n1 4\n1 5\n","10 30(...TRUNCATED)	{"input":["1 36 0\n-1 -1 -1","0 30 0\n-1 -1 -1","0 32 0\n-1 -1 -1","1 16 0\n-1 -1 -1","0 36 0\n-1 -1(...TRUNCATED)	2	9	{"language":[3,2,3,1,2,3,3,3,4,4,2,3,1,2,3,1,3,1,1,3,4,3,4,2,3,2,4,3,3,1,2,3,3,2,3,1,3,1,2,4,3,3,4,3(...TRUNCATED)	{ "language": [], "solution": [] }	0	D	2,000	2,000	[ "implementation" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1081_G. Mergesort Strikes Back	"Ori and Sein have overcome many difficult challenges. They finally lit the Shrouded Lantern and fou(...TRUNCATED)	{ "input": [ "1\n5 3\n200 6 9" ], "output": [ "120" ] }	{"input":["5\n42\n17\n444\n7\n51\n"],"output":[" (...TRUNCATED)	{"input":["7 9 999999999 0 4\n0 1 0\n1 2 0\n2 3 0\n0 4 1\n4 1 1\n1 5 499999999\n5 2 499999999\n2 6 1(...TRUNCATED)	2	10	{"language":[4,2,2,2,2,4,2,4,2,2,2,2,4,4,4,2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,4,4,4,4,2,2,2,2,2,4,2,2(...TRUNCATED)	{"language":[2,2,2,0,2,2,2,2,0,2,2,0,2,2,2,0,0,2,0,0,2,0,2,2,2,2,0,0,0,2,0,2,2,2,2,2,2,2],"solution"(...TRUNCATED)	161	A	0	1,800	[ "bitmasks", "brute force", "data structures", "string suffix structures", "strings" ]	false	{ "nanos": 0, "seconds": 2 }	0
1037_E. Trips	"Bob came to a cash & carry store, put n items into his trolley, and went to the checkout counter to(...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":["42 28\n7 19\n15 24\n3 42\n18 5\n32 27\n26 20\n40 30\n35 2\n14 8\n22 10\n36 4\n16 14\n21 2(...TRUNCATED)	{"input":["10\n75 995991040 148627929 566366239 458028006 823890903 945174886 530827147 546010999 72(...TRUNCATED)	2	7	{"language":[2,2,2,2,2,4,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,2,2,4,4,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2(...TRUNCATED)	{"language":[3,1,2,2,1,2,4,3,3,2,2,4,2,4,4,4,2,2,2,1,2,4,2,1,1,4,3,3,3,2,4,2,2,2,2,3,2,4,4,2,2,4,2,2(...TRUNCATED)	152		0	0	[ "dfs and similar", "dp", "dsu", "ternary search", "trees" ]	false	{ "nanos": 0, "seconds": 6 }	256,000,000
774_K. Stepan and Vowels	"Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings(...TRUNCATED)	{"input":["5\n1 2\n2 3\n3 4\n4 5\n5\n1 3 1 2 2\n1 4 1 3 2\n1 4 1 3 3\n4 2 3 3 9\n5 2 3 3 9\n"],"outp(...TRUNCATED)	{ "input": [ "5\n1 14\n1 50\n4 28\n5 700\n3 147" ], "output": [ "1\n10\n3\n32491\n739" ] }	{"input":["+--+-+\n","+--+--+------+++++++-+-+++--++---+--+-+---+--+++-+++-------+++++-+-++++--+-+-+(...TRUNCATED)	2	11	{"language":[2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[3,2,3,2,4,3,4,2,2,2,4,2,4,2,4,4,1,2,2,2,3,1,4,4,4,2,3,3,2,4,2,3,2,2,4,2,3,3,4,3,3,1,2,2(...TRUNCATED)	1,043		0	0	[ "data structures", "math" ]	false	null	256,000,000
1420_D. Rescue Nibel!	"Phoenix is trying to take a photo of his n friends with labels 1, 2, ..., n who are lined up in a r(...TRUNCATED)	{ "input": [ "19 29\n", "3 6\n" ], "output": [ "2\n", "2\n" ] }	{"input":["997 6 680633279\n","989 8 990767311\n","999 2 750160753\n","1 4 904448911\n","1000 3 7501(...TRUNCATED)	{"input":["11--01--2013-02-2013-01--01--2013\n","00-12-2014-00-12-2013-00-12-2014-12-12-2014\n","23-(...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":[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)	0		1,750	1,100	[ "implementation", "strings" ]	false	{ "nanos": 0, "seconds": 3 }	1,073,741,824
1304_E. 1-Trees and Queries	"You are given a square board, consisting of n rows and n columns. Each tile in it should be colored(...TRUNCATED)	{ "input": [ "1\n2 3 Chandu\n\nSAMPLE" ], "output": [ "Daspal\n" ] }	{"input":["wwwww w\n8\nwwwww wwwwwwww\nwwwwwwww wwwwwwwww\nwwwwwwwww wwwwwwwwww\nw www\nwwwwwwwwww w(...TRUNCATED)	{"input":["5 9 4\n4 1 46\n1 3 29\n3 2 58\n1 5 61\n2 4 175\n1 2 87\n4 5 58\n3 5 69\n3 4 28\n2 7\n5 7\(...TRUNCATED)	2	0	{"language":[1,1,1,1,1,1,1,1],"solution":["a=[]\nt,k=input(),input()\nfor _ in xrange(t):\n\ta.appen(...TRUNCATED)	{ "language": [], "solution": [] }	760	C	1,000	3,000	[ "brute force", "greedy" ]	false	{ "nanos": 0, "seconds": 2 }	1,073,741,824
p01835 Donut Decoration	"Monk loves cakes! He visits the Binary Bakery to buy some of his favorite cheesecakes. \nThe owner(...TRUNCATED)	{"input":["5 4 10 1 6\n1 1 5\n1 5 5\n1 3 2\n1 5 2\n2 1\n2 2\n","5 2 2 1 8\n1 1 2\n1 5 3\n1 2 1\n2 2\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1 10\n8\n1\n2\n3\n4\n5\n6\n7\n13\n9\n16\n","1 10\n2\n1\n2\n3\n4\n5\n6\n7\n8\n3\n16\n","1 (...TRUNCATED)	2	0	{"language":[4,2,3,3,4,4,4,2,2,2,2,3,4,3,2,4,3,4,4,2,4,4,3,2,4,3,4,3,4,4,3,3,2,4,2,4,2,4,4,3,4,4,2,2(...TRUNCATED)	{"language":[2,1,2,2,3,2,2,2,2,2,2,3,3,2,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,3,0,2,2,2,2(...TRUNCATED)	1,391		0	1,100	[ "brute force" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
hermione-vs-draco	"Today, Osama gave Fadi an integer X, and Fadi was wondering about the minimum possible value of max(...TRUNCATED)	{ "input": [ "3\n1 2\n2 3\n", "5\n1 2\n1 3\n1 4\n1 5\n" ], "output": [ "1 1 1\n", "1 0 0 0 0\n" ] }	{"input":["1 1\n1\n2\n","6 3\n1 2 3 4 5 6\n3 5 1\n","5 5\n5 6 3 2 1\n4 3 1 5 6\n","1 1\n1\n1\n","10 (...TRUNCATED)	{"input":["3\n1\n0 1\n0 -1\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1","3\n2\n0 1\n0 -1\n1 0\n2\n0 1\n(...TRUNCATED)	3	10	{"language":[1,1],"solution":["import sys\ndef numberToBase(n, b):\n temp=''\n while n:\n (...TRUNCATED)	{"language":[2,4,4,3,2,3,2,2,3,2,3,3,4,3,4,4,4,2,2,2,4,2,4,4,3,2,3,1,4,2,3,4,3,2,2,2,2,4,2,2,3,2,2,2(...TRUNCATED)	0	D	0	1,300	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
p03194 CADDi 2018 for Beginners - Product and GCD	"Bosky is a very curious child who turned 13 yesterday. His parents gifted him a digital watch which(...TRUNCATED)	{ "input": [ "1 2 10\n11\n15 7\n", "2 4 50\n20 100\n60 10 40 80\n" ], "output": [ "7", "50" ] }	{"input":["0\n2000000000 2000000000 1\n","22\nCleo likes Snowy\nCleo likes Troll\nChapay likes Dracu(...TRUNCATED)	{"input":["3\n60615\n1268501\n1268499\n","7\n1\n2\n3\n4\n5\n110\n2000000\n","3\n89610\n1268501\n1268(...TRUNCATED)	2	0	{"language":[1,4,1,2,2,2,2,2,2,2,4,3,2,4,2,4,2,2,2,2,2,2,4,4,2,2,4,2,2,2,2,2,4,3,4,2,2,2,4,2,4,4,2,2(...TRUNCATED)	{"language":[4,2,2,2,2,2,2,4,4,2,2,3,2,2,2,2,2,2,2,4,2,2,4,4,4,4,2,2,3,2,2,4,4,4,2,2,4,4,2,4,2,2,4,2(...TRUNCATED)	1,189	B	0	0	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	134,217,728