Datasets:

TheFactoryX
/

edition_0539_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
720_C. Homework	"Short Phrase\n\nA Short Phrase (aka. Tanku) is a fixed verse, inspired by Japanese poetry Tanka and(...TRUNCATED)	{"input":["5\n7\n1\n9\n7\n3\n","10\n100\n1\n100\n1\n100\n1\n100\n1\n100\n1\n"],"output":["1 3 7 7 9 (...TRUNCATED)	{"input":["5\n3\n1 1\n1 1\n1 1\n3\n1 1\n1 1\n1 1\n3\n1 1\n1 1\n1 1\n3\n1 1\n1 1\n1 1\n3\n1 100\n1 1\(...TRUNCATED)	{"input":["15 6\n1 6 6 5 2 10 4 4 14 8 7 3 5 1 2\n","65 7\n1 5 4 1 4 11 9 1 11 7 6 11 9 4 2 6 10 11 (...TRUNCATED)	3	7	{"language":[4,3,1,2,2,3,2,3,3,3,3,3,3,3,3,3,3,3,3,2,3,1,2,1,3,3,2,3,4,3,4,4,2,4,2,3,3,3,3,3,3,2,2,3(...TRUNCATED)	{ "language": [], "solution": [] }	716	D	750	0	[ "" ]	false	{ "nanos": 0, "seconds": 8 }	256,000,000
1475_D. Cleaning the Phone	"You are given a binary matrix A of size n × n. Let's denote an x-compression of the given matrix a(...TRUNCATED)	{"input":["1500 2000 1600 3 2","1500 2000 500 90000 100000","1500 2000 1900 3 2"],"output":["7900","(...TRUNCATED)	{ "input": [ "3\n1234567\n1268501\n1268499\n" ], "output": [ "788765312\n999997375\n999999350\n" ] }	{ "input": [], "output": [] }	2	11	{"language":[4,4,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	830	D	0	2,000	[ "geometry", "math" ]	false	{ "nanos": 0, "seconds": 5 }	256,000,000
insect-colony-2	"Some days ago, I learned the concept of LCM (least common multiple). I've played with it for severa(...TRUNCATED)	{"input":["4 5\n1 2 3 1\n2 1 2 8\n2 3 4 7\n1 1 3 3\n2 3 4 8\n","4 5\n1 2 3 1\n2 1 2 8\n2 3 4 7\n1 1 (...TRUNCATED)	{"input":["1 1 10\n10\n10\n","2 2 10\n9 11\n11 8\n","1 1 1000000000\n1000000000\n1\n","1 1 50\n1\n10(...TRUNCATED)	{"input":["5\n78188 56310 33094 70050 65217\n115040 5149 128449 98357 36580\n1 451393770\n2 57404660(...TRUNCATED)	3	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":[2,2,4,2,4,2,2,4,4,4,4,2,2,2,2,2,2,2,2,2,2,4,4,1,2,2,2,3,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)	0		0	2,900	[ "implementation", "strings" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
max-min	"Monocarp and Polycarp are learning new programming techniques. Now they decided to try pair program(...TRUNCATED)	{ "input": [ "4 2\n", "6 3\n" ], "output": [ "7\n", "8\n" ] }	{"input":["10 20 10 5\n","20 1 2 3\n","7 2 2 2\n","25 10 5 10\n","999 999 899 299\n","10000 5000 0 5(...TRUNCATED)	{"input":["1 100000 100000 110000 -100000\n","46456 -250 -23623 -98302 -99305\n","10 6 3 7 2\n","1 -(...TRUNCATED)	6	2	{"language":[3,2,3,3,3,2,2,2,3,4,4,3,3,3,3,4,3,3,3,4,2,3,2,3,3,3,3,4,3,3,4,3,4,3,3,3,3,3,3,3,2,3,3,3(...TRUNCATED)	{"language":[2,3,2,4,4,1,4,2,3,4,2,2,4,2,2,4,1,2,2,4,3,2,4,2,3,1,4,4,4,2,1,3,1,2,2,4,3,2,2,2,4,1,2,2(...TRUNCATED)	925	D	0	1,600	[ "constructive algorithms", "math", "sortings" ]	false	{ "nanos": 0, "seconds": 8 }	256,000,000
golu-and-coins-1	"Takahashi is locked within a building.\n\nThis building consists of H×W rooms, arranged in H rows (...TRUNCATED)	{ "input": [ "6 5\n1 2 2 4 2 3\n", "7 5\n3 3 2 1 1 1 3\n" ], "output": [ "4\n", "2\n" ] }	{ "input": [], "output": [] }	{"input":["7\nabbab\nabaac\ncodeforces\nzeroorez\nabcdcba\nbbbbbbb\na\n","7\nabbab\nabaac\ncodeforce(...TRUNCATED)	2	10	{ "language": [], "solution": [] }	{ "language": [], "solution": [] }	1,170	F	0	1,400	[ "data structures", "greedy" ]	false	{ "nanos": 0, "seconds": 2 }	512,000,000
1250_B. The Feast and the Bus	"You're trying to set the record on your favorite video game. The game consists of N levels, which m(...TRUNCATED)	{"input":["3 2 998244353\n","9 3 998244353\n","3 1 998244353\n","9 4 998244353\n"],"output":["665496(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	8	{"language":[2,2,2,2,2,4,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,2,2,1,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,3,2,2,4,4,2,2,2,4,2,2,2,2,2,3,2,2,2,4,3,3,3,2,3,3,2,3,4,2,3,2,2,2,2,4,4,3,2,2,3,2,2(...TRUNCATED)	1,012		1,000	900	[ "*special", "data structures", "dsu", "implementation", "math", "sortings" ]	false	{ "nanos": 500000000, "seconds": 2 }	256,000,000
593_C. Beautiful Function	"You are given a string S consisting of letters `b`, `d`, `p` and `q`. Determine whether S is a mirr(...TRUNCATED)	{ "input": [ "5\n1 2\n1 3\n3 4\n2 5" ], "output": [ "1" ] }	{"input":["2 5 1\n0 5 6\n0 2 7\n","1 1 1000000000\n0 0 0\n","2 200 5\n1 1 1\n12 3 15\n","2 10 5\n1 1(...TRUNCATED)	{"input":["2 1 5\n1 1 1 8\n2 2 1 1\n1 2 1 1\n1 2 1 3\n2 2 1 2\n","5 1 5\n1 5 1 3\n1 5 1 2\n2 2 2 5\n(...TRUNCATED)	2	10	{"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":["d(...TRUNCATED)	{ "language": [], "solution": [] }	604		0	2,100	[ "constructive algorithms", "dsu", "math" ]	true	{ "nanos": 500000000, "seconds": 2 }	256,000,000
p01222 Walk under a Scorching Sun	"Disclaimer: there are lots of untranslateable puns in the Russian version of the statement, so ther(...TRUNCATED)	{"input":["5 3\n1 2 3 4 0\n4 1 2 14 3\n","7 3\n1 2 3 4 3 2 6\n6 3 1 4 2 2 3\n","4 4\n0 1 2 3\n0 1 2 (...TRUNCATED)	{"input":["81\n9 4\n6 8\n6 4\n4 6\n4 8\n9 10\n0 2\n5 4\n8 9\n7 7\n10 5\n4 4\n7 8\n3 7\n2 1\n5 5\n2 7(...TRUNCATED)	{ "input": [], "output": [] }	2	0	{"language":[3,2,4,2,2,4,2,2,4,4,2,2,2,2,4,2,2,2,2,2,2,4,4,4,4,2,2,2,2,4,4,2,2,1,2,2,2,4,2,4,2,2,4,2(...TRUNCATED)	{"language":[2,0,2,3,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,0,0,2,2,2,2,2,3,2,2,2,2,2,2,2,3,2,2,2,2,2,2(...TRUNCATED)	1,253	E	500	800	[ "dfs and similar", "dp", "trees" ]	false	null	1,073,741,824
stadium	"Little Chris is participating in a graph cutting contest. He's a pro. The time has come to test his(...TRUNCATED)	{ "input": [ "2\n5 156\n16 40\n\nSAMPLE" ], "output": [ "Case 1: 6\nCase 2: 3\n" ] }	{"input":["brtakoktrosttttttttttosafasfkalsfkodfdasiofhadfhasdsajfdsafoasodsafahaihfdisoadspapsapios(...TRUNCATED)	{ "input": [], "output": [] }	3	0	{"language":[1,1],"solution":["def CheckIfProbablyPrime(x):\n return (2 << x - 2) % x\ndef primes(...TRUNCATED)	{ "language": [], "solution": [] }	252	B	0	2,200	[]	false	{ "nanos": 0, "seconds": 5 }	268,435,456
etmx05	"Bob came to a cash & carry store, put n items into his trolley, and went to the checkout counter to(...TRUNCATED)	{ "input": [ "3\n1 2 3\n", "3\n2 2 2\n", "2\n2 1\n" ], "output": [ "3\n1 2 3 \n1 2 3 ", "1\n1 1 1 \n2 ", "-1" ] }	{ "input": [], "output": [] }	{"input":["2 0\n1 1 0 1\n","2 2\n0 1 2 3\n2 1\n0 4\n","1 0\n2 1\n","2 0\n1 0 0 1\n","2 2\n0 1 2 4\n2(...TRUNCATED)	5	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": [], "solution": [] }	1,184		500	0	[ "number theory" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000