Datasets:

TheFactoryX
/

edition_3012_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	time_limit dict	memory_limit_bytes int64 0 1.07B
914_F. Substrings in a String	You and your friend are participating in a TV show "Run For Your Prize". At the start of the show n prizes are located on a straight line. i-th prize is located at position ai. Positions of all prizes are distinct. You start at position 1, your friend — at position 106 (and there is no prize in any of these two positi...	{ "input": [ "3\n3 4 5\n1 0 5\n5 3 2\n" ], "output": [ "9\n0\n6\n" ] }	{ "input": [], "output": [] }	{ "input": [ "7 9 999999999 0 4\n0 1 0\n1 2 0\n2 3 0\n0 4 1\n4 1 1\n1 5 499999999\n5 2 499999999\n2 6 1\n6 3 1\n", "7 9 320 0 3\n0 1 0\n2 2 0\n2 3 0\n0 4 1\n4 1 1\n1 5 100\n5 2 100\n2 6 59\n6 3 61\n", "101 1 123456 99 0\n0 99 123456\n", "7 9 319 0 3\n0 1 0\n1 2 0\n2 3 0\n0 4 1\n4 1 1\n1 5 100\n5 2 100...	2	0	{ "language": [], "solution": [] }	{ "language": [], "solution": [] }	0		0	1,700	[]	true	{ "nanos": 0, "seconds": 5 }	268,435,456
reversemerge-shuffle-reverse	"Our beloved detective, Sherlock is currently trying to catch a serial killer who kills a person eac(...TRUNCATED)	{"input":["1\n-1\n0"],"output":["? 0 0\n? 536870912 0\n? 0 536870912\n? 805306368 536870912\n? 53687(...TRUNCATED)	{ "input": [ "3\n1234567\n1268501\n1268499\n" ], "output": [ "788765312\n999997375\n999999350\n" ] }	{"input":["20\n76 86 70 7 16 24 10 62 26 29 40 65 87 49 34 55 92 47 43 100\n","100\n6591 1074 3466 3(...TRUNCATED)	2	0	{"language":[3,3,4,3,2,2,3,4,3,3,3,3,3,2,2,3,2,4,3,3,4,3,3,3,2,3,3,2,3,3,4,4,3,3,3,4,3,4,2,4,3,3,3,3(...TRUNCATED)	{ "language": [], "solution": [] }	0		0	2,000	[ "brute force", "implementation", "strings" ]	false	{ "nanos": 0, "seconds": 8 }	268,435,456
760_F. Bacterial Melee	"In one well-known algorithm of finding the k-th order statistics we should divide all elements into(...TRUNCATED)	{"input":["3 4\n5 6\n3 3\n2 2\n1 1\n0 0"],"output":["#.#.\n.#.#\n#.#.\n\n#.#.#.\n.#.#.#\n#.#.#.\n.#.(...TRUNCATED)	{"input":["2 1\n7 1 1\n2 1 1\n","5 1\n2 1 0\n2 0 1\n1 0 1\n1 1 0\n1 0 1\n","6 2\n6 0 0\n11 1 0\n9 0 (...TRUNCATED)	{"input":["202763616\n","1778707511\n","181182141\n","1438\n","55068349\n","324423196\n","339071627\(...TRUNCATED)	1	8	{"language":[2,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,4,3,2,3,3,3,3,3,2,3,3,3,3,4,4,3,3,2,3,3,3,3,3,3,2,3,3,3(...TRUNCATED)	{"language":[2,2,4,2,2,2,4,4,2,4,2,2,2,2,2,4,2,2,4,3,4,4,4,4,1,4,4,4,2,3,1,4,2,2,2,2,4,4,2,4,1,3,2,2(...TRUNCATED)	820	A	500	800	[ "flows", "shortest paths" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
720_C. Homework	"You are given a square with 'n' points on each side of the square. None of these points co-incide w(...TRUNCATED)	{ "input": [ "3\nAFI\n", "6\nAFFAAA\n" ], "output": [ "1", "4" ] }	{ "input": [], "output": [] }	{"input":["5\n0 4\n3 4\n1 2\n2 0\n0 0\n","10\n1000 0\n100 0\n0 25\n100 50\n100 51\n99 102\n1001 102\(...TRUNCATED)	6	0	{"language":[3,4,3,3,3,1,3,3,3,3,3,3,3,4,3,1,2,4,3,2,3,3,3,4,3,3,3,2,1,3,3,3,1,3,2,4,3,3,2,3,1,4,4,3(...TRUNCATED)	{"language":[2,2,4,2,2,2,2,3,3,2,3,3,4,2,2,3,2,3,2,2,2,2,2,2,2,3,2,4,2,4,1,2,4,3,2,4,4,2,2,3,4,2,2,2(...TRUNCATED)	720		0	1,600	[ "binary search", "math", "sortings" ]	false	{ "nanos": 0, "seconds": 2 }	0
chandu-and-daspal-2	"Taro is an elementary school student who has just learned multiplication. Somehow, he likes multipl(...TRUNCATED)	{ "input": [ "3\n25\n46\n99" ], "output": [ "2\n1\n2\n" ] }	{ "input": [], "output": [] }	{"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\(...TRUNCATED)	6	0	{"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":[3,2,3,3,2,2,1,2,4,4,4,3,4,4,3,3,4,2,2,2,4,3,2,2,3,2,2,3,3,3,2,2,4,3,2,4,3,3,4,2,4,1,3,2(...TRUNCATED)	143		0	2,500	[ "dsu", "graphs", "trees" ]	false	{ "nanos": 0, "seconds": 3 }	0
vowel	"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": [ "1\n3 3\n1 2\n2 3\n1 3\n\nSAMPLE" ], "output": [ "2\n" ] }	{"input":["10 10\n.L.....R..\n.........U\n..D....D..\n.R......L.\n....L.....\n.........D\n......U...(...TRUNCATED)	{"input":["5 6\n#.##\n.##.\n#...\n..##\n...#","13 27\n......#.........#.......#..\n...#.....###..\n.(...TRUNCATED)	2	0	{"language":[2,4,3,2,2,2,2,4,2,2,2,2,2,4,1,2,2,2,2,2,2,2,2,3,2,4,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,4,4,2,2,2,2,2,2,4,2,2,4,2,4,2,2,2,2,2(...TRUNCATED)	0		1,000	2,500	[ "" ]	false	{ "nanos": 0, "seconds": 6 }	256,000,000
1129_D. Isolation	"A prime number is a natural number which has exactly two distinct natural number divisors: 1 and it(...TRUNCATED)	{"input":["1 1 1\n","3 1 0\n"],"output":[" (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["10\n-1 -1\n1 1\n1 1\n3 0\n4 1\n2 0\n3 1\n2 1\n5 0\n5 0\n8\n1 2 6\n2 3 7\n2 4 7\n1 3 4\n2 (...TRUNCATED)	3	7	{"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,2,2,4,4,4,4,4,4,4,2,4,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,4,2,2,2,2,2(...TRUNCATED)	937		0	1,100	[ "" ]	false	null	256,000,000
167_C. Wizards and Numbers	"You are given a chessboard of size 1 × n. It is guaranteed that n is even. The chessboard is paint(...TRUNCATED)	{ "input": [ "2\n3\n3 2 1\n6\n3 1 4 1 5 9\n" ], "output": [ "3\n5\n" ] }	{ "input": [], "output": [] }	{"input":["3\nooe\n","36\naaiouyaaeeiioouuyyaaeeeeiiiooouuuyyy\n","3\npoo\n","1\nb\n","4\nooee\n","5(...TRUNCATED)	2	3	{ "language": [], "solution": [] }	{"language":[2,2,2,2,2,4,3,3,2,4,2,2,2,2,2,2,2,2,2,4,2,3,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,4,2,2,3,2,2,2(...TRUNCATED)	0	A	0	0	[ "bitmasks", "brute force", "data structures", "string suffix structures", "strings" ]	false	{ "nanos": 0, "seconds": 1 }	134,217,728
691_D. Swaps in Permutation	"This is the easy version of the problem. The only difference is that in this version q = 1. You can(...TRUNCATED)	{"input":["1\n3\n1 2\n2 3\n1\n1\n1\n2\n2\n1\n","2\n6\n1 2\n1 3\n1 4\n4 5\n4 6\n4\n1 3 4 5\n3\n3 5 2\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1 100000 100000 110000 -100000\n","46456 -250 -23623 -98302 -99305\n","10 6 3 7 2\n","1 -(...TRUNCATED)	3	9	{"language":[2],"solution":["//\n// Problem: Kimagagure Cleaner\n// Solution by: MORI Shingo\n// O(n(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	F	0	0	[]	false	{ "nanos": 0, "seconds": 2 }	0
1421_B. Putting Bricks in the Wall	"Vasya is a CEO of a big construction company. And as any other big boss he has a spacious, richly f(...TRUNCATED)	{"input":["6\n1 4 3 3 5 7\n3 7 5 4 3\n4 3 7 5\n","5\n1 5 8 123 7\n123 7 5 1\n5 1 7\n"],"output":["1\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\n2 3 6","3\n2 3 11","3\n3 2 3","3\n2 5 3","3\n2 2 3","3\n2 2 11","3\n3 2 6","3\n2 2 13"(...TRUNCATED)	1	0	{"language":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"solution":["_ = int(raw_input())\nfor __ in range(...TRUNCATED)	{"language":[2,0,3,2,3,2,2,3,3,3,2,2,2,2,3,2,2,0,2,2,2,2,2,4,3,2,2,2,2,2,0,2,3,2,2,2,2,2,2,2,4,2,2,3(...TRUNCATED)	1,149	D	2,500	0	[ "brute force" ]	false	null	256,000,000