Datasets:

TheFactoryX
/

edition_2064_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
687_D. Dividing Kingdom II	"Emily's birthday is next week and Jack has decided to buy a present for her. He knows she loves boo(...TRUNCATED)	{"input":["5 3\n00011\n3\n1 2 3\n1\n4\n3\n3 4 5\n","8 6\n00110011\n3\n1 3 8\n5\n1 2 5 6 7\n2\n6 8\n2(...TRUNCATED)	{ "input": [], "output": [] }	{"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)	6	10	{"language":[3,3,3,3,4,1,3,1,3,4,2,3,2,3,3,4,3,1,2,4,1,3,4,4,4,3,2,2,3,4,4,2,4,2,2,4,3,3,2,3,3,2,3,3(...TRUNCATED)	{"language":[2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,4,4,1,1,2,4,2,1,2,4,2,2,2,4,2,4,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	203	C	0	0	[ "brute force", "math" ]	false	{ "nanos": 0, "seconds": 1 }	268,435,456
1136_D. Nastya Is Buying Lunch	"Problem\n\nKND is a student programmer at the University of Aizu. His chest is known to be very sex(...TRUNCATED)	{"input":["4\n1 2\n1 3\n1 2\n1 2\n1 3\n1 2\n2 5\n1 2\n3 1\n1 4\n5 1\n1 6\n2 15\n1 2\n1 3\n1 4\n1 5\n(...TRUNCATED)	{"input":["2\naaab\n","2\nbabac\n","2\naaaaaabbbb\n","1\naabaab\n","2\naabbbbccccccdddddddd\n","2\na(...TRUNCATED)	{"input":["2\n2 1\n3 4\n3 2\n1 0 2\n\nSAMPLE","2\n2 1\n5 5\n3 2\n1 0 2\n\nSAMPLE","2\n2 1\n3 0\n3 2\(...TRUNCATED)	2	8	{"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":[2,2,4,4,4,2,2,4,4,1,2,2,2,2,4,4,2,2,4,2,4,1,4,2,4,2,2,2,2,4,4,2,4,4,1,4,4,4,4,1,2,2,4,4(...TRUNCATED)	1,325	B	0	0	[ "data structures", "implementation" ]	false	{ "nanos": 0, "seconds": 3 }	256,000,000
1110_E. Magic Stones	"Write a program which reads a sequence of integers $A = \\\\{a_0, a_1, ..., a_{n-1}\\\\}$ and swap (...TRUNCATED)	{ "input": [ "4 4\n1 2\n2 3\n3 4\n4 1\n", "3 0\n" ], "output": [ "\n0 1 0 1 \n", "\n0 0 0 \n" ] }	{"input":["80\n72 66 82 46 44 22 63 92 71 65 5 30 45 84 29 73 9 90 25 19 26 15 12 29 33 19 85 92 91 (...TRUNCATED)	{"input":["3703 4549\n433\n","2931 2881\n710\n","3762 947\n1073\n","4583 2774\n986\n","7 10\n1\n","1(...TRUNCATED)	2	11	{"language":[2,4,3,3,3,2,2,4,3,3,3,3,3,2,4,3,4,4,3,3,3,3,3,4,2,4,1,4,3,2,1,3,4,3,3,2,3,3,2,4,3,3,3,3(...TRUNCATED)	{"language":[4,2,4,3,2,2,3,4,2,4,3,3,3,4,2,2,4,3,4,2,2,2,3,4,2,2,2,2,4,3,4,2,2,4,2,2,4,3,2,3,4,2,2,2(...TRUNCATED)	0	C	250	0	[ "*special", "strings" ]	true	null	536,870,912
1244_C. The Football Season	"You are given an array of n positive integers a_1, a_2, ..., a_n. You can perform the following ope(...TRUNCATED)	{ "input": [ "5 3 \n1 2 3 4 5\n2 1 5\n1 2 5\n2 1 5" ], "output": [ "9 \n10" ] }	{"input":["10\n669924290 408119795 804030560\n663737793 250734602 29671646\n431160679 146708815 2894(...TRUNCATED)	{"input":["13\n1\n>\n1\n?\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n","3\n2(...TRUNCATED)	3	6	{"language":[2,3,4,3,4,3,4,3,3,3,3,2,3,3,4,4,4,3,4,3,2,3,3,4,1,2,3,4,3,2,1,3,4,3,3,4,4,3,1,1,3,3,3,3(...TRUNCATED)	{"language":[2,3,3,0,2,2,2,4,2,2,2,2,2,2,0,3,3,2,2,3,4,3,2,3,3,2,2,2,3,2,2,2,2,4,0,2,3,0,2,3,2,4,2,2(...TRUNCATED)	0	B	1,000	0	[ "greedy" ]	false	{ "nanos": 0, "seconds": 8 }	256,000,000
851_B. Arpa and an exam about geometry	"Vasya's telephone contains n photos. Photo number 1 is currently opened on the phone. It is allowed(...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 1\n2\n1 1\n6 9\n1\n(...TRUNCATED)	{"input":["7\n5\n-1 10 -1 12 -1\n5\n-1 40 35 -1 35\n6\n-1 -1 9 -1 3 -1\n2\n-1 -1\n2\n0 -1\n4\n1 -1 3(...TRUNCATED)	{"input":["1\n4 5\n9 7 5 3\n8 6 4 1 0\n\nSAMPLE","1\n4 5\n9 7 5 3\n16 6 4 2 0\n\nSAMPLE","1\n4 5\n9 (...TRUNCATED)	2	6	{"language":[2,4,2,3,3,3,2,2,2,1,2,2,3,2,4,2,4,4,2,3,3,2,4,4,3,3,3,1,2,4,4,3,3,2,4,2,2,3,2,3,1,3,4,1(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,4,4,3,2,2,2,2,2,2,2,2,2,2,4,2,4,4,2,2,3,4,2,2,4,2(...TRUNCATED)	0		0	1,500	[]	false	{ "nanos": 0, "seconds": 2 }	134,217,728
1227_A. Math Problem	"There is a factory that inputs the data of the side and diagonal lengths to the machine and cuts ou(...TRUNCATED)	{"input":["1000 999\n10 20 30 40\n","7 11\n2 4 7 3\n"],"output":["-1","2 7 1 5 6 3 4 \n7 2 1 5 6 4 3(...TRUNCATED)	{"input":["5\n10 50\n10 50\n10 50\n10 50\n10 50\n","2\n10000 10000\n10000 10000\n","3\n10000 10000\n(...TRUNCATED)	{"input":["100\n303\n5","100\n256\n5","100\n407\n5","100\n407\n2","100\n407\n3","100\n407\n6","100\n(...TRUNCATED)	2	1	{"language":[2,3,2,3,2,4,3,2,3,2,3,4,3,2,3,3,3,4,2,4,2,2,2,3,4,4,2,2,1,3,2,3,1,4,3,2,4,2,4,2,2,4,3,3(...TRUNCATED)	{"language":[4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,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(...TRUNCATED)	188		1,000	1,200	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	0
1053_C. Putting Boxes Together	"Given integer n, find length of n! (which is factorial of n) excluding trailing zeros.\n\nInput\n\n(...TRUNCATED)	{ "input": [ "5\n7 46 11 20 11", "7\n994 518 941 851 647 2 581", "3\n3 4 6" ], "output": [ "90", "4527", "10" ] }	{"input":["20\n-1 -1\n1 0\n2 0\n2 1\n2 1\n4 0\n1 0\n4 0\n3 0\n9 0\n6 1\n3 1\n11 1\n2 0\n2 1\n8 1\n14(...TRUNCATED)	{"input":["? + ? + ? + ? + ? + ? + ? + ? + ? + ? - ? = 9\n","? - ? = 2\n","? = 1000001\n","? - ? + ?(...TRUNCATED)	2	8	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,4,2,2,2,2,4,2,2,2,4,2,2,4,4,4,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,4,2,2,1,2,2,3,4,2(...TRUNCATED)	0	K	0	0	[ "binary search", "math" ]	false	null	512,000,000
p00323 Metal Recycling	"There are N people numbered 1 to N. Each person wears a red hat or a blue hat.\n\nYou are given a s(...TRUNCATED)	{ "input": [ "3 5\n1 2 3\n1 3 2 3 1\n" ], "output": [ "12\n" ] }	{ "input": [], "output": [] }	{"input":["5 5 2\n#####\n#A#B#\n# #\n#b#a#\n#####\n16 4 3\n################\n## ########## ##\n# (...TRUNCATED)	5	0	{"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": [], "solution": [] }	0		2,500	1,600	[ "*special" ]	false	{ "nanos": 0, "seconds": 2 }	0
630_A. Again Twenty Five!	"Programmer Vasya is studying a new programming language &K. The &K language resembles the languag(...TRUNCATED)	{"input":["7\nC is A’s father’s brother’s son’s aunt\nC is A’s mother’s brother’s son(...TRUNCATED)	{"input":["5 2 4 12\nhhhwh\n","2 5 5 1000000000\nwh\n","16 1 1000 2100\nhhhwwwhhhwhhhwww\n","1 2 3 3(...TRUNCATED)	{"input":["36 102 73 101 19\n5 9 2 4 6\n4 13\n","0 0 119 0 1\n0 0 2 0 0\n5 5\n","0 0 0 0 0\n10 10 10(...TRUNCATED)	2	0	{"language":[4,2,4,3,2,4,4,4,4,4,2,4,3,4,3,2,3,2,4,3,2,3,2,3,3,4,3,2,3,4,3,4,2,3,4,2,4,3,4,4,4,2,2,3(...TRUNCATED)	{ "language": [], "solution": [] }	793	D	0	2,400	[ "binary search", "dp", "greedy", "sortings" ]	false	null	256,000,000
1466_C. Canine poetry	"Diverta City is a new city consisting of N towns numbered 1, 2, ..., N.\n\nThe mayor Ringo is plann(...TRUNCATED)	{"input":["3\n1 0 1\n0 0 0\n","2\n1 4\n2 3\n","3\n0 0 0\n0 0 0\n"],"output":["0 0 1 \n1 0 0 ","1 3\n(...TRUNCATED)	{"input":["10\n5 7 0\n2 10 1\n1 5 0\n6 8 0\n4 9 1\n2 5 1\n10 8 0\n2 3 1\n4 2 1\n10\n9\n9\n9\n5\n2\n5(...TRUNCATED)	{"input":["4\n3 4\n1 2\n3 4\n1 4\n","4\n2 4\n1 3\n3 4\n1 1\n","4\n1 4\n2 4\n2 4\n1 2\n","7\n7 7\n2 3(...TRUNCATED)	2	11	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include<(...TRUNCATED)	{"language":[2,2,2,2,2,4,2,2,2,2,0,2,2,0,0,2,2,2,4,2,2,0,2,4,3,2,2,2,4,2,2,3,2,2,0,0,2,2,2,2,2,0,2,2(...TRUNCATED)	0	E	1,000	0	[ "" ]	false	null	0