Datasets:

TheFactoryX
/

edition_2759_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
760_F. Bacterial Melee	"Given is a string S, where each character is `0`, `1`, or `?`.\n\nConsider making a string S' by re(...TRUNCATED)	{ "input": [ "3\n3 2 1\n", "3\n1 2 3\n", "3\n2 3 1\n" ], "output": [ "2 1\n", "0 0\n", "0 1\n" ] }	{"input":["10 10\n5 9 1 3 5 8 3 4 7\n2 0 4 7 1 0 0 0 7 0\n5 7 -7 3 10 4 7 2 9 -9\n","2 2\n1\n0 0\n1 (...TRUNCATED)	{"input":["5\n5\n3\n2\n1\n7\n6\n1\n2\n3\n4\n5\n6\n3\n3\n2\n1\n0","5\n5\n3\n2\n1\n7\n6\n1\n2\n3\n4\n0(...TRUNCATED)	2	2	{"language":[2,3,4,3,3,4,1,3,3,2,4,4,3,3,1,3,2,3,3,2,3,4,3,3,3,2,3,4,4,3,3,3,2,3,3,3,2,3,2,3,3,3,3,3(...TRUNCATED)	{"language":[4,3,2,3,2,2,2,4,2,2,4,2,2,3,3,3,2,4,3,2,3,2,3,2,2,2,2,2,3,3,3,3,3,3,3,3,2,3,2,4,4,3,4,2(...TRUNCATED)	290	D	2,000	0	[]	false	{ "nanos": 0, "seconds": 1 }	134,217,728
1466_F. Euclid's nightmare	"A string is called a KEYENCE string when it can be changed to `keyence` by removing its contiguous (...TRUNCATED)	{"input":["4 5\n1 2 3 1\n2 1 2 8\n2 3 4 7\n1 1 3 3\n2 3 4 8\n","4 5\n1 2 3 1\n2 1 2 8\n2 3 4 7\n1 1 (...TRUNCATED)	{"input":["49 749442\n8888888\n8888888\n8888888\n5777777\n5777777\n5777777\n5777777\n5777777\n577777(...TRUNCATED)	{"input":["3 3\n1 2\n1 2\n1 3\n","5 3\n2 1\n5 4\n3 2\n","20 5\n3 12\n5 20\n16 4\n13 2\n9 14\n","3 2\(...TRUNCATED)	5	0	{"language":[3,4,3,2,2,3,3,1,3,4,2,4,1,3,3,1,1,3,3,2,1,3,2,4,2,3,3,1,3,2,2,2,3,3,1,2,3,4,4,4,3,4,3,3(...TRUNCATED)	{"language":[2,2,2,3,0,2,2,3,2,2,3,2,3,2,3,3,2,3,2,0,3,2,2,3,3,0,0,2,3,2,2,2,2,2,2,2,2,2,3,3,0,2,2,3(...TRUNCATED)	0	G	750	0	[ "constructive algorithms" ]	false	{ "nanos": 0, "seconds": 8 }	256,000,000
anuwta	"There are N slimes standing on a number line. The i-th slime from the left is at position x_i.\n\nI(...TRUNCATED)	{ "input": [ "3\nSdfgAe\nOut\nGet\n\nSAMPLE" ], "output": [ "Ae\nOu\ne\n" ] }	{"input":["4 4 3\n1 2 3\n1 2 1\n2 3 2\n1 3 3\n1 4 4\n","4 3 2\n1 4\n1 2 1\n2 3 5\n3 4 1\n","3 2 2\n1(...TRUNCATED)	{"input":["1 5000 2732\n","2 2 0\n","83 4122 123\n","19 862 387\n","100 843 30\n","45 1296 245\n","9(...TRUNCATED)	2	0	{"language":[4,4,4,4,2,3,2,2,2,4,1,2,2,2,4,2,2,3,2,2,3,2,2,2,2,2,2,3,1,2,4,2,4,2,2,3,2,2,2,2,2,2,4,2(...TRUNCATED)	{"language":[1,3,3,2,4,3,2,2,3,3,4,1,4,2,3,4,1,4,2,1,3,2,2,3,2,2,1,4,4,2,2,2,1,2,4,2,2,3,4,4,4,4,2,3(...TRUNCATED)	0		500	1,800	[]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
p01738 Gravity Point	"You have a string s — a sequence of commands for your toy robot. The robot is placed in some cell(...TRUNCATED)	{ "input": [ "30 60 3 1\n", "20 0 15 5\n", "10 51 5 4\n" ], "output": [ "20 0 10\n", "0 0 20\n", "-1\n" ] }	{"input":["20 20\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n","10 4\n0 1 4 2 7 0 10 0 5 8\n","10 7\n1(...TRUNCATED)	{"input":["1\n656 281\n","1\n666 760\n","2\n10 4\n1 5\n","1\n33993 6\n","1\n1656 9\n","1\n1425 1777\(...TRUNCATED)	1	2	{"language":[1],"solution":["p=10**9+7;\n\ndef modpow(x,n):\n\tif(n==0):\n\t\treturn 1;\n\telif(n%2=(...TRUNCATED)	{"language":[2,0,3,0,2,3,3,3,3,3,3,3,3,3,3,2,2,0,2,3,2,2,1,2,0,2,0,2,3,0,2,3,3,2,2,0,3,2,0,3,3,2,2,3(...TRUNCATED)	70	E	0	1,600	[ "*special", "binary search", "constructive algorithms", "interactive" ]	false	null	0
insect-colony-2	"Two students of AtCoder Kindergarten are fighting over candy packs.\n\nThere are three candy packs,(...TRUNCATED)	{ "input": [ "2 5\n1 3 4\n2 2 3\n" ], "output": [ "2\n" ] }	{"input":["9 530792195 6\n","0 0 10\n","1944219055 454183506 1369298327\n","914835 2742837 9234739\n(...TRUNCATED)	{"input":["1 0\n40654\n","3 3\n1 1 0\n1 2\n2 3\n3 1\n","5 4\n1 2 2 2 2\n1 2\n2 3\n1 4\n1 5\n","4 4\n(...TRUNCATED)	2	10	{"language":[2,2,4,2,2,2,3,4,2,2,2,4,2,4,2,3,2,2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,3,2,3(...TRUNCATED)	{"language":[2,2,4,2,2,2,2,3,3,2,3,3,4,2,2,3,2,3,2,2,2,2,2,2,2,3,2,4,2,4,1,2,4,3,2,4,4,2,2,3,4,2,2,2(...TRUNCATED)	1,348	E	0	2,500	[]	false	null	1,073,741,824
691_D. Swaps in Permutation	"Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles.\n(...TRUNCATED)	{ "input": [ "2\n3 1 1 5\n1 6 9\n3 2 6 7\n1 6 9" ], "output": [ "38\n36" ] }	{"input":["3 1\n-2 3\n-2 -2\n","-8916 9282\n2666 2344\n9109 -2730\n","0 45\n42 -47\n-51 -82\n","45 6(...TRUNCATED)	{"input":["5 5 2\n#####\n#A#B#\n# #\n#b#a#\n#####\n16 4 3\n################\n## ########## ##\n# (...TRUNCATED)	2	9	{"language":[1,1],"solution":["from collections import defaultdict\n\ndef solve(S):\n # Reverse S(...TRUNCATED)	{"language":[4,4,4,2,3,2,2,2,3,3,4,3,4,2,2,3,4,4,2,2,2,2,2,3,2,3,3,4,4,2,3,2,3,2,3,2,4,4,4,4,2,4,2,2(...TRUNCATED)	0		0	1,200	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	268,435,456
cdva1502	"Your friend Jeff Zebos has been trying to run his new online company, but it's not going very well.(...TRUNCATED)	{"input":["12\n1\n2\n3\n4\n5\n6\n7\n8\n9\n10\n39\n691\n"],"output":["\n1\n-1\n2\n3\n-1\n5\n4\n7\n-1\(...TRUNCATED)	{"input":["20 10 3\nebebccacdb\neeebccddeT\neadebecaac\nadeeeaccbc\nbaccccdaed\ndeabceabba\ndadbecba(...TRUNCATED)	{ "input": [], "output": [] }	2	0	{"language":[3,2,4,3,2,4,2,3,4,3,3,4,2,2,3,3,2,2,3,2,3,2,3,4,2,2,2,2,2,2,3,3,2,2,2,2,2,3,2,3,2,2,2,2(...TRUNCATED)	{"language":[2,0,0,2,0,2,0,0,0,2,2,2,2,0,0,0,0,2,0,4,2,0,4,0,0,0,0,0,2,0,4,2,4,2,0,2,0,0,2,2,2,0,0,0(...TRUNCATED)	143	C	0	1,500	[ "implementation", "strings" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
348_A. Mafia	"The bloodiest battle of World War II has started. Germany and its allies have attacked the Soviet u(...TRUNCATED)	{"input":["3\n7 7 3 5\n1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 5\n4 5 2 3\n1 2\n2 3\n3 4\n4 1\n4 2\n4 3 2 1\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\n1 1\n5 2\n6 3","4\n1 5\n4 7\n2 1\n6 4","10\n1375710043 178537096\n705445072 318106937\(...TRUNCATED)	6	0	{"language":[3,1,1,4,4,3,4,3,1,1,2,2,3,4,3,1,1,3,2,4,4,3,4,2,4,2,4,4,3,3,4,3,4,1,1,2,2,3,3,2,2,4,2,4(...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,244		0	2,300	[ "implementation" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
roy-and-wobbly-numbers	"Allen and Bessie are playing a simple number game. They both know a function f: \\{0, 1\\}^n → R,(...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":["3 1\nerase -1\nerase 0\nerase -2147483648\n","26 25\ndefragment\nerase 1\nerase -15602008(...TRUNCATED)	{"input":["2 0\n1 2\n","2 1\n1 3\n","3 3\n1 2\n1 5\n2 3\n","2 0\n1 0\n","4 0\n1 0\n","4 0\n1 -1\n","(...TRUNCATED)	2	9	{"language":[2,3,3,2,4,1,3,2,4,2,2,3,2,3,4,4,3,3,3,4,2,3,3,2,2,3,4,2,3,2,4,3,4,2,3,4,2,2,3,2,4,4,2,3(...TRUNCATED)	{"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	188	I	1,000	3,400	[ "games", "graphs" ]	true	{ "nanos": 0, "seconds": 1 }	256,000,000
p02613 AtCoder Beginner Contest 173 - Judge Status Summary	Example Input 2 -3 4 L 2 5 ? 3 5 Output 2 L 4 L 3	{"input":["6 10\nalloc 5\nalloc 3\nerase 1\nalloc 6\ndefragment\nalloc 6\n"],"output":["1\n2\nNULL\n(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["0 -2 -1\n","563 -23532 1232\n","0 2 0\n","0 10 20\n","-50000 100001 -50000\n","50000 1100(...TRUNCATED)	2	9	{"language":[1,3,2,2,2,4,1,4,4,2,4,3,4,4,4,4,2,2,1,4,2,2,4,2,2,4,1,4,4,2,2,2,2,2,4,4,3,2,4,4,4,3,2,2(...TRUNCATED)	{"language":[2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,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(...TRUNCATED)	483		0	0	[ "interactive", "math", "number theory" ]	false	null	256,000,000