Datasets:

TheFactoryX
/

edition_0813_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
886_D. Restoration of string	"You are given a functional graph. It is a directed graph, in which from each vertex goes exactly on(...TRUNCATED)	{ "input": [ "5\n3 2 1 6 5\n", "4\n3 3 3 3\n" ], "output": [ "8", "0" ] }	{"input":["3 7\n3 2 1\n","4 97\n97 1 50 10\n","5 25\n24 5 15 25 23\n","3 3\n3 2 1\n","4 18\n3 1 1 2\(...TRUNCATED)	{"input":["2\n11 3\n2 3 4\n6 3\n3 2 1","2\n22 3\n2 0 3\n4 3\n3 2 1","2\n22 3\n0 0 3\n4 3\n3 2 1","2\(...TRUNCATED)	2	0	{"language":[2,2,4,4,2,2,2,2,2,2,4,4,4,4,2,2,2,2,2,2,2,4,2,2,2,4,4,4,4,4,4,2,4,2,2,2,2,4,4,4,4,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,3,2,4,2,2,2,4,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	188		500	0	[ "data structures", "graphs" ]	false		{ "nanos": 0, "seconds": 1 }	64,000,000
361_C. Levko and Array Recovery	"You are given an array A of size N, and Q queries to deal with. For each query, you are given an in(...TRUNCATED)	{ "input": [ "2\n1 2\n1 2\n" ], "output": [ "\n12\n" ] }	{ "input": [], "output": [] }	{"input":["#(#(#((##((()))(((#)(#()#(((()()(()#(##(((()(((()))#(((((()(((((((()#((#((()(#(((()((*##((...TRUNCATED)	2	11	{"language":[1,1,1,1,1,1,1],"solution":["def power(x,m):\n\tglobal mod\n\tif m==0:\n\t\treturn 1\n\t(...TRUNCATED)	{"language":[2,3,3,3,4,1,2,2,2,4,1,4,3,3,2,3,4,4,2,1,2,3,4,3,2,3,3,4,1,4,2,4,3,4,3,3,2,4,2,2,3,4,1,3(...TRUNCATED)	354		0	0	[]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
golu-and-coins-1	"Buber is a Berland technology company that specializes in waste of investor's money. Recently Buber(...TRUNCATED)	{"input":["4 4 2\n2 3\n1 2\n1 3\n1 4\n","5 8 2\n2 1\n4 2\n5 4\n5 2\n4 3\n5 1\n4 1\n3 2\n","5 7 2\n1 (...TRUNCATED)	{"input":["1\n317 314 18260\n","1\n315 315 355287\n","1\n316 314 143218\n","1\n516 6 6571\n","1\n317(...TRUNCATED)	{"input":["100\n303\n5","100\n256\n5","100\n407\n5","100\n407\n2","100\n407\n3","100\n407\n6","100\n(...TRUNCATED)	2	12	{"language":[2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,4,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,0,2,2,2,0,0,2,4,2,2,3,2(...TRUNCATED)	1,208		1,750	0	[ "implementation", "math" ]	false		{ "nanos": 0, "seconds": 1 }	0
405_E. Graph Cutting	"<!--\n\nProblem G\n\n-->\n\nLet's Move Tiles!\n\nYou have a framed square board forming a grid of s(...TRUNCATED)	{"input":["6\n1 1 1 0 0 0\n","5\n0 0 0 0 0\n","7\n1 0 0 1 0 0 1\n"],"output":["\n9\n","\n0\n","\n3\n(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["10 20 11\njsnr u eq qas gcj rnnf fpb c dz g\n","10 10 19\nlguv zi riht pf jtbo qmj qp nvh(...TRUNCATED)	6	0	{"language":[4,2,2,2,2,3,4,2,4,3,2,4,1,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,3,4,2,2,2,2,2,2,2,2,2,2,4,2,4(...TRUNCATED)	{"language":[2,2,2,2,3,4,2,2,4,2,2,4,4,1,4,2,2,4,3,4,3,4,4,4,4,2,3,2,4,3,3,2,2,2,2,2,3,4,2,2,2,4,2,4(...TRUNCATED)	626		0	0	[ "implementation" ]	false	"うさぎがある電車のチケットをn 枚持っている. チケットにはそれぞれ0 か(...TRUNCATED)	null	256,000,000
1091_G. New Year and the Factorisation Collaboration	"Bob came to a cash & carry store, put n items into his trolley, and went to the checkout counter to(...TRUNCATED)	{ "input": [ "5 3 2\naaaaa\naaa\naab" ], "output": [ "1 6" ] }	{ "input": [], "output": [] }	{"input":["3\n9 5 8\n8 9 3\n9 5 2\n","50\n48 45 42\n32 45 8\n15 41 47\n32 29 38\n7 16 48\n19 9 21\n1(...TRUNCATED)	1	12	{"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": [], "solution": [] }	1,391	G	1,000	0	[ "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
996_F. Game	"We know that lucky digits are digits 4 and 7, however Vasya's got another favorite digit 0 and he a(...TRUNCATED)	{ "input": [ "5\n2\n3\n4\n5\n6", "11\n7\n8\n9\n10\n11\n12\n13\n14\n15\n16\n17" ], "output": [ "3", "4" ] }	{"input":["7 2\n-10 0 ? 1 ? 2 10\n","1 1\n0\n","5 1\n-3 -2 -1 0 1\n","7 1\n-4 ? ? ? ? ? 2\n","17 1\n(...TRUNCATED)	{"input":["6\nc armor 0 13 0 3\na weapon 23 0 0 3\nb weapon 20 0 0 4\ne orb 0 0 13 3\nd armor 0 15 0(...TRUNCATED)	2	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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	805	A	2,750	0	[ "" ]	false		null	256,000,000
963_B. Destruction of a Tree	"You are given a simple connected undirected graph G consisting of N vertices and M edges. The verti(...TRUNCATED)	{ "input": [ "4\n7 2 4 12\n7 15 10 12\n", "3\n4 4 4\n1 2 3\n" ], "output": [ "Yes\n", "No\n" ] }	{ "input": [], "output": [] }	{"input":["31 50000000\n90016\n60016\n00016\n30016\n30016\n30013\n30013\n90014\n30014\n30014\n20014\(...TRUNCATED)	2	13	{"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":[4,2,2,3,2,4,4,2,2,2,2,4,4,2,2,2,4,2,2,3,3,2,3,2,4,4,2,2,3,4,2,2,3,4,2,2,2,2,1,4,2,4,2,4(...TRUNCATED)	996	D	0	2,600	[ "math" ]	false		{ "nanos": 0, "seconds": 1 }	512,000,000
p00573 Commuter Pass	"You are given an array a of n integers and an integer s. It is guaranteed that n is odd.\n\nIn one (...TRUNCATED)	{ "input": [ "8 2\n1 1 2 3 4 5 5\n", "7 1\n1 1 3 3 4 4\n" ], "output": [ "2", "4" ] }	{"input":["9 12\n1 2\n2 3\n4 5\n5 6\n6 7\n7 8\n1 4\n4 7\n2 5\n5 8\n3 6\n6 9\n","5 4\n2 1\n3 2\n4 3\n(...TRUNCATED)	{"input":["8 15\n","6 1\n","8 9\n","500 17172\n","5 2\n","5 9\n","2 7\n","3 15\n","61 249001\n","8 5(...TRUNCATED)	2	7	{"language":[2,4,4,4,4,4,4,4,4,4,4,4,2,2,4,4,4,4,2,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,2,4,4,4,4(...TRUNCATED)	{ "language": [], "solution": [] }	0		1,500	1,600	[]	false		{ "nanos": 0, "seconds": 6 }	1,073,741,824
p03725 AtCoder Grand Contest 014 - Closed Rooms	"Employees of JebTrains are on their way to celebrate the 256-th day of the year! There are n employ(...TRUNCATED)	{ "input": [ "1 2 1\n1 100 1\n1 100 100\n", "100 100 100\n1 1 1\n1 1 1\n" ], "output": [ "99", "0" ] }	{"input":["9 13\n6 14 19 5 -5 6 -10 20 8\n","8 9\n6 -1 5 -5 -8 -7 -8 -7\n","10 7\n-9 3 -4 -22 4 -17 (...TRUNCATED)	{"input":["20\n9 4 8\n10 6 7\n4 6 0\n7 7 6\n3 6 10\n4 2 1\n4 4 0\n2 0 0\n8 8 7\n3 1 7\n3 10 7\n1 7 3(...TRUNCATED)	6	10	{"language":[2,2,4,2,2,3,4,2,2,2,1,2,4,2,2,4,4,2,2,2,4,4,2,2,4,2,2,2,4,2,4,2,2,2,2,2,1,4,2,2,4,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,446		500	0	[ "combinatorics", "dp" ]	false		{ "nanos": 525000000, "seconds": 2 }	256,000,000
536_C. Tavas and Pashmaks	"You want to go on a trip with a friend. However, friends who have a habit of spending money cannot (...TRUNCATED)	{"input":["6 4\n2 2 5 5 6 6\n1 3\n2 4\n3 5\n4 6\n","3 3\n314 159 265\n1 2\n1 3\n3 2\n","4 2\n2 1 1 5(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["4 20\n4 2 3 1\n2 2\n1 4\n2 2\n1 1\n3 3\n3 3\n1 4\n3 3\n2 2\n3 3\n4 1\n2 2\n1 4\n3 3\n3 1\(...TRUNCATED)	6	7	{"language":[1],"solution":["t = int(raw_input())\nfor _ in range(t):\n n, m, k = map(int, raw_in(...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],"sol(...TRUNCATED)	0		500	1,300	[ "implementation", "math" ]	false		{ "nanos": 0, "seconds": 3 }	256,000,000