Datasets:

TheFactoryX
/

edition_0397_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
784_B. Kids' Riddle	"So the Beautiful Regional Contest (BeRC) has come to an end! n students took part in the contest. T(...TRUNCATED)	{"input":["3 3\n1 2\n2 3\n3 3","7 9\n1 7\n5 9\n5 7\n5 9\n1 1\n6 8\n3 4"],"output":["3\n2\n2","7\n6\n(...TRUNCATED)	{ "input": [ "1\n3 3\n1 2\n2 3\n1 3" ], "output": [ "2\n" ] }	{"input":["4\n11833\n5512\n100\n28436\n33903\n100\n84816\n75747\n100\n92281\n31380\n100","1\n45819\n(...TRUNCATED)	6	8	{"language":[3,2,4,3,3,3,3,3,3,2,4,3,4,4,3,2,3,2,2,3,4,2,3,2,4,4,4,3,2,3,2,4,3,2,3,4,4,3,2,2,4,2,2,4(...TRUNCATED)	{"language":[0,4,0,0,0,0,0,0,4,2,0,2,2,3,2,0,2,0,3,0,0,0,0,2,0,2,1,1,2,0,3,2,0,0,3,0,0,4,2,2,2,0,0,2(...TRUNCATED)	0	B	0	2,100	[ "bitmasks", "dp", "graphs", "number theory" ]	false		{ "nanos": 500000000, "seconds": 0 }	256,000,000
1195_D2. Submarine in the Rybinsk Sea (hard edition)	"The bustling town of Siruseri has just one sports stadium. There\nare a number of schools, colleges(...TRUNCATED)	{ "input": [ "4 1\n1 2 3 4\n1 3\n\nSAMPLE" ], "output": [ "6 0\n" ] }	{ "input": [], "output": [] }	{"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	0	{"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,277	C	0	1,600	[ "constructive algorithms", "expression parsing", "greedy", "math" ]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
1236_A. Stones	"Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex (...TRUNCATED)	{"input":["2\n10 1\n1 2 -3 -5 4 6 -3 2 -1 2\n10 2\n1 2 -3 -5 4 6 -3 2 -1 2\n\nSAMPLE"],"output":["12(...TRUNCATED)	{"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":["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)	6	9	{"language":[2,2,2,2,2,2,2,2,4,2,2,4,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,2,2(...TRUNCATED)	{"language":[2,3,4,4,3,2,2,2,3,3,2,3,4,4,1,3,2,4,2,4,1,3,2,3,2,3,3,4,3,3,4,2,3,2,2,4,4,4,4,3,3,2,4,3(...TRUNCATED)	687	C	0	0	[ "data structures", "dfs and similar", "shortest paths", "trees" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
ism1	"You are given two arrays of integers a_1,…,a_n and b_1,…,b_m.\n\nYour task is to find a non-emp(...TRUNCATED)	{ "input": [ "4\n1 3 2 4\n" ], "output": [ "1 1\n-1\n2 4\n9 6 12 \n1 4\n0 -12 -8 -16 \n" ] }	{ "input": [], "output": [] }	{"input":["pH\n2\n","nifzlTLTeWxaD\n0\n","ysBKLtQXvmnCrldEceqXKkaZOrvjRbwlW\n5\n","LiqWMLEVLRhW\n1\n(...TRUNCATED)	2	7	{"language":[3,2,4,1,1,3,4,2,3,4,2,2,3,2,4,3,2,2,1,2,3,2,3,4,3,3,3,3,4,3,3,1,2,3,3,3,2,2,3,3,2,3,3,2(...TRUNCATED)	{"language":[2,4,4,3,4,2,3,2,2,4,4,1,2,1,2,4,3,4,3,3,4,3,1,3,2,4,2,3,3,3,3,2,4,3,2,3,3,4,2,2,3,4,4,2(...TRUNCATED)	0		0	2,100	[ "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
716_D. Complete The Graph	"Given is a string S, where each character is `0`, `1`, or `?`.\n\nConsider making a string S' by re(...TRUNCATED)	{"input":["99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["5 2\nbacba","10 2\nbbbabbbaaa","10 3\nbbaabbbaab","5 2\nbacaa","10 2\nbaabbbaabb","10 2\n(...TRUNCATED)	2	9	{"language":[3,4,3,1,3,1,2,3,4,3,3,2,3,2,4,3,2,2,2,1,1,2,3,3,3,3,3,2,4,4,4,2,4,4,2,4,3,3,4,1,3,4,1,2(...TRUNCATED)	{"language":[2,4,2,2,2,4,2,1,4,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,2,4,2,2,2(...TRUNCATED)	1,431		1,500	1,700	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	268,435,456
20_B. Equation	"The GCD table G of size n × n for an array of positive integers a of length n is defined by formul(...TRUNCATED)	{"input":["7 2\n-10 -4 -2 0 2 4 10","16 19\n-49 -48 -33 -30 -21 -14 0 15 19 23 44 52 80 81 82 84","3(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["aa\n2\nbb\nbc\n","th\n1\nht\n","bb\n1\nab\n","bn\n100\ndf\nyb\nze\nml\nyr\nof\nnw\nfm\ndw(...TRUNCATED)	3	8	{"language":[2,4,2,3,1,4,1,2,4,3,4,1,3,3,3,3,4,1,2,3,4,2,2,3,3,4,3,3,3,1,1,2,4,2,1,1,3,3,3,1,2,4,1,1(...TRUNCATED)	{"language":[2,2,2,2,4,2,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,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	290	H	2,000	1,100	[ "brute force", "implementation", "strings" ]	false	"踏み台昇降\n\nJAG大学に通う一樹君，通称カー君は，この夏友達であるあ(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	256,000,000
substrings-count-3	"There are N cities in Republic of AtCoder. The size of the i-th city is A_{i}. Takahashi would like(...TRUNCATED)	{"input":["1\n0\n","6\n2 0 3 0 1 1\n","6\n3 2 2 2 1 1\n"],"output":["0\n\n","5\n6 6\n5 5\n4 3\n4 5\n(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["4\ncbcc\n12\n4 b\n4 c\n1 b\n2 a\n3 b\n2 c\n4 a\n1 a\n2 b\n3 a\n1 b\n3 c\n","100\ndddddccc(...TRUNCATED)	2	11	{"language":[2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,4,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,4,2,4(...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)	87	C	0	2,200	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	268,435,456
p01974 Pigeonhole principle	"Problem description.\n The problem statement is simple , you are given an array and you have to p(...TRUNCATED)	{ "input": [ "2 5", "9 9", "5 10" ], "output": [ "10", "81", "-1" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	3	8	{"language":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"solution":["def gcd(a,b):\n\tif b==0:\n(...TRUNCATED)	{ "language": [], "solution": [] }	1,497		0	0	[ "implementation", "math" ]	false		null	256,000,000
366_D. Dima and Trap Graph	"In late autumn evening n robots gathered in the cheerful company of friends. Each robot has a uniqu(...TRUNCATED)	{ "input": [ "10 5 5 5\n", "3 0 0 2\n" ], "output": [ "9\n", "0\n" ] }	{ "input": [], "output": [] }	{"input":["2\n2\nbhopal\ndelhi\n3\nbhopal\neelhi\ndehradun\n\nSAMPLE","100\n4\nlrbbmqb\ncd\nr\nowkk\(...TRUNCATED)	2	11	{"language":[1,2,2,2,2,4,2,4,4,2,2,3,2,4,2,2,1,2,2,4,4,2,2,3,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,4,2,4,2,4,4,1,4,3,4,2,4,1,4,3,4,2,3,3,2,4,3,4,3,4,4,2,3,3,1,3,2,2,4,2,2,4,4,1,2,4,3(...TRUNCATED)	0	B	2,500	2,300	[ "" ]	false		null	512,000,000
379_A. New Year Candles	"Polycarp is working on a new project called \"Polychat\". Following modern tendencies in IT, he dec(...TRUNCATED)	{"input":["5\n8 5\n6 4\n4 3\n7 10\n0 10\n10\n10 5\n2 7\n9 7\n8 10\n10 2\n1 2\n8 1\n6 7\n6 0\n0 9\n5\(...TRUNCATED)	{"input":["2 2 5\n","9 9 1000000000\n","3 17 999999997\n","3 3 64\n","5 1 64\n","29 2 1000000000\n",(...TRUNCATED)	{"input":["10 15 10 5\n","20 0 2 3\n","7 3 2 2\n","29 10 5 10\n","3 2 2 2\n","20 17 20 30\n","101 18(...TRUNCATED)	2	9	{"language":[1,1],"solution":["import sys\ndef numberToBase(n, b):\n temp=''\n while n:\n (...TRUNCATED)	{"language":[3,4,3,4,4,2,2,2,4,3,2,3,1,4,2,4,4,2,3,2,3,2,3,2,2,3,2,2,2,4,4,2,2,3,4,2,1,3,4,3,3,3,4,1(...TRUNCATED)	167	D	2,500	0	[ "implementation", "math" ]	true		{ "nanos": 0, "seconds": 2 }	256,000,000