Datasets:

TheFactoryX
/

edition_2291_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
p03616 AtCoder Regular Contest 082 - Sandglass	There are five people playing a game called "Generosity". Each person gives some non-zero number of coins b as an initial bet. After all players make their bets of b coins, the following operation is repeated for several times: a coin is passed from one player to some other player. Your task is to write a program that...	{ "input": [ "5 10 25 12 4 1 \n3 16 28 100\n\nSAMPLE" ], "output": [ "4 12 10 \n100 28 16" ] }	{ "input": [ "30\n16 3\n-334 -500 -169 -724 -478 -358 -962 -464 -705 -145 -281 -827 -961 -491 -995 -942 \n22 2\n391 604 902 153 292 382 421 716 718 895 447 726 771 538 869 912 667 299 35 894 703 811 \n17 5\n-673 141 -253 -547 662 -37 723 -529 316 190 288 40 -264 446 -890 370 6 \n18 2\n-629 -84 756 966 -931 -944 -...	{ "input": [ "1 11 4 0 10\n", "17 10 12 6 8\n", "6 4 4 0 2\n", "50 4 5 5 -1\n", "20 2 40 1 2\n", "1000 501 510 0 499\n", "224 2 3 4 0\n", "11 2 4 2 1\n", "97 8 13 234 8\n", "15 5 100 1 4\n", "182 1 3 2 0\n", "1000 1 1000 2 -1\n", "1001 1 1 1000 0\n", "765 18 105...	5	10	{ "language": [ 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 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, ...	{ "language": [], "solution": [] }	621	A	0	0	[ "dp", "flows", "graph matchings", "greedy" ]	false	{ "nanos": 0, "seconds": 1 }	268,435,456
1257_G. Divisor Set	"Takahashi went to an all-you-can-eat buffet with N kinds of dishes and ate all of them (Dish 1, Dis(...TRUNCATED)	{ "input": [ "2\n5 156\n16 40\n\nSAMPLE" ], "output": [ "Case 1: 6\nCase 2: 3\n" ] }	{"input":["20\n...............\n","97\n*..*.......**......................(...TRUNCATED)	{"input":["0 1681261333\n","10 4\n","16384 40642166\n","727373493 403495785\n","62914844 907959152\n(...TRUNCATED)	2	10	{"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":[2,2,2,2,2,2,2,2,2,2,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,2,2,2,2,4,2,2(...TRUNCATED)	323		1,000	0	[ "data structures" ]	false	{ "nanos": 0, "seconds": 3 }	256,000,000
392_D. Three Arrays	"The educational program (AHK Education) of the Aiz Broadcasting Corporation broadcasts a program ca(...TRUNCATED)	{ "input": [ "3 8\n6 5 8\n", "7 20\n21 15 12 11 20 19 12\n" ], "output": [ "2\n", "6\n" ] }	{ "input": [], "output": [] }	{"input":["3\n6 13 24","3\n6 4 30","3\n12 11 12","3\n6 20 24","3\n6 7 30","3\n11 20 24","3\n10 7 30"(...TRUNCATED)	2	13	{"language":[3,3,4,2,3,3,3,3,3,2,3,4,3,3,4,3,4,3,3,3,3,3,3,3,3,4,3,3,3,4,3,1,2,4,2,3,4,3,3,3,3,3,3,3(...TRUNCATED)	{"language":[2,2,2,2,4,2,2,4,4,2,2,2,2,4,2,4,2,2,2,4,2,2,2,3,2,2,2,2,2,2,4,2,2,4,2,2,2,4,2,2,2,2,2,2(...TRUNCATED)	438		0	2,100	[]	false	{ "nanos": 0, "seconds": 6 }	256,000,000
209_B. Pixels	"Let's call a string a phone number if it has length 11 and fits the pattern \"8xxxxxxxxxx\", where (...TRUNCATED)	{"input":["1\n7\n.......\n.*.....\n.......\n.......\n.......\n.......\n.......\n\nSAMPLE"],"output":(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["10\n1000 910\n94625 95469 92038 95916 93405 95533 97004 92469 99853 94992 90361 99819 932(...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],"solution":["# @author Kil(...TRUNCATED)	{"language":[4,0,0,0,2,0,0,4,2,2,0,0,2,2,0,4,4,2,0,0,2,2,2,4,2,2,0,0,2,4,2,2,4,2,0,4,4,0,0,0,0,0,0,2(...TRUNCATED)	1,043	A	500	2,100	[ "binary search", "dp", "greedy", "sortings" ]	false	{ "nanos": 0, "seconds": 2 }	0
39_E. What Has Dirichlet Got to Do with That?	"You and your friend are participating in a TV show \"Run For Your Prize\".\n\nAt the start of the s(...TRUNCATED)	{"input":["3 3 3\n#.#\n#S.\n###","3 3 3\n.#\nS.","3 3 3\n\nS#","7 7 2\n\n\n...##\nS###\n.#.##\n.###"(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["6 4 2\n100110\n","4 2 1\n1001\n","64 40 7\n1010011100101100101011000001000011110111011011(...TRUNCATED)	2	0	{"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2(...TRUNCATED)	{"language":[2,2,4,2,4,2,2,4,4,4,4,2,2,2,2,2,2,2,2,2,2,4,4,1,2,2,2,3,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)	0		0	800	[ "combinatorics", "dp", "trees" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
571_B. Minimization	"Artsem has a friend Saunders from University of Chicago. Saunders presented him with the following (...TRUNCATED)	{ "input": [ "2\nacxz\nbcxz\n\nSAMPLE" ], "output": [ "Funny\nNot Funny\n" ] }	{"input":["993 992 991\n","100 1 10\n","960 935 994\n","99 8 99\n","60 16 1\n","759 10 258\n","24 19(...TRUNCATED)	{"input":["4 6\n1 2 101\n3 1 100\n2 4 100\n4 3 100\n1 4 100\n3 2 100","15 22\n8 13 33418\n14 15 5584(...TRUNCATED)	6	12	{"language":[2,2,2,3,4,2,2,2,3,2,2,4,4,3,2,2,3,2,2,2,2,2,2,2,2,2,2,3,2,2,3,4,2,1,1,1,2,2,2,2,4,2,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,2,2,2,2,2,2,2,2,2,2,4(...TRUNCATED)	0		2,000	0	[ "brute force", "greedy", "implementation", "math" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
p01835 Donut Decoration	"A string is called a k-string if it can be represented as k concatenated copies of some string. For(...TRUNCATED)	{ "input": [ "5 3 2\naaaaa\naaa\naab" ], "output": [ "1 6" ] }	{ "input": [ "1 1\n5\n2 1 6\n" ], "output": [ "1\n" ] }	{"input":["25\n11632 6805 12792 25513 4573 48789 42308 23247 17502 23125 43597 22173 52717 8637 3300(...TRUNCATED)	2	8	{"language":[1],"solution":["from collections import deque\nclass Frog():\n\t\n\tdef __init__(self,n(...TRUNCATED)	{ "language": [], "solution": [] }	0		3,000	1,600	[ "implementation", "math" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
737_A. Road to Cinema	"You are working as a private teacher. Since you are giving lessons to many pupils, you are very bus(...TRUNCATED)	{"input":["3 8\n10 20\n0 0\n20 40\n300 600\n30 60\n170 340\n50 100\n28 56\n90 180\n-4 -8\n-1 -2\n","(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["2\n1\n4","2\n2\n4","2\n2\n1","2\n0\n1","2\n0\n2","2\n2\n2","2\n4\n2","2\n2\n3","2\n3\n2",(...TRUNCATED)	2	11	{"language":[1,3,3,3,2,4,4,3,4,3,2,4,2,3,3,4,3,2,4,1,3,3,4,4,4,4,3,2,2,1,3,1,3,1,4,1,3,3,2,3,4,3,4,1(...TRUNCATED)	{"language":[3,2,3,2,4,3,4,2,2,2,4,2,4,2,4,4,1,2,2,2,3,1,4,4,4,2,3,3,2,4,2,3,2,2,4,2,3,3,4,3,3,1,2,2(...TRUNCATED)	70	D	3,000	0	[ "binary search", "graphs", "matrices" ]	false	{ "nanos": 0, "seconds": 2 }	268,435,456
1301_B. Motarack's Birthday	"Alice is playing with some stones.\n\nNow there are three numbered heaps of stones. The first of th(...TRUNCATED)	{"input":["2\n3 3 2\n8 3 2\n3 0\n3 7\n8 0\n8 7","2\n3 3 2\n8 3 2\n0 3\n3 7\n8 0\n8 7","1\n10 10 10\n(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	0	{"language":[3,3,4,4,2,3,4,3,4,2,2,3,2,3,4,4,4,4,4,4,2,2,1,2,2,2,2,2,2,2,2,2,3,2,4,2,2,3,4,2,3,3,2,4(...TRUNCATED)	{"language":[2,4,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,4,2,2,2,0,2,2,0,0,0,0,2,0,2,2,2,2,2,2,4,0,1,4,4,4(...TRUNCATED)	663		0	2,200	[ "math", "number theory", "sortings" ]	false	{ "nanos": 0, "seconds": 2 }	0
79_D. Password	"The statement of this problem is the same as the statement of problem C1. The only difference is th(...TRUNCATED)	{"input":["5 3\n1 2 3 4 0\n4 1 2 14 3\n","7 3\n1 2 3 4 3 2 6\n6 3 1 4 2 2 3\n","4 4\n0 1 2 3\n0 1 2 (...TRUNCATED)	{"input":["20 10000000\n8861863 2169292 3484361 511558 5975675 1413584 774309 5847326 6668965 253146(...TRUNCATED)	{ "input": [], "output": [] }	3	0	{"language":[3,4,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,2,2,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[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,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,301		0	2,700	[ "games", "math", "number theory" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000