Datasets:

TheFactoryX
/

edition_0926_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
lexicographically-preceding-permutation	"There are N stations in the city where JOI lives, and they are numbered 1, 2, ..., and N, respectiv(...TRUNCATED)	{"input":["2\n4 INDIAN\nCONTEST_WON 1\nTOP_CONTRIBUTOR\nBUG_FOUND 100\nCONTEST_HOSTED\n4 NON_INDIAN\(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	9	{"language":[3,3,3,3,3,2,3,3,3,3,3,4,4,4,3,2,3,3,3,2,3,2,2,3,2,4,2,3,3,3,4,2,2,3,2,2,2,3,3,3,3,2,2,2(...TRUNCATED)	{"language":[2,2,2,4,2,2,2,2,3,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)	760	C	1,000	0	[]	false		{ "nanos": 500000000, "seconds": 0 }	0
1227_D1. Optimal Subsequences (Easy Version)	"In computer science, there is a method called \"Divide And Conquer By Node\" to solve some hard pro(...TRUNCATED)	{ "input": [ "3\n5\n3 5 2 1 4\n1\n1\n4\n4 3 1 2\n" ], "output": [ "\n1 0 2 3 1 \n0 \n0 1 3 2 \n" ] }	{ "input": [ "60 0 58", "7 3 7" ], "output": [ "630738177", "195634923" ] }	{"input":["1 1\n-1\n","5 1\n-3 -2 -1 0 0\n","7 1\n-7 ? ? ? ? ? 2\n","3 2\n-5 ? 0\n","7 4\n-10 0 ? 1 (...TRUNCATED)	2	0	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,4,2,2,2,2,4,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[3,2,2,2,2,3,2,3,3,4,3,4,2,4,2,3,4,2,4,2,4,2,2,2,2,3,4,2,2,2,3,3,4,3,3,4,2,2,3,1,2,2,2,4(...TRUNCATED)	1,512		0	2,000	[ "brute force", "implementation" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
p03254 AtCoder Grand Contest 027 - Candy Distribution Again	"PCK, which recycles Aizu's precious metal, Aizunium, has a network all over the country and collect(...TRUNCATED)	{ "input": [ "2\n2 6\n10 11" ], "output": [ "2\n1\n" ] }	{ "input": [], "output": [] }	{"input":["+dab\n+abac\n-abac\n+baca\n","+Dmitry\n+Mike\nDmitry:All letters will be used\nDmitry:qwe(...TRUNCATED)	5	0	{"language":[3,2,4,3,2,4,2,3,4,3,3,4,2,2,3,3,2,2,3,2,3,2,3,4,2,2,2,2,2,2,3,3,2,2,2,2,2,3,2,3,2,2,2,2(...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)	0	D	500	0	[ "dfs and similar", "dsu", "graphs" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
1281_B. Azamon Web Services	"An elementary school student Takahashi has come to a variety store.\n\nHe has two coins, A-yen and (...TRUNCATED)	{"input":["4 5 3\n1 2 3\n1 2 5\n4 2 1\n2 3 2\n1 4 4\n1 3 3\n","2 3 2\n2 1\n1 2 3\n1 2 2\n2 2 1\n"],"(...TRUNCATED)	{"input":["+-+--+-+\n","+-+--+\n","+-+++-\n","+++-\n","-++-+--++--+-++-\n","-+++--\n","-+--+-\n","+-(...TRUNCATED)	{"input":["10 9\n2 5\n2 4\n2 7\n2 9\n2 3\n2 8\n2 6\n4 10\n2 1\n","10 10\n6 4\n9 2\n3 6\n6 7\n4 2\n9 (...TRUNCATED)	6	7	{"language":[4,2,1,3,3,3,2,3,3,3,3,3,2,4,4,3,3,4,4,2,4,3,1,4,2,3,3,3,3,4,4,2,3,4,2,3,2,1,3,2,3,4,4,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,3,2,1,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,386	B	500	0	[ "" ]	true		{ "nanos": 0, "seconds": 2 }	268,435,456
990_E. Post Lamps	"You've got an array a, consisting of n integers. The array elements are indexed from 1 to n. Let's (...TRUNCATED)	{"input":["22\n0011223344556677889988\n","11\n00000000008\n","11\n31415926535\n"],"output":["2\n","1(...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":["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	11	{"language":[2,2,4,2,2,3,4,2,2,2,1,2,4,2,2,4,4,2,2,2,4,4,2,2,4,2,2,2,4,2,4,2,2,2,2,2,1,4,2,2,4,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,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,2,2,4,0,2,3,2,3,2(...TRUNCATED)	405	A	500	0	[]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
1081_D. Maximum Distance	"In the rush of modern life, people often forget how beautiful the world is. The time to enjoy those(...TRUNCATED)	{ "input": [ "5 10\n2 1 2 1 2\n2\n2 4\n4 5\n" ], "output": [ "3\n3\n" ] }	{ "input": [], "output": [] }	{"input":["4","6","3","7","5","8","4","3","5","6","8","7"],"output":["aaaa\naaab\naaba\naabb\naabc\n(...TRUNCATED)	2	10	{"language":[4,3,3,3,3,3,3,3,3,2,3,3,4,3,3,3,4,4,3,3,4,3,3,3,3,3,3,3,4,2,3,1,3,3,3,3,3,3,3,3,3,3,4,3(...TRUNCATED)	{"language":[2,2,2,4,2,2,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,2,2,2,2,2,4,2,2,2,2,2(...TRUNCATED)	178	D	0	3,200	[]	false		{ "nanos": 0, "seconds": 2 }	268,435,456
rams-love-for-sita-2	"Kolya has a turtle and a field of size 2 × n. The field rows are numbered from 1 to 2 from top to (...TRUNCATED)	{ "input": [ "4 1 2 3 4\n", "5 5 46 372 81 9\n" ], "output": [ "5 3 5 7 ", "14 51 418 453 90 " ] }	{ "input": [], "output": [] }	{"input":["5 5 2\ns..#a\n.#...\ne#a.#\n...#a\n.#...","5 5 2\ns..#a\n.#../\n#.a#e\n...#a\n.#...","5 5(...TRUNCATED)	2	0	{"language":[2,3,2,4,3,3,3,1,3,2,3,3,3,3,2,3,3,3,3,2,2,3,3,1,4,3,3,2,3,2,2,3,3,3,3,3,4,4,3,3,4,3,2,3(...TRUNCATED)	{"language":[4,2,2,2,2,2,4,2,2,4,2,2,4,2,4,2,2,2,2,4,2,2,4,2,4,2,4,4,4,3,4,2,2,2,2,2,2,2,3,2,2,2,2,1(...TRUNCATED)	0	D	0	2,500	[ "binary search", "brute force", "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
donuts	"Two students of AtCoder Kindergarten are fighting over candy packs.\n\nThere are three candy packs,(...TRUNCATED)	{ "input": [ "1\n5 3\n200 6 9" ], "output": [ "120" ] }	{ "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)	2	0	{"language":[2,4,4,4,2,2,2,4,3,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,4,2,2,2,2,2,2,2,3,2,2,2,2,2,2,3,2(...TRUNCATED)	{"language":[2,2,3,2,0,3,0,3,2,0,3,4,3,4,3,3,0,2,3,2,2,2,2,2,3,4,3,2,3,0,3,2,2,0,2,3,3,3,2,3,4,3,0,3(...TRUNCATED)	0		1,000	800	[]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
470_C. Eval	"Linda likes to change her hair color from time to time, and would be pleased if her boyfriend Archi(...TRUNCATED)	{ "input": [ "0", "0011", "11011010001011" ], "output": [ "0", "4", "12" ] }	{ "input": [], "output": [] }	{"input":["1 5000 2732\n","2 2 0\n","83 4122 123\n","19 862 387\n","100 843 30\n","45 1296 245\n","9(...TRUNCATED)	1	0	{"language":[4,2,2,2,2,2,2,2,2,4,4,2,2,4,4,2,2,2,4,2,2,4,2,4,2,2,2,2,3,2,2,2,2,2,2,2,2,4,2,2,4,4,2,2(...TRUNCATED)	{"language":[4,2,2,2,2,2,2,2,2,1,2,2,2,1,3,2,2,2,1,2,2,3,2,3,2,2,2,2,2,2,2,2,2,2,3,2,2,4,4,3,2,2,3,2(...TRUNCATED)	571	D	0	0	[ "math", "number theory" ]	false		null	134,217,728
p00365 Age Difference	"Petya and Vasya arranged a game. The game runs by the following rules. Players have a directed grap(...TRUNCATED)	{ "input": [ "5\n2 4 2\n5 10 4\n3 10 1\n1 2 3\n4 6 5\n" ], "output": [ "6\n4\n1\n3\n10\n" ] }	{"input":["1\n2\n3\n2\n","8\n190409007 190409007 352375776 190409007 352375776 352375776 352375776 3(...TRUNCATED)	{ "input": [], "output": [] }	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,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(...TRUNCATED)	1,250	E	2,000	0	[ "brute force", "data structures", "dp", "greedy", "implementation", "math", "strings" ]	false	"D：素因数分解の多様性 (The Diversity of Prime Factorization)\n\nProblem\n\nEbi-chan has (...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	256,000,000