Datasets:

TheFactoryX
/

edition_2868_deepmind-code_contests-readymade

name large_stringlengths 4 70	description large_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 large_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 large_stringclasses 36 values	time_limit dict	memory_limit_bytes int64 0 1.07B
1176_F. Destroy it!	"Now that Chef has finished baking and frosting his cupcakes, it's time to package them. Chef has N (...TRUNCATED)	{ "input": [ "5\n5\n3\n2\n1\n4\n6\n1\n2\n3\n4\n5\n6\n3\n3\n2\n1\n0" ], "output": [ "7\n0\n3" ] }	{"input":["3 1\n1 2 5\n","1 1\n100000\n","5 1\n2 2 4 6 1\n","3 10\n5 5 10\n","1 1\n1\n","3 4\n1 2 5\(...TRUNCATED)	{"input":["80\n72 66 82 46 44 22 63 92 71 65 5 30 45 84 29 73 9 90 25 19 26 15 12 40 33 19 85 92 91 (...TRUNCATED)	2	10	{"language":[1],"solution":["t = int(raw_input())\nfor _ in range(t):\n n, m, k = map(int, raw_in(...TRUNCATED)	{"language":[2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,4,4,1,1,2,4,2,1,2,4,2,2,2,4,2,4,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	B	0	0	[ "*special" ]	false	"E: マークアップ言語は衰退しました\n\nわたしたち人類がゆるやかな衰退(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	268,435,456
40_B. Repaintings	"Ivan on his birthday was presented with array of non-negative integers a_1, a_2, …, a_n. He immed(...TRUNCATED)	{"input":["1 5 3\n1 3\n1 1\n1 5\n","2 2 3\n1 2\n2 2\n2 1\n","4 3 6\n1 2\n1 3\n2 2\n2 3\n3 1\n3 3\n"](...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3 313 856 964 421\n","3 3 1 11 9\n","2 2 9 8 1\n","61 538 623 89 548\n","7 202 512 995 37(...TRUNCATED)	6	11	{"language":[2,2,2,2,2,2,2,2,4,4,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,2,2,2,2,2,4,3,2(...TRUNCATED)	{ "language": [], "solution": [] }	0		1,000	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	0
662_C. Binary Table	"You are given a tree (a graph with n vertices and n - 1 edges in which it's possible to reach any v(...TRUNCATED)	{ "input": [ "5\n3\n1\n2\n3\n4\n5\n\nSAMPLE" ], "output": [ "2\n" ] }	{ "input": [], "output": [] }	{"input":["1\n656 281\n","1\n666 760\n","2\n10 4\n1 5\n","1\n33993 6\n","1\n1656 9\n","1\n1425 1777\(...TRUNCATED)	2	9	{"language":[4,2,2,2,2,3,4,2,4,3,2,4,1,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,3,4,2,2,2,2,2,2,2,2,2,2,4,2,4(...TRUNCATED)	{"language":[2,2,4,4,4,4,2,2,2,2,2,2,2,3,2,4,3,3,2,2,2,2,2,2,2,2,2,4,4,4,2,2,2,2,4,2,2,4,2,2,2,2,2,2(...TRUNCATED)	0	A	0	2,300	[ "" ]	false		null	256,000,000
1439_C. Greedy Shopping	"You are given an array a_1, a_2, …, a_n of integers. This array is non-increasing.\n\nLet's consi(...TRUNCATED)	{ "input": [ "2\n2\n3\n\n\nSAMPLE" ], "output": [ "2\n4\n" ] }	{"input":["2+2+1+1+3\n","3+1\n","1+3\n","2+2+1+1+1+3+1+1+3+3+2+3+1+3+1+1+3+1+1+2+2+2+2+1+2+1+2+1+1+1(...TRUNCATED)	{"input":["aabbaaaa\nbaaaaaab\n","cba\ncba\n","xnahfslefuigq\naaaaaaaaaaaaa\n","abcddd\ndddcab\n","a(...TRUNCATED)	6	9	{"language":[3,2,3,4,3,2,3,3,3,2,3,2,2,2,3,3,4,3,3,2,4,3,2,3,3,2,2,3,3,2,4,3,4,2,4,2,4,2,2,2,3,4,2,2(...TRUNCATED)	{"language":[2,3,4,3,0,2,2,4,2,0,3,0,3,0,3,3,2,0,2,2,2,2,2,0,0,3,2,2,2,2,2,2,3,2,3,2,4,2,2,3,0,2,2,3(...TRUNCATED)	1,269	D	0	1,600	[ "data structures", "greedy", "implementation" ]	false		null	1,073,741,824
p02157 Shuffle 2	"Taro is going to play a card game. However, now he has only n cards, even though there should be 52(...TRUNCATED)	{ "input": [ "2\n2 999995\n", "3\n2 3 9\n" ], "output": [ "5\n", "8\n" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	0	{"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":[2,2,4,2,2,2,2,3,3,2,3,3,4,2,2,3,2,3,2,2,2,2,2,2,2,3,2,4,2,4,1,2,4,3,2,4,4,2,2,3,4,2,2,2(...TRUNCATED)	0		2,500	1,300	[ "math", "number theory", "sortings" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
monks-choice-of-numbers-1	"Roma found a new character in the game \"World of Darkraft - 2\". In this game the character fights(...TRUNCATED)	{"input":["3 5 10\nred\n0 0 0\n5 0 0\ngreen\n0 5 5\n5 6 1\nblue\n0 40 5\n5 0 0\n3 10 5\natom\n0 47 3(...TRUNCATED)	{"input":["5 3\n","1500 2000\n","500 1000\n","1000 1000\n","5 5\n","2000 2\n","1000 500\n","3 1000\n(...TRUNCATED)	{"input":["5 10\n2 1 2 2 2\n2\n2 4\n4 5\n","5 10\n2 1 2 2 1\n2\n2 4\n4 5\n","5 10\n3 1 4 2 1\n2\n2 4(...TRUNCATED)	3	8	{"language":[2,2,2,2,2,3,2,4,2,2,4,2,3,2,2,2,2,2,2,2,4,4,2,2,2,2,4,2,4,2,2,2,2,3,4,2,2,2,2,4,1,2,2,4(...TRUNCATED)	{"language":[2,2,2,3,3,4,2,3,3,3,2,3,3,2,3,3,0,2,3,2,2,2,0,2,3,2,0,2,2,0,2,2,2,3,3,2,3,2,2,2,3,3,0,2(...TRUNCATED)	1,421	E	0	2,500	[ "" ]	false		null	256,000,000
1466_F. Euclid's nightmare	"Long long ago, there was a thief. Looking for treasures, he was running about all over the world. O(...TRUNCATED)	{ "input": [ "2\nSHILPA\nAAMIR\nMATT\nDENISE" ], "output": [ "ENEMIES\nLOVE" ] }	{"input":["10000 10 100\n2339 4118 4595 5499 5582 6055 8693 9002 9190 9658\n10 75 82 5 14 55 64 68 4(...TRUNCATED)	{"input":["0 1681261333\n","10 4\n","16384 40642166\n","727373493 403495785\n","62914844 907959152\n(...TRUNCATED)	3	0	{"language":[4,3,4,3,3,4,3,4,2,4,4,3,1,2,4,3,4,4,2,3,3,3,2,4,4,4,4,3,3,3,2,2,4,4,1,3,4,4,2,2,3,3,2,3(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,0,4,2,2,2,4,2,2,2,2,2,2,3,2,2,3,3,2,2,2,2,2,3,0,2,2,0,2,2,0,0,2,3,2,3,3,2(...TRUNCATED)	331	B	0	0	[ "dfs and similar", "dp", "games", "graphs" ]	false		null	268,435,456
70_C. Lucky Tickets	"Pavel loves grid mazes. A grid maze is an n × m rectangle maze where each cell is either empty, or(...TRUNCATED)	{ "input": [ "4\n", "583291\n" ], "output": [ "16\n", "135712853\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":["5\n1 4 4 5 2","9\n1 2 4 9 5 8 7 6 6","9\n1 2 4 9 5 8 4 6 6","5\n0 4 4 5 1","2\n1 0","2\n1(...TRUNCATED)	2	0	{"language":[4,4,2,4,4,4,2,4,2,4,2,3,3,3,2,2,2,2,4,3,2,2,2,4,4,2,3,2,4,4,2,2,4,3,3,4,1,2,4,4,4,4,4,3(...TRUNCATED)	{"language":[2,4,2,2,2,4,2,1,4,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,4,2,2,2(...TRUNCATED)	242	A	2,000	0	[ "number theory" ]	false		null	268,435,456
789_A. Anastasia and pebbles	Example Input ACM Output 0	{ "input": [ "1\n2 3 Chandu\n\nSAMPLE" ], "output": [ "Daspal\n" ] }	{"input":["1\n656 656\n","1\n666 666\n","2\n7 4\n1 5\n","1\n33993 5\n","1\n1656 5\n","1\n1319 1777\n(...TRUNCATED)	{"input":["2\n3 6\n10 11","2\n1 3\n10 11","2\n0 6\n10 11","2\n0 6\n0 11","2\n3 6\n8 22","2\n3 6\n8 4(...TRUNCATED)	2	10	{"language":[2,2,4,2,2,2,3,4,2,2,2,4,2,4,2,3,2,2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,3,2,3(...TRUNCATED)	{"language":[2,2,4,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,2,2(...TRUNCATED)	776	D	0	1,400	[]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
tech07	"There are five people playing a game called \"Generosity\". Each person gives some non-zero number (...TRUNCATED)	{ "input": [ "4\n4 4\n1000000000 0\n7 15\n8 7\n" ], "output": [ "2\n0\n7\n5\n" ] }	{"input":["66\n","652615\n","482331\n","336161\n","33\n","1000000\n","79531\n","768208\n","3\n","885(...TRUNCATED)	{"input":["3\n((()))\n(())()\n()())","3\n((()()\n(())()\n()(()","3\n((()))\n(())))\n()())","3\n)))(((...TRUNCATED)	3	12	{"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": [], "solution": [] }	0	E	1,250	0	[ "" ]	false	"Background\n\n会津大学付属幼稚園はプログラミングが大好きな子供が集まる(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	256,000,000