Datasets:

TheFactoryX
/

edition_3051_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
p02971 AtCoder Beginner Contest 134 - Exception Handling	"Polycarp has recently created a new level in this cool new game Berlio Maker 85 and uploaded it onl(...TRUNCATED)	{ "input": [ "6 1 2 3 4 5", "6 200 2 3 4 5" ], "output": [ "1", "1" ] }	{ "input": [], "output": [] }	{"input":["3 10 10\n1\n1 1 1\n1\n3 3 3\n1\n5 5 5\n0 1 1\n1 0 0\n0 1 0","1 10 3\n3\n1 10 1\n2 20 2\n3(...TRUNCATED)	6	0	{"language":[3,1,3,2,3,3,3,1,2,2,2,1,4,4,1,4,2,2,4,2,4,2,3,2,2,4,3,3,3,3,1,3,2,1,1,3,2,3,4,4,4,4,3,4(...TRUNCATED)	{"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,3(...TRUNCATED)	39		0	0	[]	false		{ "nanos": 0, "seconds": 2 }	0
p03612 AtCoder Beginner Contest 072 - Derangement	"There was a large mansion surrounded by high walls. The owner of the mansion loved cats so much tha(...TRUNCATED)	{"input":["1.1 3.4 2.5\n","1.9 1.8 1.7\n","2.0 2.0 2.0\n"],"output":["z^y^x\n","(x^y)^z\n","x^y^z\n"(...TRUNCATED)	{ "input": [ "5\n1 1 1 1 1\n", "5\n2 1 1 1 1\n" ], "output": [ "4\n", "2\n" ] }	{"input":["3\n77 42 77\n77 77\n77\n","3\n77 31 77\n77 77\n77\n","4\n1 5 7 12\n1 5 7\n1 5\n","3\n77 7(...TRUNCATED)	2	3	{"language":[3,2,4,2,2,2,3,3,3,4,3,3,3,2,4,3,2,4,2,3,2,2,3,2,2,4,2,2,3,3,4,3,3,2,2,2,4,3,3,3,3,3,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0		1,000	0	[ "data structures", "greedy", "implementation" ]	false		null	268,435,456
1007_E. Mini Metro	"There is a frog known as \"CHAMELEON\" because he has a special feature to change its body's color (...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":["20 18 1 2\n-9999944 -9999861 -9999850 -9999763 -9999656 -9999517 -9999375 -9999275 -99992(...TRUNCATED)	{"input":["3 5 999999997\n","1011 1 1000000000\n","1 30 33\n","29 3 1000000000\n","3 2 31\n","2 2 85(...TRUNCATED)	6	8	{"language":[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,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,3,4,2,4,2,2,3,1,2,3,2,4,2,3,3,4,2,2,4,4,2,2,4,3,2,2,4,4,4,3,4,4,2,2,4,4,3,2,3,2,4,2,1(...TRUNCATED)	512		0	800	[ "data structures", "greedy" ]	false		null	134,217,728
p03010 diverta 2019 Programming Contest 2 - Diverta City	"You have a string s — a sequence of commands for your toy robot. The robot is placed in some cell(...TRUNCATED)	{ "input": [ "3\n1\n2 3\n2\n4 5\n5 6\n2\n2 3\n3 5" ], "output": [ "NO\nNO\nYES" ] }	{ "input": [], "output": [] }	{"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	10	{"language":[4,4,2,4,4,4,2,4,2,4,2,3,3,3,2,2,2,2,4,3,2,2,2,4,4,2,3,2,4,4,2,2,4,3,3,4,1,2,4,4,4,4,4,3(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,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(...TRUNCATED)	1,155	A	0	1,700	[ "implementation" ]	false		null	256,000,000
483_B. Friends and Presents	"Nick has n bottles of soda left after his birthday. Each bottle is described by two values: remaini(...TRUNCATED)	{"input":["6\n3\n60\n100\n1024\n23456\n8735373\n\nSAMPLE"],"output":["0\n14\n24\n253\n5861\n2183837\(...TRUNCATED)	{"input":["2\nFF\n","5\nIIIIF\n","5\nFAFFF\n","2\nFA\n","3\nAAA\n","5\nFAIAF\n","5\nAIFFF\n","3\nFFF(...TRUNCATED)	{"input":["11\n54 91 4 6 88 23 38 71 77 10 84\n","20\n12 37 81 56 61 2 26 27 59 69 24 7 71 76 45 54 (...TRUNCATED)	2	0	{"language":[3,3,3,3,4,1,3,1,3,4,2,3,2,3,3,4,3,1,2,4,1,3,4,4,4,3,2,2,3,4,4,2,4,2,2,4,3,3,2,3,3,2,3,3(...TRUNCATED)	{"language":[3,2,2,2,3,4,3,2,2,3,4,4,4,3,2,2,4,4,2,3,2,3,3,4,4,2,3,2,2,1,4,2,2,4,4,2,2,3,3,2,3,4,4,2(...TRUNCATED)	875	B	2,500	0	[ "brute force", "sortings" ]	false	"踏み台昇降\n\nJAG大学に通う一樹君，通称カー君は，この夏友達であるあ(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	1,073,741,824
p03774 AtCoder Beginner Contest 057 - Checkpoints	"Allen and Bessie are playing a simple number game. They both know a function f: \\{0, 1\\}^n → R,(...TRUNCATED)	{ "input": [ "5 3\n5 5 7 3 1\n", "4 2\n1 2 3 4\n", "2 3\n1 2\n" ], "output": [ "15\n", "8\n", "0\n" ] }	{"input":["3 8\n2 4 4 4\n7 2 5 2\n6 5 6 3\n20\n3 2 U 1000000\n3 2 U 1\n3 2 U 2\n3 2 U 3\n3 2 U 4\n3 (...TRUNCATED)	{"input":["1 1 2000000000\n1\n3\n","28 3 2099\n768 115 416 934 926 65 802 980 551 213 335 202 784 91(...TRUNCATED)	2	7	{"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":[3,1,4,4,2,1,4,4,3,4,3,4,4,2,4,1,3,2,2,3,2,4,1,2,2,1,2,1,3,2,2,2,4,4,2,2,3,3,4,2,2,2,3,1(...TRUNCATED)	284		0	1,800	[ "brute force", "implementation" ]	false		{ "nanos": 0, "seconds": 2 }	134,217,728
class-homework	"There were n types of swords in the theater basement which had been used during the plays. Moreover(...TRUNCATED)	{ "input": [ "ppqb", "pdbq" ], "output": [ "No", "Yes" ] }	{ "input": [], "output": [] }	{"input":["176856\n","468424\n","371312\n","1559681\n","1362308\n","1165938\n","1001000\n","45859\n"(...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,4,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,4,2,4(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,4,4,2,2,2,2,2,2,4,2,2,4,2,4,2,2,2,2,2(...TRUNCATED)	339	C	500	1,000	[ "" ]	false	"あなたは友人と旅行に行きたいと考えています。ところが、浪費癖のある(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	256,000,000
p00490 Best Pizza	"Peter got a new snow blower as a New Year present. Of course, Peter decided to try it immediately. (...TRUNCATED)	{ "input": [ "100\n200\n5" ], "output": [ "13" ] }	{"input":["8\n2 3 5 7 11 13 17 19\n4 8 7 1 5 2 6 3\n","1\n2\n2\n","1\n1000000000\n100000\n","1\n1\n1(...TRUNCATED)	{"input":["8 15\n","6 1\n","8 9\n","500 17172\n","5 2\n","5 9\n","2 7\n","3 15\n","61 249001\n","8 5(...TRUNCATED)	2	8	{"language":[2,2,2,3,4,2,4,4,4,2,2,4,4,4,2,2,2,2,4,2,2,2,4,3,4,2,4,2,2,2,3,2,2,4,2,4,4,2,4,4,2,3,2,2(...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,2,2,2,2,2,2,2,2(...TRUNCATED)	1,219	C	0	0	[ "graphs", "greedy", "shortest paths" ]	false		{ "nanos": 0, "seconds": 5 }	256,000,000
trailing-zero-problem-1	"As you know Appu created aversion to Maths after that maths problem given by his teacher.So he stop(...TRUNCATED)	{"input":["6\n1 1 1 0 0 0\n","5\n0 0 0 0 0\n","7\n1 0 0 1 0 0 1\n"],"output":["\n9\n","\n0\n","\n3\n(...TRUNCATED)	{"input":["5\ncbbbb\nbcbbb\naacbb\naaacb\naaaac\n","20\nbifcabiabgfibfccdbgd\ncffaheagahcbacafbgeb\n(...TRUNCATED)	{"input":["13\n1\n>\n1\n?\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n","3\n2(...TRUNCATED)	3	0	{"language":[1,1,1,1,1,1,1,1,1,1,1],"solution":["def gcd(x,y):\n if y==0: return x\n else: ret(...TRUNCATED)	{"language":[3,4,3,3,2,3,2,4,2,3,2,2,4,3,2,2,4,3,4,4,4,3,2,2,4,3,1,2,3,2,4,4,4,3,4,3,3,2,4,2,4,3,3,4(...TRUNCATED)	0		0	0	[ "constructive algorithms", "math", "sortings" ]	false		{ "nanos": 0, "seconds": 2 }	268,435,456
323_C. Two permutations	"Your task is very simple. Given K numbers A1, A2, ..., AK. You need to find f(N) mod max(A1, A2, .(...TRUNCATED)	{ "input": [ "10\n2 3 1 5 6 4 2 10 7 7\n5\n10 1\n5 7\n10 6\n1 1\n10 8\n" ], "output": [ "3\n0\n1\n1\n0\n" ] }	{ "input": [], "output": [] }	{"input":["4 4","1 15","2 4","2 15","3 0","2 26","3 -1","2 32","0 -1","1 32","0 -2","1 17","-1 -2","(...TRUNCATED)	3	0	{"language":[2,4,1,2,2,2,4,4,2,2,4,4,2,2,2,2,2,2,2,2,3,2,4,1,2,2,2,2,2,2,2,1,2,2,2,1,4,2,3,2,2,2,2,3(...TRUNCATED)	{ "language": [], "solution": [] }	0		2,500	0	[ "greedy", "two pointers" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000