Datasets:

TheFactoryX
/

edition_0726_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
687_A. NP-Hard Problem	"Story\n\nAt UZIA High School in the sky city AIZU, the club activities of competitive programming a(...TRUNCATED)	{"input":["6 2\n2 3 0 5 6 0\n","6 2\n0 0 1 0 4 5\n","6 1\n2 0 4 0 6 0\n","4 1\n0 0 0 0\n"],"output":(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["5\n0 4\n3 4\n1 2\n2 0\n0 0\n","10\n1000 0\n100 0\n0 25\n100 50\n100 51\n99 102\n1001 102\(...TRUNCATED)	2	12	{"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,4,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,2,2,2,1,2,1,3,2,4,3,4,2,4,2,2,2,2,4,3,4,4,4,2,2,4,1,4,4,4,2,4,2,4,2,2,2,2,3,1,2,2,2,4(...TRUNCATED)	0		1,000	0	[ "brute force", "geometry", "math" ]	false		{ "nanos": 0, "seconds": 4 }	134,217,728
1475_D. Cleaning the Phone	"At the big break Nastya came to the school dining room. There are n pupils in the school, numbered (...TRUNCATED)	{"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\n131\n123\n10 7\n-4\n-(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["5 0\n884430748 884430748 182474629 708433020 708433020\n","5 2\n65390026 1454694739 65390(...TRUNCATED)	2	7	{"language":[2,2,2,4,2,4,4,4,2,2,2,4,4,4,2,2,2,2,2,4,2,2,4,4,3,2,2,2,4,2,2,2,2,4,4,2,2,2,2,4,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,4,2,2,4,4,2,2,2,2,4,2,4,2,2,2,4,2,2,2,3,2,2,2,2,2,2,4,2,2,4,2,2,2,4,2,2,2,2,2,2(...TRUNCATED)	536	B	0	0	[ "graphs" ]	false	"\n\n問題\n\n$N$ 個の相違なる自然数 $a_i$ が与えられる。与えられた自然数(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	0
p00035 Is it Convex?	"You are given an array a of n integers.\n\nYou want to make all elements of a equal to zero by doin(...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": [], "output": [] }	{"input":["xxoo\no.oo\nx...\nx..x\n","oo.x\nxo.o\nxx.o\n.oxx\n","xo..\nxo.x\no.xo\nxoox\n","..ox\n..(...TRUNCATED)	5	11	{"language":[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,4,2,2,2,2,2,2,2,2,2,2,2,4,2,4(...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,4,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	E	0	2,100	[ "binary search", "brute force", "geometry", "math" ]	false		null	256,000,000
464_D. World of Darkraft - 2	"At a geometry lesson Gerald was given a task: to get vector B out of vector A. Besides, the teacher(...TRUNCATED)	{"input":["2\n2 1 4 3\n4\n1 2 0 2\n","1\n1 2\n3\n0 1 1\n"],"output":[" (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1\n3\nS10\n111\n00F\n","1\n5\nS0000\n10000\n00000\n00000\n0000F\n","1\n3\nS10\n110\n11F\n(...TRUNCATED)	2	8	{"language":[2,2,4,2,4,4,2,3,2,3,3,4,3,2,4,3,2,2,3,3,4,2,2,2,2,3,3,2,2,4,4,4,4,3,3,2,3,3,3,2,2,2,3,3(...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)	0	D	0	2,100	[ "brute force", "implementation" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
p02365 Minimum-Cost Arborescence	"Roy is going through the dark times of his life. Recently his girl friend broke up with him and to (...TRUNCATED)	{ "input": [ "1\n3\n1 3 2\n\nSAMPLE" ], "output": [ "1 2 3" ] }	{"input":["605 297 -251700323 -366763764 -445828791 325081312\n","14 9 44 45 -50 -9\n","18 17 -26078(...TRUNCATED)	{ "input": [], "output": [] }	6	0	{"language":[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,1,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)	{"language":[2,4,4,3,4,2,3,2,2,4,4,1,2,1,2,4,3,4,3,3,4,3,1,3,2,4,2,3,3,3,3,2,4,3,2,3,3,4,2,2,3,4,4,2(...TRUNCATED)	405		0	1,400	[ "greedy", "sortings" ]	false		null	64,000,000
519_B. A and B and Compilation Errors	"Let us consider sets of positive integers less than or equal to n. Note that all elements of a set (...TRUNCATED)	{"input":["1 8\n2 8 81\n","2 30\n20 30 80\n3 9 85\n","4 319\n63 79 89\n79 97 91\n75 87 88\n75 90 83\(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	0	{"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":[2,0,2,2,2,2,0,2,4,2,2,2,0,0,2,2,2,2,2,2,2,0,2,2,2,2,2,2,0,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,374	B	0	0	[ "*special", "implementation" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
105_C. Item World	"Problem Statement\n\nYou are given a list of $N$ intervals. The $i$-th interval is $[l_i, r_i)$, wh(...TRUNCATED)	{ "input": [ "2\n17 25\n4\n17 45\n4\n17 25\n7\n19 35\n0" ], "output": [ "250\n1300" ] }	{"input":["1 1\na\n10\n","1 20\naaaaaaaaaaaaaaaaaaaa\n924705 786913 546594 427698 741583 189683 3540(...TRUNCATED)	{"input":["51\n1732111733638718702525811518175029394157760329139501\n","55\n815096522892298714932212(...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],"solution":["d(...TRUNCATED)	{"language":[2,2,2,3,4,2,2,4,2,2,3,2,3,2,2,2,4,2,2,2,2,2,3,3,2,3,3,2,4,2,2,2,2,2,3,2,2,2,2,1,3,2,2,2(...TRUNCATED)	1,170		0	1,000	[ "number theory" ]	false		{ "nanos": 0, "seconds": 2 }	0
354_B. Game with Strings	"You are given a huge decimal number consisting of n digits. It is guaranteed that this number has n(...TRUNCATED)	{"input":["4 4\n100 100 100 100\n1 2\n2 3\n2 4\n3 4\n","4 3\n10 20 30 40\n1 4\n1 2\n2 3\n","7 10\n40(...TRUNCATED)	{"input":["2 1\n1 1\n","2 3\n3 1\n","100 5\n5 5 2 4 5 4 4 4 4 2 5 3 4 2 4 4 1 1 5 3 2 2 1 3 3 2 5 3 (...TRUNCATED)	{"input":["2 0\n1 2 2","4 1\n4 2 2","2 0\n2 2 2","2 0\n4 2 2","4 0\n4 2 2","4 0\n4 2 1","6 0\n4 2 1"(...TRUNCATED)	2	0	{"language":[3,2,4,4,2,4,4,4,3,3,3,2,3,3,4,3,3,2,4,4,2,4,4,1,3,1,4,3,1,1,2,3,3,4,2,1,2,2,4,2,2,4,2,2(...TRUNCATED)	{"language":[3,3,2,1,4,1,2,4,3,2,2,2,3,3,2,2,3,3,3,2,4,2,2,1,4,4,2,3,2,2,2,2,3,3,2,3,2,4,2,2,2,2,3,4(...TRUNCATED)	0	A	0	0	[ "brute force", "implementation" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
25_D. Roads not only in Berland	"Polycarp has n coins, the value of the i-th coin is a_i. It is guaranteed that all the values are i(...TRUNCATED)	{ "input": [ "2\n1 2\n1 2\n" ], "output": [ "\n12\n" ] }	{ "input": [], "output": [] }	{"input":["2 3 3\n.#\nS.","7 8 2\n\n\n...##\n###S\n.#.##\n.###","7 7 2\n\n\n##...\nS###\n.#.##\n.###(...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],"solution":["for q in range((...TRUNCATED)	{ "language": [], "solution": [] }	0	C	0	0	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	1,073,741,824
203_E. Transportation	"Vasya's telephone contains n photos. Photo number 1 is currently opened on the phone. It is allowed(...TRUNCATED)	{ "input": [ "100 5\n1\n23\n45\n67\n89", "10 2\n4\n5", "6 1\n3" ], "output": [ "608200469", "0", "4" ] }	{"input":["1\n1\n1\n1\n1\n1\n1\n","1\n3\n2 3 1\n1 2\n2 3\n1\n1\n1\n2\n","2\n6\n5 3 2 4 1 6\n1 2\n1 3(...TRUNCATED)	{"input":["000 0","10 3\n8 7 000\n7 9 100\n9 8 100","4 3\n2 1 1\n2 3 3\n3 4 2","10 3\n8 7 000\n7 9 1(...TRUNCATED)	2	9	{"language":[1,1,1,1,1,1,1,1,1,1,1,1],"solution":["for _ in xrange(input()):\n\tn,c,m=map(int,raw_in(...TRUNCATED)	{"language":[4,2,2,2,2,2,2,4,2,3,2,2,4,2,2,2,2,4,4,2,2,2,2,2,2,2,2,4,2,2,4,3,3,2,2,2,2,4,3,4,2,2,2,4(...TRUNCATED)	0	D	2,000	800	[ "" ]	false		null	512,000,000