Datasets:

TheFactoryX
/

edition_2867_deepmind-code_contests-readymade

name large_stringlengths 4 70	description large_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 large_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
roys-life-cycle	"We have a sandglass consisting of two bulbs, bulb A and bulb B. These bulbs contain some amount of (...TRUNCATED)	{ "input": [ "2\nSHILPA\nAAMIR\nMATT\nDENISE" ], "output": [ "ENEMIES\nLOVE" ] }	{ "input": [], "output": [] }	{"input":["14 2 2012","14 4 2012","14 4 1177","20 4 1177","20 4 1433","20 3 1433","14 3 1433","14 3 (...TRUNCATED)	2	11	{"language":[1,1,1,1],"solution":["t=int(raw_input())\ndef z(x):\n i=5\n c=0\n while x/i>=1(...TRUNCATED)	{"language":[4,2,4,3,4,3,2,2,3,3,2,4,4,3,3,4,4,4,2,2,2,4,3,3,2,3,2,4,3,3,1,2,4,4,3,3,3,2,3,2,2,4,4,4(...TRUNCATED)	0	D2	1,750	0	[ "brute force", "constructive algorithms", "math" ]	false	null	256,000,000
1208_D. Restore Permutation	"One foggy Stockholm morning, Karlsson decided to snack on some jam in his friend Lillebror Svantens(...TRUNCATED)	{ "input": [ "2\nxa\nay\n", "2\nab\ncd\n", "3\naab\nbcb\nbac\n" ], "output": [ "FIRST\n", "DRAW\n", "DRAW\n" ] }	{"input":["0 -2 0\n","1223 -23532 1232\n","0 1 0\n","-1 10 20\n","0 3431 43123\n","-50000 100000 -50(...TRUNCATED)	{"input":["10\n2 3 1 5 6 4 2 10 7 7\n5\n10 1\n5 7\n19 6\n1 1\n10 8\n","10\n2 3 1 5 6 4 1 10 7 7\n5\n(...TRUNCATED)	2	8	{"language":[2,2,2,4,2,2,3,3,4,3,4,3,3,2,4,4,1,3,4,4,1,3,2,4,2,2,2,4,3,3,3,2,4,2,2,3,1,2,2,4,3,4,4,3(...TRUNCATED)	{"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,311		0	2,100	[ "games", "graphs" ]	false	{ "nanos": 0, "seconds": 8 }	1,073,741,824
1455_F. String and Operations	"Once upon a time, there was a king who loved beautiful costumes very much. The king had a special c(...TRUNCATED)	{"input":["1 1 1\n\n0\n\n0\n\n1337\n\n0\n\n0\n\n0\n","1 1 1\n\n1337\n\n1337\n\n1337\n\n1337\n\n1337\(...TRUNCATED)	{"input":["21 3 -3 3 -3 3 -3 19 3 -3 3 -3 3 -3 19 3 -3 3 -3 3 -3 19","2 8 -100\n5 -1000 5 1000 500 2(...TRUNCATED)	{ "input": [], "output": [] }	2	7	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include<iostream>\n#include<algo(...TRUNCATED)	{"language":[2,2,3,2,0,3,0,3,2,0,3,4,3,4,3,3,0,2,3,2,2,2,2,2,3,4,3,2,3,0,3,2,2,0,2,3,3,3,2,3,4,3,0,3(...TRUNCATED)	0	E	0	0	[ "" ]	false	null	256,000,000
1070_C. Cloud Computing	"Bearland is a dangerous place. Limak can’t travel on foot. Instead, he has k magic teleportation (...TRUNCATED)	{"input":["5 4 10 1 6\n1 1 5\n1 5 5\n1 3 2\n1 5 2\n2 1\n2 2\n","5 2 2 1 8\n1 1 2\n1 5 3\n1 2 1\n2 2\(...TRUNCATED)	{"input":["7 20\n4 6\n6 7\n4 5\n1 2\n2 4\n1 7\n3 5\n2 1\n6 2\n6 1\n7 3\n3 2\n3 6\n3 1\n3 4\n2 5\n1 6(...TRUNCATED)	{"input":["30 35 4 30\n14 2 7\n22 23 4\n5 26 3\n28 4 3\n7 5 29\n19 15 2\n11 20 12\n1 22 9\n30 21 24\(...TRUNCATED)	2	11	{"language":[2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,4,2,2,2,4,2,2,2,4,2,4,2,2,2,2,2,2,4,2,2,2,4,2,2,2,2,4,2,2(...TRUNCATED)	{"language":[2,1,2,2,2,2,2,2,0,2,4,2,2,3,2,2,2,2,2,2,2,4,3,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,4,0,2(...TRUNCATED)	741		0	0	[ "bitmasks", "brute force", "fft", "strings", "trees" ]	false	{ "nanos": 0, "seconds": 2 }	0
586_F. Lizard Era: Beginning	"A permutation — is a sequence of length n integers from 1 to n, in which all the numbers occur ex(...TRUNCATED)	{ "input": [ "2\n\nSAMPLE" ], "output": [ "3\n" ] }	{"input":["8\n0 1\n1 0\n0 1\n1 1\n0 1\n1 0\n0 1\n1 0\n","8\n1 0\n1 0\n1 0\n0 1\n0 1\n1 1\n1 1\n0 1\n(...TRUNCATED)	{"input":["6 4 3\n0 1 2\n2 3 0\n0 4 5\n1 4 4\n1 2 2\n0 4 2\n","5 1 7\n0 4 1\n0 10 5\n9 0 2\n9 0 0\n9(...TRUNCATED)	2	12	{"language":[1,3,3,4,1,1,4,3,3,2,3,2,4,3,1,4,2,2,2,3,4,4,3,3,4,3,1,2,4,3,1,3,2,1,3,3,1,4,4,1,3,2,3,2(...TRUNCATED)	{"language":[4,1,2,2,2,1,2,2,2,4,2,3,2,4,4,2,4,2,4,2,2,4,4,2,4,3,2,2,2,2,4,2,4,2,1,2,2,4,2,2,2,2,2,2(...TRUNCATED)	0	B	500	2,900	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1170_E. Sliding Doors	"The Chef likes to stay in touch with his staff. So, the Chef, the head server, and the sous-chef al(...TRUNCATED)	{"input":["2 1 0\n","2 2 4\n0 1 2 1\n0 1 2 1\n1 2 1 0\n1 1 1 2\n"],"output":["FIRST\n1 0 1 1\n","SEC(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["30\n10 1 8 10 2 6 37 7 3 7 1 3 1 1 14 2 5 19 4 1 13 3 5 6 1 5 1 1 23 1\n98 4 43 41 56 58 (...TRUNCATED)	3	11	{"language":[2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2(...TRUNCATED)	{"language":[4,4,4,1,2,4,1,4,2,4,1,4,2,1,1,2,1,4,2,3,4,3,3,4,2,4,2,2,4,4,3,1,2,2,2,3,4,3,4,2,3,3,2,2(...TRUNCATED)	0		2,000	2,500	[ "brute force", "constructive algorithms", "greedy", "math" ]	false	null	256,000,000
p03664 AtCoder Regular Contest 078 - Mole and Abandoned Mine	"Petya studies positional notations. He has already learned to add and subtract numbers in the syste(...TRUNCATED)	{"input":["6 7\n2 3\n3 4\n4 2\n1 2\n1 5\n5 6\n6 1\n","3 3\n1 2\n2 3\n3 1\n","5 6\n1 2\n2 3\n2 4\n4 3(...TRUNCATED)	{"input":["4\n14723\n5512\n100\n28436\n33903\n100\n84816\n75747\n100\n92281\n31380\n100","1\n45819\n(...TRUNCATED)	{"input":["5\n3\n1 1\n1 1\n1 1\n3\n1 1\n1 1\n1 1\n3\n1 1\n1 1\n1 1\n3\n1 2\n1 1\n1 1\n3\n1 100\n1 1\(...TRUNCATED)	3	10	{"language":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"solution":["_ = int(raw_input())\nfor __ in range(...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		0	0	[]	false	{ "nanos": 500000000, "seconds": 0 }	256,000,000
776_A. A Serial Killer	"you are given an array of size N. You need to select K elements from the array such that the differ(...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": [], "output": [] }	{"input":["2\n1 10\n2\n2 2\n2 1\n1 1\n","2\n3922 3922\n1\n2 2\n2 1\n1 1\n","1\n1\n2\n1 1\n1 1\n1 1\n(...TRUNCATED)	2	0	{"language":[2,4,3,3,3,2,2,4,3,3,3,3,3,2,4,3,4,4,3,3,3,3,3,4,2,4,1,4,3,2,1,3,4,3,3,2,3,3,2,4,3,3,3,3(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,4,2,2,2,1,2,2,4,2,2,2,2,4,4,4,2,2,2,3,2,4,2(...TRUNCATED)	195	A	500	2,000	[ "data structures", "dfs and similar", "graphs", "greedy" ]	false	{ "nanos": 0, "seconds": 1 }	1,073,741,824
7_B. Memory Manager	"We are definitely not going to bother you with another generic story when Alice finds about an arra(...TRUNCATED)	{ "input": [ "6\n5 2 4 6 1 3", "6\n5 6 4 2 1 3" ], "output": [ "1 2 3 4 5 6\n3", "1 2 3 4 5 6\n4" ] }	{"input":["15\nMIRZOYANOVECLOX\n","23\nAABBBAAACCCCCAAADDDDDDD\n","2\nQA\n","11\nGGRRAATTZZZ\n","6\n(...TRUNCATED)	{"input":["2\n11 3\n2 3 4\n6 3\n3 2 1","2\n22 3\n2 0 3\n4 3\n3 2 1","2\n22 3\n0 0 3\n4 3\n3 2 1","2\(...TRUNCATED)	6	0	{"language":[4,2,4,2,2,2,3,2,1,2,2,2,4,2,2,2,4,2,2,2,2,2,4,2,2,2,3,2,4,4,2,4,2,2,2,2,4,4,4,4,2,2,2,2(...TRUNCATED)	{"language":[4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,4,4,4,2,2,2,4,4,2,1,3,2,2,2,4,2,2,2,4,4,2,2,2,2(...TRUNCATED)	0	C	1,750	0	[ "brute force", "sortings" ]	false	{ "nanos": 0, "seconds": 2 }	0
79_D. Password	"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": [ "2\n5\n2 3 5 1 2\n3\n1 2 3" ], "output": [ "3\n3" ] }	{"input":["2 5 1\n0 5 6\n0 2 7\n","1 1 1000000000\n0 0 0\n","2 200 5\n1 1 1\n12 3 15\n","2 10 5\n1 1(...TRUNCATED)	{"input":["xkbvkadjec gqjlhxpnsx 10\n2 7 1 0 0\n2 5 8 0 0\n4 7 8 0 4\n0 4 7 3 6\n5 5 9 3 7\n7 9 5 0 (...TRUNCATED)	2	0	{"language":[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,2,3,2,4,2,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,0,2,4,2,2,2,2,4,2,3,2,0,2,2,2,2,2,2,2,0,2,4,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2(...TRUNCATED)	378		1,500	0	[ "brute force", "implementation", "strings" ]	false	{ "nanos": 0, "seconds": 1 }	268,435,456