Datasets:

TheFactoryX
/

edition_0765_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	time_limit dict	memory_limit_bytes int64 0 1.07B
500_C. New Year Book Reading	"Two players play the following game. Initially, the players have a knife and a rectangular sheet of(...TRUNCATED)	{ "input": [ "0.0,0.0,1.0,0.0,1.0,1.0,0.0,1.0\n0.0,0.0,3.0,0.0,1.0,1.0,1.0,3.0" ], "output": [ "YES\nNO" ] }	{ "input": [], "output": [] }	{"input":["6\n3 1\n3 2\n5 100\n4 3\n4 4\n5 2\n\nSAMPLE","6\n6 1\n3 2\n5 100\n4 3\n4 4\n5 2\n\nSAMPLE(...TRUNCATED)	1	7	{"language":[1,1],"solution":["t=input()\nwhile t>0:\n\tb=[]\n\ta=raw_input().split()\n\tfor i in ra(...TRUNCATED)	{"language":[3,2,4,4,2,2,2,4,1,4,4,2,2,4,2,2,4,4,4,2,2,2,2,2,1,2,4,4,2,2,2,2,2,2,2,3,2,2,2,3,2,2,2,2(...TRUNCATED)	1,165		0	0	[ "implementation", "math" ]	false	{ "nanos": 0, "seconds": 2 }	512,000,000
89_C. Chip Play	"A recently found Ancient Prophesy is believed to contain the exact Apocalypse date. The prophesy is(...TRUNCATED)	{ "input": [ "5\n2\n3\n4\n5\n6", "11\n7\n8\n9\n10\n11\n12\n13\n14\n15\n16\n17" ], "output": [ "3", "4" ] }	{ "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	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":[4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,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)	556		2,000	900	[ "brute force", "implementation" ]	false	{ "nanos": 0, "seconds": 4 }	0
trailing-zero-problem-1	"In a mystical TimeLand, a person's health and wealth is measured in terms of time(seconds) left. \n(...TRUNCATED)	{ "input": [ "1\n", "6\n", "30\n" ], "output": [ "1\n0", "2", "1\n6" ] }	{"input":["5 3\n","1000 3\n","777 17\n","4 3\n","2 2\n","100 4\n","10 4\n","999 2\n","6 4\n","1 2\n"(...TRUNCATED)	{"input":["72\n909 34\n420 51\n621 76\n65 48\n82 41\n665 53\n43 33\n309 21\n942 51\n156 13\n997 11\n(...TRUNCATED)	2	0	{"language":[2,2,2,4,2,2,2,4,2,2,2,2,4,2,2,2,2,1,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,1,4,2,4,2,2,2,4,2(...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,3,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,227	A	2,000	800	[ "greedy" ]	false	null	134,217,728
260_B. Ancient Prophesy	"Employees of JebTrains are on their way to celebrate the 256-th day of the year! There are n employ(...TRUNCATED)	{"input":["6\n3\n0 0\n1 1\n1 2\n2\n1 0\n1000 3\n4\n10 1\n15 2\n10 2\n15 2\n1\n765 432\n2\n4 4\n4 3\n(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	5	0	{"language":[2,4,3,4,3,3,4,3,4,4,4,2,2,4,2,1,3,2,3,3,4,1,4,2,4,4,4,2,4,3,4,3,4,3,2,4,3,3,3,4,3,4,2,3(...TRUNCATED)	{"language":[2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	C	0	1,600	[ "bitmasks", "dp" ]	false	{ "nanos": 0, "seconds": 6 }	268,435,456
p02807 Dwango Programming Contest 6th - Fusing Slimes	"Chandan gave his son a cube with side N. The N X N X N cube is made up of small 1 X 1 X 1 cubes.\n(...TRUNCATED)	{ "input": [ "5 3 2\naaaaa\naaa\naab" ], "output": [ "1 6" ] }	{ "input": [], "output": [] }	{"input":["30 2\n-999999924 -499999902 500000091 -697652453 500000030 -999999934 500000086 -49999991(...TRUNCATED)	2	0	{"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": [], "solution": [] }	846		0	1,900	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
bobs-journey-5	"You are given an undirected graph, consisting of n vertices and m edges. The graph does not necessa(...TRUNCATED)	{ "input": [ "4\naaa\nabc\nabdbca\nabba" ], "output": [ "YES\nNO\nYES\nYES\n" ] }	{ "input": [], "output": [] }	{"input":["4 0\n","8 9\n1 2\n2 3\n3 4\n4 1\n5 6\n6 7\n7 1\n8 5\n6 8\n","11 9\n5 9\n8 5\n11 3\n11 1\n(...TRUNCATED)	2	0	{"language":[3,3,3,4,2,3,3,4,2,3,2,4,4,4,4,4,3,4,4,2,2,3,4,4,2,2,3,2,4,3,3,4,2,2,3,2,3,4,3,2,3,4,3,3(...TRUNCATED)	{"language":[4,2,2,2,1,2,2,2,2,2,2,4,2,2,4,2,4,3,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,0,4,2(...TRUNCATED)	0		1,000	0	[ "brute force", "sortings" ]	false	{ "nanos": 0, "seconds": 2 }	0
662_C. Binary Table	"Two friends are on the coordinate axis Ox in points with integer coordinates. One of them is in the(...TRUNCATED)	{ "input": [ "3,4,5\n5,5,8\n4,4,4\n5,4,3" ], "output": [ "1\n2" ] }	{"input":["30\n10 1 8 10 2 6 45 7 3 7 1 3 1 1 14 2 5 19 4 1 13 3 5 6 1 5 1 1 23 1\n98 4 43 41 56 58 (...TRUNCATED)	{"input":["12 11\n11 12\n25 7\n","12 17\n6 19\n13 16\n","9 12\n3 17\n10 20\n","2 4\n1 3\n3 3\n","3 7(...TRUNCATED)	2	7	{"language":[2,4,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,4,2,2,2,4,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,4,2,4,4,2,2,2,2,2,2,2,1,2,2,4,4,2,2,4,2,2,2,2,2,3,2,2,2,2,3,2,2,2,1,2,2,2,2,2,2(...TRUNCATED)	1,421		1,000	1,500	[ "greedy" ]	true	{ "nanos": 0, "seconds": 1 }	256,000,000
609_B. The Best Gift	"Let's consider the following game. We have a rectangular field n × m in size. Some squares of the (...TRUNCATED)	{ "input": [ "4\n2 5\n9 7\n15 6\n9 3" ], "output": [ "3" ] }	{ "input": [], "output": [] }	{"input":["4 1 1 12\n3 2 3","4 1 1 16\n3 2 3","4 1 1 16\n2 2 3","4 1 1 6\n3 1 3","4 0 1 12\n3 2 3","(...TRUNCATED)	2	7	{"language":[2,1,3,3,3,4,2,3,1,1,2,4,2,3,4,4,3,1,1,3,4,4,3,3,2,3,3,4,2,3,2,2,3,3,4,3,3,3,1,2,3,2,2,3(...TRUNCATED)	{ "language": [], "solution": [] }	814	B	1,500	0	[ "data structures", "dfs and similar", "graphs", "greedy" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
p00206 Next Trip	"You are given q queries in the following form:\n\nGiven three integers l_i, r_i and d_i, find minim(...TRUNCATED)	{ "input": [ "TSTTSS", "SSTTST", "TSSTTTSS" ], "output": [ "4", "0", "4" ] }	{"input":["8\n0 1\n1 0\n0 1\n1 1\n0 1\n1 0\n0 1\n1 0\n","8\n1 0\n1 0\n1 0\n0 1\n0 1\n1 1\n1 1\n0 1\n(...TRUNCATED)	{"input":["1\n297754\n","16\n2 2 2 3 5 3 5 5 5 7 7 7 11 11 13 17\n","16\n2 2 2 2 2 3 3 5 5 5 5 7 7 1(...TRUNCATED)	2	10	{"language":[2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,1,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,3,2,2,4,2,3,3,4,2,2,3,2,2,4,2,2,4,3,2,3,4,3,4,2,2,2,3,3,2,4,2,3,2,3,4,4,3,4,4,4,4,3,2(...TRUNCATED)	1,219	E	500	0	[ "" ]	false	{ "nanos": 0, "seconds": 8 }	134,217,728
nopc10	"You happened to get a special bicycle. You can run with it incredibly fast because it has a turbo e(...TRUNCATED)	{ "input": [ "6 1 2 3 4 5", "6 200 2 3 4 5" ], "output": [ "1", "1" ] }	{"input":["5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\(...TRUNCATED)	{"input":["384\n87 78 16 94 36 87 93 50 22 63 28 91 60 64 27 41 27 73 37 12 69 68 30 83 31 63 24 68 (...TRUNCATED)	1	10	{"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,0,2,2,2,2,2,1,2,2,2,2,2,2,2,1,2,2,2,2,0,2,0,0,2,0,0,0,4,1,2,2,0,2,0,0,2,2,2,0,2,2,2,2(...TRUNCATED)	1,107	C	500	1,400	[ "" ]	true	{ "nanos": 0, "seconds": 1 }	0