Datasets:

TheFactoryX
/

edition_3102_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	time_limit dict	memory_limit_bytes int64 0 1.07B
157_A. Game Outcome	"Takahashi went to an all-you-can-eat buffet with N kinds of dishes and ate all of them (Dish 1, Dis(...TRUNCATED)	{"input":["6 3\n3 1 2 3 2 3\n","10 1\n1 1 1 1 1 1 1 1 1 1\n","12 4\n1 2 3 1 2 3 4 1 2 1 2 1\n"],"out(...TRUNCATED)	{"input":["85 30 123\n","100000 100000 1320777\n","94728 36278 300352\n","70386 4182 113682\n","6518(...TRUNCATED)	{"input":["5 2","1 972439611840","1 110","1 2","1 534720932937","1 18","1 010","1 3","1 867963093279(...TRUNCATED)	2	10	{"language":[3,1,2,4,2,2,1,4,1,4,2,4,4,4,2,2,2,2,2,3,2,3,4,4,2,4,3,1,3,2,1,4,3,1,3,1,4,3,4,2,3,2,4,4(...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)	188		500	1,200	[]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1250_B. The Feast and the Bus	"We know that lucky digits are digits 4 and 7, however Vasya's got another favorite digit 0 and he a(...TRUNCATED)	{ "input": [ "2\n5\n2 3 5 1 2\n3\n1 2 3" ], "output": [ "3\n3" ] }	{"input":["20\nadd 17\nadd 18\nadd 19\nsum\nadd 20\nadd 21\nadd 22\nsum\nadd 23\nadd 24\nadd 25\nsum(...TRUNCATED)	{"input":["5\n2 1 1 1 2\n","6\n5 1 3 4 8 3\n","5\n1 5 7 1 2\n","6\n5 1 3 4 5 3\n","2\n1000010 100100(...TRUNCATED)	2	0	{"language":[3,3,4,4,4,2,4,4,4,4,2,4,2,4,4,3,4,4,4,3,3,3,2,4,4,4,3,4,4,2,1,2,4,4,4,3,2,3,3,4,2,4,3,4(...TRUNCATED)	{"language":[4,4,1,3,4,1,4,2,3,4,3,1,3,2,4,4,4,1,1,3,2,4,4,4,2,2,4,2,4,2,4,4,1,2,2,4,1,1,4,4,2,2,4,3(...TRUNCATED)	709	E	0	800	[ "dp", "graphs", "greedy", "math", "trees" ]	false	{ "nanos": 0, "seconds": 3 }	256,000,000
1311_F. Moving Points	"The nation of Panel holds an annual show called The Number Games, where each district in the nation(...TRUNCATED)	{"input":["7\nbabba\nabaac\ncodeforces\nzeroorez\nabcdcba\nbbbbbbb\na\n"],"output":["\n1\n1\n0\n1\n1(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["4 4 3\n1 2 3\n1 2 1\n2 3 3\n1 3 3\n1 4 4\n","5 4 2\n4 5\n1 2 100\n1 3 100\n3 4 10\n3 5 20(...TRUNCATED)	2	3	{"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,1,1,1,1,1,1,1,1(...TRUNCATED)	{"language":[4,2,2,2,4,2,4,2,2,2,3,4,1,1,3,4,1,4,2,3,4,4,1,2,4,4,4,3,4,1,4,2,4,2,2,2,3,4,4,2,1,2,3,1(...TRUNCATED)	455		1,500	2,400	[ "" ]	false	{ "nanos": 0, "seconds": 4 }	512,000,000
once-upon-a-time-in-time-land	"The statement of this problem is the same as the statement of problem C1. The only difference is th(...TRUNCATED)	{"input":["10\n10\n3 7\n1 4\n1 6\n5 5\n1 1\n3 9\n7 8\n1 2\n3 3\n7 10\n10\n2 4\n1 7\n3 4\n3 5\n2 8\n2(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["4 20\n4 2 3 1\n2 2\n1 4\n2 2\n1 1\n3 3\n3 3\n1 4\n3 3\n2 2\n3 3\n4 1\n2 2\n1 4\n3 3\n3 1\(...TRUNCATED)	2	0	{"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":[0,2,2,0,2,3,2,3,4,0,3,2,2,2,2,2,2,3,0,2,0,2,3,4,0,2,2,0,2,2,2,2,2,2,3,0,3,2,2,0,0,2,2,2(...TRUNCATED)	754	A	0	0	[ "math" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
p00822 Weather Forecast	"Artem has an array of n positive integers. Artem decided to play with it. The game consists of n mo(...TRUNCATED)	{"input":["+Mike\nMike:hello\n+Kate\n+Dmitry\n-Dmitry\nKate:hi\n-Kate\n","+Mike\n-Mike\n+Mike\nMike:(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["31 50000000\n90016\n60016\n00016\n30016\n30016\n30013\n30013\n90014\n30014\n30014\n20014\(...TRUNCATED)	2	8	{"language":[1,1,1,1],"solution":["M,N=map(int,raw_input().split())\nL=[]\nfor i in range(M):\n L(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,3,2,4,2,2,2,4,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	F	1,750	1,800	[ "data structures", "implementation" ]	false	null	512,000,000
p01646 Dictionary	"A Little Elephant from the Zoo of Lviv likes lucky strings, i.e., the strings that consist only of (...TRUNCATED)	{ "input": [ "5 0\n3 14 15 92 6\n", "3 1\n1 2 3\n" ], "output": [ "3 14 15 92 6 ", "1 3 6 " ] }	{ "input": [], "output": [] }	{"input":["1 15\n15\n1\n","1 22\n15\n1\n","1 15\n4\n1\n","4 3\n0 0 2 1\n2 0 1 0\n","1 15\n15\n2\n","(...TRUNCATED)	2	7	{"language":[2,2,2,2,2,2,2,2,2,3,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3(...TRUNCATED)	{"language":[2,2,4,2,3,4,4,3,4,1,3,3,2,3,2,2,1,3,3,3,2,3,4,3,4,2,2,3,4,3,2,4,4,3,4,4,4,3,4,2,3,4,3,2(...TRUNCATED)	551	D	0	0	[ "dp", "greedy", "strings" ]	false	{ "nanos": 0, "seconds": 2 }	0
cube-change-qualifier2	"Consider an infinite triangle made up of layers. Let's number the layers, starting from one, from t(...TRUNCATED)	{"input":["3\nTroll likes Dracul\nDracul likes Anka\nSnowy likes Hexadecimal\n210 200 180\n","2\nAnk(...TRUNCATED)	{"input":["1\n9\n>>>>>>>><\n","13\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\(...TRUNCATED)	{"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	13	{"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],"solution":["t=int(input())\nwhile(...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,195	F	0	1,900	[ "brute force", "sortings" ]	false	{ "nanos": 0, "seconds": 2 }	0
1101_A. Minimum Integer	"4 different points on the plane Read the coordinates of $ A (x_a, y_a) $, $ B (x_b, y_b) $, $ C (x_(...TRUNCATED)	{ "input": [ "5 3\n5 5 7 3 1\n", "4 2\n1 2 3 4\n", "2 3\n1 2\n" ], "output": [ "15\n", "8\n", "0\n" ] }	{"input":["10\n5 1 33242121\n5 7 535463871\n9 1 202863787\n5 4 874413088\n6 1 623012241\n6 8 7866591(...TRUNCATED)	{"input":["3 1\n-1 3\n-2 -2\n","-8360 9282\n2666 2344\n9109 -2730\n","0 45\n42 -47\n-51 -42\n","45 6(...TRUNCATED)	6	0	{"language":[4,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,4,4,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,4,1(...TRUNCATED)	{"language":[2,2,2,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,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0		0	1,700	[ "bitmasks", "dp" ]	false	null	536,870,912
405_E. Graph Cutting	"Ilya is an experienced player in tic-tac-toe on the 4 × 4 field. He always starts and plays with X(...TRUNCATED)	{"input":["10\n1\n248618\n3\n12 10 8\n6\n100 11 15 9 7 8\n4\n0 1 1 0\n2\n0 0\n2\n0 1\n2\n1 0\n2\n1 1(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	6	0	{"language":[2,3,2,2,2,2,4,3,3,3,3,2,2,2,2,2,3,2,2,2,3,2,2,2,2,3,1,3,3,3,2,4,3,2,4,3,4,2,2,3,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	699	B	2,000	0	[]	false	{ "nanos": 0, "seconds": 2 }	134,217,728
ankit-and-race-team-10	"Suppose you have a string S which has length N and is indexed from 0 to N−1. String R is the reve(...TRUNCATED)	{ "input": [ "5 5 10\n1 2 4 8 16\n", "3 4 11\n1 2 3 4\n" ], "output": [ "7\n", "6\n" ] }	{ "input": [], "output": [] }	{"input":["4\n3 3\n1 2\n2 3\n3 1\n3 6\n1 2\n2 1\n2 3\n3 2\n1 3\n3 1\n7 10\n1 2\n2 3\n3 1\n1 4\n4 5\n(...TRUNCATED)	2	7	{"language":[2,2,2,2,2,2,2,2,2,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,2,4,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)	702		500	1,600	[ "constructive algorithms", "implementation" ]	false	{ "nanos": 0, "seconds": 1 }	268,435,456