Datasets:

TheFactoryX
/

edition_0734_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
p02834 AtCoder Beginner Contest 148 - Playing Tag on Tree	"In the Land of Fire there are n villages and n-1 bidirectional road, and there is a path between an(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	{"input":["2\n17 25\n4\n17 45\n4\n17 25\n7\n1 35\n0","2\n19 25\n4\n17 37\n4\n17 47\n7\n0 63\n0","2\n(...TRUNCATED)	1	10	{"language":[2,4,4,2,2,2,4,2,3,2,2,2,4,3,2,4,3,1,1,2,3,4,2,2,4,2,3,3,1,4,4,3,1,3,1,2,2,2,1,4,4,4,3,3(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,4,2,2,2,1,2,2,4,2,2,2,2,4,4,4,2,2,2,3,2,4,2(...TRUNCATED)	1,170	C	0	0	[ "dp", "math" ]	false	{ "nanos": 0, "seconds": 8 }	256,000,000
954_F. Runner's Problem	"As usual, Sereja has array a, its elements are integers: a[1], a[2], ..., a[n]. Let's introduce not(...TRUNCATED)	{"input":["2 2 1\n2 3 1\n3 2 3\n2 3 5"],"output":["3.9681187851\n6.7970540913\n6.5668891783\n13.9527(...TRUNCATED)	{"input":["5 9 4\n4 1 46\n1 3 29\n3 2 58\n1 5 61\n2 4 88\n1 2 87\n4 5 58\n3 5 69\n3 4 28\n2 7\n5 7\n(...TRUNCATED)	{"input":["4\n3\n1 4 2\n1 3 1\n2\n2 4\n2 3\n2\n1 1100000000\n1 1000000000\n4\n3 10 5 8\n2 5 2 4\n","(...TRUNCATED)	2	13	{"language":[3,2,3,3,4,2,3,3,3,3,3,3,3,4,2,3,2,2,3,3,3,3,3,3,2,3,3,3,1,2,3,4,3,3,2,3,2,4,2,4,4,3,3,4(...TRUNCATED)	{"language":[4,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,4,2,2,2,2,2(...TRUNCATED)	0		1,000	1,700	[ "binary search", "brute force", "chinese remainder theorem", "math", "number theory" ]	true	{ "nanos": 0, "seconds": 1 }	256,000,000
the-strongest-string-1-1	"Some time ago Mister B detected a strange signal from the space, which he started to study.\n\nAfte(...TRUNCATED)	{ "input": [ "5 3 2\naaaaa\naaa\naab" ], "output": [ "1 6" ] }	{ "input": [], "output": [] }	{"input":["1\n2 3 Chandu\n\nSBMPLE","1\n2 4 Chandu\n\nELPMBT","51\n8 10 Chandu\n2 2959 Daspal\n2903 (...TRUNCATED)	2	0	{ "language": [], "solution": [] }	{ "language": [], "solution": [] }	1,439	D	2,000	2,500	[ "brute force", "greedy" ]	false	{ "nanos": 0, "seconds": 2 }	268,435,456
20_B. Equation	"Ramesh and Suresh were in the same class and got home work from their mathematics teacher. The Home(...TRUNCATED)	{ "input": [ "3\n3 4 2\n4 5 0\n325 265 1231232\n" ], "output": [ "7\n4\n76\n" ] }	{ "input": [], "output": [] }	{"input":["2\n2 2\nyz\n1 1\n2 2\nzy\n1 1\n","1\n11 2\nthisisatest\n3 7\n","3\n4 2\nabca\n1 3\n10 5\n(...TRUNCATED)	2	9	{"language":[4,2,3,3,4,4,4,2,2,2,2,3,4,3,2,4,3,4,4,2,4,4,3,2,4,3,4,3,4,4,3,3,2,4,2,4,2,4,4,3,4,4,2,2(...TRUNCATED)	{"language":[2,4,4,3,2,2,2,2,3,4,4,4,4,2,2,4,3,4,2,3,4,2,2,4,1,2,2,1,2,4,4,3,2,3,2,4,4,2,4,2,1,4,1,2(...TRUNCATED)	354	C	750	2,100	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	134,217,728
stadium	"Hackers! Hackers! Everywhere!\nSome days back your email ID was hacked. Some one read the personal (...TRUNCATED)	{"input":["4 4\n1 2\n3 2\n3 4\n1 3","15 28\n10 7\n5 9\n2 13\n2 14\n6 1\n5 12\n2 10\n3 9\n10 15\n11 1(...TRUNCATED)	{"input":["5\n1000000000000000000 352839520853234088 175235832528365792 753467583475385837 895062156(...TRUNCATED)	{"input":["4\naaa\nabc\nabdbca\nabca","4\naaa\nabc\nabdbc`\naaca","4\naab\nacc\n`bd`cb\naaad","4\nba(...TRUNCATED)	2	7	{"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": [], "solution": [] }	0		2,000	0	[ "data structures", "greedy" ]	false	{ "nanos": 0, "seconds": 10 }	256,000,000
magic-gcd	"problem\n\nYou are looking for a constellation in a picture of the starry sky. The photo always con(...TRUNCATED)	{"input":["4\nlu ru ld rd\n4\nlu ld lu ru\n1\nlu\n10\nru lu ld rd ru rd ru lu rd ld\n0"],"output":["(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1\n0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0\n7\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n1 0 0 0 0 0 1 0 0(...TRUNCATED)	2	12	{"language":[2,2,2,2],"solution":["#include <iostream>\n#include <iomanip>\n#include <complex>\n#inc(...TRUNCATED)	{ "language": [], "solution": [] }	0	C	0	0	[ "brute force", "dp", "math", "number theory" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
980_E. The Number Games	"You are given a positive integer m and two integer sequence: a=[a_1, a_2, …, a_n] and b=[b_1, b_2(...TRUNCATED)	{ "input": [ "5\n1 4 3 5 2", "9\n1 2 4 9 5 8 7 3 6", "2\n1 2", "2\n2 1" ], "output": [ "2", "3", "1", "0" ] }	{ "input": [], "output": [] }	{"input":["7\n5\n-1 10 -1 12 -1\n5\n-1 40 35 -1 35\n6\n-1 -1 9 -1 3 -1\n2\n-1 -1\n2\n0 -1\n4\n1 -1 3(...TRUNCATED)	2	0	{"language":[2,4,2,2,2,2,2,2,2,2,2,2,2,2,1,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,4(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,4,3,2,2,2,2,2,4,2,2,3,2,2,2,2,3,2,2,4,2,2,2,2,2,2,2,2,3,2,2,2(...TRUNCATED)	0		500	2,000	[]	false	{ "nanos": 0, "seconds": 2 }	1,073,741,824
1269_B. Modulo Equality	"Everybody knows that Balázs has the fanciest fence in the whole town. It's built up from N fancy s(...TRUNCATED)	{ "input": [ "73", "1" ], "output": [ "458.67252742410977361942", "6.28318530717958623200" ] }	{ "input": [], "output": [] }	{"input":["20 101 100\n1 14 20 3 19 10 12 18 4 17 13 6 8 5 2 15 7 16 9 11\n69 53 101 100 41 38 63 84(...TRUNCATED)	2	8	{"language":[3,3,3,3,3,3,3,1,1,3,3,4,3,3,3,2,1,2,3,3,3,2,3,3,3,3,4,3,2,3,3,3,3,3,3,4,3,3,3,2,3,3,3,3(...TRUNCATED)	{"language":[4,2,2,2,1,2,1,3,2,4,3,4,2,4,2,2,2,2,4,3,4,4,4,2,2,4,1,4,4,4,2,4,2,4,2,2,2,2,3,1,2,2,2,4(...TRUNCATED)	793	A	500	0	[ "dp", "matrices", "sortings" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
donuts	"Print the K-th element of the following sequence of length 32:\n\n\n1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1(...TRUNCATED)	{"input":["3\n1 1 101\n1 2 1\n3 2 1\n","5\n1 1 2 2 3\n2 2 4 3 3\n3 3 1 1 1\n"],"output":["5\n","5\n"(...TRUNCATED)	{"input":["5\n10 50\n10 50\n10 50\n10 50\n10 50\n","2\n10000 10000\n10000 10000\n","3\n10000 10000\n(...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)	1	8	{"language":[2,2,2,2,2,4,4,4,2,2,2,2,4,2,2,2,2,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,2(...TRUNCATED)	{ "language": [], "solution": [] }	851	A	0	1,700	[ "" ]	false	null	268,435,456
subtraction-game-theory-1	"In the rush of modern life, people often forget how beautiful the world is. The time to enjoy those(...TRUNCATED)	{ "input": [ "2\naazz\n", "3\nabcabcabz\n" ], "output": [ "azaz", "-1\n" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	11	{"language":[3,2,4,2,3,2,2,2,2,4,4,4,3,3,4,3,3,3,4,3,3,4,2,2,3,3,2,2,4,3,3,2,2,2,3,2,4,3,2,2,3,4,4,2(...TRUNCATED)	{"language":[4,3,3,4,4,4,2,2,4,4,4,2,4,2,2,2,2,2,1,2,4,2,2,2,2,2,3,4,2,4,2,2,2,4,4,2,2,4,1,4,2,2,2,2(...TRUNCATED)	1,239		2,500	0	[]	false	{ "nanos": 0, "seconds": 2 }	134,217,728