Datasets:

TheFactoryX
/

edition_2407_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
p03455 AtCoder Beginner Contest 086 - Product	"Background\n\nThe kindergarten attached to the University of Aizu is a kindergarten where children (...TRUNCATED)	{"input":["9\ndo\nthe\nbest\nand\nenjoy\ntoday\nat\nacm\nicpc\n14\noh\nyes\nby\nfar\nit\nis\nwow\nso(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1\n5\n2 3 4 5 2\n","1\n3\n1 1 129021590\n","4\n7\n6 6 8 8 6 6 6\n1\n2\n5\n4 5 9 8 7\n7\n1(...TRUNCATED)	2	7	{"language":[3,2,3,1,2,3,3,3,4,4,2,3,1,2,3,1,3,1,1,3,4,3,4,2,3,2,4,3,3,1,2,3,3,2,3,1,3,1,2,4,3,3,4,3(...TRUNCATED)	{"language":[3,3,2,2,3,2,1,1,2,3,2,4,2,2,4,1,4,4,3,2,3,3,4,4,4,4,1,3,2,2,4,2,4,4,4,2,2,2,4,4,1,2,3,2(...TRUNCATED)	415		2,000	1,900	[ "dp", "two pointers" ]	false		{ "nanos": 500000000, "seconds": 0 }	1,073,741,824
630_A. Again Twenty Five!	"For a given polygon g, print \"1\" if g is a convex polygon, \"0\" otherwise. Here, in a convex pol(...TRUNCATED)	{"input":["3\n3 0 2 5\n1 1 1 6\n3 2 1 10\n1 -2 3 6\n2\n1 2\n3 3\n1\n2\n3\n0\n3 0 2 5\n1 1 1 6\n3 2 1(...TRUNCATED)	{"input":["100\n0 0 57 121 57 0 19 251 19 301 19 160 57 578 664 57 19 50 0 621 91 5 263 34 5 96 713 (...TRUNCATED)	{"input":["1\n1\n3\n2\n","3\n1 1 2\n1 0 3\n1 1 4\n","3\n1 1 101\n1 2 1\n1 2 1\n","8\n148933105 19040(...TRUNCATED)	2	0	{"language":[1,2,4,3,2,2,2,3,4,2,3,1,2,2,4,2,4,4,2,2,1,4,4,2,4,2,2,2,2,2,3,1,2,2,4,4,4,1,2,2,3,4,2,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)	687		0	2,300	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	64,000,000
p00991 Grid	"Polycarp plays a well-known computer game (we won't mention its name). In this game, he can craft t(...TRUNCATED)	{"input":["abc\ndefg\n","czaaab\nabcdef\n","aad\naac\n","abad\nbob\n"],"output":["-1\n","abczaa\n","(...TRUNCATED)	{"input":["10\n10\n8 10\n1 1\n1 6\n4 7\n4 9\n8 8\n1 4\n2 3\n4 5\n2 2\n10\n1 1\n1 2\n1 3\n1 4\n1 5\n6(...TRUNCATED)	{"input":["7\nabbab\nabaac\ncodeforces\nzeroorez\nabcdcba\nbbbbbbb\na\n","7\nabbab\nabaac\ncodeforce(...TRUNCATED)	2	0	{"language":[2,2,2,4,2,4,2,4,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,4,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[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,2(...TRUNCATED)	0	B	0	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	134,217,728
425_A. Sereja and Swaps	"Find the sum of the weights of edges of the Minimum-Cost Arborescence with the root r for a given w(...TRUNCATED)	{"input":["3 3 5\n4 4 0\n1 3\n3 2\n3 1\n","4 5 4\n2 1 0 3\n4 3\n3 2\n1 2\n1 4\n1 3\n"],"output":["1\(...TRUNCATED)	{"input":["10 4\nbcaaddaacc\n1 0 1 1\n0 0 1 0\n1 1 1 0\n1 0 0 1\n","100 10\nigffabeaiaajhjaghjgfjcch(...TRUNCATED)	{"input":["10000\n5000 3150\n5000 5000\n0 0\n5000 1050\n5000 3980\n5000 210\n5000 5000\n5000 5000\n0(...TRUNCATED)	2	2	{"language":[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,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2(...TRUNCATED)	1,140	C	2,500	2,000	[ "implementation" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
571_E. Geometric Progressions	"There are n points on a coordinate axis OX. The i-th point is located at the integer point x_i and (...TRUNCATED)	{ "input": [ "1\n1\n", "6\n100011\n", "2\n10\n" ], "output": [ "1\n1\n", "2\n1 00011\n", "2\n1 0\n" ] }	{"input":["3 1\n1 2 5\n","1 1\n100000\n","5 1\n2 2 4 6 1\n","3 10\n5 5 10\n","1 1\n1\n","3 4\n1 2 5\(...TRUNCATED)	{"input":["16\nFFC0\nFFC0\nFFC0\nFFC0\nFFC0\nFFD0\nFFC0\nFFC0\nFFC0\nFFC0\nFFC0\nFFC0\nFFC0\nFFC0\nF(...TRUNCATED)	2	9	{ "language": [], "solution": [] }	{"language":[2,0,2,2,2,2,2,1,2,2,2,2,2,2,2,1,2,2,2,2,0,2,0,0,2,0,0,0,4,1,2,2,0,2,0,0,2,2,2,0,2,2,2,2(...TRUNCATED)	0	A	0	0	[ "greedy", "implementation", "math", "ternary search" ]	true		{ "nanos": 0, "seconds": 2 }	256,000,000
p03452 AtCoder Regular Contest 090 - People on a Line	"Jack is the most intelligent student in the class.To boost his intelligence,his class teacher gave (...TRUNCATED)	{"input":["3\n0\n1\n2\n3\n4\n5\n","3\n10\n12\n-5\n8\n10\n12\n"],"output":["5.656854249\n","15.524174(...TRUNCATED)	{ "input": [ "2\nacxz\nbcxz" ], "output": [ "Funny\nNot Funny\n" ] }	{"input":["10 4\n0 1 4 2 3 0 10 0 5 8\n","6 3\n0 0 1 0 4 5\n","6 1\n0 0 4 0 6 0\n","4 1\n0 1 0 0\n",(...TRUNCATED)	2	7	{"language":[2,4,4,4,4,4,4,2,4,4,2,2,4,4,3,3,1,4,4,3,2,2,3,4,4,2,2,4,4,4,4,2,2,4,2,2,2,2,2,2,2,4,2,4(...TRUNCATED)	{ "language": [], "solution": [] }	0		0	0	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
find-the-nth-prime	"Monk loves cakes! He visits the Binary Bakery to buy some of his favorite cheesecakes. \nThe owner(...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":["10 16\n6 10\n5 2\n6 4\n6 8\n5 3\n5 4\n6 2\n5 9\n5 7\n5 1\n6 9\n5 8\n5 10\n6 1\n6 7\n6 3\n(...TRUNCATED)	{"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,3,2,3,4,3,2,4,4,2,2,2,4,4,3,2,3,3,2,4,4,3,2,2,2,3,4,2,3,2,2,4,2,2,4,2,4,4,3,4,3,2,2,3(...TRUNCATED)	{ "language": [], "solution": [] }	0	D	0	3,100	[]	false	"アイヅ放送協会の教育番組(ＡＨＫ教育)では、子供向けの工作番組「あそ(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	268,435,456
1250_B. The Feast and the Bus	"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":["2\n2 9\n","3\n3 12 6\n","7\n2 1000000000 4 6 8 4 2\n","6\n13 52 0 13 26 52\n"],"output":[(...TRUNCATED)	{"input":["3\n121339 121339 121339 55451923 531222142 121339 121339 435485671 121339\n","3\n1 7 9232(...TRUNCATED)	{ "input": [], "output": [] }	2	7	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2,2,4,2,2,2,4(...TRUNCATED)	{"language":[4,2,2,2,2,4,4,4,4,4,2,2,2,2,2,1,4,3,4,2,2,4,2,2,2,4,2,4,4,2,1,2,1,2,2,2,4,1,2,2,2,2,3,3(...TRUNCATED)	1,136		0	3,400	[ "data structures", "trees" ]	false		null	256,000,000
p01535 Markup language has Declined	"Mister B once received a gift: it was a book about aliens, which he started read immediately. This (...TRUNCATED)	{"input":["7 3\nabacaba\n1 1 1\n1 0 0\n1 0 0\n","7 3\nabacaba\n0 1 1\n1 0 0\n1 0 0\n","7 4\nbacadab\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1 36 0\n-1 -1 -1","0 30 0\n-1 -1 -1","0 32 0\n-1 -1 -1","1 16 0\n-1 -1 -1","0 36 0\n-1 -1(...TRUNCATED)	2	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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,3,1,4,3,4,4,3,3,2,2,2,1,4,4,2,3,4,3,4,2,2,2,4,4,4,3,3,3,2,3,2,4,1,2,3,3,3,4,1,2,3,4(...TRUNCATED)	0		500	2,700	[ "" ]	false		null	256,000,000
p02260 Selection Sort	"You are given a string S consisting of letters `b`, `d`, `p` and `q`. Determine whether S is a mirr(...TRUNCATED)	{ "input": [ "2\n5\n5", "3\n1\n4\n3" ], "output": [ "5\n5", "4\n3\n4" ] }	{"input":["0 -2 0\n","1223 -23532 1232\n","0 1 0\n","-1 10 20\n","0 3431 43123\n","-50000 100000 -50(...TRUNCATED)	{"input":["11--01--2013-02-2013-01--01--2013\n","00-12-2014-00-12-2013-00-12-2014-12-12-2014\n","23-(...TRUNCATED)	1	12	{"language":[2,4,2,2,2,3,2,2,2,2,2,2,2,2,2,3,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,3,2,4(...TRUNCATED)	{ "language": [], "solution": [] }	385	E	0	800	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000