Datasets:

TheFactoryX
/

edition_2973_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
simple-prime-factorization	You are given an integer sequence A of length N and an integer K. You will perform the following operation on this sequence Q times: * Choose a contiguous subsequence of length K, then remove the smallest element among the K elements contained in the chosen subsequence (if there are multiple such elements, choose one ...	{ "input": [ "5 3 2\naaaaa\naaa\naab" ], "output": [ "1 6" ] }	{ "input": [ "100 3\n45 1 2 3 4 5 6 7 8 9 19 21 24 27 28 30 34 35 37 39 40 41 42 43 46 47 48 51 52 55 58 59 61 63 64 66 69 71 76 80 85 86 88 89 94 99\n26 10 11 15 18 23 29 31 33 36 38 44 49 54 56 60 62 65 75 78 82 83 84 95 96 97 98\n29 12 13 14 16 17 20 22 25 26 32 45 50 53 57 67 68 70 72 73 74 77 79 81 87 90 91 ...	{ "input": [ "25\n91 57\n2 73\n54 57\n2 57\n23 57\n2 6\n57 54\n57 23\n91 54\n91 23\n57 23\n91 57\n54 2\n6 91\n57 54\n2 57\n57 91\n73 91\n57 23\n91 57\n2 73\n91 2\n23 6\n2 73\n23 12\n", "29\n8 18\n33 75\n69 22\n97 95\n1 97\n78 10\n88 18\n13 3\n19 64\n98 12\n79 92\n41 72\n69 15\n98 31\n55 74\n15 56\n36 37\n15 6...	6	9	{ "language": [ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 main():\n\tn = int(ra...	{ "language": [], "solution": [] }	0		0	0	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
chandu-and-daspal-2	"To improve the boomerang throwing skills of the animals, Zookeeper has set up an n × n grid with s(...TRUNCATED)	{ "input": [ "1\n9\n10\n1\n\nSAMPLE" ], "output": [ "10" ] }	{ "input": [], "output": [] }	{"input":["7 9\n1 9\n5 9\n5 7\n5 9\n1 1\n6 8\n3 4","7 9\n1 9\n9 9\n5 7\n5 9\n1 1\n6 8\n3 4","7 11\n1(...TRUNCATED)	2	7	{"language":[4,3,2,4,3,2,3,2,2,4,2,4,3,3,2,3,2,2,2,3,3,3,3,3,3,3,3,2,4,3,3,4,3,3,3,4,3,3,3,4,3,3,3,3(...TRUNCATED)	{"language":[3,2,2,4,1,2,2,2,2,4,4,2,2,2,4,4,2,3,2,1,2,2,2,4,4,2,4,2,2,1,2,2,2,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED)	0	F	1,000	3,100	[ "" ]	false	"Problem\n\nKND君は会津大学に在籍する学生プログラマである。彼の住む町の(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	256,000,000
p00781 Lattice Practices	"Snuke is conducting an optical experiment using mirrors and his new invention, the rifle of Mysteri(...TRUNCATED)	{ "input": [ "4 5 3 1 5\n", "5 1 2 1 2\n", "3 3 1 1 1\n" ], "output": [ "Friendship\n", "First\n", "Second\n" ] }	{"input":["1 3 0\n6 3 4\n","5 4 32\n4 2 1 1\n","32 6 635\n3 4 2 1 7 7\n","3 7 20012\n1 1 1 1 1 1 100(...TRUNCATED)	{"input":["5 6\n#.##\n.##.\n#...\n..##\n...#","13 27\n......#.........#.......#..\n...#.....###..\n.(...TRUNCATED)	5	0	{"language":[2,2,2,2,2,2,2,2,2,2,4,2,4,4,4,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,4,4,4,4,2,2,4,2,4,2,2,2,4(...TRUNCATED)	{"language":[3,1,3,2,1,2,2,2,4,2,3,4,2,4,2,4,2,3,1,3,4,3,2,2,4,3,2,2,1,2,4,2,4,3,4,2,4,2,4,4,4,3,2,4(...TRUNCATED)	1,211	B	0	2,600	[ "brute force", "implementation", "sortings" ]	false		{ "nanos": 0, "seconds": 2 }	134,217,728
774_K. Stepan and Vowels	"On Children's Day, the child got a toy from Delayyy as a present. However, the child is so naughty (...TRUNCATED)	{ "input": [ "5 2" ], "output": [ "12" ] }	{ "input": [], "output": [] }	{"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	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": [] }	38	D	1,000	1,100	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
830_A. Office Keys	"Story\n\nAt UZIA High School in the sky city AIZU, the club activities of competitive programming a(...TRUNCATED)	{"input":["10000\n5000 3150\n5000 5000\n0 0\n5000 1050\n5000 3980\n5000 210\n5000 5000\n5000 5000\n0(...TRUNCATED)	{"input":["5 4\n1 2 1 -1\n2 3 1 -1\n3 1 1 -1\n4 5 2 -1\n","3 3\n1 2 -10 30\n1 3 1 1\n2 3 -10 -1\n","(...TRUNCATED)	{"input":["1 10\n778084 -205153\n778001 -205093\n778155 -205118\n778168 -204997\n778066 -205141\n778(...TRUNCATED)	1	8	{"language":[2,2,2,2,2,2,2,4,2,4,2,2,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,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[0,0,0,0,2,0,2,0,2,2,2,1,2,4,2,2,1,4,2,2,0,2,0,4,2,0,0,0,2,0,2,0,3,0,0,2,2,0,2,3,0,2,4,2(...TRUNCATED)	0		1,000	900	[]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
walk	"At a geometry lesson Gerald was given a task: to get vector B out of vector A. Besides, the teacher(...TRUNCATED)	{ "input": [ "6 1 2 3 4 5", "6 200 2 3 4 5" ], "output": [ "1", "1" ] }	{ "input": [ "1 1\n1\n1\n1\n" ], "output": [ "0\n" ] }	{"input":["000 0","10 3\n8 7 000\n7 9 100\n9 8 100","4 3\n2 1 1\n2 3 3\n3 4 2","10 3\n8 7 000\n7 9 1(...TRUNCATED)	5	0	{"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,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)	455	B	1,250	0	[ "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
p02741 Panasonic Programming Contest 2020 - Kth Term	"A factory produces thimbles in bulk. Typically, it can produce up to a thimbles a day. However, som(...TRUNCATED)	{"input":["5\n1 2\n2 3\n3 4\n4 5\n5\n1 3 1 2 2\n1 4 1 3 2\n1 4 1 3 3\n4 2 3 3 9\n5 2 3 3 9\n"],"outp(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1 10\n1 5 9 5\n1\n5 5 L 0\n","3 7\n2 4 2 7\n4 7 4 6\n7 3 5 3\n10\n6 7 L 1\n6 7 L 2\n6 7 L(...TRUNCATED)	2	7	{"language":[2,4,4,4,2,4,4,4,4,4,2,3,2,3,4,2,2,2,2,2,4,4,2,4,2,4,2,2,2,4,2,2,2,2,2,3,2,4,2,4,4,2,2,1(...TRUNCATED)	{"language":[2,2,3,0,3,2,0,3,0,2,2,3,2,3,2,2,0,2,0,3,0,3,3,2,3,2,2,0,2,2,3,3,2,2,2,3,3,3,2,2,4,3,4,2(...TRUNCATED)	1,244		750	1,400	[ "geometry", "math" ]	false		{ "nanos": 0, "seconds": 1 }	268,435,456
79_D. Password	"You are given a permutation p_1,p_2,...,p_N consisting of 1,2,..,N. You can perform the following o(...TRUNCATED)	{"input":["341143514535\n314\n143565553551655311343411652235654535651124615163\n551544654451431564\n(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["aabbaaaa\nbaaaaaab\n","cba\ncba\n","xnahfslefuigq\naaaaaaaaaaaaa\n","abcddd\ndddcab\n","a(...TRUNCATED)	2	0	{"language":[2,2,2,2,2,2,4,2,2,4,4,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,0,0,2,2,2,2,2,2,2,0,0,0,0,2,2,0,3,0,0,0,0,2,2,0,2,2,2,2,0,2,2,2,0,0],"solution":["#in(...TRUNCATED)	0	B3	70	2,300	[ "combinatorics", "dp" ]	false		{ "nanos": 0, "seconds": 2 }	268,435,456
483_B. Friends and Presents	"We have a tree with N vertices. The i-th edge connects Vertex A_i and B_i bidirectionally.\n\nTakah(...TRUNCATED)	{ "input": [ "keyence", "ashlfyha", "keyofscience", "mpyszsbznf" ], "output": [ "YES", "NO", "YES", "NO" ] }	{"input":["2\n1 1 3 1\n3\n0 1 2\n"],"output":[" (...TRUNCATED)	{"input":["11\nadd 1\nsum\nadd 2\nsum\nadd 3\nsum\nadd 4\nsum\nadd 6\nsum\nadd 6\n","6\nadd 4\nadd 7(...TRUNCATED)	2	15	{"language":[4,1,2,3,4,4,3,2,3,1,2,4,4,2,3,4,3,3,2,2,2,4,3,4,1,3,2,4,2,3,2,4,1,4,2,2,4,2,2,2,4,2,4,3(...TRUNCATED)	{"language":[2,2,2,4,4,4,2,4,2,2,1,4,4,2,1,2,2,4,4,2,2,2,4,4,2,2,2,3,4,2,2,2,4,2,2,4,3,2,2,2,4,2,3,2(...TRUNCATED)	0		0	0	[ "constructive algorithms", "dfs and similar", "dp", "greedy", "trees" ]	false	"Background\n\n会津大学付属幼稚園はプログラミングが大好きな子供が集まる(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	134,217,728
roy-and-wobbly-numbers	"Manao works on a sports TV. He's spent much time watching the football games of some country. After(...TRUNCATED)	{ "input": [ "73", "1" ], "output": [ "458.67252742410977361942", "6.28318530717958623200" ] }	{ "input": [], "output": [] }	{"input":["10 1\n1 0 1 1 1 1 1 1 1 1\n","3 87\n78 165 54\n","9 13\n132 166 200 62 168 51 185 192 118(...TRUNCATED)	2	7	{"language":[4,2,1,1,3,2,3,3,4,2,4,4,2,3,4,3,2,4,1,2,2,3,1,2,2,2,4,1,2,4,3,3,2,4,4,4,1,3,1,4,4,1,2,4(...TRUNCATED)	{"language":[2,0,2,2,0,2,2,0],"solution":["#include <bits/stdc++.h>\n#define pq priority_queue\nusin(...TRUNCATED)	1,003	D	0	1,400	[ "games", "implementation" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000