Datasets:

TheFactoryX
/

edition_1111_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
1374_B. Multiply by 2, divide by 6	"The Chef likes to stay in touch with his staff. So, the Chef, the head server, and the sous-chef al(...TRUNCATED)	{"input":["1\n1 1 0 1 0 0 0 1 0 1\n3 4 5 6 7 8 9 -2 -3 4 -2","3\n1 1 1 1 1 1 0 0 1 1\n0 1 0 1 1 1 1 (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["8\n0 -1\n3 2\n6 2\n8 6\n6 5\n7 7\n0 4\n3 4\n8\n0 0\n5 3\n5 2\n4 1\n6 1\n8 6\n6 4\n2 4\n0"(...TRUNCATED)	2	7	{"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": [], "solution": [] }	0	B	0	0	[ "graphs" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
p01262 Adaptive Time Slicing Quantization	"You are given a permutation p_1,p_2,...,p_N consisting of 1,2,..,N. You can perform the following o(...TRUNCATED)	{ "input": [ "4\n100 100 100 200\n", "3\n100 200 100\n" ], "output": [ "NO\n", "YES\n" ] }	{"input":["24\n9 83\n90 31\n83 3\n83 3\n21 31\n83 3\n32 31\n12 21\n31 21\n90 32\n32 21\n12 9\n12 31\(...TRUNCATED)	{"input":["100\n95 54 23 27 51 58 94 34 29 95 53 53 8 5 64 32 17 62 14 37 26 95 27 85 94 37 85 72 88(...TRUNCATED)	5	8	{"language":[2,3,4,2,4,2,4,2,2,3,1,2,3,4,4,4,4,4,3,4,3,4,1,4,1,1,4,3,3,4,3,4,3,3,1,2,3,4,4,2,3,2,2,2(...TRUNCATED)	{"language":[4,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,2,2,2,2,2,2,2,4,2,2,2,2,2(...TRUNCATED)	0		2,500	1,800	[ "divide and conquer", "fft", "greedy", "math", "number theory" ]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
765_D. Artsem and Saunders	"Bessie and the cows have recently been playing with \"cool\" sequences and are trying to construct (...TRUNCATED)	{ "input": [ "1\n3\n1 3 2\n\nSAMPLE" ], "output": [ "1 2 3" ] }	{ "input": [], "output": [] }	{"input":["1\n5 39\n1 2\n3 4\n5 6\n7 8\n1 9\n3 10\n3 11\n5 12\n5 13\n7 14\n7 15\n9 2\n10 2\n11 2\n12(...TRUNCATED)	2	11	{"language":[2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,3,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(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,4,3,2,2,2,2,2,4,2,2,3,2,2,2,2,3,2,2,4,2,2,2,2,2,2,2,2,3,2,2,2(...TRUNCATED)	1,354		0	0	[ "data structures", "implementation" ]	false		null	256,000,000
p01086 Short Phrase	"Computation of the date either previous or forthcoming dates is quiet easy. But it is quiet difficu(...TRUNCATED)	{"input":["3 2\n1 2\n2 3\n","3 3\n1 2\n2 3\n3 1\n","8 12\n1 2\n2 3\n3 4\n4 1\n1 3\n2 4\n3 5\n3 6\n5 (...TRUNCATED)	{"input":["30 2\n26 11 22 16 14 29 16 14 8 23 21 22 11 24 15 23 22 1 11 20 23 29 13 19 19 15 13 2 7\(...TRUNCATED)	{"input":["1\n3\nS10\n111\n00F\n","1\n5\nS0000\n10000\n00000\n00000\n0000F\n","1\n3\nS10\n110\n11F\n(...TRUNCATED)	2	7	{"language":[3,2,2,2,2,2,4,1,2,4,2,2,4,2,2,2,2,2,2,4,4,2,3,3,2,2,4,3,2,4,2,2,2,1,2,2,2,2,4,2,2,4,4,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,2,2,3,2,2,2,2,2,2,2(...TRUNCATED)	89		0	2,400	[ "brute force", "sortings" ]	false	"Problem\n\nKND君は会津大学に在籍する学生プログラマである。彼の胸元はと(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	256,000,000
526_A. King of Thieves	"problem\n\nGiven $ N $ different natural numbers $ a_i $. I decided to make a pair by choosing a di(...TRUNCATED)	{ "input": [ "3\n1\n0 1\n0 0\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1" ], "output": [ "yes\nyes\nno\n" ] }	{ "input": [], "output": [] }	{"input":["0 1681261333\n","10 4\n","16384 40642166\n","727373493 403495785\n","62914844 907959152\n(...TRUNCATED)	2	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],"solution":["#include (...TRUNCATED)	{"language":[2,2,2,4,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,4,2,2,2,2,2(...TRUNCATED)	855		0	2,000	[ "dfs and similar", "graphs" ]	false		null	256,000,000
p01535 Markup language has Declined	"A permutation — is a sequence of length n integers from 1 to n, in which all the numbers occur ex(...TRUNCATED)	{"input":["2 2\n6 3\nMonday Tuesday Wednesday\n8 4\nThursday Friday Saturday Sunday\n2 2\n7 3\nMonda(...TRUNCATED)	{"input":["2\n-492673762 -496405053\n","13\n-958184557 -577042357 -616514099 -553646903 -719490759 -(...TRUNCATED)	{"input":["11\nadd 1\nsum\nadd 2\nsum\nadd 3\nsum\nadd 4\nsum\nadd 6\nsum\nadd 6\n","6\nadd 4\nadd 7(...TRUNCATED)	5	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],"solution":["def solve():\n\(...TRUNCATED)	{"language":[2,2,3,2,3,2,2,0,4,0,0,2,2,4,2,3,2,2,3,3,3,2,0,2,3,2,2,2,3,2,0,0,2,3,2,3,3,0,2,0,2,0,3,3(...TRUNCATED)	0		2,500	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
brcktsrm	"You have a Petri dish with bacteria and you are preparing to dive into the harsh micro-world. But, (...TRUNCATED)	{"input":["5\n3\n1 6\n1 7\n1 5\n2\n1 4\n1 3\n3\n1 10\n3 5\n2 3\n3\n1 15\n2 4\n1 10\n1\n1 100\n"],"ou(...TRUNCATED)	{"input":["7 2\n-10 0 ? 1 ? 2 10\n","1 1\n0\n","5 1\n-3 -2 -1 0 1\n","7 1\n-4 ? ? ? ? ? 2\n","17 1\n(...TRUNCATED)	{"input":["50 50\n75 54 23 37 28 23 69 75 5 62 3 11 96 100 13 50 57 51 8 90 4 6 84 27 11 89 95 81 10(...TRUNCATED)	2	0	{"language":[2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,4,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,525		1,750	1,300	[ "combinatorics", "number theory" ]	true		null	0
494_D. Birthday	"Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits whe(...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":["11 20\n1 2\n2 7 6\n1 7\n4 10 9 3 2\n2 9 2\n1 3\n0\n0\n3 1 6 7\n4 11 7 5 6\n2 2 8\n4\n","5(...TRUNCATED)	{"input":["5 2 4 15\nhhhwh\n","2 8 5 1000000000\nwh\n","1 3 3 3\nw\n","10 2 3 32\nhwwhwhwwhh\n","7 1(...TRUNCATED)	2	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,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0		0	2,300	[ "math" ]	false		{ "nanos": 0, "seconds": 2 }	268,435,456
p00573 Commuter Pass	"Today Peter has got an additional homework for tomorrow. The teacher has given three integers to hi(...TRUNCATED)	{"input":["5\n10 20 30 40 50\n1 1 1 1 1\n","8\n4264 4921 6321 6984 2316 8432 6120 1026\n4264 4921 63(...TRUNCATED)	{ "input": [ "4\n4568\n4545992\n9265642\n4592886" ], "output": [ "13598\n27154740\n58212156\n27455323\n" ] }	{"input":["7\n0 1\n1 2\n2 3\n3 0\n2 4\n2 5\n1 6\n","15\n0 1\n1 2\n2 3\n3 4\n4 5\n5 0\n0 6\n0 7\n2 8\(...TRUNCATED)	2	10	{"language":[3,3,1,4,2,4,2,4,3,3,4,3,2,2,2,3,1,3,2,4,1,4,3,3,3,1,3,2,3,3,2,2,4,4,3,4,2,2,3,3,3,3,3,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,0,2,2,2,0,3,2,2,3,2,4,0,2,2,2,2,0,2,2,2,2,4,2,2,2,2,2,0,2,2,2,2,2,2,3,2,2(...TRUNCATED)	1,037		3,000	0	[ "geometry", "math" ]	false		{ "nanos": 0, "seconds": 1 }	64,000,000
1065_F. Up and Down the Tree	"Bob is travelling from one city to another. In his way, he sees many other cities pass by. What he (...TRUNCATED)	{ "input": [ "10 5 5 5\n", "3 0 0 2\n" ], "output": [ "9\n", "0\n" ] }	{"input":["6\n396640239 62005863 473635171 329666981 510631133 207643327\n","4\n363034183 741262741 (...TRUNCATED)	{"input":["3\ncan you meet me ouuside ccd today\na\nthis year hard kaur is coming to entertain us","(...TRUNCATED)	2	2	{"language":[2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,4,2,4(...TRUNCATED)	{"language":[2,2,2,4,2,2,4,2,4,2,4,2,2,2,1,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,4,4,2,4,2,2,2,2,2,2(...TRUNCATED)	0	A	2,000	1,100	[ "brute force", "math", "number theory" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000