Datasets:

TheFactoryX
/

edition_0879_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	time_limit dict	memory_limit_bytes int64 0 1.07B
260_B. Ancient Prophesy	"Given is a positive integer N. How many tuples (A,B,C) of positive integers satisfy A \\times B + C(...TRUNCATED)	{ "input": [ "5 10\n2 1 2 1 2\n2\n2 4\n4 5\n" ], "output": [ "3\n3\n" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	7	{"language":[3,3,3,3,3,3,3,3,3,3,2,3,3,3,1,3,3,3,3,3,3,3,3,3,3,3,4,3,3,3,3,3,3,1,3,3,1,3,3,3,4,3,3,3(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,4,4,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	A	2,750	2,500	[ "bitmasks", "brute force", "data structures", "string suffix structures", "strings" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
p00032 Plastic Board	"There are N oases on a number line. The coordinate of the i-th oases from the left is x_i.\n\nCamel(...TRUNCATED)	{ "input": [ "5 10 25 12 4 1 \n3 16 28 100\n\nSAMPLE" ], "output": [ "4 12 10 \n100 28 16" ] }	{ "input": [], "output": [] }	{"input":["5\n4\n1 2 3 4\n5 10 15 20\n4\n1 2 1 2\n5 10 15 20\n4\n2 2 4 1\n2 8 19 2\n2\n1 1\n6 9\n1\n(...TRUNCATED)	5	0	{"language":[2,4,2,4,4,2,2,2,4,4,3,2,4,3,3,4,2,4,2,4,3,4,3,4,3,2,1,4,3,1,3,3,2,2,3,3,2,4,2,3,2,2,4,4(...TRUNCATED)	{ "language": [], "solution": [] }	0	A	2,000	0	[ "dfs and similar", "dsu", "math" ]	false	{ "nanos": 0, "seconds": 2 }	0
give-me-my-test-monk	"This is the hard version of the problem. The difference between the versions is in the constraints (...TRUNCATED)	{ "input": [ "3\ncode\ncoder\ncoding\n2\n1 3 code\n1 3 co\n\nSAMPLE" ], "output": [ "2 \n3" ] }	{ "input": [], "output": [] }	{"input":["3\n1\n2 3\n2\n4 5\n5 6\n2\n2 3\n1 5","3\n1\n2 3\n2\n4 5\n5 6\n1\n2 3\n3 5","3\n1\n1 3\n2\(...TRUNCATED)	2	10	{"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,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)	720		1,000	0	[ "greedy", "implementation", "sortings", "strings" ]	false	{ "nanos": 0, "seconds": 2 }	268,435,456
195_A. Let's Watch Football	"In the intergalactic empire Bubbledom there are N planets, of which some pairs are directly connect(...TRUNCATED)	{ "input": [ "1000 352 146\n", "10 1 14\n", "20 10 50\n" ], "output": [ "1108\n", "1\n", "0\n" ] }	{ "input": [], "output": [] }	{"input":["13372 2590 2818\n","78 28 44\n","9178 2255 2041\n","6571 10325 8965\n","6151 6148 1348\n"(...TRUNCATED)	2	9	{"language":[4,4,3,4,3,3,3,3,4,4,3,1,4,3,3,3,3,4,2,3,3,3,3,4,3,3,3,3,4,3,3,2,4,3,3,4,2,2,3,3,4,3,3,3(...TRUNCATED)	{"language":[0,0,0,0,2,0,0,2,2,1,1,0,2,4,0,2,0,0,0,0,0,0,2,2,0,0,0,2,2,2,3,2,2,2,1,3,4,2,0,2,2,0,2,2(...TRUNCATED)	470		0	0	[]	false	{ "nanos": 0, "seconds": 6 }	256,000,000
subtraction-game-theory-1	"Arpa is taking a geometry exam. Here is the last problem of the exam.\n\nYou are given three points(...TRUNCATED)	{"input":["(((#)((#)\n","#\n","()((#((#(#()\n","(#)\n"],"output":["1\n2\n","-1\n","1\n1\n3\n","-1\n"(...TRUNCATED)	{"input":["1 10\n778084 -205153\n778001 -205093\n778155 -205118\n778168 -204997\n778066 -205141\n778(...TRUNCATED)	{"input":["341143514535\n158\n143565553551655311343411652235654535651124615163\n551544654451431564\n(...TRUNCATED)	3	11	{"language":[3,2,2,4,3,4,4,3,3,3,2,1,1,2,3,2,4,4,3,4,3,4,3,2,3,4,1,3,1,3,3,3,1,2,3,1,2,4,3,4,1,3,3,3(...TRUNCATED)	{"language":[2,2,2,2,2,4,2,2,2,2,0,2,2,0,0,2,2,2,4,2,2,0,2,4,3,2,2,2,4,2,2,3,2,2,0,0,2,2,2,2,2,0,2,2(...TRUNCATED)	0		0	2,800	[ "constructive algorithms", "games", "interactive" ]	false	{ "nanos": 500000000, "seconds": 2 }	0
playing-with-substrings	"problem\n\nGiven $ N $ different natural numbers $ a_i $. I decided to make a pair by choosing a di(...TRUNCATED)	{ "input": [ "4\n1 2 1 16\n", "3\n6 7 14\n" ], "output": [ "4\n", "2\n" ] }	{ "input": [], "output": [] }	{"input":["5\n42665793 93310343 856080769 176604645 248258165\n10\n1 5 141156007\n2 5 5 3\n2 4 4 2\n(...TRUNCATED)	2	10	{"language":[2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,2,2,4,4,4,4,2,3,2,4,1,4,4,2,4,4,2,4,3,2,2,3,3,2,2,1,4,2,3,4,3,2,2,1,2,2,2,4,2,2,4,2,2(...TRUNCATED)	38		1,000	2,200	[ "constructive algorithms", "graphs" ]	false	{ "nanos": 0, "seconds": 2 }	512,000,000
1244_C. The Football Season	"Coach Ankit is forming a team for the Annual Inter Galactic Relay Race. He has N students that trai(...TRUNCATED)	{ "input": [ "3\n3 2 2\n", "4\n2 2 2 2\n" ], "output": [ "4\n", "3\n" ] }	{"input":["100\n0 0 57 121 57 0 19 251 19 301 19 160 57 578 664 57 19 50 0 621 91 5 263 34 5 96 713 (...TRUNCATED)	{ "input": [], "output": [] }	6	0	{"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)	{ "language": [], "solution": [] }	709		0	1,800	[ "graphs", "shortest paths" ]	false	null	1,073,741,824
p02120 Cluster Network	"At the big break Nastya came to the school dining room. There are n pupils in the school, numbered (...TRUNCATED)	{ "input": [ "5\n2 2 3 2 2\n", "5\n1 1 1 5 1\n" ], "output": [ "5\n", "5\n" ] }	{"input":["777 2\n","2 2\n","99900 1\n","50000 1\n","2 5\n","100000 99\n","22222 22\n","100000 4\n",(...TRUNCATED)	{"input":["3 4\n3 2 1\n","5 97\n1 10 76 97 2\n","2 16\n12 4\n","2 100\n132 1\n","5 76\n1 10 50 100 2(...TRUNCATED)	1	0	{"language":[4,2,3,3,4,4,4,2,2,2,2,3,4,3,2,4,3,4,4,2,4,4,3,2,4,3,4,3,4,4,3,3,2,4,2,4,2,4,4,3,4,4,2,2(...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	C	0	3,000	[ "dfs and similar", "interactive", "trees" ]	false	{ "nanos": 0, "seconds": 2 }	134,217,728
p01974 Pigeonhole principle	"Two players are playing a game. The game is played on a sequence of positive integer pairs. The pla(...TRUNCATED)	{"input":["3 10 10\n1\n1 1 1\n1\n3 3 3\n1\n5 5 5\n0 1 0\n1 0 0\n0 1 0","4 59 40\n1\n7 6 3\n1\n10 3 9(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1 1\n-1\n","5 1\n-3 -2 -1 0 0\n","7 1\n-7 ? ? ? ? ? 2\n","3 2\n-5 ? 0\n","7 4\n-10 0 ? 1 (...TRUNCATED)	2	11	{"language":[4,3,2,4,3,4,2,4,4,2,3,3,2,3,3,3,3,3,4,2,3,2,3,2,4,4,2,4,3,2,4,3,2,4,4,3,2,2,4,3,3,4,2,4(...TRUNCATED)	{"language":[3,2,2,2,3,3,2,2,3,0,3,2,3,2,3,3,0,4,2,2,2,3,2,2,0,2,4,4,0,2,0,3,2,2,3,3,3,3,2,2,0,0,2,2(...TRUNCATED)	1,439		0	2,200	[ "bitmasks", "dp" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
949_C. Data Center Maintenance	"You're trying to set the record on your favorite video game. The game consists of N levels, which m(...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":["4\n39 20\n183 11\n551 27\n85 16","8\n4 65\n5 12\n7 24\n9 38\n12 24\n14 10\n65 75\n31 26"](...TRUNCATED)	{"input":["1\n5 3\n200 12 9","1\n9 3\n200 12 9","1\n7 3\n200 12 9","1\n7 3\n141 12 9","1\n9 0\n141 1(...TRUNCATED)	2	0	{"language":[2,2,2,2,2,2,4,4,2,2,4,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,3,2,2,2,1,4,3,2,2,1,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,1,2,4,1,4,3,1,2,4,3,1,4,2,2,3,2,4,2,2,4,4,3,4,3,2,4,1,1,4,1,3,4,2,3,3,1,3,2,4,2,4,4(...TRUNCATED)	1,466		0	1,100	[ "dfs and similar", "graphs", "trees" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000