Datasets:

TheFactoryX
/

edition_1821_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
1211_I. Unusual Graph	"Monk's birthday is coming this weekend! He wants to plan a Birthday party and is preparing an invit(...TRUNCATED)	{"input":["100\n5\n48 141 231 314 425\n7\n0 19\n50 98\n143 30\n231 55\n342 0\n365 100\n600 10","180\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\nnxx","3\nnwx","3\nxxo","3\nxwn","3\nowx","3\npxx","3\npyx","3\npzx","3\npzw","3\npwz",(...TRUNCATED)	5	11	{"language":[2,3,2,2,2,2,2,2,2,2,2,2,2,4,2,2,3,4,2,2,2,2,2,2,2,2,2,2,2,4,2,4,4,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,1,4,4,2,2,3,2,4,2,2,2,4,2,2,4,4,2,4,2,2,2,2,3,2,2,2,2,2,2,2,4,3,4,2,1,2,2,4,2,2,4,4,2(...TRUNCATED)	1,455	D	0	1,500	[ "implementation" ]	false	{ "nanos": 0, "seconds": 1 }	0
455_C. Civilization	"Problem description.\nVipul is a hardworking super-hero who maintains the bracket ratio of all the (...TRUNCATED)	{"input":["341143514535\n314\n143565553551655311343411652235654535651124615163\n551544654451431564\n(...TRUNCATED)	{"input":["6\n0 1 3 2 1 2\n","4\n1 2 3 1\n","4\n1 1 1 2\n","4\n3 3 2 1\n","4\n1 2 1 1\n","4\n1 1 2 1(...TRUNCATED)	{"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)	6	12	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,4,4,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	464	B	0	2,500	[ "implementation" ]	false	null	0
lexicographically-preceding-permutation	"After hard work Igor decided to have some rest.\n\nHe decided to have a snail. He bought an aquariu(...TRUNCATED)	{ "input": [ "123+456\n", "192/5\n", "945%19\n" ], "output": [ "579\n", "38\n", "14\n" ] }	{"input":["19 20 196\n###.....##.#..#..##.\n####............##..\n###....#..#.#....#.#\n##....###...(...TRUNCATED)	{"input":["10 10\n4 5 6 7 8 11 14 15 17 19\n1 4 12 10 13 20 14 20 13 16\n-7 16\n1 1\n7 9\n1 4\n4 8\n(...TRUNCATED)	6	0	{"language":[2],"solution":["#include <iostream>\n#include <string>\n#include <cstdio>\n#include <ve(...TRUNCATED)	{"language":[2,2,2,2,4,2,4,4,2,2,2,2,2,2,2,1,2,2,4,4,2,2,4,2,2,2,2,2,3,2,2,2,2,3,2,2,2,1,2,2,2,2,2,2(...TRUNCATED)	656	A	3,750	2,500	[ "math" ]	false	null	268,435,456
316_B2. EKG	"In the game Lizard Era: Beginning the protagonist will travel with three companions: Lynn, Meliana (...TRUNCATED)	{"input":["7 5\n1 2\n2 7\n7 6\n2 3\n3 4\n","2 1\n1 2\n","7 6\n1 2\n2 7\n7 6\n2 3\n3 4\n1 5\n"],"outp(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["4\n4 3 2 1\n2 3 4 1\n3\n1 2 3 4\n1 3 2 1\n2 4 2 3\n","4\n4 3 2 1\n2 3 4 1\n3\n1 2 3 4\n1 (...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,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2],"solutio(...TRUNCATED)	{"language":[2,3,3,0,2,2,2,4,2,2,2,2,2,2,0,3,3,2,2,3,4,3,2,3,3,2,2,2,3,2,2,2,2,4,0,2,3,0,2,3,2,4,2,2(...TRUNCATED)	70	E	3,000	0	[ "dsu", "graphs", "trees" ]	false	{ "nanos": 0, "seconds": 1 }	1,073,741,824
p00323 Metal Recycling	"Piet is one of the most known visual esoteric programming languages. The programs in Piet are const(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [ "1\n1\n1\n1\n1 1 1 1\n" ], "output": [ "1\n" ] }	{"input":["2\n2 2\nyz\n1 1\n2 2\nzy\n1 1\n","1\n11 2\nthisisatest\n3 7\n","3\n4 2\nabca\n1 3\n10 5\n(...TRUNCATED)	3	12	{"language":[2,4,2,2,2,2,2,2,2,3,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,4,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,2,2,4,2,2,2,2,2,2,2,4,2,4,4,4,4,2,2,2,2,2,4,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,4(...TRUNCATED)	662	D1	500	0	[ "constructive algorithms", "dfs and similar", "dp" ]	false	{ "nanos": 0, "seconds": 2 }	0
p03503 AtCoder Beginner Contest 080 - Shopping Street	"Vasya is currently at a car rental service, and he wants to reach cinema. The film he has bought a (...TRUNCATED)	{ "input": [ "3 4\n2 1 4\n3 1 3 1\n1 2\n", "3 3\n1 1\n1 2\n1 1\n" ], "output": [ "YES\n", "NO\n" ] }	{"input":["30 2\n26 11 22 16 14 29 16 14 8 23 21 22 11 24 15 23 22 1 11 20 23 29 13 19 19 15 13 2 7\(...TRUNCATED)	{"input":["21\n11 19 4 19 6 0 13 7 6 2 5 3 16 16 1 9 15 21 9 21 2\n","100\n57 85 27 81 41 27 73 10 7(...TRUNCATED)	1	0	{"language":[2,2,2,3,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(...TRUNCATED)	{"language":[4,4,4,1,2,4,1,4,2,4,1,4,2,1,1,2,1,4,2,3,4,3,3,4,2,4,2,2,4,4,3,1,2,2,2,3,4,3,4,2,3,3,2,2(...TRUNCATED)	1,219		500	1,700	[ "brute force" ]	false	{ "nanos": 0, "seconds": 6 }	0
754_E. Dasha and cyclic table	"You are given a graph with 3 ⋅ n vertices and m edges. You are to find a matching of n edges, or (...TRUNCATED)	{ "input": [ "4\naaa\nabc\nabdbca\nabba" ], "output": [ "YES\nNO\nYES\nYES\n" ] }	{"input":["8 10\ncwcwcwcwcw\ncrcrcrcrcr\ncwcwcwcwcw\ncrcrcrcrcr\ncwcwcwcwcw\ncrcrcrcrcr\ncwcwcwcwcw\(...TRUNCATED)	{"input":["80\n72 66 82 46 44 22 63 92 71 65 5 30 45 84 29 73 9 90 25 19 26 15 12 40 33 19 85 92 91 (...TRUNCATED)	2	2	{"language":[2,3,2,3,4,3,2,4,4,2,2,2,4,4,3,2,3,3,2,4,4,3,2,2,2,3,4,2,3,2,2,4,2,2,4,2,4,4,3,4,3,2,2,3(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,4,2,4,2,1,2,2,1,2,1,4,4,2,2,2,2,2,2,2,1,2,2,2,1,2,2,2,2,4,2,3,4,2,2,2(...TRUNCATED)	1,264	A	1,500	0	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1060_A. Phone Numbers	"After his wife's tragic death, Eurydice, Orpheus descended to the realm of death to see her. Reachi(...TRUNCATED)	{ "input": [ "3\n1\n0 1\n0 0\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1" ], "output": [ "yes\nyes\nno\n" ] }	{ "input": [], "output": [] }	{"input":["1\n2 2\n1 1\n1 3\n","1\n1 3\n3\n1 2 0\n","5\n4 5\n10 8 6 4\n1 2 3 4 5\n1 1\n3\n3\n1 1\n3\(...TRUNCATED)	2	9	{"language":[2,2,2,2,2,2,2,2,4,4,2,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,2,2,2,4,3,2(...TRUNCATED)	{"language":[2,2,2,3,2,2,4,4,2,2,2,2,4,2,2,4,4,2,2,4,2,2,2,2,2,2,4,4,2,4,2,2,2,4,2,2,4,2,2,3,3,3,2,2(...TRUNCATED)	331		500	1,900	[ "greedy", "implementation", "math", "ternary search" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
556_C. Case of Matryoshkas	"You can't possibly imagine how cold our friends are this winter in Nvodsk! Two of them play the fol(...TRUNCATED)	{ "input": [ "2 1\n1 2 2" ], "output": [ "1" ] }	{"input":["4 0 0\n1 -1\n1 3\n3 3\n3 -1\n","3 0 0\n-10 1\n0 2\n1 1\n","3 0 0\n-1 1\n0 3\n1 1\n","20 -(...TRUNCATED)	{"input":["3 2\n3\n2\n1","3 4\n3\n2\n1","3 0\n3\n2\n1","3 001\n3\n2\n1","5 1\n5\n3\n2\n1\n4","5 6\n1(...TRUNCATED)	5	10	{"language":[2,2,2,4,2,2,2,2,2,2,2,2,3,2,2,2,4,2,3,2,2,2,4,2,2,4,2,2,2,2,2,2,4,2,2,2,4,2,2,2,4,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	260		0	900	[]	false	{ "nanos": 0, "seconds": 1 }	512,000,000
1506_F. Triangular Paths	"One day, Taro received a strange email with only the number \"519345213244\" in the text. The email(...TRUNCATED)	{"input":["5\n4\n1 2 3 4\n5 10 15 20\n4\n1 2 1 2\n5 10 15 20\n4\n2 2 4 1\n2 8 19 1\n2\n1 1\n6 9\n1\n(...TRUNCATED)	{"input":["1 10\n778084 -205153\n778001 -205093\n778155 -205118\n778168 -204997\n778066 -205141\n778(...TRUNCATED)	{"input":["#(#(#((##((()))(((#)(#()#(((()()(()#(##(((()(((()))#(((((()(((((((()#((#((()(#(((()((*##((...TRUNCATED)	2	10	{"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":[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)	242	E	0	1,000	[ "brute force", "implementation", "strings" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000