Datasets:

TheFactoryX
/

edition_1223_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
playing-with-substrings	"Recenlty Luba got a credit card and started to use it. Let's consider n consecutive days Luba uses (...TRUNCATED)	{ "input": [ "3 6\n2 3 5\n", "6 7\n1 2 3 4 5 6\n" ], "output": [ "2\n", "7\n" ] }	{"input":["2\n1 2\n","100\n61 96 25 10 50 71 38 77 76 75 59 100 89 66 6 99 2 13 3 23 91 93 22 92 4 8(...TRUNCATED)	{"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)	2	8	{"language":[4,4,4,2,4,1,2,2,2,2,3,2,2,4,3,2,1,3,2,3,2,2,1,2,2,4,2,4,2,4,2,2,1,4,1,2,2,4,2,1,3,4,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,3,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,428	B	0	1,100	[ "dp", "implementation", "sortings" ]	false	{ "nanos": 0, "seconds": 2 }	268,435,456
digital-numbers	"Chouti was tired of the tedious homework, so he opened up an old programming problem he created yea(...TRUNCATED)	{ "input": [ "eggegg\n\nSAMPLE" ], "output": [ "egg" ] }	{ "input": [ "5\n90 94\n26 25\n64 84\n14 6\n20 96\n" ], "output": [ "1842\n12\n1015\n3\n1908\n" ] }	{"input":["5\n1 2 0\n1 3 0\n3 5 0\n3 4 0\n3\n3\n4\n1\n3\n4\n","20\n9 11 0\n1 5 0\n1 14 0\n5 17 0\n14(...TRUNCATED)	2	9	{"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": [], "solution": [] }	0	D	0	0	[ "constructive algorithms", "dsu", "math" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
p02405 Print a Chessboard	"You are given an array of n positive integers a_1, a_2, ..., a_n. You can perform the following ope(...TRUNCATED)	{"input":["3 10\n2 3 2\n6\n1 5\n2 1 10\n2 2 9\n2 5 6\n3 1 7 8\n4 1 2 3 4\n"],"output":["\nYES\nYES\n(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["5\n2 1\n5 2\n10 3\n25 4\n25479 33\n","5\n2 1\n9 1\n10 3\n25 4\n25479 33\n","5\n1 1\n9 1\n(...TRUNCATED)	2	11	{"language":[2,2,2,2,2,3,2,4,2,2,4,2,3,2,2,2,2,2,2,2,4,4,2,2,2,2,4,2,4,2,2,2,2,3,4,2,2,2,2,4,1,2,2,4(...TRUNCATED)	{"language":[3,3,2,2,3,2,1,1,2,3,2,4,2,2,4,1,4,4,3,2,3,3,4,4,4,4,1,3,2,2,4,2,4,4,4,2,2,2,4,4,1,2,3,2(...TRUNCATED)	1,136	E	3,000	1,400	[ "" ]	false	null	134,217,728
1513_C. Add One	"Find the number of ways to divide an array a of n integers into any number of disjoint non-empty se(...TRUNCATED)	{"input":["3\nTroll likes Dracul\nDracul likes Anka\nSnowy likes Hexadecimal\n210 200 180\n","2\nAnk(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	9	{"language":[3,3,2,3,2,4,4,1,4,3,3,3,3,2,3,3,3,4,1,3,2,3,4,3,2,3,3,3,2,4,4,2,2,2,2,3,2,3,4,2,4,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,0,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,2(...TRUNCATED)	789	A	0	3,000	[ "constructive algorithms", "dfs and similar", "dp" ]	true	{ "nanos": 0, "seconds": 5 }	256,000,000
p00074 Videotape	"All of us know that girls in Arpa’s land are... ok, you’ve got the idea :D\n\nAnyone knows that(...TRUNCATED)	{ "input": [ "3\n3 2 1\n1 2 3\n1 1\n1 2\n", "3\n1 2 3\n3 2 1\n1 1\n1 1\n" ], "output": [ "NO\n", "YES\n" ] }	{"input":["20\n76 86 70 7 16 24 10 62 26 29 40 65 55 49 34 55 92 47 43 100\n","100\n6591 1074 3466 3(...TRUNCATED)	{"input":["2 5 1\n0 4 6\n0 2 7\n","1 1 1000000000\n0 0 1\n","5 200 10\n1 1 1\n1000000000 200 1000000(...TRUNCATED)	2	0	{"language":[1,1],"solution":["def CheckIfProbablyPrime(x):\n return (2 << x - 2) % x\ndef primes(...TRUNCATED)	{"language":[2,2,3,4,4,4,1,2,3,4,3,1,2,4,4,2,4,4,1,4,3,3,3,2,4,3,2,4,2,2,2,2,2,2,4,2,4,4,4,2,4,3,2,4(...TRUNCATED)	954		0	1,900	[ "bitmasks", "brute force", "dp", "math" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
p00493 Zig-Zag Numbers	"Problem\n\nKND is a student programmer at the University of Aizu. His chest is known to be very sex(...TRUNCATED)	{"input":["4\n3\n4 5\n5 9\n7 7\n5\n11 19\n4 17\n16 16\n3 12\n14 17\n1\n1 10\n1\n1 1\n"],"output":["2(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\n2 3 6","3\n2 3 11","3\n3 2 3","3\n2 5 3","3\n2 2 3","3\n2 2 11","3\n3 2 6","3\n2 2 13"(...TRUNCATED)	2	0	{"language":[4,4,3,2,4,2,1,3,2,3,1,4,4,3,1,2,1,4,2,3,2,4,4,2,4,3,3,1,4,2,2,2,3,1,3,2,4,3,4,4,4,1,1,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)	699	D	0	2,500	[]	false	{ "nanos": 0, "seconds": 2 }	0
442_C. Artem and Array	"We have a sandglass consisting of two bulbs, bulb A and bulb B. These bulbs contain some amount of (...TRUNCATED)	{ "input": [ "2\n5\n6 5 4 3 2\n5\n3 4 3 1 1" ], "output": [ "6\n5\n" ] }	{"input":["20 101 100\n1 14 20 3 19 10 12 18 4 17 13 6 8 5 2 15 7 16 9 11\n69 53 101 100 41 38 63 84(...TRUNCATED)	{"input":["20\n76 86 70 7 16 24 10 62 26 29 40 65 87 49 34 55 92 47 43 100\n","100\n6591 1074 3466 3(...TRUNCATED)	2	9	{"language":[2,4,3,4,4,4,1,3,3,2,4,3,2,3,1,3,3,4,4,4,3,2,4,2,3,2,3,2,2,2,2,3,2,1,1,1,4,2,3,4,4,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	80	A	0	2,000	[]	true	{ "nanos": 0, "seconds": 1 }	256,000,000
nopc10	"ZS the Coder has drawn an undirected graph of n vertices numbered from 0 to n - 1 and m edges betwe(...TRUNCATED)	{ "input": [ "5\n2 3 4 6 8" ], "output": [ "1" ] }	{"input":["10 1 4 10 0\n","100 1 2 1000 0\n","1 11 12 0 10\n","1 2 3 0 0\n","8 6 13 2 5\n","8 3 5 1 (...TRUNCATED)	{"input":["30\n10 1 8 10 2 6 37 7 3 7 1 3 1 1 14 2 5 19 4 1 13 3 5 6 1 5 1 1 23 1\n98 4 43 41 56 58 (...TRUNCATED)	1	7	{"language":[2,2,2,2,2,2,4,2,2,2,2,2,2,2,3,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,2,2,2,2(...TRUNCATED)	{"language":[4,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,4,2,2,2,4,2,4,2,2(...TRUNCATED)	378	C1	0	2,600	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
p01931 Check answers	"This problem differs from the previous one only in the absence of the constraint on the equal lengt(...TRUNCATED)	{ "input": [ "4 5 3 1 5\n", "5 1 2 1 2\n", "3 3 1 1 1\n" ], "output": [ "Friendship\n", "First\n", "Second\n" ] }	{ "input": [], "output": [] }	{"input":["15\nLIRZOYANOVECLOX\n","23\nAACBBAAACCCCBAAADDDDDDD\n","2\nAQ\n","11\nAGRRGATTZZZ\n","3\n(...TRUNCATED)	2	10	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2],"solution":["#include <iostream>\n#inc(...TRUNCATED)	{"language":[2,2,2,2,4,2,4,2,4,2,2,2,4,2,2,2,3,2,2,2,2,2,0,2,2,2,4,2,2,4,2,0,2,2,2,2,1,0,2,2,1,2,2,2(...TRUNCATED)	478	F	1,500	1,000	[ "dp", "implementation" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
discover-the-monk	"Problem description.\n The problem statement is simple , you are given an array and you have to p(...TRUNCATED)	{ "input": [ "4\n4 4 4\n", "5\n2 3 5 5\n" ], "output": [ "6\n", "17\n" ] }	{"input":["1\n2\n999999997 999999998\n999999999 1000000000\n","4\n1\n1 1000000000\n5\n1 1\n12 18\n10(...TRUNCATED)	{"input":["89 1\n50 53 97 41 68 27 53 66 93 19 11 78 35 49 38 69 96 9 43 16 1 63 95 64 96 6 34 34 45(...TRUNCATED)	2	8	{"language":[3,2,2,2,2,2,4,1,2,4,2,2,4,2,2,2,2,2,2,4,4,2,3,3,2,2,4,3,2,4,2,2,2,1,2,2,2,2,4,2,2,4,4,4(...TRUNCATED)	{"language":[2,0,3,2,3,2,2,3,3,3,2,2,2,2,3,2,2,0,2,2,2,2,2,4,3,2,2,2,2,2,0,2,3,2,2,2,2,2,2,2,4,2,2,3(...TRUNCATED)	0	G	0	1,600	[ "geometry", "math" ]	false	{ "nanos": 0, "seconds": 8 }	256,000,000