Datasets:

TheFactoryX
/

edition_2563_deepmind-code_contests-readymade

name large_stringlengths 4 70	description large_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 large_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 large_stringclasses 36 values	time_limit dict	memory_limit_bytes int64 0 1.07B
1428_D. Bouncing Boomerangs	"You might have heard about our new goodie distribution program aka the \"Laddu Accrual System\". Th(...TRUNCATED)	{"input":["2 0\n1 1 1 1\n","2 2\n0 1 2 3\n2 5\n0 4\n","1 0\n2 3\n"],"output":["1.0000000000\n","1.50(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["5 7\n2 2\n2 3\n3 4\n1 5\n2 5\n3 5\n4 5\n","4 0\n","6 9\n1 2\n1 4\n1 5\n2 6\n2 5\n2 6\n3 5(...TRUNCATED)	6	12	{"language":[2,2,4,2,2,3,2,2,2,2,2,2,3,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,4,2,2,4(...TRUNCATED)	{ "language": [], "solution": [] }	1,466		1,000	1,000	[ "" ]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
1466_F. Euclid's nightmare	"Bessie and the cows have recently been playing with \"cool\" sequences and are trying to construct (...TRUNCATED)	{"input":["3\n3 3\n1 -3 4\n1 5 2\n2 2\n-2 0\n1 2\n2 2\n0 1\n1 2\n"],"output":["\n0 6 2 \n-1 -1 \n1 3(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["5 3 2\naaaaa\nbaa\naab","5 3 2\naaaaa\nabb\naac","6 3 2\naaaaa\naaa\naab","6 3 2\naabaa\n(...TRUNCATED)	2	0	{"language":[2,2,2,2,2,3,2,4,2,2,4,2,3,2,2,2,2,2,2,2,4,4,2,2,2,2,4,2,4,2,2,2,2,3,4,2,2,2,2,4,1,2,2,4(...TRUNCATED)	{"language":[3,2,3,2,4,4,2,4,3,4,4,4,2,4,3,4,4,4,2,4,2,2,3,4,4,3,2,3,3,3,3,2,2,4,4,4,2,3,4,4,4,4,4,2(...TRUNCATED)	0	D1	0	2,300	[ "*special", "implementation" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
161_B. Discounts	"Grigory has n magic stones, conveniently numbered from 1 to n. The charge of the i-th stone is equa(...TRUNCATED)	{"input":["4\n3\n4 5\n5 9\n7 7\n5\n11 19\n4 17\n16 16\n3 12\n14 17\n1\n1 10\n1\n1 1\n"],"output":["2(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\n1000000000 1000000000 11000000\n","3\n2 2 1\n","3\n2 10 11\n","5\n1000010000 5 5 4 4\n(...TRUNCATED)	1	10	{"language":[4,2,4,2,4,2,2,2,2,2,2,4,2,2,2,2,2,2,4,2,1,4,4,2,2,4,3,4,4,4,3,2,2,2,2,2,2,2,2,2,2,4,2,2(...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)	702		0	2,300	[ "dp", "probabilities" ]	false		{ "nanos": 0, "seconds": 5 }	0
494_A. Treasure	"Strings can be efficiently stored as a data structure, to have efficient searching methods.\nA new (...TRUNCATED)	{ "input": [ "2\n3\n10" ], "output": [ "1\n3" ] }	{ "input": [], "output": [] }	{"input":["3\n10 2 5\n12 4 8\n6 2 2\n\nSAMPLE","3\n7 2 5\n12 4 8\n6 2 2\n\nSAMPLF","3\n7 2 5\n12 4 8(...TRUNCATED)	2	11	{"language":[3,1,1,4,4,3,4,3,1,1,2,2,3,4,3,1,1,3,2,4,4,3,4,2,4,2,4,4,3,3,4,3,4,1,1,2,2,3,3,2,2,4,2,4(...TRUNCATED)	{ "language": [], "solution": [] }	323		0	0	[ "graphs" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1149_E. Election Promises	"Problem description.\nVipul is a hardworking super-hero who maintains the bracket ratio of all the (...TRUNCATED)	{ "input": [ "ACM" ], "output": [ "0" ] }	{"input":["8\n0 1\n1 0\n0 1\n1 1\n0 1\n1 0\n0 1\n1 0\n","8\n1 0\n1 0\n1 0\n0 1\n0 1\n1 1\n1 1\n0 1\n(...TRUNCATED)	{"input":["7\n576460752303423487 2\n82 9\n101 104\n10 12\n31 10\n0 1\n10 30\n","1\n12881797281728299(...TRUNCATED)	5	11	{"language":[4,2,2,2,2,3,2,2,4,2,3,2,2,4,4,2,2,4,2,2,2,4,4,2,2,2,2,3,2,3,4,2,3,4,2,2,2,2,4,4,2,2,2,2(...TRUNCATED)	{"language":[4,3,2,3,0,2,2,3,0,2,3,3,2,3,0,0,2,2,3,2,0,3,0,3,2,2,3,2,3,3,2,3,3,0,3,4,0,2,3,3,2,3,2,0(...TRUNCATED)	0		1,000	1,100	[ "" ]	false		{ "nanos": 0, "seconds": 5 }	1,073,741,824
1513_C. Add One	"Sita loves chocolate and Ram being his boyfriend wants to give Sita as many chocolates as he can. S(...TRUNCATED)	{"input":["1500 2000 1600 3 2","1500 2000 500 90000 100000","1500 2000 1900 3 2"],"output":["7900","(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["46\n63 1\n63 63\n123 1\n123 123\n63 2\n63 62\n123 2\n123 122\n63 3\n63 61\n123 3\n123 121(...TRUNCATED)	3	7	{"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":[2,2,2,4,2,2,2,2,2,2,2,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,2,2,2,2,2,2(...TRUNCATED)	0		1,250	0	[ "" ]	false	"D：素因数分解の多様性 (The Diversity of Prime Factorization)\n\nProblem\n\nEbi-chan has (...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	1,073,741,824
dbyz15t	"One foggy Stockholm morning, Karlsson decided to snack on some jam in his friend Lillebror Svantens(...TRUNCATED)	{"input":["3 2\n1 3\n1 1\n0\n2\n","2 2\n1 2\n1 1\n1\n","5 6\n2 2 3\n2 4 5\n1 4\n1 5\n0\n1\n"],"outpu(...TRUNCATED)	{"input":["10\n62159435 282618243 791521863 214307200 976959598 590907019 166397456 708291256 853773(...TRUNCATED)	{"input":["50\n16 4\n17 9\n31 19\n3 10\n8 1\n40 30\n3 31\n20 29\n47 27\n22 25\n32 34\n12 15\n40 32\n(...TRUNCATED)	5	0	{"language":[3,2,4,2,2,2,3,3,3,4,3,3,3,2,4,3,2,4,2,3,2,2,3,2,2,4,2,2,3,3,4,3,3,2,2,2,4,3,3,3,3,3,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0	B	0	1,900	[ "data structures", "implementation", "math" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
1208_A. XORinacci	"Bosky is a very curious child who turned 13 yesterday. His parents gifted him a digital watch which(...TRUNCATED)	{ "input": [ "1", "2" ], "output": [ "a", "aa\nab" ] }	{ "input": [], "output": [] }	{"input":["2\n2 2\nyz\n1 1\n2 2\nzy\n1 1\n","1\n11 2\nthisisatest\n3 7\n","3\n4 2\nabca\n1 3\n10 5\n(...TRUNCATED)	2	11	{"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,2,3,3,2,2,1,2,4,4,4,3,4,4,3,3,4,2,2,2,4,3,2,2,3,2,2,3,3,3,2,2,4,3,2,4,3,3,4,2,4,1,3,2(...TRUNCATED)	621	F	0	2,200	[ "" ]	false	"りんごだいぼうけん\n\nsquare1001君とE869120君は縦 $H$ 行、横 $W$ 列のグリッ(...TRUNCATED)	null	256,000,000
366_D. Dima and Trap Graph	"The Chef likes to stay in touch with his staff. So, the Chef, the head server, and the sous-chef al(...TRUNCATED)	{"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\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["2 3\n1 1 0\n0 1 0","3 3\n0 1 0\n1 0 1\n0 1 -1","4 6\n1 0 1 1 0 1 \n0 0 1 1 1 1 \n1 1 1 1 (...TRUNCATED)	2	11	{"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":[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)	0	F	0	2,100	[]	false		{ "nanos": 0, "seconds": 3 }	0
571_B. Minimization	"You are given a sequence of n integers a1, a2, ..., an. \n\nDetermine a real number x such that the(...TRUNCATED)	{ "input": [ "3\n25\n46\n99" ], "output": [ "2\n1\n2\n" ] }	{"input":["20\n9 4 8\n10 6 7\n4 6 0\n7 7 6\n3 3 10\n4 2 1\n4 4 0\n2 0 0\n8 8 7\n3 1 7\n3 10 7\n1 7 3(...TRUNCATED)	{"input":["2\n5\n4","3\n1\n0\n3","2\n3\n4","3\n1\n0\n2","2\n4\n4","3\n1\n0\n1","2\n4\n0","3\n1\n2\n1(...TRUNCATED)	5	0	{"language":[3,2,2,2,4,2,2,2,3,3,2,2,4,2,2,2,2,4,2,2,2,2,2,4,2,4,4,2,2,2,2,4,2,4,3,2,2,2,4,2,4,2,2,2(...TRUNCATED)	{"language":[3,1,2,2,2,2,2,1,2,1,2,2,4,2,4,1,2,2,4,4,2,2,1,4,2,4,4,3,2,4,2,4,3,4,2,2,4,2,3,4,2,4,2,2(...TRUNCATED)	0		0	0	[ "divide and conquer", "fft", "greedy", "math", "number theory" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000