Datasets:

TheFactoryX
/

edition_2803_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
958_E2. Guard Duty (medium)	"Story\n\nAt UZIA High School in the sky city AIZU, the club activities of competitive programming a(...TRUNCATED)	{"input":["o.x.\no...\n.x..\nooxx\n","x.ox\nox..\nx.o.\noo.x\n","xx..\n.oo.\nx...\noox.\n","x..x\n..(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["9 1004498469 6\n","1 0 10\n","1944219055 33463955 1369298327\n","914835 4386500 9234739\n(...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":[4,3,3,3,2,3,2,2,1,4,3,4,3,2,3,2,2,2,4,2,2,2,2,2,2,3,3,4,3,3,2,3,2,4,1,4,4,4,4,2,4,2,2,4(...TRUNCATED)	1,195	C	3,000	2,500	[ "brute force", "greedy" ]	false	"問題\n\n正の整数を (先頭に 0 をつけずに) 10 進法で書いて桁の数字を順番(...TRUNCATED)	{ "nanos": 0, "seconds": 1 }	134,217,728
p00035 Is it Convex?	"Panda has a thing for palindromes. Hence he was a given a problem by his master. The master will g(...TRUNCATED)	{ "input": [ "3\n3 1 0\n1 2 3\nXOR\n3 1 0\n1 2 3\nAND\n3 1 0\n1 2 3\nOR" ], "output": [ "0\n0\n3\n" ] }	{ "input": [], "output": [] }	{"input":["4\n11833\n5512\n100\n28436\n33903\n100\n84816\n75747\n100\n92281\n31380\n100","1\n45819\n(...TRUNCATED)	2	8	{"language":[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,4,4,2,2,2,2,2,2,2,2,2,2,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)	582	D	1,000	2,400	[ "data structures", "greedy", "implementation" ]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
977_B. Two-gram	"You are given an array of n integers. For each element output the sum of itself and the previous el(...TRUNCATED)	{"input":["6 2\n100 1 10 40 10 40\n","5 1\n5 10 7 3 20\n","3 0\n1 2 3\n"],"output":["97\n","3\n","0\(...TRUNCATED)	{"input":["5 3\n","1500 2000\n","500 1000\n","1000 1000\n","5 5\n","2000 2\n","1000 500\n","3 1000\n(...TRUNCATED)	{"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(...TRUNCATED)	2	11	{"language":[3,2,4,3,3,3,3,2,3,3,3,3,4,3,3,3,3,4,3,4,3,3,3,3,3,3,2,3,1,2,3,3,3,3,4,1,3,2,3,3,4,4,3,3(...TRUNCATED)	{"language":[0,4,0,0,0,0,0,0,4,2,0,2,2,3,2,0,2,0,3,0,0,0,0,2,0,2,1,1,2,0,3,2,0,0,3,0,0,4,2,2,2,0,0,2(...TRUNCATED)	1,398	B	2,500	1,100	[ "brute force", "implementation", "sortings" ]	false		{ "nanos": 0, "seconds": 1 }	268,435,456
699_F. Limak and Shooting Points	"Geometric progression with the first element a and common ratio b is a sequence of numbers a, ab, a(...TRUNCATED)	{ "input": [ "5\n3 2 1 6 5\n", "4\n3 3 3 3\n" ], "output": [ "8", "0" ] }	{ "input": [], "output": [] }	{"input":["1 1 1000000000 1000000100\n100 1000000000\n1\n","1 1 10 18\n3 6\n5\n","4 13 400 600\n13 3(...TRUNCATED)	6	0	{"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,0,0,2,2,2,2,2,2,2,0,0,0,0,2,2,0,3,0,0,0,0,2,2,0,2,2,2,2,0,2,2,2,0,0],"solution":["#in(...TRUNCATED)	996	E	1,750	1,600	[ "data structures", "dfs and similar", "shortest paths", "trees" ]	false	"JOI 君が住む都市にはN 個の駅があり，それぞれ1, 2, ..., N の番号が付けら(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	256,000,000
1466_F. Euclid's nightmare	"Don't put up with what you're sick of! The Smart Beaver decided to escape from the campus of Beaver(...TRUNCATED)	{"input":["3 2\n2 1\n3 2\n3 1\n","4 3\n4 1\n1 2\n2 2\n3 2\n"],"output":["5.5\n1 3 \n2 1 2 \n","8.0\n(...TRUNCATED)	{"input":["6\nbabcdc\n","5\nbadec\n","3\naba\n","7\nbaaaccb\n","3\naaa\n","4\npara\n","3\nbac\n","7\(...TRUNCATED)	{"input":["4000 4000 2\n","3 300 167\n","3 300 2\n","4 4 2\n","3 2 70\n","1625 3998 2\n","300 403 30(...TRUNCATED)	3	11	{"language":[2,4,2,2,2,2,2,2,2,3,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,4,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,4,2,3,2,2,1,2,4,2,2,2,3,2,4,2,2,2,4,4,1,4,4,1,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,4,4,1(...TRUNCATED)	0		1,500	2,200	[ "brute force" ]	false		{ "nanos": 0, "seconds": 2 }	1,073,741,824
p02445 Swap	"There are N people numbered 1 to N. Each person wears a red hat or a blue hat.\n\nYou are given a s(...TRUNCATED)	{ "input": [ "5 2\n3 -5 3 -5 3\n", "3 2\n1 2 4\n", "6 3\n4 3 4 3 2 5\n" ], "output": [ "0\n", "1\n", "3\n" ] }	{"input":["143165576\n","1919020031\n","1204252996\n","210637432\n","724264821\n","1741\n","61948959(...TRUNCATED)	{"input":["brtakoktrosttttttttttosafasfkalsfkodfdasiofhadfhasdsajfdsafoasodsafahaihfdisoadspapsapios(...TRUNCATED)	2	11	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,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,4,2,2,2,2(...TRUNCATED)	{"language":[2,4,2,2,2,3,4,2,2,2,4,1,4,2,4,1,4,2,2,2,2,2,2,4,2,2,2,2,2,2,2,4,4,2,2,4,2,2,1,2,2,2,2,2(...TRUNCATED)	0	A	1,500	1,500	[ "implementation", "strings" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
556_C. Case of Matryoshkas	"The bear decided to store some raspberry for the winter. He cunningly found out the price for a bar(...TRUNCATED)	{"input":["3\n1 3 2\n-100 2 3\n","2\n2 1\n-3 0\n","5\n2 1 4 3 5\n2 2 2 3 4\n"],"output":["3\n","0\n"(...TRUNCATED)	{"input":["10 10\n5 9 1 3 5 8 3 4 7\n2 0 4 7 1 0 0 0 7 0\n5 7 -7 3 10 4 7 2 9 -9\n","2 2\n1\n0 0\n1 (...TRUNCATED)	{ "input": [], "output": [] }	5	0	{"language":[4,4,4,4,4,4,4,3,3,2,4,4,4,3,3,4,2,2,4,3,3,3,4,3,1,2,2,3,1,2,4,1,1,4,2,2,4,1,3,3,4,4,4,3(...TRUNCATED)	{"language":[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,3,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	80	F	0	0	[ "constructive algorithms", "dp", "flows", "graph matchings", "greedy", "sortings" ]	false		{ "nanos": 0, "seconds": 4 }	256,000,000
the-strongest-string-1-1	"Problem Statement\n\nWe found a dictionary of the Ancient Civilization Mayo (ACM) during excavation(...TRUNCATED)	{ "input": [ "14 3 2012" ], "output": [ "Wednesday" ] }	{"input":["100\n4\nlrbbmqb\ncd\nr\nowkk\n7\nid\nqscdxrjmow\nrxsjybldbe\nsarcbyne\ndyggxxp\nlorel\nnm(...TRUNCATED)	{"input":["2 2\n2 1 2 16\n2 1 2 7\n","1 2\n1 1 1 10\n2 1 1 5\n","6 5\n1 2 3 1\n2 1 2 8\n2 3 4 7\n1 1(...TRUNCATED)	3	11	{"language":[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,2,2(...TRUNCATED)	{"language":[0,2,2,0,2,3,2,3,4,0,3,2,2,2,2,2,2,3,0,2,0,2,3,4,0,2,2,0,2,2,2,2,2,2,3,0,3,2,2,0,0,2,2,2(...TRUNCATED)	977		0	1,600	[ "" ]	false		{ "nanos": 0, "seconds": 5 }	256,000,000
938_B. Run For Your Prize	"Let us denote by d(n) the sum of all divisors of the number n, i.e. d(n) = ∑_{k \| n} k.\n\nFor ex(...TRUNCATED)	{"input":["2\n1000000 1000000\n","6\n5 1 2 4 6 3\n","5\n1 5 7 8 2\n"],"output":["1000000\n","0\n","0(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3 5 10\nred\n0 0 0\n5 0 0\ngreen\n0 5 5\n5 6 1\nblue\n0 40 5\n5 0 0\n3 10 5\nbtom\n0 47 3(...TRUNCATED)	2	10	{"language":[4,3,3,2,1,4,3,4,3,3,4,4,3,3,3,3,3,3,3,3,2,3,3,3,2,3,3,4,3,3,3,3,3,4,4,2,3,3,3,3,3,3,1,3(...TRUNCATED)	{ "language": [], "solution": [] }	789	D	1,500	0	[]	true		{ "nanos": 0, "seconds": 2 }	256,000,000
40_B. Repaintings	"We have a sandglass consisting of two bulbs, bulb A and bulb B. These bulbs contain some amount of (...TRUNCATED)	{ "input": [ "10 5 5 5\n", "3 0 0 2\n" ], "output": [ "9\n", "0\n" ] }	{"input":["11 11\n6 2\n6 2\n1 2\n2 2\n3 1\n6 2\n1 1\n1 1\n3 1\n3 1\n6 2\n","21 7\n14 1\n882797755 2\(...TRUNCATED)	{"input":["bcccccccccccaaacaaaaccccccbaaaaaabbbccbbbbbbaaaaaaaaaccccccccaaaaaaaaaaaaaaccccccaaaaaaaa(...TRUNCATED)	2	0	{"language":[3,3,3,3,3,3,3,3,4,3,3,3,3,3,3,2,3,4,3,3,3,3,3,3,3,3,3,2,3,3,3,3,2,3,3,3,3,3,3,3,2,3,4,3(...TRUNCATED)	{"language":[1,2,2,2,2,3,2,4,2,1,2,4,2,3,4,2,2,3,3,3,4,2,4,2,2,2,2,3,2,1,4,2,2,2,2,4,2,1,2,2,2,4,4,2(...TRUNCATED)	161		0	3,500	[ "greedy", "implementation" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000