Datasets:

TheFactoryX
/

edition_2820_deepmind-code_contests-readymade

name large_stringlengths 4 70	description large_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 large_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 large_stringclasses 36 values	time_limit dict	memory_limit_bytes int64 0 1.07B
p00781 Lattice Practices	"Find the sum of the weights of edges of the Minimum-Cost Arborescence with the root r for a given w(...TRUNCATED)	{"input":["3\n-1 -1\n1 0\n2 0\n2\n1 1 3\n2 1 3\n","3\n-1 -1\n1 0\n1 1\n2\n2 2 3\n2 3 2\n"],"output":(...TRUNCATED)	{"input":["2 5 1\n0 5 6\n0 2 7\n","1 1 1000000000\n0 0 0\n","2 200 5\n1 1 1\n12 3 15\n","2 10 5\n1 1(...TRUNCATED)	{"input":["cba\naaac\n","bcbcdddbbd\ndbbdbdcbcb\n","cadaccbaaa\nacabbbabaa\n","b\nb\n","acaccaaadz\n(...TRUNCATED)	2	9	{"language":[4,4,4,2,2,2,4,2,2,4,4,2,2,2,2,4,2,2,4,4,2,2,2,4,4,2,2,2,2,2,4,4,4,4,4,4,4,4,2,2,4,4,4,4(...TRUNCATED)	{"language":[2,2,2,4,2,4,2,2,4,2,2,2,2,4,2,4,2,2,2,4,2,2,2,4,2,2,2,4,2,4,4,2,2,3,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	805	G	1,000	0	[]	false	"太郎君はかけざんを習いたての小学生です。なんとなく、彼はかけざんを(...TRUNCATED)	{ "nanos": 0, "seconds": 5 }	0
1374_B. Multiply by 2, divide by 6	"Hasan loves playing games and has recently discovered a game called TopScore. In this soccer-like g(...TRUNCATED)	{"input":["4\n..E.\n.AD.\nB...\n..C.\nD\n4\n..E.\n.AD.\nB...\n..C.\nDR\n3\n...\n.A.\nBC.\n((URD)3L)2(...TRUNCATED)	{"input":["2\n1 2\n","100\n61 96 25 10 50 71 38 77 76 75 59 100 89 66 6 99 2 13 3 23 91 93 22 92 4 8(...TRUNCATED)	{"input":["1100 0\n","6 6\n1 2 1 10\n2 3 1 10\n3 6 1 1\n1 4 1 6\n4 5 1 3\n5 6 1 3\n","4 4\n1 2 1 10\(...TRUNCATED)	3	7	{"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": [] }	1,369	B	2,500	0	[ "divide and conquer", "hashing", "sortings", "strings" ]	false		null	256,000,000
tf01	"There are n persons who initially don't know each other. On each morning, two of them, who were not(...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":["xkbvkadjec gqjlhxpnsx 10\n2 7 1 0 0\n2 5 8 0 0\n4 7 8 0 4\n0 4 7 3 6\n5 5 9 3 7\n7 9 5 0 (...TRUNCATED)	{ "input": [], "output": [] }	5	11	{"language":[4,2,2,2,2,3,2,2,4,2,3,2,2,4,4,2,2,4,2,2,2,4,4,2,2,2,2,3,2,3,4,2,3,4,2,2,2,2,4,4,2,2,2,2(...TRUNCATED)	{"language":[2,3,2,2,2,1,1,3,1,3,2,4,3,4,4,2,3,2,3,2,3,3,1,2,3,2,2,2,4,4,3,4,1,4,3,4,3,3,3,4,2,3,3,2(...TRUNCATED)	1,189		2,000	1,400	[]	true		{ "nanos": 0, "seconds": 2 }	0
470_C. Eval	"Ramesh and Suresh were in the same class and got home work from their mathematics teacher. The Home(...TRUNCATED)	{ "input": [ "5 2" ], "output": [ "12" ] }	{"input":["1\n656 656\n","1\n666 666\n","2\n7 4\n1 5\n","1\n33993 5\n","1\n1656 5\n","1\n1319 1777\n(...TRUNCATED)	{"input":["2\n1 1 6 1\n3\n0 1 2\n","2\n2 0 4 3\n4\n1 2 0 2\n","2\n1 1 6 2\n3\n0 1 2\n","2\n2 0 4 6\n(...TRUNCATED)	2	11	{"language":[2,2,2,2,2,4,2,2,2,4,2,2,2,2,4,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,2,2,2,2(...TRUNCATED)	{"language":[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,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2(...TRUNCATED)	1,053	C	1,750	0	[ "graphs" ]	false		{ "nanos": 0, "seconds": 2 }	268,435,456
jumping-frog	"The bustling town of Siruseri has just one sports stadium. There\nare a number of schools, colleges(...TRUNCATED)	{"input":["1 2\n3 4\n5 6\n","11 10\n13 8\n5 16\n","3 7\n4 6\n5 5\n","10 10\n10 10\n10 10\n"],"output(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["10000\n5000 3150\n5000 5000\n0 0\n5000 1050\n5000 3980\n5000 210\n5000 5000\n5000 5000\n0(...TRUNCATED)	6	11	{"language":[4,2,1,3,3,3,2,3,3,3,3,3,2,4,4,3,3,4,4,2,4,3,1,4,2,3,3,3,3,4,4,2,3,4,2,3,2,1,3,2,3,4,4,2(...TRUNCATED)	{ "language": [], "solution": [] }	0	D	500	0	[ "implementation" ]	false		{ "nanos": 0, "seconds": 1 }	268,435,456
805_A. Fake NP	"You are given three sequences: a_1, a_2, …, a_n; b_1, b_2, …, b_n; c_1, c_2, …, c_n.\n\nFor e(...TRUNCATED)	{"input":["9 4 12\nthis is a sample text for croc final round\n","9 1 9\nthis is a sample text for c(...TRUNCATED)	{"input":["100 10000\n337491026 878382762 942177429 998998997 292784016 407647544 813626083 20338593(...TRUNCATED)	{"input":["500 000 1000","31 123 143","19 123 141","50 100 127","500 101 1000","55 123 143","1 123 1(...TRUNCATED)	2	10	{ "language": [], "solution": [] }	{ "language": [], "solution": [] }	0		1,000	0	[ "dp", "math" ]	false		{ "nanos": 0, "seconds": 4 }	256,000,000
464_D. World of Darkraft - 2	"Valeric and Valerko missed the last Euro football game, so they decided to watch the game's key mom(...TRUNCATED)	{ "input": [ "5\n0 1 2 1 2\n", "4\n0 1 2 3\n" ], "output": [ "YES\n1\n2\n3\n5\n4\n", "NO\n" ] }	{"input":["2 3\n1 1 1\n0 1 0","2 2\n1 0\n0 1","3 3\n0 1 0\n1 0 1\n0 1 0","2 2\n0 0\n1 0","2 2\n0 1\n(...TRUNCATED)	{"input":["9 3 23\n9 3 22\n10 3 28\n16 10 107\n20 8 102\n20 10 105\n20 10 155\n3 5 3\n4 2 11\n0 0 0"(...TRUNCATED)	6	0	{"language":[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,4,2,2,2,2,2,2,2,2,2,2,2,4,2,4(...TRUNCATED)	{ "language": [], "solution": [] }	0	B	1,000	1,900	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	0
1253_F. Cheap Robot	"Amr loves Geometry. One day he came up with a very interesting problem.\n\nAmr has a circle of radi(...TRUNCATED)	{ "input": [ "3 2 1\n1 2\n3\n", "10 8 2\n1 2 3 5 6 7 8 9\n3 5\n" ], "output": [ "-1", "2" ] }	{ "input": [], "output": [] }	{"input":["4\n4 3 2 1\n2 3 4 1\n3\n1 2 3 4\n1 3 2 1\n2 4 2 3\n","4\n4 3 2 1\n2 3 4 1\n3\n1 2 3 4\n1 (...TRUNCATED)	2	12	{"language":[1,1,1,1,1,1,1,1,1,1,1,1],"solution":["for _ in xrange(input()):\n\tn,c,m=map(int,raw_in(...TRUNCATED)	{ "language": [], "solution": [] }	7	B	0	0	[ "dp", "greedy", "strings" ]	true		{ "nanos": 0, "seconds": 1 }	0
29_E. Quarrel	"Having learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclu(...TRUNCATED)	{"input":["4\ncba\ncab\nb\na\n3\nbca\nab\na\n5\nabc\nacb\nb\nc\nc\n5\nabc\nacb\nc\nb\nb\n0"],"output(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["100\n303\n5","100\n256\n5","100\n407\n5","100\n407\n2","100\n407\n3","100\n407\n6","100\n(...TRUNCATED)	2	0	{"language":[2,2,2,2,2,2,2,2,2,4,2,2,4,2,3,2,2,4,4,2,4,4,2,2,4,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,2,4,2,2(...TRUNCATED)	{"language":[2,2,2,4,2,4,2,2,2,4,2,4,4,4,2,2,4,4,2,4,2,2,4,2,4,4,2,2,2,4,4,2,2,2,2,2,4,2,2,2,2,2,4,4(...TRUNCATED)	0	A	0	0	[ "greedy" ]	false		{ "nanos": 0, "seconds": 2 }	512,000,000
chsparr	"You are given two permutations p and q, consisting of n elements, and m queries of the form: l1, r1(...TRUNCATED)	{ "input": [ "3\n0 1 1\n1 0 4\n1 4 0\n", "4\n0 1 2 3\n1 0 4 5\n2 4 0 6\n3 5 6 0\n" ], "output": [ "2", "5" ] }	{ "input": [], "output": [] }	{"input":["5\n2 3 0 6 8","5\n2 3 4 6 5","5\n2 3 4 6 7","5\n2 3 0 6 7","5\n2 -1 8 6 4","5\n6 0 8 5 2"(...TRUNCATED)	2	9	{"language":[2,4,3,2,3,2,2,3,2,3,4,3,2,3,3,2,2,2,2,2,2,4,2,4,3,4,3,2,2,2,2,2,2,3,3,3,3,3,2,3,2,3,4,3(...TRUNCATED)	{"language":[4,2,2,4,2,2,2,2,2,2,2,4,2,4,4,4,4,2,2,2,2,2,4,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,4(...TRUNCATED)	0		0	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000