Datasets:

TheFactoryX
/

edition_2957_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	untranslated_description large_stringclasses 36 values	time_limit dict	memory_limit_bytes int64 0 1.07B
p01356 Nearest Station	"Sita loves chocolate and Ram being his boyfriend wants to give Sita as many chocolates as he can. S(...TRUNCATED)	{ "input": [ "1\n5 3\n200 6 9" ], "output": [ "120" ] }	{"input":["1 1 2 2\n1000000000 1000000000\n1\n","1 1 1000000000 1000000000\n100 1000000000\n1\n","1 (...TRUNCATED)	{"input":["100 1 7\n83\n174\n191\n145\n167\n55\n232\n157\n51\n209\n85\n73\n216\n39\n72\n76\n132\n70\(...TRUNCATED)	2	9	{"language":[2,4,1,2,2,2,1,2,2,4,2,4,4,3,1,2,4,2,4,2,3,1,1,4,3,4,4,4,2,3,4,4,4,1,1,2,2,4,1,4,4,4,2,1(...TRUNCATED)	{ "language": [], "solution": [] }	0		0	0	[ "" ]	false		null	1,073,741,824
949_C. Data Center Maintenance	"In code world all genders are considered equal ( It means their is nothing like male or female). No(...TRUNCATED)	{ "input": [ "2\n27 25 4\n25 26 16\n\nSAMPLE" ], "output": [ "K-G-B\nX-Y-B" ] }	{"input":["10\n100000000 200000000 300000000 20 500000000 600000000 700000000 800000000 900000000 10(...TRUNCATED)	{"input":["5\n2 1 1 1 2\n","6\n5 1 3 4 8 3\n","5\n1 5 7 1 2\n","6\n5 1 3 4 5 3\n","2\n1000010 100100(...TRUNCATED)	2	9	{"language":[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,2,2,2,2,3,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,0,0,0,2,0,0,4,2,2,0,0,2,2,0,4,4,2,0,0,2,2,2,4,2,2,0,0,2,4,2,2,4,2,0,4,4,0,0,0,0,0,0,2(...TRUNCATED)	80	F	0	1,900	[ "geometry", "math" ]	false	"ある日、たろう君は、本文に「519345213244」という数字だけが書いてあるお(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	1,073,741,824
1170_B. Bad Days	"A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang (...TRUNCATED)	{"input":["2\n10 1\n1 2 -3 -5 4 6 -3 2 -1 2\n10 2\n1 2 -3 -5 4 6 -3 2 -1 2\n\nSAMPLE"],"output":["12(...TRUNCATED)	{"input":["20\n...............\n","97\n*..*.......**......................(...TRUNCATED)	{"input":["34 20 1\n17 13\n","1 0 0\n","10000 9999 1\n8594 9264\n","98 100 25\n96 100\n97 100\n97 99(...TRUNCATED)	2	11	{"language":[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,4,4,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,3,3,2,3,2,3,2,3,3,2,3,3,3,2,2,3,3,3,2,3,0,3,2,3,3,2,2,2,3,3,0,2,2,0,3,3,3,0,2,3,2,3,3(...TRUNCATED)	203		500	0	[ "greedy", "implementation" ]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
ig01	"Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings(...TRUNCATED)	{ "input": [ "4\naaa\nabc\nabdbca\nabba" ], "output": [ "YES\nNO\nYES\nYES\n" ] }	{"input":["6\nc armor 0 13 0 3\na weapon 23 0 0 3\nb weapon 20 0 0 4\ne orb 0 0 13 3\nd armor 0 15 0(...TRUNCATED)	{"input":["3\n((()))\n(())()\n()())","3\n((()()\n(())()\n()(()","3\n((()))\n(())))\n()())","3\n)))(((...TRUNCATED)	6	0	{"language":[3,4,2,3,4,4,3,3,3,4,4,2,4,4,3,3,4,1,2,3,3,2,4,2,4,4,2,2,2,2,4,2,2,4,4,4,3,2,4,4,3,4,2,4(...TRUNCATED)	{"language":[2,2,4,2,2,2,2,2,2,2,4,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,2,2(...TRUNCATED)	0	C	0	1,700	[ "geometry", "math" ]	false		{ "nanos": 0, "seconds": 2 }	134,217,728
p03371 AtCoder Beginner Contest 095 - Half and Half	"In one well-known algorithm of finding the k-th order statistics we should divide all elements into(...TRUNCATED)	{ "input": [ "5\n1 2\n1 3\n3 4\n2 5" ], "output": [ "1" ] }	{"input":["46\n63 1\n63 63\n123 1\n123 123\n63 2\n63 62\n123 2\n123 122\n63 3\n63 61\n123 3\n123 121(...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)	6	10	{ "language": [], "solution": [] }	{"language":[2,2,2,2,4,2,2,2,2,2,2,1,4,3,2,2,2,2,2,1,2,3,2,2,2,4,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,366	A	0	2,000	[]	true		{ "nanos": 0, "seconds": 2 }	256,000,000
519_B. A and B and Compilation Errors	"Problem description.\nVipul is a hardworking super-hero who maintains the bracket ratio of all the (...TRUNCATED)	{ "input": [ "5\nZZZAA\n", "7\nABACABA\n" ], "output": [ "ZZ\n", "AB\n" ] }	{ "input": [], "output": [] }	{"input":["10000 01000 00100 11000 01100 11111 01110 11100 10110 11110\n10101 01000 00000 11001 0110(...TRUNCATED)	1	9	{"language":[2,3,4,3,4,3,4,3,3,3,3,2,3,3,4,4,4,3,4,3,2,3,3,4,1,2,3,4,3,2,1,3,4,3,3,4,4,3,1,1,3,3,3,3(...TRUNCATED)	{"language":[4,2,4,3,2,2,3,4,2,4,3,3,3,4,2,2,4,3,4,2,2,2,3,4,2,2,2,2,4,3,4,2,2,4,2,2,4,3,2,3,4,2,2,2(...TRUNCATED)	0		0	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
lexicographically-preceding-permutation	"After playing Neo in the legendary \"Matrix\" trilogy, Keanu Reeves started doubting himself: maybe(...TRUNCATED)	{ "input": [ "3\n4251\n52310\n00006\n\nSAMPLE" ], "output": [ "12\n56\nunlucky" ] }	{ "input": [], "output": [] }	{"input":["202763616\n","1778707511\n","181182141\n","1438\n","55068349\n","324423196\n","339071627\(...TRUNCATED)	2	13	{"language":[1,2,4,2,3,3,3,4,3,3,4,3,4,2,3,3,4,4,2,3,4,2,4,4,2,3,3,2,2,1,3,3,3,3,2,4,3,4,4,4,3,3,3,2(...TRUNCATED)	{"language":[2,2,2,2,2,3,2,2,3,2,2,2,2,4,3,3,2,4,2,2,2,2,4,2,3,4,2,2,2,2,2,2,4,2,2,2,2,2,3,2,2,2,2,2(...TRUNCATED)	1,281	A	0	1,400	[ "binary search", "data structures", "divide and conquer", "greedy", "implementation" ]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
gcd2	"Panda has a thing for palindromes. Hence he was a given a problem by his master. The master will g(...TRUNCATED)	{ "input": [ "1 2 10\n11\n15 7\n", "2 4 50\n20 100\n60 10 40 80\n" ], "output": [ "7", "50" ] }	{ "input": [], "output": [] }	{"input":["1 0\n25 47 15","1 0\n16 47 15","1 0\n31 47 15","2 0\n31 47 13","2 0\n31 47 20","2 0\n31 4(...TRUNCATED)	1	0	{ "language": [], "solution": [] }	{"language":[2,4,2,2,2,2,3,2,2,2,1,2,2,2,4,2,2,2,4,4,1,2,4,4,2,1,4,4,4,2,2,2,2,4,2,2,2,1,2,4,2,2,2,2(...TRUNCATED)	1,328		0	1,400	[ "implementation", "strings" ]	false		{ "nanos": 0, "seconds": 6 }	256,000,000
1012_E. Cycle sort	"In a mystical TimeLand, a person's health and wealth is measured in terms of time(seconds) left. \n(...TRUNCATED)	{"input":["6\n4 2\nbbab\n7 5\ncceddda\n6 5\necdaed\n7 4\ndcdbdaa\n8 3\nccabbaca\n5 7\neabba\n"],"out(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["5\n90 94\n26 25\n64 84\n18 6\n20 96\n","5\n1912 1\n5 6\n999 1\n88 2\n11 100\n","5\n90 94\(...TRUNCATED)	2	9	{"language":[2,2,2,2,2,2,2,2,3,3,4,2,2,2,4,4,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,4,2,2,2,2,4,1,3,4,4,2,2,4(...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)	378	D	0	1,800	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
find-the-nth-prime	"You are running through a rectangular field. This field can be represented as a matrix with 3 rows (...TRUNCATED)	{ "input": [ "0.0,0.0,1.0,0.0,1.0,1.0,0.0,1.0\n0.0,0.0,3.0,0.0,1.0,1.0,1.0,3.0" ], "output": [ "YES\nNO" ] }	{ "input": [], "output": [] }	{"input":["3 5 10\nred\n0 0 0\n5 0 0\ngreen\n0 5 5\n5 6 1\nblue\n0 40 5\n5 0 0\n3 10 5\nbtom\n0 47 3(...TRUNCATED)	2	0	{"language":[4,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,4,4,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,4,1(...TRUNCATED)	{"language":[4,4,2,1,2,3,2,4,3,4,3,3,4,2,3,3,3,3,2,4,3,3,3,4,4,2,3,2,3,4,2,2,2,4,2,3,2,3,4,3,2,3,3,3(...TRUNCATED)	720		0	2,400	[ "greedy" ]	false		{ "nanos": 0, "seconds": 2 }	512,000,000