Datasets:

TheFactoryX
/

edition_0583_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
634_C. Factory Repairs	"We have a string s consisting of lowercase English letters. Snuke is partitioning s into some numbe(...TRUNCATED)	{ "input": [ "3\n3 2 2\n", "4\n2 2 2 2\n" ], "output": [ "4\n", "3\n" ] }	{"input":["99 100 100 100 100\n","57 83 11 4 93\n","99 99 99 99 99\n","100 0 0 0 0\n","0 1 2 3 4\n",(...TRUNCATED)	{"input":["1 1 1 2\n5\n1000000000 1 10000\n35510851 1188 5566\n1000000000 1 10000\n1 1 10000\n5 100 (...TRUNCATED)	6	14	{ "language": [], "solution": [] }	{"language":[2,4,2,4,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,4,4,2,4,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2(...TRUNCATED)	1,070	B	2,500	1,000	[ "" ]	false	{ "nanos": 0, "seconds": 5 }	256,000,000
p00493 Zig-Zag Numbers	"Takahashi went to an all-you-can-eat buffet with N kinds of dishes and ate all of them (Dish 1, Dis(...TRUNCATED)	{"input":["3 1\n1 100 1","12 5\n43 94 27 3 69 99 56 25 8 15 46 8","3 1000\n1 100 1","6 14\n25 171 7 (...TRUNCATED)	{"input":["47\n169884146 730277703 8645016 732791141 331583052 25104065 895622218 478600214 92415406(...TRUNCATED)	{"input":["2\n1 20\n","10\n450661 128600 993228 725823 293549 33490 843121 528432 556169 448234\n","(...TRUNCATED)	2	9	{"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,2,4,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,4,3,2,2,2,2,2,2,3,2,2,2(...TRUNCATED)	963	A	0	1,500	[ "constructive algorithms" ]	false	null	256,000,000
1144_B. Parity Alternated Deletions	Example Input 2 -3 4 L 2 5 ? 3 5 Output 2 L 4 L 3	{"input":["4\n..E.\n.AD.\nB...\n..C.\nD\n4\n..E.\n.AD.\nB...\n..C.\nDR\n3\n...\n.A.\nBC.\n((URD)3L)2(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["9 3 23\n9 3 22\n10 3 28\n16 10 107\n20 8 102\n20 10 105\n20 10 155\n3 5 3\n4 2 11\n0 0 0"(...TRUNCATED)	2	7	{ "language": [], "solution": [] }	{"language":[2,2,2,2,2,2,2,0,0,2,2,0,2,2,4,2,2,4,0,0,2,2,0,2,2,0,0,2,2,2,2,2,2,2,0,2,2,2,2,2,0,2,2,2(...TRUNCATED)	85	D	1,000	0	[ "dp", "flows", "graph matchings", "greedy" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
p01576 Exciting Bicycle	"Harry, upon inquiring Helena Ravenclaw's ghost, came to know that she told Tom Riddle or You-know-w(...TRUNCATED)	{ "input": [ "7\nabacaba\n", "6\naabcfg\n" ], "output": [ "YES\n2 3\n", "NO\n" ] }	{ "input": [], "output": [] }	{"input":["1 16\n1\n","10 1\n-1 1 1 0 1 1 1 1 1 1\n","78 8\n-230 -757 673 -284 381 -324 -96 975 249 (...TRUNCATED)	2	15	{"language":[2,2,4,2,4,2,2,4,2,2,4,4,2,1,1,4,4,4,1,2,2,2,4,3,2,4,1,4,2,1,4,2,3,2,4,4,2,2,1,1,2,2,2,4(...TRUNCATED)	{ "language": [], "solution": [] }	0	D	0	0	[ "data structures", "greedy", "two pointers" ]	false	{ "nanos": 0, "seconds": 2 }	64,000,000
1540_C1. Converging Array (Easy Version)	"Rakesh have learn about vowel in school and is given an assignment by his teacher in which he has t(...TRUNCATED)	{"input":["99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999(...TRUNCATED)	{"input":["10 7\n1 10\n2 10\n3 10\n4 10\n5 10\n1 2\n1 3\n1 4\n1 5\n1 6\n","2 2\n1 1\n1 1\n","20 12\n(...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 2\n2\n1 1\n6 9\n1\n(...TRUNCATED)	3	2	{"language":[3,2,2,4,3,4,4,3,3,3,2,1,1,2,3,2,4,4,3,4,3,4,3,2,3,4,1,3,1,3,3,3,1,2,3,1,2,4,3,4,1,3,3,3(...TRUNCATED)	{"language":[2,2,2,2,2,3,2,2,4,4,4,2,4,4,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	914	C	1,250	2,000	[]	false	{ "nanos": 0, "seconds": 2 }	1,073,741,824
1382_A. Common Subsequence	"You're given an array a_1, …, a_n of n non-negative integers.\n\nLet's call it sharpened if and o(...TRUNCATED)	{"input":["6\n3\n0 0\n1 1\n1 2\n2\n1 0\n1000 3\n4\n10 1\n15 2\n10 2\n15 2\n1\n765 432\n2\n4 4\n4 3\n(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\n3 2 0\n","3\n1 2 0\n","3\n2 0 2\n","11\n1 1 1 1 1 2 4 2 2 2 1\n","5\n1 1 2 1 2\n","5\n(...TRUNCATED)	2	11	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include<iostream>\n#include<algo(...TRUNCATED)	{ "language": [], "solution": [] }	1,189		500	0	[ "meet-in-the-middle" ]	false	{ "nanos": 0, "seconds": 5 }	256,000,000
615_A. Bulbs	"Strings can be efficiently stored as a data structure, to have efficient searching methods.\nA new (...TRUNCATED)	{ "input": [ "5 10\n-1 -1 -1 -1 -1\n", "10 2\n10 -1 2 2 2 2 2 2 -1 10\n" ], "output": [ "-1\n", "32\n" ] }	{"input":["21 6\n12 15 14 4 4 7 2 4 11 1 15 4 12 11 12 8 11 12 3 4 4\n","50 25\n19 1 17 6 4 21 9 16 (...TRUNCATED)	{"input":["777 20\n","110 4\n","12 4\n","500 2\n","11 4\n","1 8\n","26 11\n","91 4\n","20 4\n","123 (...TRUNCATED)	5	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":[0,2,2,2,2,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,0,2,2,2,2,2],"solution":[(...TRUNCATED)	875	E	2,500	0	[ "constructive algorithms", "math" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
p02807 Dwango Programming Contest 6th - Fusing Slimes	"There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on(...TRUNCATED)	{ "input": [ "1\n2 3 Chandu\n\nSAMPLE" ], "output": [ "Daspal\n" ] }	{ "input": [ "4\n4568\n4545992\n9265642\n4592886" ], "output": [ "13598\n27154740\n58212156\n27455323\n" ] }	{ "input": [], "output": [] }	2	9	{"language":[2,2,2,2,2,2,2,4,2,2,1,4,2,2,2,2,4,2,4,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,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)	0	A	0	1,000	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	0
the-competitive-class-3	"The black king is standing on a chess field consisting of 109 rows and 109 columns. We will conside(...TRUNCATED)	{ "input": [ "1\n5 3\n200 6 9" ], "output": [ "120" ] }	{"input":["1 1 10\n10\n10\n","2 2 10\n9 11\n11 8\n","1 1 1000000000\n1000000000\n1\n","1 1 50\n1\n10(...TRUNCATED)	{"input":["12\n161735902 211047202 430302156 450968417 628894325 707723857 731963982 822804784 88089(...TRUNCATED)	5	10	{"language":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...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)	379		0	0	[ "" ]	false	{ "nanos": 0, "seconds": 4 }	0
378_C. Maze	"The Smart Beaver from ABBYY began to develop a new educational game for children. The rules of the (...TRUNCATED)	{"input":["10\n","3\n"],"output":["1 2 3 4 5 6 7 8 9 \n2 4 6 8 10 12 14 16 18 \n3 6 9 1(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["2 8","9 5","7 10","3 8","9 8","7 7","6 8","7 9","7 8","7 3","7 2","9 2","9 4","9 6","5 6"(...TRUNCATED)	2	8	{ "language": [], "solution": [] }	{"language":[3,3,2,0,0,3,2,2,4,2,0,4,0,0,0,0,2,0,2,0,2,2,0,0,0,2,2,1,2,3,2,2,0,4,2,4,2,2,2,2,2,2,3,0(...TRUNCATED)	0		2,000	1,500	[ "brute force", "greedy" ]	false	{ "nanos": 525000000, "seconds": 2 }	256,000,000