Datasets:

TheFactoryX
/

edition_0729_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
1328_F. Make k Equal	"Nick has n bottles of soda left after his birthday. Each bottle is described by two values: remaini(...TRUNCATED)	{ "input": [ "3\n2\n<>\n3\n><<\n1\n>\n" ], "output": [ "0\n0\n0\n" ] }	{"input":["48 1976\n30 97 84\n80 81 84\n41 70 86\n23 57 80\n17 60 85\n36 48 81\n51 87 81\n38 85 81\n(...TRUNCATED)	{"input":["4\nSSSSEEEECCCCEECCCC\nCCCCCSSSSEEECCCCSS\nSCCCCCCCSSEEESSSSS\nEESSSSCCCCCCSSEEEESAMPLE",(...TRUNCATED)	2	12	{"language":[1,1,1,1,1],"solution":["import math\nfor _ in xrange(int(raw_input())):\n\tn = int(raw_(...TRUNCATED)	{"language":[2,3,4,2,4,2,2,3,1,2,3,2,4,2,3,3,4,2,2,4,4,2,2,4,3,2,2,4,4,4,3,4,4,2,2,4,4,3,2,3,2,4,2,1(...TRUNCATED)	1,500	D	0	0	[ "" ]	false	null	256,000,000
magic-gcd	"Anastasia loves going for a walk in Central Uzhlyandian Park. But she became uninterested in simple(...TRUNCATED)	{ "input": [ "5\n1912 1\n5 6\n999 1\n88 2\n12 100\n" ], "output": [ "\n5\n2\n6\n4\n2115\n" ] }	{ "input": [ "1 1 2 1 1\n2 1\n" ], "output": [ "0\n" ] }	{"input":["5 2\nbacba","10 2\nbbbabbbaaa","10 3\nbbaabbbaab","5 2\nbacaa","10 2\nbaabbbaabb","10 2\n(...TRUNCATED)	2	0	{"language":[2,2,2,3,4,2,4,4,4,2,2,4,4,4,2,2,2,2,4,2,2,2,4,3,4,2,4,2,2,2,3,2,2,4,2,4,4,2,4,4,2,3,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,2(...TRUNCATED)	0	F	0	3,100	[ "greedy", "strings" ]	false	{ "nanos": 0, "seconds": 1 }	268,435,456
1244_C. The Football Season	"You are given an undirected graph consisting of n vertices and <image> edges. Instead of giving you(...TRUNCATED)	{"input":["5 7\nqcezchs\nhhedywq\nwikywqy\nqckrqzt\nbqexcxz\n3 2\n??\nyw\n?q\n","8 6\nibrgxl\nxqdcsg(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["2\n1 20\n","10\n450661 128600 993228 725823 293549 33490 843121 528432 556169 448234\n","(...TRUNCATED)	6	11	{"language":[1],"solution":["testcase = raw_input();\ntc = int(testcase)\n\nwhile (tc > 0):\n\t\n\t(...TRUNCATED)	{ "language": [], "solution": [] }	963	G	1,000	1,900	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
438_A. The Child and Toy	"Computation of the date either previous or forthcoming dates is quiet easy. But it is quiet difficu(...TRUNCATED)	{ "input": [ "1\n4 2 1\n1 1 2 2\n1 1\n1 1\n1 1\n3 1\n0 1\n0 1\n1 0\n1 0" ], "output": [ "5" ] }	{ "input": [], "output": [] }	{"input":["11 7 5\n24979445 861648772 623690081 433933447 476190629 262703497 147009374 971407775 62(...TRUNCATED)	1	10	{"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,4,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,3,2,2,4,2,2,2,2,2,2,4,2,2,2,3,2,2,2,2,2,2,2,2,2,2,4,3,2,2,2,3,2,2,4,3,2,2,2,2,2,2,4,2(...TRUNCATED)	0	B	500	1,400	[ "" ]	false	null	64,000,000
909_D. Colorful Points	"Xenia the beginner mathematician is a third year student at elementary school. She is now learning (...TRUNCATED)	{ "input": [ "5 3 \n1 2 3 4 5\n2 1 5\n1 2 5\n2 1 5" ], "output": [ "9 \n10" ] }	{"input":["1 100000 100000 100000 -100000\n","46456 -2621 -23623 -98302 -99305\n","9 20 0 40 0\n","1(...TRUNCATED)	{"input":["10\n3\n-15 -33 79\n16\n45 -84 19 85 69 -64 93 -70 0 -53 2 -52 -55 66 33 -60\n2\n14 -2\n4\(...TRUNCATED)	2	0	{"language":[2,2,2,2,2,4,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,4,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0		0	3,200	[ "binary search", "dp" ]	false	{ "nanos": 0, "seconds": 5 }	134,217,728
p02257 Prime Numbers	"Jiro is a fun loving lad. His classmates are very competitive and are striving for getting a good r(...TRUNCATED)	{"input":["6\n4 2\nbbab\n7 5\ncceddda\n6 5\necdaed\n7 4\ndcdbdaa\n8 3\nccabbaca\n5 7\neabba\n"],"out(...TRUNCATED)	{"input":["61\n17357774\n248290406\n171408490\n20054376\n118774144\n110228788\n8827234\n85304880\n15(...TRUNCATED)	{"input":["1\n1 0 1 1\n10000 10000 10000 10000","2\n10 3 1 2\n2 4 1 3\n1 2 1 1","2\n10 3 1 2\n2 4 1 (...TRUNCATED)	2	0	{"language":[2,4,4,2,3,4,4,4,4,2,2,3,4,3,3,3,3,3,4,2,2,4,3,3,4,3,2,3,4,2,3,3,2,3,3,4,3,3,2,2,3,4,3,2(...TRUNCATED)	{"language":[2,0,2,2,2,2,0,2,4,2,2,2,0,0,2,2,2,2,2,2,2,0,2,2,2,2,2,2,0,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	609	F	0	1,900	[ "" ]	false	null	256,000,000
chefrp	"problem\n\nChairman K is a regular customer of the JOI pizza shop in the center of JOI city. For so(...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": [], "output": [] }	{"input":["8","0","4","-1","2","-2","3","-4","6","-3","-6","-9","-8","-12","-5","7","-10","10","-17"(...TRUNCATED)	2	8	{"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,0,0,0,3,2,2,0,4,0,1,2,0,3,1,0,2,0,2,2,2,4,2,0,0,0,4,2,0,2,0,2,0,2,4,3,0,3,2,3,4,0,0(...TRUNCATED)	1,176		1,500	2,200	[ "implementation", "sortings", "strings" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
702_E. Analysis of Pathes in Functional Graph	"We have N integers. The i-th number is A_i.\n\n\\\\{A_i\\\\} is said to be pairwise coprime when GC(...TRUNCATED)	{"input":["5 8\n1 2 6 7 10\n1 1 1 1 2\n1 1\n1 5\n1 3\n3 5\n-3 5\n-1 10\n1 4\n2 5\n"],"output":["0\n1(...TRUNCATED)	{"input":["10 7\n1 10\n2 10\n3 10\n4 10\n5 10\n1 2\n1 3\n1 4\n1 5\n1 6\n","2 2\n1 1\n1 1\n","20 12\n(...TRUNCATED)	{"input":["1","0010","11011010001001","11001010001001","11001000001001","1010","01001000101000","110(...TRUNCATED)	2	6	{"language":[3,4,4,4,1,3,4,3,2,4,3,3,3,4,3,2,3,3,4,3,4,4,4,2,3,2,4,3,3,4,4,3,3,3,2,2,3,4,2,4,2,3,2,3(...TRUNCATED)	{"language":[4,2,2,2,2,2,2,2,2,2,2,2,3,2,4,2,2,4,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,3,2(...TRUNCATED)	101		1,000	0	[ "data structures", "dp", "greedy" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1500_B. Two chandeliers	"Now that Chef has finished baking and frosting his cupcakes, it's time to package them. Chef has N (...TRUNCATED)	{ "input": [ "3\n2 3 4\n2 1\n1\n-1\n" ], "output": [ "56\n" ] }	{"input":["5\ncbbbb\nbcbbb\naacbb\naaacb\naaaac\n","20\nbifcabiabgfibfccdbgd\ncffaheagahcbacafbgeb\n(...TRUNCATED)	{"input":["3\n10 2 5\n12 4 8\n6 2 2\n\nSAMPLE","3\n7 2 5\n12 4 8\n6 2 2\n\nSAMPLF","3\n7 2 5\n12 4 8(...TRUNCATED)	2	11	{"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":[2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,4,2,2,4,2,2,2,2,2,2,1,2,2,4,2,2,2,2,2,2,2,4,2,4(...TRUNCATED)	0		0	2,000	[ "" ]	false	null	134,217,728
774_K. Stepan and Vowels	"Mad scientist Mike has just finished constructing a new device to search for extraterrestrial intel(...TRUNCATED)	{ "input": [ "2\n1\n2" ], "output": [ "2\n5\n" ] }	{ "input": [], "output": [] }	{"input":["2\n999999\n1000100","3\n9\n99\n238","2\n999999\n1010100","3\n9\n99\n39","2\n999999\n10101(...TRUNCATED)	6	0	{"language":[3,1,2,2,3,4,2,2,2,4,3,2,2,2,4,4,4,2,2,2,3,1,4,4,2,4,4,3,4,3,1,4,2,3,2,3,3,3,3,3,3,2,1,4(...TRUNCATED)	{"language":[2,0,0,2,0,2,0,0,0,2,2,2,2,0,0,0,0,2,0,4,2,0,4,0,0,0,0,0,2,0,4,2,4,2,0,2,0,0,2,2,2,0,0,0(...TRUNCATED)	716	B2	0	1,600	[ "strings" ]	false	{ "nanos": 0, "seconds": 2 }	0