Datasets:

TheFactoryX
/

edition_0615_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
1525_D. Armchairs	You are given a square with 'n' points on each side of the square. None of these points co-incide with the corners of this square. You have to compute the total number of triangles that can be formed using these '4n' points (n points on each side of the square) as vertices of the triangle. Input First line contains ...	{ "input": [ "5\nZZZAA\n", "7\nABACABA\n" ], "output": [ "ZZ\n", "AB\n" ] }	{ "input": [], "output": [] }	{ "input": [ "2 5 1\n0 4 6\n0 2 7\n", "1 1 1000000000\n0 0 1\n", "5 200 10\n1 1 1\n1000000000 200 1000000000\n1000000000 300 1000000000\n1000000000 400 1000000000\n1000000000 500 1000000010\n", "4 10 5\n1 1 1\n1 0 1\n1 5 8\n2 7 100\n", "1 2 1000000000\n0 1 1\n", "5 56 10\n1 1 1\n1000000000 200...	2	9	{ "language": [ 1 ], "solution": [ "from collections import deque\nclass Frog():\n\t\n\tdef __init__(self,n,stones):\n\t\tself.colors=[[] for _ in xrange(101)]\n\t\tself.N = n\n\t\tself.stones = stones\n\t\tfor i,c in enumerate(stones):\n\t\t\tself.colors[c].append(i)\n\t\tself.l=[0]*self.N\n\t\t\n\t\t\n\...	{ "language": [], "solution": [] }	724	G	0	1,900	[ "data structures", "greedy", "two pointers" ]	false		{ "nanos": 0, "seconds": 1 }	268,435,456
741_E. Arpa’s abnormal DNA and Mehrdad’s deep interest	"Bearland has n cities, numbered 1 through n. Cities are connected via bidirectional roads. Each roa(...TRUNCATED)	{"input":["5 18 1000\n","132 10 35\n","48 132 235\n","2 2 1\n"],"output":["-1","5 7\n","22 111","1 1(...TRUNCATED)	{"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":["1\n2 2\n1 1\n1 3\n","1\n1 3\n3\n1 2 0\n","5\n4 5\n10 8 6 4\n1 2 3 4 5\n1 1\n3\n3\n1 1\n3\(...TRUNCATED)	2	7	{"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,4,2,2,4,2,2,2,2,2,2,4,2,2,4,2,4,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,4,2,2(...TRUNCATED)	0	F	1,000	1,600	[ "dfs and similar", "dsu", "graphs" ]	false		{ "nanos": 500000000, "seconds": 1 }	0
633_H. Fibonacci-ish II	"Today Peter has got an additional homework for tomorrow. The teacher has given three integers to hi(...TRUNCATED)	{ "input": [ "1 2 10\n11\n15 7\n", "2 4 50\n20 100\n60 10 40 80\n" ], "output": [ "7", "50" ] }	{ "input": [], "output": [] }	{"input":["50 100\n3 24 49\n2 10 12\n1 87 92\n2 19 60\n2 53 79\n3 65 82\n3 10 46\n1 46 86\n2 55 84\n(...TRUNCATED)	2	0	{"language":[2,2,3,2,4,4,2,2,1,4,2,2,4,2,4,4,3,3,3,3,4,3,1,4,4,1,3,2,4,4,4,3,3,2,3,2,3,2,3,3,3,3,4,4(...TRUNCATED)	{"language":[2,2,2,2,4,2,2,1,2,1,2,2,4,1,4,2,2,2,1,2,2,2,2,4,4,2,2,2,4,1,4,2,2,2,2,2,2,4,2,3,1,1,3,2(...TRUNCATED)	0	B	500	2,200	[ "brute force", "greedy" ]	false		{ "nanos": 0, "seconds": 2 }	512,000,000
p01878 Destiny Draw	"KM country has N kinds of coins and each coin has its value a_i.\n\nThe king of the country, Kita_m(...TRUNCATED)	{"input":["3 10\n2 3 2\n6\n1 5\n2 1 10\n2 2 9\n2 5 6\n3 1 7 8\n4 1 2 3 4\n"],"output":["\nYES\nYES\n(...TRUNCATED)	{"input":["5 0\n884430748 884430748 708433020 708433020 708433020\n","2 1\n1 1\n","2 0\n2 1\n","5 2\(...TRUNCATED)	{"input":["1\n47 1 47\n40 45 19 10 44 33 47 12 2 46 16 23 3 14 21 28 31 42 22 18 35 38 24 25 36 32 4(...TRUNCATED)	2	0	{"language":[2,2,3,3,1,3,4,3,2,2,4,3,2,4,2,4,4,4,3,3,2,4,3,2,2,2,3,2,3,4,2,3,2,2,4,4,3,3,2,3,4,3,3,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	A1	1,500	1,800	[ "dfs and similar", "dsu", "math" ]	false		{ "nanos": 0, "seconds": 2 }	268,435,456
730_J. Bottles	"Bessie and the cows have recently been playing with \"cool\" sequences and are trying to construct (...TRUNCATED)	{"input":["5\n\n3 2 2\n2 0\n0 5\n\n4 3 2\n2 0 5\n0 6\n\n0 2 2\n1 0\n2 3\n\n5 4 4\n6 0 8 0\n0 7 0 9\n(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\n184427 500001 500002\n","1\n413243\n","1\n256223\n","2\n3 999999\n","1\n576559\n","2\n(...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":[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,547	C	0	0	[ "dp", "matrices" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
p00720 Earth Observation with a Mobile Robot Team	"Your task is very simple. Given K numbers A1, A2, ..., AK. You need to find f(N) mod max(A1, A2, .(...TRUNCATED)	{"input":["1 1 1\n","3 1 0\n"],"output":[" (...TRUNCATED)	{"input":["30 35 4 30\n14 2 7\n22 23 2\n5 26 3\n28 4 3\n7 5 29\n19 15 2\n11 20 12\n1 22 9\n30 21 24\(...TRUNCATED)	{"input":["aa\n2\nbb\nbc\n","th\n1\nht\n","bb\n1\nab\n","bn\n100\ndf\nyb\nze\nml\nyr\nof\nnw\nfm\ndw(...TRUNCATED)	2	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,2,2,2,2,2,2,1,2,2,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,4,2,2,2,2,2(...TRUNCATED)	0		0	2,500	[ "graphs", "greedy", "sortings" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
p02260 Selection Sort	"You may know that Euclid was a mathematician. Well, as it turns out, Morpheus knew it too. So when (...TRUNCATED)	{"input":["6 3\n2 1\n2 6\n4 2\n5 6\n2 3\n","8 4\n2 6\n2 7\n7 8\n1 2\n3 1\n2 4\n7 5\n"],"output":["1 (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["72\n111101100111001110000000100010100000111011100110001010111010101011111100\n","3\n001\n(...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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,030		0	0	[ "brute force", "implementation", "strings" ]	false	"うさぎがとあるロールプレイングゲームで遊んでいる. 城に入る直前で, (...TRUNCATED)	{ "nanos": 0, "seconds": 1 }	256,000,000
1250_B. The Feast and the Bus	"Advertising has become part of our routine. And now, in the era of progressive technologies, we nee(...TRUNCATED)	{ "input": [ "5\n7 46 11 20 11", "7\n994 518 941 851 647 2 581", "3\n3 4 6" ], "output": [ "90", "4527", "10" ] }	{"input":["1\n1\n1\n1\n1\n1\n1\n","1\n3\n2 3 1\n1 2\n2 3\n1\n1\n1\n2\n","2\n6\n5 3 2 4 1 6\n1 2\n1 3(...TRUNCATED)	{ "input": [], "output": [] }	2	8	{"language":[3,2,3,4,3,2,3,3,3,2,3,2,2,2,3,3,4,3,3,2,4,3,2,3,3,2,2,3,3,2,4,3,4,2,4,2,4,2,2,2,3,4,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0	C	0	1,800	[ "data structures", "dp", "greedy", "implementation" ]	false		{ "nanos": 0, "seconds": 2 }	512,000,000
1060_A. Phone Numbers	"You are given an integer n. In one move, you can either multiply n by two or divide n by 6 (if it i(...TRUNCATED)	{"input":["22\n0011223344556677889988\n","11\n00000000008\n","11\n31415926535\n"],"output":["2\n","1(...TRUNCATED)	{"input":["3 10\n2 3 1\n1 1\n3 3\n3 3\n3 2\n1 1\n2 2\n3 1\n1 3\n2 1\n3 3\n","7 20\n6 2 5 7 3 1 4\n7 (...TRUNCATED)	{"input":["5\n1 2 0\n1 3 0\n3 5 0\n3 4 0\n3\n3\n4\n1\n3\n4\n","20\n9 11 0\n1 5 0\n1 14 0\n5 17 0\n14(...TRUNCATED)	2	12	{"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],"solution":["# @author Kil(...TRUNCATED)	{ "language": [], "solution": [] }	0		0	900	[ "implementation" ]	false		{ "nanos": 0, "seconds": 1 }	512,000,000
p03940 AtCoder Grand Contest 007 - Shik and Game	"Please note the non-standard memory limit.\n\nThere are n problems numbered with integers from 1 to(...TRUNCATED)	{ "input": [ "0 1 1 1 1 0\n", "1 1 0 0 1000 1000\n" ], "output": [ "Yes\n", "No\n" ] }	{"input":["10 10\n.L.....R..\n.........U\n..D....D..\n.R......L.\n....L.....\n.........D\n......U...(...TRUNCATED)	{"input":["10\n4643665 282618243 791521863 214307200 976959598 590907019 166397456 708291256 8537738(...TRUNCATED)	1	7	{"language":[4,1,4,3,1,4,4,2,2,4,2,2,2,2,4,1,2,1,4,4,2,4,4,4,4,4,4,2,4,2,2,2,4,2,4,2,4,2,4,2,2,4,2,4(...TRUNCATED)	{"language":[4,2,4,2,2,2,2,2,2,1,4,2,2,2,2,1,4,2,2,3,2,2,2,2,2,2,4,2,2,2,1,2,1,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED)	306	D	2,500	0	[]	false		{ "nanos": 0, "seconds": 2 }	268,435,456