Datasets:

TheFactoryX
/

edition_2421_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
discover-the-monk	"New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has n (...TRUNCATED)	{ "input": [ "3\n12 2\n200\n50\n300\n100" ], "output": [ "37" ] }	{ "input": [], "output": [] }	{"input":["5 6\n3 1 2 6\n3 1 2 6\n1 1\n2 3 6\n3 1 5 6\n","5 7\n2 6 7\n5 1 1 1 1 1\n3 6 5 5\n0\n4 4 3(...TRUNCATED)	6	10	{"language":[2,4,2,2,2,2,2,4,4,2,2,4,2,2,2,3,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2(...TRUNCATED)	{"language":[4,4,2,3,2,4,2,3,4,3,3,2,2,4,2,3,4,2,2,3,3,3,1,4,4,3,4,4,2,1,2,1,2,3,2,2,4,3,2,2,3,2,1,2(...TRUNCATED)	1,136	D	500	1,000	[ "constructive algorithms" ]	false		{ "nanos": 0, "seconds": 2 }	512,000,000
702_E. Analysis of Pathes in Functional Graph	"Today Peter has got an additional homework for tomorrow. The teacher has given three integers to hi(...TRUNCATED)	{ "input": [ "4 2\n1 2\n2 3\n", "3 3\n1 2\n2 3\n1 3\n" ], "output": [ "3\n1 3 4 \n1\n2 ", "-1" ] }	{"input":["1 0\n1 1 0\n1 446844829 77109657 780837560\n1 754808995 539371459\n","1 1\n1 1\n2 2 0\n1 (...TRUNCATED)	{"input":["6\n0 41 48 86 94 14\n41 0 1 30 59 39\n48 1 0 9 31 49\n86 30 9 0 48 30\n94 59 31 48 0 33\n(...TRUNCATED)	2	0	{"language":[1,1],"solution":["def CheckIfProbablyPrime(x):\n return (2 << x - 2) % x\ndef primes(...TRUNCATED)	{ "language": [], "solution": [] }	990		0	0	[ "data structures", "dfs and similar", "shortest paths", "trees" ]	false		{ "nanos": 0, "seconds": 2 }	0
p01353 Rabbit Plays Games!	"There are n points on a coordinate axis OX. The i-th point is located at the integer point x_i and (...TRUNCATED)	{"input":["5\n12\n5 4 4 3 2 2 1 1 1 1 1 1\n4\n4 3 2 1\n1\n1000000\n20\n20 19 18 17 16 15 14 13 12 11(...TRUNCATED)	{"input":["20 10000000\n8861863 2169292 3484361 511558 5975675 1413584 774309 5847326 6668965 253146(...TRUNCATED)	{"input":["+--+-+\n","+--+--+------+++++++-+-+++--++---+--+-+---+--+++-+++-------+++++-+-++++--+-+-+(...TRUNCATED)	2	7	{"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":["c(...TRUNCATED)	{"language":[2,2,2,2,4,2,4,2,4,2,2,2,4,2,2,2,3,2,2,2,2,2,0,2,2,2,4,2,2,4,2,0,2,2,2,2,1,0,2,2,1,2,2,2(...TRUNCATED)	1,311	F	0	0	[ "constructive algorithms", "graphs", "implementation" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
70_C. Lucky Tickets	"Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings(...TRUNCATED)	{"input":["5\nAJMP\naB23d\nE\n86AE\nAM\n6\nJPEM\nWaEaETC302Q\nCP\nrTurnAGundam1isdefferentf"],"outpu(...TRUNCATED)	{"input":["1000\n999001\n999002\n999003\n999004\n999005\n999006\n999007\n999008\n999009\n999010\n999(...TRUNCATED)	{"input":["3 313 856 964 421\n","3 3 1 11 9\n","2 2 9 8 1\n","61 538 623 89 548\n","7 202 512 995 37(...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,2,2,2,4,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,3,2,2,3,0,3,2,2,2,2,2,2,3,2,2,2,4,2,2,2,2,2,2,3,3,3,2,4,2,4,3,3,2,3,2,0,2,2,2,3,2,2,3(...TRUNCATED)	544	D	500	3,000	[]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1155_A. Reverse a Substring	"You are given a square matrix of size n (it will be an odd integer). Rows are\nindexed 0 to n-1 fro(...TRUNCATED)	{"input":["6\nAC\nTLE\nAC\nAC\nWA\nTLE","10\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC\nAC"],"output":["AC (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\n7089544 9134148 -5332724\n368810 1638695 13258988\n-3866235 -4257263 5802154\n","16\n-(...TRUNCATED)	6	7	{"language":[2,2,2,2,2,2,2,2,2,4,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,4,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[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,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0		0	0	[ "greedy", "implementation" ]	false		null	0
p01046 Yu-kun Likes a lot of Money	"Hilbert's Hotel is a very unusual hotel since the number of rooms is infinite! In fact, there is ex(...TRUNCATED)	{ "input": [ "3\n3 2 1\n1 2 3\n1 1\n1 2\n", "3\n1 2 3\n3 2 1\n1 1\n1 1\n" ], "output": [ "NO\n", "YES\n" ] }	{"input":["20 20\n00010110100100010111\n11110000001100101110\n01110101110001111000\n1011110100011111(...TRUNCATED)	{"input":["5\n1 2 0\n1 3 0\n3 5 0\n3 4 0\n3\n3\n4\n1\n3\n4\n","20\n9 11 0\n1 5 0\n1 14 0\n5 17 0\n14(...TRUNCATED)	5	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,4,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,4,2,2,2,2,2,4,2,2(...TRUNCATED)	774		0	1,100	[ "graphs" ]	false	"データを並べ替えるための整列（ソート）アルゴリズムはコンピュータ科(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	256,000,000
378_C. Maze	"There are N children, numbered 1, 2, ..., N.\n\nSnuke has decided to distribute x sweets among them(...TRUNCATED)	{ "input": [ "2\n4 1\n2 15 36 43 \n3 2\n27 30 35 \n\nSAMPLE" ], "output": [ "41\n5\n" ] }	{"input":["50 100\n1 71 96\n2 34 52\n2 16 95\n1 54 55\n1 65 85\n1 76 92\n2 19 91\n1 26 43\n2 83 95\n(...TRUNCATED)	{"input":["1 16\n1\n","10 1\n-1 1 1 0 1 1 1 1 1 1\n","78 8\n-230 -757 673 -284 381 -324 -96 975 249 (...TRUNCATED)	1	8	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2,2,4,2,2,2,4(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,1,4,2,2,2,2(...TRUNCATED)	1,413		0	1,500	[]	true		null	268,435,456
gameaam	"Note that this is the first problem of the two similar problems. You can hack this problem only if (...TRUNCATED)	{"input":["3\n0\n1\n2\n3\n4\n5\n","3\n10\n12\n-5\n8\n10\n12\n"],"output":["5.656854249\n","15.524174(...TRUNCATED)	{"input":["5\n\n3 2 2\n2 0\n0 5\n\n4 3 2\n2 0 5\n0 6\n\n0 2 2\n1 0\n2 3\n\n5 4 4\n6 0 8 0\n0 7 0 9\n(...TRUNCATED)	{"input":["50 5000\n2 35 46\n2 43 92\n2 16 88\n2 67 99\n2 36 93\n2 12 20\n2 33 96\n2 55 82\n2 18 32\(...TRUNCATED)	2	0	{"language":[3,2,3,4,2,3,2,4,2,4,2,4,3,1,2,3,3,2,4,3,2,2,4,4,2,3,4,3,3,3,2,4,4,3,3,3,2,3,4,4,4,2,3,4(...TRUNCATED)	{"language":[2,2,3,0,3,2,0,3,0,2,2,3,2,3,2,2,0,2,0,3,0,3,3,2,3,2,2,0,2,2,3,3,2,2,2,3,3,3,2,2,4,3,4,2(...TRUNCATED)	1,053		750	2,600	[ "math" ]	false		{ "nanos": 0, "seconds": 2 }	268,435,456
915_A. Garden	Example Input 2 1 1 2 2 Output 1	{ "input": [ "3\n4251\n52310\n00006\n\nSAMPLE" ], "output": [ "12\n56\nunlucky" ] }	{"input":["3 1\nerase -1\nerase 0\nerase -2147483648\n","26 25\ndefragment\nerase 1\nerase -15602008(...TRUNCATED)	{"input":["7 11 10 5\n6 18 32 63 66 68 87\n6 8 15 23 25 41 53 59 60 75 90\n","13 17 14 1\n6 9 10 12 (...TRUNCATED)	2	11	{"language":[2,2,2,2,2,2,4,4,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,4,2(...TRUNCATED)	{"language":[4,2,3,2,4,2,2,4,4,2,2,2,1,2,2,2,4,2,3,4,2,4,2,4,2,4,2,1,2,3,2,2,2,1,4,3,2,4,2,2,4,4,2,2(...TRUNCATED)	1,344	E	0	1,800	[ "implementation" ]	true		{ "nanos": 0, "seconds": 2 }	256,000,000
p03153 KEYENCE Programming Contest 2019 - Connecting Cities	"A new type of mobile robot has been developed for environmental earth observation. It moves around (...TRUNCATED)	{"input":["5 3 2\nSba\nccc\naac\nccc\nabT\n","3 4 1\nSxyy\nyxxx\nyyyT\n","1 3 3\nTyS\n","1 4 1\nSxyT(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1\n3 3\n1 2\n3 3\n1 3","1\n2 3\n0 0\n2 -1\n0 1\n\nSANPLE","1\n3 3\n1 2\n2 3\n1 3\n\nELPMA(...TRUNCATED)	6	2	{"language":[4,2,4,4,4,2,2,4,4,2,4,3,4,2,2,2,2,4,2,2,2,2,2,2,2,4,2,2,2,4,2,4,1,4,2,2,4,2,1,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,4,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,4,0,2,3,2,3,2(...TRUNCATED)	0	E	0	0	[ "constructive algorithms", "dfs and similar", "dp", "greedy", "trees" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000