Datasets:

TheFactoryX
/

edition_2181_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
996_F. Game	"New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has n (...TRUNCATED)	{"input":["1000 999\n10 20 30 40\n","7 11\n2 4 7 3\n"],"output":["-1","2 7 1 5 6 3 4 \n7 2 1 5 6 4 3(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["15\nxxtxttxxttxtxxt\n","3\nymw\n","127\nxixtxixnxixtxixlxixtxixnxixtxixoxixtxixnxhxtxixlx(...TRUNCATED)	2	0	{"language":[3,3,4,3,2,2,3,4,3,3,3,3,3,2,2,3,2,4,3,3,4,3,3,3,2,3,3,2,3,3,4,4,3,3,3,4,3,4,2,4,3,3,3,3(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,4,4,2,2,4,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,4,2,4,2,2,2,2(...TRUNCATED)	464	A	1,000	2,000	[ "data structures", "graphs" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
582_A. GCD Table	"You are given three sequences: a_1, a_2, …, a_n; b_1, b_2, …, b_n; c_1, c_2, …, c_n.\n\nFor e(...TRUNCATED)	{"input":["7 3\nabacaba\n1 1 1\n1 0 0\n1 0 0\n","7 3\nabacaba\n0 1 1\n1 0 0\n1 0 0\n","7 4\nbacadab\(...TRUNCATED)	{"input":["1000\n999001\n999002\n999003\n999004\n999005\n999006\n999007\n999008\n999009\n999010\n999(...TRUNCATED)	{"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)	2	8	{ "language": [], "solution": [] }	{"language":[3,2,2,2,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,012		500	0	[ "dfs and similar", "interactive", "trees" ]	false		{ "nanos": 0, "seconds": 2 }	0
lexicographically-preceding-permutation	"Kevin Sun has just finished competing in Codeforces Round #334! The round was 120 minutes long and (...TRUNCATED)	{ "input": [ "1\n4 2 1\n1 1 2 2\n1 1\n1 1\n1 1\n3 1\n0 1\n0 1\n1 0\n1 0" ], "output": [ "5" ] }	{"input":["541\n54 98 68 63 83 94 55 35 12 63 30 17 97 62 96 26 63 76 91 19 52 42 55 95 8 97 6 18 96(...TRUNCATED)	{"input":["72\n111101100111001110000000100010100000111011100110001010111010101011111100\n","3\n001\n(...TRUNCATED)	2	10	{"language":[2],"solution":["#include <bits/stdc++.h>\n#define INF 1000000007\nusing namespace std;\(...TRUNCATED)	{ "language": [], "solution": [] }	1,264	B	0	1,700	[ "dfs and similar", "dp" ]	false		null	256,000,000
chsparr	"A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang (...TRUNCATED)	{"input":["4 4\n100 100 100 100\n1 2\n2 3\n2 4\n3 4\n","4 3\n10 20 30 40\n1 4\n1 2\n2 3\n","7 10\n40(...TRUNCATED)	{"input":["6\n396640239 62005863 473635171 329666981 510631133 207643327\n","4\n363034183 741262741 (...TRUNCATED)	{"input":["+--+-+\n","+--+--+------+++++++-+-+++--++---+--+-+---+--+++-+++-------+++++-+-++++--+-+-+(...TRUNCATED)	2	0	{"language":[2,4,3,3,3,1,3,4,2,2,3,3,3,3,3,3,3,3,3,3,3,4,3,3,2,3,4,4,3,3,3,4,3,3,4,3,3,4,2,4,3,3,3,3(...TRUNCATED)	{"language":[2,2,3,2,2,2,2,2,4,4,4,2,4,2,4,2,2,3,2,2,2,2,2,2,4,4,2,3,2,2,4,2,2,2,2,2,2,3,2,4,4,2,2,4(...TRUNCATED)	0	C	0	2,400	[ "bitmasks", "combinatorics", "dp" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
228_D. Zigzag	"Recenlty Luba got a credit card and started to use it. Let's consider n consecutive days Luba uses (...TRUNCATED)	{ "input": [ "2\n1\n2" ], "output": [ "2\n5\n" ] }	{"input":["21 3 -3 3 -3 3 -3 19 3 -3 3 -3 3 -3 19 3 -3 3 -3 3 -3 19","2 8 -100\n5 -1000 5 1000 500 2(...TRUNCATED)	{"input":["aabbaaaa\nbaaaaaab\n","cba\ncba\n","xnahfslefuigq\naaaaaaaaaaaaa\n","abcddd\ndddcab\n","a(...TRUNCATED)	2	0	{"language":[4,4,3,4,2,4,3,3,3,3,4,3,2,3,4,3,3,3,3,3,2,4,2,1,2,3,2,4,1,2,2,4,2,3,4,3,4,2,4,2,3,2,3,2(...TRUNCATED)	{"language":[4,3,1,4,1,4,3,2,2,2,4,3,3,2,4,3,2,2,2,2,4,4,2,2,2,4,2,3,4,4,2,3,3,2,3,4,3,3,2,4,2,2,3,4(...TRUNCATED)	0	A	0	0	[]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
789_A. Anastasia and pebbles	"Xenia the beginner mathematician is a third year student at elementary school. She is now learning (...TRUNCATED)	{ "input": [ "5 4\n3 1 8 9 7\n", "3 2\n2 3 4\n" ], "output": [ "5\n", "3\n" ] }	{"input":["72\n111101100111001110000000100010100000011011100110001010111010101011111100\n","3\n101\n(...TRUNCATED)	{"input":["3\n7 7 3 5\n1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 5\n4 5 2 4\n1 2\n2 3\n3 4\n4 1\n4 2\n4 3 2 1\(...TRUNCATED)	2	0	{"language":[4,4,4,4,2,1,3,1,3,4,4,2,3,4,3,4,4,1,3,2,4,2,2,2,3,4,1,2,2,2,2,2,2,4,4,2,4,4,1,4,3,1,2,4(...TRUNCATED)	{"language":[2,2,2,2,4,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,4,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,081	G	2,250	2,200	[ "constructive algorithms", "greedy", "number theory" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1500_B. Two chandeliers	"Strings can be efficiently stored as a data structure, to have efficient searching methods.\nA new (...TRUNCATED)	{"input":["3 3 5\n4 4 0\n1 3\n3 2\n3 1\n","4 5 4\n2 1 0 3\n4 3\n3 2\n1 2\n1 4\n1 3\n"],"output":["1\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1\n1\n3\n2\n","3\n1 1 2\n1 0 3\n1 1 4\n","3\n1 1 101\n1 2 1\n1 2 1\n","8\n148933105 19040(...TRUNCATED)	2	7	{"language":[1,1,1,1],"solution":["'''\n# Read input from stdin and provide input before running cod(...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)	937		1,750	2,400	[ "constructive algorithms", "math" ]	false		null	256,000,000
comm3	"Piet is one of the most known visual esoteric programming languages. The programs in Piet are const(...TRUNCATED)	{ "input": [ "10\n1 2 3 4 5\n", "6\n1 2 6\n" ], "output": [ "10\n", "2\n" ] }	{ "input": [], "output": [] }	{"input":["16\nFFC0\nFFC0\nFFC0\nFFC0\nFFC0\nFFD0\nFFC0\nFFC0\nFFC0\nFFC0\nFFC0\nFFC0\nFFC0\nFFC0\nF(...TRUNCATED)	2	12	{"language":[2,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,4,0,2,2,0,2,2,2,2,2,2,2,2,2,2,2,4,2,0,2,2,2,4,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,4(...TRUNCATED)	571		0	2,200	[ "brute force", "greedy", "implementation" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1374_B. Multiply by 2, divide by 6	"Let us consider sets of positive integers less than or equal to n. Note that all elements of a set (...TRUNCATED)	{ "input": [ "3\n25\n46\n99" ], "output": [ "2\n1\n2\n" ] }	{ "input": [], "output": [] }	{"input":["4\n6\na b c d\nA\nThomas a\nd d\ned edgars\nal Adams\n1\nTurnipHeadJohnson\n3\na a a a a (...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":[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)	0		0	0	[]	false	"Problem\n\nKND君は会津大学に在籍する学生プログラマである。彼の胸元はと(...TRUNCATED)	{ "nanos": 0, "seconds": 1 }	256,000,000
609_B. The Best Gift	"Maga and Alex are good at string manipulation problems. Just now they have faced a problem related (...TRUNCATED)	{ "input": [ "3\n2 3 4\n2 1\n1\n-1\n" ], "output": [ "56\n" ] }	{"input":["51\n882889888888689888850888388887688788888888888858888\n","55\n7271714707719515303911625(...TRUNCATED)	{"input":["10000\n5000 3150\n5000 5000\n0 0\n5000 1050\n5000 3980\n5000 210\n5000 5000\n5000 5000\n0(...TRUNCATED)	2	9	{"language":[2,2,2,3,2,2,4,2,2,3,2,2,2,2,2,2,3,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,3,2,2,2,2(...TRUNCATED)	{"language":[4,2,2,2,2,1,4,2,3,3,4,1,4,1,2,2,2,2,2,2,3,2,1,3,3,2,2,1,2,2,4,3,1,4,1,1,3,4,4,3,2,3,4,3(...TRUNCATED)	101	A	0	0	[ "implementation", "strings" ]	false		{ "nanos": 0, "seconds": 2 }	268,435,456