Datasets:

TheFactoryX
/

edition_1444_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	time_limit dict	memory_limit_bytes int64 0 1.07B
1413_F. Roads and Ramen	"Easy and hard versions are actually different problems, so read statements of both problems complet(...TRUNCATED)	{ "input": [ "3\n1 2 3\n", "5\n5 4 3 2 1\n" ], "output": [ "0 0 0\n", "0 1 3 6 10\n" ] }	{"input":["#(#(#((##((()))(((#)(#()#(((()()(()#(##(((()(((()))#(((((()(((((((()#((#((()(#(((()(()##((...TRUNCATED)	{"input":["5 9 4\n4 1 46\n1 3 29\n3 2 58\n1 5 61\n2 4 175\n1 2 87\n4 5 58\n3 5 69\n3 4 28\n2 7\n5 7\(...TRUNCATED)	3	8	{"language":[4,2,2,2,2,2,3,4,2,4,4,2,3,4,4,2,4,2,1,2,4,2,4,2,2,4,4,2,2,2,4,4,2,4,3,4,2,4,4,3,2,1,4,2(...TRUNCATED)	{"language":[4,3,3,4,4,4,2,2,4,4,4,2,4,2,2,2,2,2,1,2,4,2,2,2,2,2,3,4,2,4,2,2,2,4,4,2,2,4,1,4,2,2,2,2(...TRUNCATED)	820		0	1,900	[ "constructive algorithms", "math", "sortings" ]	false	{ "nanos": 0, "seconds": 2 }	0
p00323 Metal Recycling	"Step up and down\n\nKazuki, commonly known as Kerr, who attends JAG University, was invited by your(...TRUNCATED)	{"input":["3 3\n0 0 0 1\n0 2 2 2\n3 3 2 3\n12\n0 0 L 0\n0 0 L 1\n0 0 L 2\n0 0 L 3\n0 0 L 4\n0 0 L 5\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["2\n1 1 1 1 1 0 0 0 0 0\n0 0 0 0 0 1 1 1 1 1\n0 -2 -2 -2 -2 -2 -1 -1 -1 -1 -1\n0 -2 -2 -2 (...TRUNCATED)	2	9	{"language":[2,2,2,3,2,2,4,2,2,3,2,2,2,2,2,2,3,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,3,2,2,2,2(...TRUNCATED)	{"language":[2,3,4,4,3,2,2,2,3,3,2,3,4,4,1,3,2,4,2,4,1,3,2,3,2,3,3,4,3,3,4,2,3,2,2,4,4,4,4,3,3,2,4,3(...TRUNCATED)	248		0	1,700	[ "data structures", "divide and conquer", "dp" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
p00365 Age Difference	"Polycarp plays a well-known computer game (we won't mention its name). In this game, he can craft t(...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":["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)	{"input":["4 3\n1 3 2 7","4 4\n1 3 2 4","4 4\n1 0 2 4","4 3\n1 3 2 8","2 4\n1 3 2 4","4 4\n1 -1 2 4"(...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": [], "solution": [] }	633	B	1,750	1,500	[ "math" ]	false	null	256,000,000
893_A. Chess For Three	"Levko loves array a1, a2, ... , an, consisting of integers, very much. That is why Levko is playing(...TRUNCATED)	{ "input": [ "777-444---21-12-2013-12-2013-12-2013---444-777\n" ], "output": [ "13-12-2013\n" ] }	{"input":["4\n6\na b c d\nA\nThomas a\nd d\ned edgars\nal Adams\n1\nTurnipHeadJohnson\n3\na a a a a (...TRUNCATED)	{"input":["0 -2 -1\n","563 -23532 1232\n","0 2 0\n","0 10 20\n","-50000 100001 -50000\n","50000 1100(...TRUNCATED)	6	0	{"language":[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 gcd(a,b):\n\tif b==0:\n(...TRUNCATED)	{"language":[2,2,4,4,4,4,2,3,3,3,3,3,3,3,3,2,3,2,4,3,1,4,2,2,2,3,2,4,4,2,3,3,4,2,2,3,1,3,2,4,4,4,3,2(...TRUNCATED)	551	A	0	0	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1361_E. James and the Chase	"\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-piz(...TRUNCATED)	{ "input": [ "4 1 2 3 4\n", "5 5 46 372 81 9\n" ], "output": [ "5 3 5 7 ", "14 51 418 453 90 " ] }	{"input":["9 530792195 6\n","0 0 10\n","1944219055 454183506 1369298327\n","914835 2742837 9234739\n(...TRUNCATED)	{ "input": [], "output": [] }	5	1	{"language":[2,2,2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\nusing namespace std;\n#defi(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,4,3,2,2,3,2,2,2,2,2,2,2,2,4,3,2,2,2,2,1,2,4,2,2,2,2,2,4,2,2,3,1(...TRUNCATED)	188		2,000	1,800	[ "brute force", "data structures", "dsu", "graphs", "sortings" ]	false	null	1,073,741,824
roys-life-cycle	"The bloodiest battle of World War II has started. Germany and its allies have attacked the Soviet u(...TRUNCATED)	{"input":["1 1\n1\n1\n1\n2 1 100\n","4 6\n1 8 2 4\n3 3 6 1 5 2\n3\n1 1 1\n2 5 10\n1 1 6\n","1 1\n1\n(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\n1 4\n-1 1\n2 -1","10\n3 2\n3 2\n-1 1\n2 -1\n-3 -6\n-8 12\n7 7\n8 1\n8 2\n8 4","3\n2 4\(...TRUNCATED)	2	10	{"language":[4,2,1,3,3,3,2,3,3,3,3,3,2,4,4,3,3,4,4,2,4,3,1,4,2,3,3,3,3,4,4,2,3,4,2,3,2,1,3,2,3,4,4,2(...TRUNCATED)	{"language":[4,3,2,2,2,2,4,1,2,2,2,3,1,3,3,1,2,3,2,4,4,2,3,3,4,1,4,3,3,2,4,4,2,3,2,2,2,4,2,3,2,3,2,2(...TRUNCATED)	0	D	1,000	1,800	[ "" ]	false	{ "nanos": 0, "seconds": 3 }	256,000,000
1366_A. Shovels and Swords	"Let's call a string a phone number if it has length 11 and fits the pattern \"8xxxxxxxxxx\", where (...TRUNCATED)	{"input":["3\n6 10 16","3\n6 10 15","3\n3 4 5"],"output":["not coprime","setwise coprime","pairwise (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["5 4","7 4","6 1","9 4","6 3","14 4","8 1","28 4","15 2","28 3","19 2","32 2","29 5","26 3(...TRUNCATED)	2	2	{"language":[1],"solution":["for _ in xrange(input()):\n n= input()\n a=map(int,raw_input().sp(...TRUNCATED)	{ "language": [], "solution": [] }	1,149	D	0	0	[]	false	{ "nanos": 0, "seconds": 1 }	0
1369_D. TediousLee	"<!--\n\nProblem G\n\n-->\n\nLet's Move Tiles!\n\nYou have a framed square board forming a grid of s(...TRUNCATED)	{"input":["10\n1\n248618\n3\n12 10 8\n6\n100 11 15 9 7 8\n4\n0 1 1 0\n2\n0 0\n2\n0 1\n2\n1 0\n2\n1 1(...TRUNCATED)	{"input":["6 4 2\n100010\n","4 2 1\n1000\n","8 5 2\n10000100\n","11 5 2\n11010000101\n","64 40 14\n1(...TRUNCATED)	{"input":["1\n5\n2 3 4 5 2\n","1\n3\n1 1 129021590\n","4\n7\n6 6 8 8 6 6 6\n1\n2\n5\n4 5 9 8 7\n7\n1(...TRUNCATED)	2	9	{"language":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"solution":["n=int(raw_input())\nin_array=[]\nfo(...TRUNCATED)	{ "language": [], "solution": [] }	494		500	2,000	[ "" ]	false	{ "nanos": 0, "seconds": 3 }	1,073,741,824
1490_D. Permutation Transformation	"You have a string s of length n consisting of only characters > and <. You may do some operations w(...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":["1 1\nt\n+ 2 p\n","2 12\naa\n+ 1 a\n+ 2 a\n+ 3 a\n- 1\n+ 1 a\n- 2\n+ 2 a\n- 3\n+ 3 a\n+ 2 (...TRUNCATED)	{"input":["20 20\n1 9\n11 9\n3 5\n15 13\n1 20\n11 18\n10 6\n10 8\n10 19\n12 16\n10 3\n9 18\n8 7\n15 (...TRUNCATED)	2	13	{"language":[1,1],"solution":["from collections import defaultdict\n\ndef solve(S):\n # Reverse S(...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,3,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	D	1,500	0	[ "greedy" ]	false	{ "nanos": 0, "seconds": 8 }	268,435,456
1334_D. Minimum Euler Cycle	"Snuke is conducting an optical experiment using mirrors and his new invention, the rifle of Mysteri(...TRUNCATED)	{"input":["2 3\n1 2\n1 2\n1 2\n","5 7\n2 4\n5 1\n2 3\n3 4\n4 1\n5 3\n3 5\n"],"output":["5 6 ","10 9 (...TRUNCATED)	{"input":["10 9 5\n0 0 0 0 0 0 0 0 0 4\n10 3\n10 7\n10 5\n10 8\n10 9\n10 1\n10 4\n10 6\n10 2\n","10 (...TRUNCATED)	{"input":["4\n1 4\n3 2\n3 4\n","21\n7 15\n13 1\n14 3\n4 10\n2 3\n16 18\n17 20\n16 20\n8 4\n3 12\n2 1(...TRUNCATED)	6	0	{"language":[1],"solution":["x=raw_input()\nl=len(x)\nif l>=3:\n l=l/2\n print x[l-1:l+2]\nels(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,0,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,2,2,2(...TRUNCATED)	0		1,750	1,000	[ "brute force" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000