Datasets:

TheFactoryX
/

edition_2079_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
582_A. GCD Table	"Lee tried so hard to make a good div.2 D problem to balance his recent contest, but it still doesn'(...TRUNCATED)	{"input":["7\n5\n-1 10 -1 12 -1\n5\n-1 40 35 -1 35\n6\n-1 -1 9 -1 3 -1\n2\n-1 -1\n2\n0 -1\n4\n1 -1 3(...TRUNCATED)	{"input":["3 8\n2 4 4 4\n7 2 5 2\n6 5 6 3\n20\n3 2 U 1000000\n3 2 U 1\n3 2 U 2\n3 2 U 3\n3 2 U 4\n3 (...TRUNCATED)	{"input":["5\n7 46 11 17 11","7\n994 518 941 851 647 2 568","3\n3 1 6","5\n7 46 11 17 13","7\n994 51(...TRUNCATED)	6	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,4,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,3,4,4,4,1,2,3,4,3,1,2,4,4,2,4,4,1,4,3,3,3,2,4,3,2,4,2,2,2,2,2,2,4,2,4,4,4,2,4,3,2,4(...TRUNCATED)	0		500	1,400	[]	false	"りんごだいぼうけん\n\nsquare1001君とE869120君は縦 $H$ 行、横 $W$ 列のグリッ(...TRUNCATED)	{ "nanos": 0, "seconds": 1 }	256,000,000
147_B. Smile House	"Vasilisa the Wise from the Kingdom of Far Far Away got a magic box with a secret as a present from (...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": [], "output": [] }	{"input":["2","6","7","8","10","1","5","9","001","010","5","6","1","9","7","2","10","8","001","010"](...TRUNCATED)	3	0	{"language":[3,4,4,3,3,1,2,3,2,2,3,2,3,2,3,1,4,3,4,3,4,3,3,4,4,2,2,3,2,2,3,2,2,4,3,2,4,3,4,4,2,2,3,3(...TRUNCATED)	{"language":[2,2,2,2,2,4,2,4,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,4,2,4,2,2,2,2,2,4,4,2,4,2,4,2,2,2,2,2,2,4(...TRUNCATED)	0	D	0	0	[ "" ]	false		{ "nanos": 0, "seconds": 8 }	256,000,000
1354_F. Summoning Minions	"We have a tree with N vertices. The i-th edge connects Vertex A_i and B_i bidirectionally.\n\nTakah(...TRUNCATED)	{"input":["10\n10\n3 7\n1 4\n1 6\n5 5\n1 1\n3 9\n7 8\n1 2\n3 3\n7 10\n10\n2 4\n1 7\n3 4\n3 5\n2 8\n2(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["2 7\n4\n2\n1\n0\n-1\n-2\n-4\n131\n137\n2 7\n4\n2\n1\n0\n-1\n-2\n-4\n124\n123\n10 7\n-4\n-(...TRUNCATED)	2	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],"solution":["d(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	B	0	0	[ "dfs and similar", "greedy", "trees" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1490_G. Old Floppy Drive	"You are given an integer n. You have to apply m operations to it.\n\nIn a single operation, you mus(...TRUNCATED)	{"input":["1.1 3.4 2.5\n","1.9 1.8 1.7\n","2.0 2.0 2.0\n"],"output":["z^y^x\n","(x^y)^z\n","x^y^z\n"(...TRUNCATED)	{"input":["1 1\na\n10\n","1 20\naaaaaaaaaaaaaaaaaaaa\n924705 786913 546594 427698 741583 189683 3540(...TRUNCATED)	{"input":["5 2\nbacba","10 2\nbbbabbbaaa","10 3\nbbaabbbaab","5 2\nbacaa","10 2\nbaabbbaabb","10 2\n(...TRUNCATED)	2	11	{"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],"solution":["for q in range((...TRUNCATED)	{"language":[4,3,3,1,2,4,2,2,3,3,4,3,4,3,2,2,4,3,3,3,4,2,2,2,4,3,2,2,3,3,4,4,4,1,1,4,1,1,1,3,2,4,2,1(...TRUNCATED)	1,291		0	0	[ "greedy", "implementation" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
1091_G. New Year and the Factorisation Collaboration	"The bloodiest battle of World War II has started. Germany and its allies have attacked the Soviet u(...TRUNCATED)	{"input":["4 1111\n1 10 100 1000","3 70\n20 30 10","3 10\n20 30 10","2 10\n20 20"],"output":["4","2"(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["5 4 5\n1 2\n1 3\n2 4\n1 5","5 4 1\n1 2\n1 3\n3 4\n3 5","9 6 1\n1 2\n2 3\n3 4\n4 5\n5 6\n4(...TRUNCATED)	2	0	{"language":[4,3,1,2,2,3,2,3,3,3,3,3,3,3,3,3,3,3,3,2,3,1,2,1,3,3,2,3,4,3,4,4,2,4,2,3,3,3,3,3,3,2,2,3(...TRUNCATED)	{"language":[4,2,4,2,2,2,2,2,2,1,4,2,2,2,2,1,4,2,2,3,2,2,2,2,2,2,4,2,2,2,1,2,1,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED)	1,075		0	0	[ "bitmasks", "combinatorics", "dp" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
604_A. Uncowed Forces	"A substring of some string is called the most frequent, if the number of its occurrences is not les(...TRUNCATED)	{"input":["3 8 41\n1 3 2\n1 6 4 3 5 7 2 8\n","1 2 31\n1\n1 2\n","4 2 4\n4 2 3 1\n2 1\n"],"output":["(...TRUNCATED)	{"input":["3\n1 2 6\n","10\n7 7 7 7 7 7 7 7 7 7\n","76\n13 13 5 6 20 20 6 1 18 18 13 15 20 3 9 11 3 (...TRUNCATED)	{"input":["1\n3 1 2\n","1\n25 30 500\n","1\n5 4 7\n","3\n2 1 3\n3 4 6\n99995 9998900031 9998900031\n(...TRUNCATED)	5	9	{"language":[2,2,2,2,2,2,2,2,2,4,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,4,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,2,2,2,2,2,2,2,2,2,2,2,3,2,4,2,2,4,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,3,2(...TRUNCATED)	1,304	D	1,500	0	[ "greedy", "sortings" ]	false		{ "nanos": 0, "seconds": 1 }	64,000,000
70_C. Lucky Tickets	"After hard work Igor decided to have some rest.\n\nHe decided to have a snail. He bought an aquariu(...TRUNCATED)	{"input":["4 4 2\n2 3\n1 2\n1 3\n1 4\n","5 8 2\n2 1\n4 2\n5 4\n5 2\n4 3\n5 1\n4 1\n3 2\n","5 7 2\n1 (...TRUNCATED)	{ "input": [ "abcdabcdab\n5\n2 2 8 ab\n2 1 10 ab\n1 3 a\n1 4 b\n2 1 4 ab\n" ], "output": [ "1\n3\n2\n" ] }	{"input":["5 4","7 4","6 1","9 4","6 3","14 4","8 1","28 4","15 2","28 3","19 2","32 2","29 5","26 3(...TRUNCATED)	2	7	{"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":[4,3,4,1,2,4,3,2,2,4,4,4,1,4,4,3,4,3,4,1,2,2,4,4,2,3,4,2,4,2,4,2,2,4,2,4,3,2,2,4,4,2,4,2(...TRUNCATED)	1,107	E	0	0	[ "" ]	false	"あなたは友人と旅行に行きたいと考えています。ところが、浪費癖のある(...TRUNCATED)	{ "nanos": 0, "seconds": 3 }	512,000,000
p03771 AtCoder Grand Contest 012 - Camel and Oases	"You are given two permutations p and q, consisting of n elements, and m queries of the form: l1, r1(...TRUNCATED)	{ "input": [ "30 60 3 1\n", "20 0 15 5\n", "10 51 5 4\n" ], "output": [ "20 0 10\n", "0 0 20\n", "-1\n" ] }	{"input":["3 4\n1 1\n1 2\n1 3\n","1 100\n99 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22(...TRUNCATED)	{"input":["3\n2 3\n3 6\n1 2\n3\n2 3\n3 5\n2 2\n0","3\n2 3\n3 6\n2 2\n3\n3 3\n3 6\n2 2\n0","3\n2 1\n3(...TRUNCATED)	5	0	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,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,4(...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)	0	D	0	0	[ "greedy", "strings" ]	false		{ "nanos": 0, "seconds": 8 }	256,000,000
p02971 AtCoder Beginner Contest 134 - Exception Handling	"Artsem has a friend Saunders from University of Chicago. Saunders presented him with the following (...TRUNCATED)	{ "input": [ "2 1\n", "1 3\n", "10 2\n" ], "output": [ "2.333333333", "1.000000000", "15.938076892" ] }	{ "input": [], "output": [] }	{"input":["5\n90 94\n26 25\n64 84\n18 6\n20 96\n","5\n1912 1\n5 6\n999 1\n88 2\n11 100\n","5\n90 94\(...TRUNCATED)	2	0	{"language":[3,4,4,4,4,2,2,3,4,4,2,4,2,4,1,4,2,4,3,3,1,4,4,2,2,1,4,4,4,4,4,2,2,3,4,4,4,3,4,4,2,4,4,4(...TRUNCATED)	{"language":[2,0,2,3,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,0,0,2,2,2,2,2,3,2,2,2,2,2,2,2,3,2,2,2,2,2,2(...TRUNCATED)	464		0	2,800	[ "" ]	false		{ "nanos": 0, "seconds": 8 }	256,000,000
348_A. Mafia	"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":["2\n1 1\n100 100\n","5\n10 30 5 6 24\n10 41 7 8 24\n","4\n3 3 4 3\n4 7 6 5\n"],"output":["(...TRUNCATED)	{"input":["1 5000 4999\n","2 1 0\n","83 2813 123\n","93 2364 2364\n","100 1 0\n","21 862 387\n","1 1(...TRUNCATED)	{"input":["5 0\n884430748 884430748 182474629 708433020 708433020\n","5 2\n65390026 1454694739 65390(...TRUNCATED)	2	8	{"language":[4,2,3,3,2,4,4,2,4,2,4,3,3,3,2,4,3,2,4,2,3,2,4,2,4,4,3,3,3,4,3,4,2,4,3,3,4,4,4,2,3,4,3,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,0,2,2,4,2,1,0,0,2,2,4,2,2,2,2,2,2,2,4,0,2,2,2,2,0,1,2,2,2,2,2,0,2,4(...TRUNCATED)	0	E	0	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000