Datasets:

TheFactoryX
/

edition_2217_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
cdva1502	"Apple adventure\n\nsquare1001 and E869120 got lost in the grid world of $ H $ rows and $ W $ rows!\(...TRUNCATED)	{ "input": [ "3 4", "1 21" ], "output": [ "Even", "Odd" ] }	{"input":["205078485761\n","873109054817\n","518649879439\n","401021537803\n","821985629174\n","6146(...TRUNCATED)	{"input":["7 11 10 5\n6 18 32 63 66 68 87\n6 8 15 23 25 41 53 59 60 75 90\n","13 17 14 1\n6 9 10 12 (...TRUNCATED)	2	0	{"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],"solution":["imp(...TRUNCATED)	{"language":[2,2,3,2,2,4,4,2,2,2,4,2,2,2,2,2,3,2,2,2,4,3,3,3,2,3,3,2,3,4,2,3,2,2,2,2,4,4,3,2,2,3,2,2(...TRUNCATED)	1,101		0	800	[]	false	"G: 運命力 - Destiny Draw -\n\n問題\n\nMr. D はカードゲームで勝負をすることに(...TRUNCATED)	{ "nanos": 0, "seconds": 1 }	0
p03010 diverta 2019 Programming Contest 2 - Diverta City	"In a mystical TimeLand, a person's health and wealth is measured in terms of time(seconds) left. \n(...TRUNCATED)	{ "input": [ "1 1 1 4 4\n", "2 0 0 0 4\n", "4 5 6 5 6\n" ], "output": [ "3\n", "1\n", "0\n" ] }	{"input":["9\n72 49 39 50 68 35 75 94 56\n","4\n2 3 1 2\n","8\n3 4 3 1 1 3 4 1\n","1\n4\n","7\n2 1 2(...TRUNCATED)	{"input":["5\n2 1 1 1 2\n","6\n5 1 3 4 8 3\n","5\n1 5 7 1 2\n","6\n5 1 3 4 5 3\n","2\n1000010 100100(...TRUNCATED)	2	6	{"language":[2,2,2,2,2,3,3,2,2,2,4,2,2,2,2,2,2,3,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,3,2,2,4,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	820		1,500	1,300	[]	false		null	0
p02014 Rough Sorting	"D: The Diversity of Prime Factorization\n\nProblem\n\nEbi-chan has the FACTORIZATION MACHINE, which(...TRUNCATED)	{"input":["icm codeforces\n1\ncodeforces technex\n","ross rachel\n4\nross joey\nrachel phoebe\nphoeb(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\n77 42 77\n77 77\n77\n","3\n77 31 77\n77 77\n77\n","4\n1 5 7 12\n1 5 7\n1 5\n","3\n77 7(...TRUNCATED)	2	8	{"language":[2,2,2,2,4,2,4,2,2,4,2,2,2,2,2,4,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4(...TRUNCATED)	{"language":[4,2,2,3,2,4,4,2,2,2,2,4,4,2,2,2,4,2,2,3,3,2,3,2,4,4,2,2,3,4,2,2,3,4,2,2,2,2,1,4,2,4,2,4(...TRUNCATED)	343	F	0	1,600	[ "brute force", "data structures", "dsu", "graphs", "sortings" ]	false		{ "nanos": 0, "seconds": 1 }	134,217,728
acdemy	"Everybody knows that Balázs has the fanciest fence in the whole town. It's built up from N fancy s(...TRUNCATED)	{"input":["5 10\n-5 0 10 -11 0\n","5 10\n-1 5 0 -5 3\n","3 4\n-10 0 20\n"],"output":["2\n","0\n","-1(...TRUNCATED)	{"input":["264193194 -448876521 736684426 -633906160 -328597212 -47935734\n","-357531221 381512519 -(...TRUNCATED)	{"input":["4 4 3\n1 2 3\n1 2 1\n2 3 3\n1 3 3\n1 4 4\n","5 4 2\n4 5\n1 2 100\n1 3 100\n3 4 10\n3 5 20(...TRUNCATED)	1	0	{"language":[2,3,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,3,2,4,2,4,2,3,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,1,2(...TRUNCATED)	{"language":[2,3,2,2,0,2,2,2,4,2,2,2,2,1,2,2,2,4,2,3,2,2,2,2,2,2,2,2,0,4,0,2,1,2,3,2,2,2,3,3,2,2,2,2(...TRUNCATED)	754	B	0	0	[ "" ]	true	"Problem\n\nKND君は会津大学に在籍する学生プログラマである。彼の住む町の(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	256,000,000
hermione-vs-draco	"In PrimeLand, there existed a very handsome young prince named Prima. He greatly desired the Prince(...TRUNCATED)	{ "input": [ "3\n5\n7\n10\n\nSAMPLE" ], "output": [ "2\n3\n5\n" ] }	{"input":["10\n100000000 200000000 300000000 20 500000000 600000000 700000000 800000000 900000000 10(...TRUNCATED)	{ "input": [], "output": [] }	5	0	{"language":[3,2,2,2,3,3,4,3,3,4,2,3,2,4,2,2,4,2,2,2,2,4,3,2,3,2,2,4,4,4,2,2,2,3,3,2,3,3,2,3,2,2,3,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,3,2,2,2,2,2,2,2(...TRUNCATED)	1,244	E	1,000	0	[ "graphs", "greedy", "shortest paths" ]	false		{ "nanos": 0, "seconds": 2 }	134,217,728
656_E. Out of Controls	"Let's denote a function \n\n<image>\n\nYou are given an array a consisting of n integers. You have (...TRUNCATED)	{ "input": [ "5 5\n1 2 3 4 5\n", "3 1\n1 1 2\n", "5 2\n1 1 2 1 3\n" ], "output": [ "16", "3", "14" ] }	{"input":["6\nbabcdc\n","5\nbadec\n","3\naba\n","7\nbaaaccb\n","3\naaa\n","4\npara\n","3\nbac\n","7\(...TRUNCATED)	{"input":["3\nDSAWWAW\nD\nAW\n","3\nWSAWDAW\nD\nAW\n","3\nDAAWWSW\nD\nAW\n","3\nWAWWASD\nD\nWA\n","3(...TRUNCATED)	2	8	{"language":[2,2,2,2,2,2,2,2,4,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,3,2,2,2,2,2,2,2(...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)	405		0	2,300	[ "implementation", "sortings", "strings" ]	false		{ "nanos": 0, "seconds": 2 }	1,073,741,824
83_C. Track	"Monk loves cakes! He visits the Binary Bakery to buy some of his favorite cheesecakes. \nThe owner(...TRUNCATED)	{ "input": [ "2 5\n1 3 4\n2 2 3\n" ], "output": [ "2\n" ] }	{ "input": [], "output": [] }	{"input":["10 7\n3 4\n8 6\n7 8\n3 1\n9 10\n10 6\n9 4\n","10 16\n9 8\n1 2\n9 5\n5 4\n9 2\n3 2\n1 6\n5(...TRUNCATED)	6	11	{ "language": [], "solution": [] }	{"language":[2,2,2,2,3,4,2,2,4,2,2,4,4,1,4,2,2,4,3,4,3,4,4,4,4,2,3,2,4,3,3,2,2,2,2,2,3,4,2,2,2,4,2,4(...TRUNCATED)	272		1,500	0	[ "greedy", "strings" ]	false		{ "nanos": 0, "seconds": 8 }	0
p03503 AtCoder Beginner Contest 080 - Shopping Street	"Surya loves to play with primes. One day, he asked his friend don to print any number in the form o(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\n7089544 9134148 -5332724\n368810 1638695 7889905\n-3866235 -4257263 5802154\n","16\n-3(...TRUNCATED)	{"input":["4000 4000 2\n","3 300 167\n","3 300 2\n","4 4 2\n","3 2 70\n","1625 3998 2\n","300 403 30(...TRUNCATED)	1	7	{"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":[3,1,2,2,1,2,4,3,3,2,2,4,2,4,4,4,2,2,2,1,2,4,2,1,1,4,3,3,3,2,4,2,2,2,2,3,2,4,4,2,2,4,2,2(...TRUNCATED)	893	C	2,000	2,300	[ "" ]	false		null	1,073,741,824
bogosort	"Polycarpus enjoys studying Berland hieroglyphs. Once Polycarp got hold of two ancient Berland pictu(...TRUNCATED)	{"input":["o.x.\no...\n.x..\nooxx\n","x.ox\nox..\nx.o.\noo.x\n","xx..\n.oo.\nx...\noox.\n","x..x\n..(...TRUNCATED)	{ "input": [ "4\n4568\n4545992\n9265642\n4592886" ], "output": [ "13598\n27154740\n58212156\n27455323\n" ] }	{"input":["3\n7089544 9134148 -5332724\n368810 1638695 13258988\n-3866235 -4257263 5802154\n","16\n-(...TRUNCATED)	2	0	{"language":[3,3,2,2,3,2,2,2,3,3,3,2,3,4,3,2,3,2,3,2,2,2,2,3,3,3,3,2,2,3,3,2,3,2,3,4,3,2,3,2,4,1,4,3(...TRUNCATED)	{"language":[4,2,3,4,3,2,4,4,4,2,2,4,2,4,4,4,2,4,2,2,4,2,2,3,3,4,3,3,2,4,2,3,3,4,3,2,2,3,3,2,4,3,4,3(...TRUNCATED)	915	B	1,750	0	[ "implementation", "strings" ]	false		{ "nanos": 0, "seconds": 2 }	0
p01262 Adaptive Time Slicing Quantization	"To improve the boomerang throwing skills of the animals, Zookeeper has set up an n × n grid with s(...TRUNCATED)	{"input":["6 10\nalloc 5\nalloc 3\nerase 1\nalloc 6\ndefragment\nalloc 6\n"],"output":["1\n2\nNULL\n(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	7	{"language":[1,4,2,3,2,2,2,4,1,2,1,3,1,2,3,3,2,4,3,3,2,2,3,4,4,4,2,1,3,3,2,2,4,1,3,2,3,3,2,4,4,3,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,311		0	2,000	[ "meet-in-the-middle" ]	false		{ "nanos": 0, "seconds": 2 }	134,217,728