Datasets:

TheFactoryX
/

edition_0762_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
acdemy	"Chef and his girlfriend are going to have a promenade. They are walking along the straight road whi(...TRUNCATED)	{"input":["9\ndo\nthe\nbest\nand\nenjoy\ntoday\nat\nacm\nicpc\n14\noh\nyes\nby\nfar\nit\nis\nwow\nso(...TRUNCATED)	{"input":["3\n121339 121339 121339 55451923 531222142 121339 121339 435485671 121339\n","3\n1 7 9232(...TRUNCATED)	{"input":["4 0\n","8 9\n1 2\n2 3\n3 4\n4 1\n5 6\n6 7\n7 1\n8 5\n6 8\n","11 9\n5 9\n8 5\n11 3\n11 1\n(...TRUNCATED)	1	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,4,2,4,4,2,1,4,2,4,2,2,2,4,2,4,4,1,2,4,2,2,4,1,4,2,4,4,2,4,4,4,2,4,4,2,2,4,2,3,2,4,4,2(...TRUNCATED)	560	A	0	900	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	0
pcsc1	"There are N children, numbered 1, 2, ..., N.\n\nSnuke has decided to distribute x sweets among them(...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":["36\n2 2 2 8 9 4 8 5\n9 1 7 6 10 6 9 3\n10 2 4 6 6 2 1 1\n9 6 2 3 5 7 7 3\n6 6 3 9 10 9 1 (...TRUNCATED)	{"input":["5\nAJMP\naB33d\nE\n86AE\nAM\n6\nJPEM\nWaEaETC302Q\nCP\nrTurnAGundam1isdefferentf","5\nAJM(...TRUNCATED)	2	9	{"language":[4,4,4,4,4,4,4,3,3,2,4,4,4,3,3,4,2,2,4,3,3,3,4,3,1,2,2,3,1,2,4,1,1,4,2,2,4,1,3,3,4,4,4,3(...TRUNCATED)	{"language":[2,2,2,3,4,2,2,4,2,2,3,2,3,2,2,2,4,2,2,2,2,2,3,3,2,3,3,2,4,2,2,2,2,2,3,2,2,2,2,1,3,2,2,2(...TRUNCATED)	433	C	1,500	2,400	[ "constructive algorithms", "dfs and similar", "dp", "greedy", "trees" ]	false		{ "nanos": 0, "seconds": 2 }	134,217,728
jumping-frog	"Two-gram is an ordered pair (i.e. string of length two) of capital Latin letters. For example, \"AZ(...TRUNCATED)	{"input":["+Mike\nMike:hello\n+Kate\n+Dmitry\n-Dmitry\nKate:hi\n-Kate\n","+Mike\n-Mike\n+Mike\nMike:(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	0	{"language":[2,2,4,2,2,2,2,2,2,2,2,2,4,4,4,2,2,2,2,2,2,1,2,2,2,2,2,1,2,4,2,4,4,2,2,2,2,2,2,2,2,2,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)	379	D	2,000	0	[ "" ]	false		{ "nanos": 0, "seconds": 3 }	1,073,741,824
p02679 AtCoder Beginner Contest 168 - ∙ (Bullet)	"Problem\n\nA large-scale cluster † type supercomputer (commonly known as \"SAKURA\") cluster at M(...TRUNCATED)	{"input":["7\n0 8 9\n5 9 -2\n6 -8 -7\n9 4 5\n-4 -9 9\n-4 5 2\n-6 8 -7\n","2\n1 0 0\n1 1 0\n","3\n1 0(...TRUNCATED)	{"input":["2\n1 1 3 1\n3\n0 1 2\n"],"output":[" (...TRUNCATED)	{"input":["7 7 19\n#.....#\n..#.#..\n.#...#.\n...#...\n.#...#.\n..#.#..\n#.....#\n","4 6 3\n#.....\n(...TRUNCATED)	2	13	{"language":[2,2,2,3,4,2,2,2,3,2,2,4,4,3,2,2,3,2,2,2,2,2,2,2,2,2,2,3,2,2,3,4,2,1,1,1,2,2,2,2,4,2,2,2(...TRUNCATED)	{"language":[2,2,3,2,2,2,2,2,4,4,4,2,4,2,4,2,2,3,2,2,2,2,2,2,4,4,2,3,2,2,4,2,2,2,2,2,2,3,2,4,4,2,2,4(...TRUNCATED)	925		3,500	1,600	[ "brute force" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
331_E2. Deja Vu	"Princess Heidi decided to give orders to all her K Rebel ship commanders in person. Unfortunately, (...TRUNCATED)	{"input":["10000 01000 00100 11000 01100 11111 01110 11100 10110 11110\n10101 01000 00000 11001 0110(...TRUNCATED)	{"input":["53812 4 967428361\n","7 2 400166453\n","75727 16 485722667\n","65536 10 802338989\n","655(...TRUNCATED)	{"input":["36\n2 2 2 8 9 4 8 5\n9 1 7 6 10 6 9 3\n10 2 4 6 6 2 1 1\n9 6 2 3 5 7 7 3\n6 6 3 9 10 9 1 (...TRUNCATED)	2	6	{"language":[2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,1,2,2,2,2,2,4,2,2,2,2,2,2,1,4,2,2(...TRUNCATED)	{"language":[2,4,3,2,2,2,2,2,2,4,2,2,2,4,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,4,2,2,2,2,2,2,2(...TRUNCATED)	630	A	500	0	[ "math", "number theory", "sortings" ]	false		{ "nanos": 0, "seconds": 8 }	256,000,000
433_A. Kitahara Haruki's Gift	"Problem:\n\nRani and Nandu decide to play a number game. Both play alternately, Rani playing the fi(...TRUNCATED)	{"input":["1\n1 1 0 1 0 0 0 1 0 1\n3 4 5 6 7 8 9 -2 -3 4 -2","3\n1 1 1 1 1 1 0 0 1 1\n0 1 0 1 1 1 1 (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["8 12\n1 2\n2 3\n4 5\n5 6\n6 7\n7 8\n1 4\n4 7\n2 5\n5 8\n3 6\n6 9\n","7 3\n3 2\n2 1\n1 4\n(...TRUNCATED)	2	0	{"language":[4,2,2,2,2,2,3,2,2,2,2,2,2,2,2,3,2,2,2,3,2,2,3,2,2,2,2,2,2,2,2,2,4,2,2,4,2,3,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,176		0	2,300	[]	true		{ "nanos": 0, "seconds": 1 }	256,000,000
378_C. Maze	"Little Chris is participating in a graph cutting contest. He's a pro. The time has come to test his(...TRUNCATED)	{"input":["7 6 6\n3 2\n1 7\n5 7\n3 7\n6 4\n8 9\n8 5\n","5 2 2\n1 1\n4 1\n2 3\n3 2\n3 4\n"],"output":(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["4\n3\n1 4 2\n1 3 1\n2\n2 4\n2 3\n2\n1 1100000000\n1 1000000000\n4\n3 10 5 8\n2 5 2 4\n","(...TRUNCATED)	5	8	{"language":[2,2,2,4,2,4,2,4,4,4,4,2,4,2,4,2,4,3,2,2,2,4,2,2,2,2,1,4,4,4,4,2,2,2,2,4,4,2,4,4,2,4,2,3(...TRUNCATED)	{"language":[2,4,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)	0		0	0	[ "implementation" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
chefrp	"There are some coins in the xy-plane. The positions of the coins are represented by a grid of chara(...TRUNCATED)	{ "input": [ "6 1 2 3 4 5", "6 200 2 3 4 5" ], "output": [ "1", "1" ] }	{"input":["10\n100000000 200000000 300000000 20 500000000 600000000 700000000 800000000 900000000 10(...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)	2	6	{"language":[2,4,2,4,2,2,2,2,2,2,2,2,4,4,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)	{"language":[2,1,4,2,2,2,4,2,3,2,2,2,2,4,2,2,2,2,2,2,3,4,2,4,4,4,2,3,4,3,2,3,4,3,2,2,3,2,2,4,2,2,4,2(...TRUNCATED)	272		500	0	[ "graphs" ]	false	"標準録画で 120 分のビデオテープがあります。テープを完全に巻き戻した(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	268,435,456
643_B. Bear and Two Paths	"Your math teacher gave you the following problem:\n\nThere are n segments on the x-axis, [l_1; r_1](...TRUNCATED)	{"input":["4\n3 3\n1 2\n2 3\n3 1\n3 6\n1 2\n2 1\n2 3\n3 2\n1 3\n3 1\n7 10\n1 2\n2 3\n3 1\n1 4\n4 5\n(...TRUNCATED)	{"input":["3 7\n3 2 1\n","4 97\n97 1 50 10\n","5 25\n24 5 15 25 23\n","3 3\n3 2 1\n","4 18\n3 1 1 2\(...TRUNCATED)	{ "input": [], "output": [] }	2	0	{"language":[4,4,1,4,2,4,4,1,4,1,3,2,2,3,1,4,1,4,3,3,4,4,3,2,3,1,2,4,2,3,1,4,4,3,3,2,4,4,2,4,1,2,3,4(...TRUNCATED)	{"language":[2,3,2,4,3,2,2,4,2,3,4,4,2,4,2,2,2,3,2,3,2,3,2,3,2,4,2,4,2,3,4,3,2,4,2,4,3,4,2,4,4,4,4,4(...TRUNCATED)	0	D	0	1,900	[]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
p00320 Cuboid	"There are N people numbered 1 to N. Each person wears a red hat or a blue hat.\n\nYou are given a s(...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": [], "output": [] }	2	0	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2],"solution":["#include <bits/stdc++.h>\nusing n(...TRUNCATED)	{ "language": [], "solution": [] }	0	B	0	0	[ "dfs and similar", "interactive", "trees" ]	false		{ "nanos": 500000000, "seconds": 0 }	512,000,000