Datasets:

TheFactoryX
/

edition_2528_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
1158_F. Density of subarrays	"Problem:\n\nRani and Nandu decide to play a number game. Both play alternately, Rani playing the fi(...TRUNCATED)	{ "input": [ "4 4\n1 2 -10 3\n1 3 1 -10\n2 4 -10 -1\n3 4 0 -3\n" ], "output": [ "4\n" ] }	{ "input": [], "output": [] }	{"input":["2\nacxz\nzxcb","2\nzxda\nzxcb\n\nSAMPLE","2\nzwac\nbcyz","2\nywac\nbcyz","2\nzxca\nbcxz\n(...TRUNCATED)	6	0	{"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":[3,2,3,3,2,2,2,3,1,2,2,3,2,4,3,4,3,1,4,3,4,3,3,4,4,4,4,4,3,3,4,3,3,4,4,2,4,3,2,4,3,4,4,2(...TRUNCATED)	0	E	0	2,800	[ "brute force", "implementation", "strings" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
746_F. Music in Car	"You can't possibly imagine how cold our friends are this winter in Nvodsk! Two of them play the fol(...TRUNCATED)	{ "input": [ "3\noxx" ], "output": [ "2" ] }	{"input":["0\n2000000000 2000000000 1\n","22\nCleo likes Snowy\nCleo likes Troll\nChapay likes Dracu(...TRUNCATED)	{"input":["15 12\n2 3\n2 14\n4 3\n4 10\n3 5\n1 4\n1 12\n4 15\n1 9\n10 7\n11 2\n12 8\n15 13\n1 6\n","(...TRUNCATED)	6	0	{ "language": [], "solution": [] }	{"language":[2,4,1,3,2,2,4,4,2,1,2,2,4,1,3,2,4,2,3,2,2,2,2,2,2,3,3,2,2,4,2,4,2,3,4,4,3,4,2,4,2,2,2,2(...TRUNCATED)	0		500	2,500	[]	false	{ "nanos": 0, "seconds": 2 }	0
70_C. Lucky Tickets	"We have a string s consisting of lowercase English letters. Snuke is partitioning s into some numbe(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["11 11\n6 2\n6 2\n1 2\n2 2\n3 1\n6 2\n1 1\n1 1\n3 1\n3 1\n6 2\n","21 7\n14 1\n882797755 2\(...TRUNCATED)	{"input":["9\ndo\nhte\nbest\nand\nenjoy\ntoday\nat\nacm\nicpc\n14\noh\nyes\nby\nfar\nit\nis\nwow\nso(...TRUNCATED)	2	0	{"language":[1,2,3,2,2,2,4,4,3,4,4,3,2,2,2,2,2,3,2,2,2,1,2,2,2,4,4,1,2,2,2,2,2,4,2,2,2,4,2,4,2,2,2,1(...TRUNCATED)	{ "language": [], "solution": [] }	188	B	0	2,000	[ "" ]	true	{ "nanos": 0, "seconds": 3 }	256,000,000
p01083 RedBlue	"Polycarp has recently created a new level in this cool new game Berlio Maker 85 and uploaded it onl(...TRUNCATED)	{"input":["12\n161735902 211047202 430302156 450968417 628894325 707723857 731963982 822804784 88089(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["11 11\n6 2\n6 2\n1 2\n3 2\n3 1\n6 2\n1 1\n1 1\n3 1\n3 1\n6 2\n","21 7\n14 1\n882797755 2\(...TRUNCATED)	2	10	{"language":[2,1,3,3,3,4,2,3,1,1,2,4,2,3,4,4,3,1,1,3,4,4,3,3,2,3,3,4,2,3,2,2,3,3,4,3,3,3,1,2,3,2,2,3(...TRUNCATED)	{ "language": [], "solution": [] }	702		1,500	1,200	[ "games", "graphs" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
p00914 Equal Sum Sets	"Let's call a string a phone number if it has length 11 and fits the pattern \"8xxxxxxxxxx\", where (...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":["7\n7 3 4 6 6 7\n","4\n3 3 4\n","6\n3 3 6 6 6\n","5\n4 4 4 5\n","9\n2 9 7 6 9 7 8 9\n","3\(...TRUNCATED)	{"input":["1\n2\n905303520 999999998\n999999999 1000000000\n","1\n10\n132182352 630066892\n323711215(...TRUNCATED)	1	0	{"language":[2,4,4,2,2,2,2,4,2,4,2,4,2,2,2,4,4,2,4,4,2,2,2,2,2,2,2,2,2,4,2,4,2,4,4,2,2,2,2,4,2,2,2,4(...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)	203	C	0	0	[ "" ]	true	{ "nanos": 0, "seconds": 2 }	0
438_A. The Child and Toy	"BCPC stands for Byteforces Collegiate Programming Contest, and is the most famous competition in By(...TRUNCATED)	{"input":["3\nAZAMON APPLE\nAZAMON AAAAAAAAAAALIBABA\nAPPLE BANANA\n"],"output":["AAZMON\n---\nAEPLP(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1\n3\n1 3 1\n1 2\n2 3\n1\n1\n1\n2\n","1\n3\n1 2\n2 4\n1\n1\n1\n2\n2\n1\n","2\n6\n1 2\n1 3(...TRUNCATED)	2	0	{"language":[2,4,1,2,2,2,4,4,2,2,4,4,2,2,2,2,2,2,2,2,3,2,4,1,2,2,2,2,2,2,2,1,2,2,2,1,4,2,3,2,2,2,2,3(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,3,2,4,2,2,2,4,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	765	A	0	2,500	[ "data structures", "dp", "greedy" ]	false	null	256,000,000
ankit-and-race-team-10	"There are n people and k keys on a straight line. Every person wants to get to the office which is (...TRUNCATED)	{ "input": [ "3\n3 4 2\n4 5 0\n325 265 1231232\n" ], "output": [ "7\n4\n76\n" ] }	{ "input": [], "output": [] }	{"input":["qqqqqqqqqq qqqqqqqq\n3\nqqqqqqqq qqqqqqqqq\nqqqqqqqqq qqqqq\nqqqqq p\n","wwwww w\n8\nwwww(...TRUNCATED)	5	0	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2(...TRUNCATED)	{"language":[3,3,1,4,4,4,4,2,2,4,4,3,2,1,2,2,2,3,2,4,4,2,4,3,4,2,4,2,4,2,3,2,4,4,1,2,3,2,4,2,3,3,4,4(...TRUNCATED)	699	A	1,750	0	[ "constructive algorithms", "graphs", "greedy", "implementation" ]	false	null	256,000,000
p03407 AtCoder Beginner Contest 091 - Two Coins	"Kitahara Haruki has bought n apples for Touma Kazusa and Ogiso Setsuna. Now he wants to divide all (...TRUNCATED)	{ "input": [ "3\nAFI\n", "6\nAFFAAA\n" ], "output": [ "1", "4" ] }	{ "input": [], "output": [] }	{"input":["5\n42665793 93310343 856080769 176604645 248258165\n10\n1 5 141156007\n2 5 5 3\n2 4 4 2\n(...TRUNCATED)	5	8	{"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": [], "solution": [] }	1,081		0	0	[ "binary search", "data structures", "sortings", "two pointers" ]	false	null	268,435,456
433_A. Kitahara Haruki's Gift	"Malek has recently found a treasure map. While he was looking for a treasure he found a locked door(...TRUNCATED)	{ "input": [ "3 6\n2 3 5\n", "6 7\n1 2 3 4 5 6\n" ], "output": [ "2\n", "7\n" ] }	{ "input": [], "output": [] }	{"input":["10\n4643665 282618243 791521863 214307200 976959598 590907019 166397456 708291256 8537738(...TRUNCATED)	2	10	{"language":[2,2,2,2,2,2,2,2,4,2,2,4,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(...TRUNCATED)	{ "language": [], "solution": [] }	252		0	0	[]	false	null	256,000,000
1216_D. Swords	"A permutation — is a sequence of length n integers from 1 to n, in which all the numbers occur ex(...TRUNCATED)	{"input":["4\n3\n1 4 2\n1 3 1\n2\n2 4\n2 3\n2\n1 1000000000\n1 1000000000\n4\n3 10 5 8\n2 5 2 4\n"],(...TRUNCATED)	{"input":["2 2 1\n0 1 1 1\n","5 5 20\n3 1 3 3\n1 2 2 2\n4 3 4 2\n3 2 2 2\n3 4 2 4\n4 1 4 5\n4 3 5 3\(...TRUNCATED)	{"input":["3\n7 7 3 5\n1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 5\n4 5 2 4\n1 2\n2 3\n3 4\n4 1\n4 2\n4 3 2 1\(...TRUNCATED)	2	0	{"language":[3,2,4,4,2,4,4,4,3,3,3,2,3,3,4,3,3,2,4,4,2,4,4,1,3,1,4,3,1,1,2,3,3,4,2,1,2,2,4,2,2,4,2,2(...TRUNCATED)	{"language":[2,2,2,0,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,0,0,0,2,0,2,2,2,2,0,2,2,0,2,2,0,2,2,2,2,0,2,0,2,2(...TRUNCATED)	0		500	2,100	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	1,073,741,824