Datasets:

TheFactoryX
/

edition_0899_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
478_A. Initial Bet	"Friends Alex and Bob live in Bertown. In this town there are n crossroads, some of them are connect(...TRUNCATED)	{ "input": [ "5 3 2\naaaaa\naaa\naab" ], "output": [ "1 6" ] }	{"input":["2 2 5\n","9 9 1000000000\n","3 17 999999997\n","3 3 64\n","5 1 64\n","29 2 1000000000\n",(...TRUNCATED)	{"input":["47\nS 10\nS 11\nS 12\nS 13\nH 1\nH 2\nS 6\nS 7\nS 8\nS 9\nH 6\nH 8\nH 9\nH 10\nH 11\nH 4\(...TRUNCATED)	5	7	{"language":[2,4,3,4,4,4,1,3,3,2,4,3,2,3,1,3,3,4,4,4,3,2,4,2,3,2,3,2,2,2,2,3,2,1,1,1,4,2,3,4,4,2,2,2(...TRUNCATED)	{"language":[2,2,2,4,2,4,2,2,4,2,2,1,2,1,4,4,2,2,2,2,2,4,2,2,2,4,4,4,2,2,4,4,4,2,4,2,2,2,2,2,3,3,2,2(...TRUNCATED)	0	D2	3,500	2,100	[ "" ]	false	"アイヅ放送協会の教育番組(ＡＨＫ教育)では、子供向けの工作番組「あそ(...TRUNCATED)	{ "nanos": 0, "seconds": 1 }	0
p03986 AtCoder Grand Contest 005 - STring	"You are given a permutation p_1,p_2,...,p_N consisting of 1,2,..,N. You can perform the following o(...TRUNCATED)	{ "input": [ "1\n4 2\n6 1 2 0\n\nSAMPLE" ], "output": [ "3\n" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	11	{"language":[2,2,2,2,4,4,2,2,2,2,3,2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,1,2,2,2,2,2,2,2,2,2,2,4(...TRUNCATED)	{"language":[4,2,4,3,3,4,3,4,4,4,2,2,3,3,2,2,4,4,4,2,3,3,2,3,3,2,2,2,4,2,2,4,2,3,4,4,3,4,1,2,1,4,4,4(...TRUNCATED)	0	D	1,500	0	[ "greedy", "implementation" ]	false		{ "nanos": 0, "seconds": 2 }	134,217,728
p02652 AtCoder Grand Contest 045 - 01 Unbalanced	"There is an infinite line consisting of cells. There are n boxes in some cells of this line. The i-(...TRUNCATED)	{"input":["5 6\n1 2 3 4\n4 0 0 1 0\n1 5 2 3 -5 -1\n","7 8\n4 5 1 1 5 5\n0 0 0 1 2 0 0\n2 6 3 7 -2 4 (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["5 9 4\n4 1 46\n1 3 29\n3 2 58\n1 5 61\n2 4 175\n1 2 87\n4 5 58\n3 5 69\n3 4 28\n2 7\n5 7\(...TRUNCATED)	2	0	{"language":[2,2,3,3,2,3,1,4,3,4,2,4,1,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,3,2,3,3,2,2,4,2,4,2,4,4,2,3,4(...TRUNCATED)	{"language":[2,2,0,2,1,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,0,2,2,2,2,2,2,2,0,2,2,2(...TRUNCATED)	19		0	1,900	[ "" ]	false		null	256,000,000
1386_A. Colors	"You are given an equation: \n\nAx2 + Bx + C = 0. \n\nYour task is to find the number of distinct ro(...TRUNCATED)	{ "input": [ "5\n0 1 2 1 2\n", "4\n0 1 2 3\n" ], "output": [ "YES\n1\n2\n3\n5\n4\n", "NO\n" ] }	{"input":["99 100 100 100 100\n","57 83 11 4 93\n","99 99 99 99 99\n","100 0 0 0 0\n","0 1 2 3 4\n",(...TRUNCATED)	{"input":["3\nooe\n","36\naaiouyaaeeiioouuyyaaeeeeiiiooouuuyyy\n","3\npoo\n","1\nb\n","4\nooee\n","5(...TRUNCATED)	2	8	{"language":[2,2,4,4,2,2,2,2,2,2,4,4,4,4,2,2,2,2,2,2,2,4,2,2,2,4,4,4,4,4,4,2,4,2,2,2,2,4,4,4,4,2,2,2(...TRUNCATED)	{"language":[3,1,4,4,2,1,4,4,3,4,3,4,4,2,4,1,3,2,2,3,2,4,1,2,2,1,2,1,3,2,2,2,4,4,2,2,3,3,4,2,2,2,3,1(...TRUNCATED)	0	E	1,000	1,600	[ "dp" ]	true		null	268,435,456
p03774 AtCoder Beginner Contest 057 - Checkpoints	"The statement of this problem is the same as the statement of problem C1. The only difference is th(...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)	{"input":["46\n63 1\n63 63\n123 1\n123 123\n63 2\n63 62\n123 2\n123 122\n63 3\n63 61\n123 3\n123 121(...TRUNCATED)	{"input":["10\n100000000 200000000 300000000 28 500000000 600000000 700000000 800000000 900000000 10(...TRUNCATED)	3	10	{"language":[1],"solution":["# your code goes here\nfrom sys import stdin, stdout\nt = int(stdin.rea(...TRUNCATED)	{ "language": [], "solution": [] }	1,451	B3	0	1,500	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	0
1129_A2. Toy Train	"Valeric and Valerko missed the last Euro football game, so they decided to watch the game's key mom(...TRUNCATED)	{"input":["11 7 5\n24979445 861648772 623690081 433933447 476190629 262703497 211047202 971407775 62(...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":["11 11\n6 2\n6 2\n1 2\n3 2\n3 1\n6 2\n1 1\n1 1\n3 1\n3 1\n6 2\n","21 7\n14 1\n882797755 2\(...TRUNCATED)	2	0	{"language":[3,2,2,2,4,2,2,2,3,3,2,2,4,2,2,2,2,4,2,2,2,2,2,4,2,4,4,2,2,2,2,4,2,4,3,2,2,2,4,2,4,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	592		0	0	[]	false		{ "nanos": 0, "seconds": 4 }	256,000,000
p02260 Selection Sort	"Artsem has a friend Saunders from University of Chicago. Saunders presented him with the following (...TRUNCATED)	{ "input": [ "5 10 25 12 4 1 \n3 16 28 100\n\nSAMPLE" ], "output": [ "4 12 10 \n100 28 16" ] }	{"input":["2\naaab\n","2\nbabac\n","2\naaaaaabbbb\n","1\naabaab\n","2\naabbbbccccccdddddddd\n","2\na(...TRUNCATED)	{"input":["3\nAZAMON APPLE\nAZOMAN AAAAAAAAAAALIBABA\nAPPLE BANANA\n","3\nAZAMNO ELPPA\nAZAMON AAAAA(...TRUNCATED)	2	10	{"language":[4,2,2,2,2,4,2,4,2,2,2,2,4,4,4,2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,4,4,4,4,2,2,2,2,2,4,2,2(...TRUNCATED)	{"language":[2,2,3,0,3,2,0,3,0,2,2,3,2,3,2,2,0,2,0,3,0,3,3,2,3,2,2,0,2,2,3,3,2,2,2,3,3,3,2,2,4,3,4,2(...TRUNCATED)	0	B	0	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
518_E. Arthur and Questions	"You are running through a rectangular field. This field can be represented as a matrix with 3 rows (...TRUNCATED)	{"input":["4\n1 3\n2 4\n3 4\n2 3\n","4\n4 4\n1 3\n2 4\n3 4\n"],"output":["NO\n1 3 4 2\n1 2 4 3\n","Y(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	3	3	{"language":[4,2,4,3,2,4,4,4,4,4,2,4,3,4,3,2,3,2,4,3,2,3,2,3,3,4,3,2,3,4,3,4,2,3,4,2,4,3,4,4,4,2,2,3(...TRUNCATED)	{"language":[4,1,4,4,2,4,4,2,4,1,3,2,3,4,3,3,3,2,2,2,4,3,3,2,4,3,1,3,3,3,2,4,3,3,1,3,3,2,2,1,4,1,2,4(...TRUNCATED)	306	B	0	1,900	[ "implementation", "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
938_B. Run For Your Prize	"You are given a set of points on a straight line. Each point has a color assigned to it. For point (...TRUNCATED)	{"input":["5 4 10 1 6\n1 1 5\n1 5 5\n1 3 2\n1 5 2\n2 1\n2 2\n","5 2 2 1 8\n1 1 2\n1 5 3\n1 2 1\n2 2\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["20 20\n1 9\n11 9\n3 5\n15 13\n1 20\n11 18\n10 6\n10 8\n10 19\n12 16\n10 3\n9 18\n8 7\n15 (...TRUNCATED)	2	8	{"language":[1,1,1,1],"solution":["def func(s,val):\n\tcfc=0\n\tx=0\n\tlength=len(s)\n\tfor i in ran(...TRUNCATED)	{"language":[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,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0		750	1,500	[ "data structures", "dfs and similar", "dp", "graphs", "greedy", "trees" ]	false		null	512,000,000
730_J. Bottles	"Polycarp has an array a consisting of n integers.\n\nHe wants to play a game with this array. The g(...TRUNCATED)	{"input":["1\n3\n1 2\n2 3\n1\n1\n1\n2\n2\n1\n","2\n6\n1 2\n1 3\n1 4\n4 5\n4 6\n4\n1 3 4 5\n3\n3 5 2\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\nDSAWWAW\nD\nAW\n","3\nWSAWDAW\nD\nAW\n","3\nDAAWWSW\nD\nAW\n","3\nWAWWASD\nD\nWA\n","3(...TRUNCATED)	3	11	{"language":[4,2,2,2,2,3,2,1,4,4,4,2,2,4,2,4,2,2,2,4,2,3,3,4,2,2,2,2,2,4,4,2,4,4,2,2,3,4,2,3,4,3,2,2(...TRUNCATED)	{"language":[2,2,2,4,3,2,4,2,4,4,4,4,4,3,2,4,2,4,3,4,1,2,3,3,2,2,4,4,2,4,2,2,3,4,3,3,4,3,2,2,4,4,4,2(...TRUNCATED)	634		0	2,000	[ "dfs and similar", "divide and conquer", "implementation" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000