Datasets:

TheFactoryX
/

edition_1564_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
p03725 AtCoder Grand Contest 014 - Closed Rooms	"Artsem has a friend Saunders from University of Chicago. Saunders presented him with the following (...TRUNCATED)	{"input":["5\n1 2\n2 1\n5 10\n10 9\n20 1\n","5\n1 2\n2 1\n5 10\n10 9\n19 1\n"],"output":["4\n","3\n"(...TRUNCATED)	{"input":["21\n11 19 4 19 6 0 13 7 6 2 5 3 16 10 1 9 15 21 9 21 2\n","100\n57 85 27 81 41 27 73 10 7(...TRUNCATED)	{ "input": [], "output": [] }	2	7	{"language":[2,2,2,2,2,4,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(...TRUNCATED)	{ "language": [], "solution": [] }	464		0	0	[ "" ]	true		{ "nanos": 0, "seconds": 2 }	268,435,456
1043_A. Elections	"You are given an integer x represented as a product of n its prime divisors p_1 ⋅ p_2, ⋅ … (...TRUNCATED)	{"input":["1 5 3\n1 3\n1 1\n1 5\n","2 2 3\n1 2\n2 2\n2 1\n","4 3 6\n1 2\n1 3\n2 2\n2 3\n3 1\n3 3\n"](...TRUNCATED)	{ "input": [], "output": [] }	{"input":["10 23\n6 9 8 10 4 3 7 1 5 2\n7 2\n3 2\n2 4\n2 6\n7 5\n6 4\n10 7\n7 1\n6 8\n6 2\n8 10\n3 5(...TRUNCATED)	2	0	{"language":[4,2,2,2,2,2,4,2,4,2,2,4,2,4,2,2,4,4,2,3,2,2,2,4,4,4,2,2,2,2,4,4,2,2,4,2,4,3,2,2,4,4,4,2(...TRUNCATED)	{"language":[2,2,4,2,2,2,2,4,3,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,2,2,2,2,3,2,2,2,2,2(...TRUNCATED)	1,208	C	0	0	[ "constructive algorithms", "greedy", "sortings" ]	false		null	256,000,000
p02260 Selection Sort	"Takahashi is locked within a building.\n\nThis building consists of H×W rooms, arranged in H rows (...TRUNCATED)	{ "input": [ "5 5 10\n1 2 4 8 16\n", "3 4 11\n1 2 3 4\n" ], "output": [ "7\n", "6\n" ] }	{ "input": [], "output": [] }	{"input":["10\n-1 -1\n1 1\n1 1\n3 0\n4 1\n2 0\n3 1\n2 1\n5 0\n5 0\n8\n1 2 6\n2 3 7\n2 4 7\n1 3 4\n2 (...TRUNCATED)	3	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":["def solve():\n\(...TRUNCATED)	{"language":[2,2,3,2,4,4,2,4,4,4,2,3,3,2,2,2,2,3,2,3,4,4,2,4,2,2,4,3,2,4,4,3,2,2,3,4,4,3,3,4,3,2,2,3(...TRUNCATED)	0	B	0	0	[ "greedy", "strings" ]	false		{ "nanos": 0, "seconds": 1 }	512,000,000
lucky5	"Vasya commutes by train every day. There are n train stations in the city, and at the i-th station (...TRUNCATED)	{"input":["3\n-1 -1\n1 0\n2 0\n2\n1 1 3\n2 1 3\n","3\n-1 -1\n1 0\n1 1\n2\n2 2 3\n2 3 2\n"],"output":(...TRUNCATED)	{"input":["20 20\n00010110100100010111\n11110000001100101110\n01110101110001111000\n1011110100011111(...TRUNCATED)	{"input":["3703 4549\n433\n","2931 2881\n710\n","3762 947\n1073\n","4583 2774\n986\n","7 10\n1\n","1(...TRUNCATED)	6	6	{"language":[2,2,2,2,2,2,2,2,2,4,4,2,4,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,4,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)	147		0	1,000	[ "math" ]	true		{ "nanos": 0, "seconds": 2 }	256,000,000
737_A. Road to Cinema	"Serge came to the school dining room and discovered that there is a big queue here. There are m pup(...TRUNCATED)	{ "input": [ "3 5\n1 2 3\n1 3 2 3 1\n" ], "output": [ "12\n" ] }	{ "input": [], "output": [] }	{"input":["1 5000 2732\n","2 2 0\n","83 4122 123\n","19 862 387\n","100 843 30\n","45 1296 245\n","9(...TRUNCATED)	6	7	{"language":[4,4,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,3,2,2,4,4,4,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0	F	0	3,200	[ "constructive algorithms", "math" ]	false	"会津特産の貴金属であるアイヅニウムをリサイクルするＰＣＫ社は、全国(...TRUNCATED)	{ "nanos": 0, "seconds": 4 }	256,000,000
palin-pairs	"The blinds are known to consist of opaque horizontal stripes that can be rotated thus regulating th(...TRUNCATED)	{ "input": [ "0 1 1 1 1 0\n", "1 1 0 0 1000 1000\n" ], "output": [ "Yes\n", "No\n" ] }	{"input":["wwwww w\n8\nwwwww wwwwwwww\nwwwwwwww wwwwwwwww\nwwwwwwwww wwwwwwwwww\nw www\nwwwwwwwwww w(...TRUNCATED)	{"input":["2 5 1\n0 4 6\n0 2 7\n","1 1 1000000000\n0 0 1\n","5 200 10\n1 1 1\n1000000000 200 1000000(...TRUNCATED)	5	0	{"language":[1],"solution":["x=raw_input()\nl=len(x)\nif l>=3:\n l=l/2\n print x[l-1:l+2]\nels(...TRUNCATED)	{"language":[2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,4,4,1,1,2,4,2,1,2,4,2,2,2,4,2,4,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,117	D	0	1,700	[ "greedy", "implementation" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
235_D. Graph Game	"Two players are playing a game. The game is played on a sequence of positive integer pairs. The pla(...TRUNCATED)	{ "input": [ "5\n1 2 3 4 5\n", "5\n1 100 101 100 1\n", "5\n3 1 5 2 6\n" ], "output": [ "6", "102", "11" ] }	{"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":["81\n9 4\n6 8\n6 4\n4 6\n4 8\n9 10\n0 2\n5 4\n8 9\n7 7\n10 5\n4 4\n7 8\n3 7\n2 1\n5 5\n2 7(...TRUNCATED)	1	0	{"language":[2,3,3,2,4,1,3,2,4,2,2,3,2,3,4,4,3,3,3,4,2,3,3,2,2,3,4,2,3,2,4,3,4,2,3,4,2,2,3,2,4,4,2,3(...TRUNCATED)	{ "language": [], "solution": [] }	914		0	0	[ "" ]	false		{ "nanos": 0, "seconds": 6 }	1,073,741,824
dbyz15t	"Ramesh and Suresh were in the same class and got home work from their mathematics teacher. The Home(...TRUNCATED)	{ "input": [ "3 1 2 3\n", "1 3 2 3\n" ], "output": [ "5\n", "4\n" ] }	{"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\n2\n46\n99","3\n0\n7\n61","3\n25\n46\n24","3\n2\n60\n99","3\n0\n8\n24","3\n25\n46\n35",(...TRUNCATED)	2	10	{"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":[4,4,4,2,2,2,2,2,4,2,4,2,4,2,4,1,2,2,2,2,4,2,2,2,4,4,4,2,2,2,2,2,2,4,4,2,2,2,2,2,2,4,4,1(...TRUNCATED)	593	C1	1,000	2,400	[ "implementation", "strings" ]	false		{ "nanos": 0, "seconds": 4 }	256,000,000
p01046 Yu-kun Likes a lot of Money	"After his wife's tragic death, Eurydice, Orpheus descended to the realm of death to see her. Reachi(...TRUNCATED)	{ "input": [ "5\n1912 1\n5 6\n999 1\n88 2\n12 100\n" ], "output": [ "\n5\n2\n6\n4\n2115\n" ] }	{ "input": [], "output": [] }	{"input":["2 0\n1 2\n","2 1\n1 3\n","3 3\n1 2\n1 5\n2 3\n","2 0\n1 0\n","4 0\n1 0\n","4 0\n1 -1\n","(...TRUNCATED)	2	10	{"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":[3,2,2,2,4,2,3,2,4,1,4,3,4,4,4,4,3,3,3,4,4,2,4,3,2,3,3,3,2,2,3,2,2,4,2,4,4,3,2,4,2,1,2,4(...TRUNCATED)	0	D	0	800	[ "data structures", "dp", "greedy" ]	false		{ "nanos": 0, "seconds": 5 }	536,870,912
p00447 Searching Constellation	"Mole decided to live in an abandoned mine. The structure of the mine is represented by a simple con(...TRUNCATED)	{ "input": [ "5 1\nbacba", "10 2\nbbaabbbaab" ], "output": [ "aabca", "aaaabbaabb" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	9	{"language":[4,3,4,2,4,4,3,3,4,2,2,2,2,3,4,2,3,3,3,3,4,3,2,4,2,3,4,4,3,4,3,4,3,2,2,2,3,2,2,2,3,3,2,2(...TRUNCATED)	{"language":[2,3,4,3,3,4,2,2,3,3,2,2,2,3,3,3,2,2,3,3,3,4,2,3,2,2,3,2,3,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2(...TRUNCATED)	0		500	0	[]	false		{ "nanos": 0, "seconds": 2 }	1,073,741,824