Datasets:

TheFactoryX
/

edition_1668_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
1506_F. Triangular Paths	"Problem\n\nA large-scale cluster † type supercomputer (commonly known as \"SAKURA\") cluster at M(...TRUNCATED)	{ "input": [ "3\n((()))\n(())()\n()(()" ], "output": [ "YES\nYES\nNO" ] }	{ "input": [], "output": [] }	{"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	12	{"language":[2,1,3,4,1,4,1,4,2,3,4,2,4,1,2,3,2,2,4,3,2,4,2,2,2,4,4,3,2,4,4,4,4,1,1,3,2,2,2,4,1,4,1,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)	174		0	1,100	[ "*special" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
1216_D. Swords	"Maga and Alex are good at string manipulation problems. Just now they have faced a problem related (...TRUNCATED)	{ "input": [ "CANDY", "SOLVING" ], "output": [ "AND", "LVI" ] }	{ "input": [], "output": [] }	{"input":["10\n669924290 408119795 283272835\n663737793 250734602 29671646\n431160679 146708815 2894(...TRUNCATED)	2	10	{"language":[3,4,2,2,3,3,3,3,3,4,4,2,3,4,4,2,2,4,2,3,1,3,2,3,4,3,3,2,3,2,2,3,2,2,2,2,2,4,2,4,3,3,3,2(...TRUNCATED)	{ "language": [], "solution": [] }	0	F	0	2,500	[]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
max-min	"There are N integers a_1, a_2, ..., a_N not less than 1. The values of a_1, a_2, ..., a_N are not k(...TRUNCATED)	{"input":["14\nadd 1\nadd 7\nadd 2\nadd 5\nsum\nadd 6\nadd 8\nadd 9\nadd 3\nadd 4\nadd 10\nsum\ndel (...TRUNCATED)	{"input":["3\n7089544 9134148 -5332724\n368810 1638695 7889905\n-3866235 -4257263 5802154\n","16\n-3(...TRUNCATED)	{ "input": [], "output": [] }	3	0	{"language":[4,3,4,4,3,3,3,3,3,3,3,4,4,3,3,3,4,3,3,3,3,2,2,3,2,3,3,4,3,2,3,4,2,4,3,4,3,3,3,3,3,4,3,3(...TRUNCATED)	{ "language": [], "solution": [] }	0	E	0	0	[ "" ]	false		null	256,000,000
195_A. Let's Watch Football	"There are three arrays a, b and c. Each of them consists of n integers. SmallY wants to find three (...TRUNCATED)	{"input":["3\n1 1 101\n1 2 1\n3 2 1\n","5\n1 1 2 2 3\n2 2 4 3 3\n3 3 1 1 1\n"],"output":["5\n","5\n"(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\n77 42 77\n77 77\n77\n","3\n77 31 77\n77 77\n77\n","4\n1 5 7 12\n1 5 7\n1 5\n","3\n77 7(...TRUNCATED)	3	7	{"language":[2,2,2,2,2,2,2,2,2,4,2,2,4,2,3,2,2,4,4,2,4,4,2,2,4,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,2,4,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,3,2,3,2,2,3,3,2,3,2,2,2,2,2,2,2,3,2,2,2,3,2,3,2,3,2,3,2,3,2,2,2,2,2,3,2,2(...TRUNCATED)	0	F	0	1,100	[ "constructive algorithms", "dsu", "math" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
rams-love-for-sita-2	"Edward R. Nelson is visiting a strange town for some task today. This city is built on a two-dimens(...TRUNCATED)	{ "input": [ "2\n2 9 17\n1 1\n\nSAMPLE" ], "output": [ "Yes\nNo\n" ] }	{"input":["85 30 123\n","100000 100000 1320777\n","94728 36278 300352\n","70386 4182 113682\n","6518(...TRUNCATED)	{"input":["5\nAJMP\naB33d\nE\n86AE\nAM\n6\nJPEM\nWaEaETC302Q\nCP\nrTurnAGundam1isdefferentf","5\nAJM(...TRUNCATED)	2	0	{"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		0	0	[ "brute force", "math" ]	false		null	134,217,728
once-upon-a-time-in-time-land	"Your task is very simple. Given K numbers A1, A2, ..., AK. You need to find f(N) mod max(A1, A2, .(...TRUNCATED)	{"input":["4 4 2\n2 3\n1 2\n1 3\n1 4\n","5 8 2\n2 1\n4 2\n5 4\n5 2\n4 3\n5 1\n4 1\n3 2\n","5 7 2\n1 (...TRUNCATED)	{"input":["1\n1\n1\n1\n1\n1\n1\n","1\n3\n2 3 1\n1 2\n2 3\n1\n1\n1\n2\n","2\n6\n5 3 2 4 1 6\n1 2\n1 3(...TRUNCATED)	{"input":["ecneyek","ashkfyha","eeyofscienck","mnyszsbzpf","ecneyel","arhkfyha","eeyofsciencj","mnys(...TRUNCATED)	2	10	{"language":[1,1,1],"solution":["t=input()\nfrom fractions import gcd\nfor x in range(t):\n\tn1=inpu(...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	A	0	2,400	[ "constructive algorithms", "dfs and similar", "dp" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1046_D. Interstellar battle	"There are N oases on a number line. The coordinate of the i-th oases from the left is x_i.\n\nCamel(...TRUNCATED)	{ "input": [ "5 2" ], "output": [ "12" ] }	{ "input": [], "output": [] }	{"input":["7\nabbab\nabaac\ncodeforces\nzeroorez\nabcdcba\nbbbbbbb\na\n","7\nabbab\nabaac\ncodeforce(...TRUNCATED)	2	0	{ "language": [], "solution": [] }	{"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)	425		0	2,400	[ "data structures" ]	false	Time Limit: 8 sec / Memory Limit: 64 MB	{ "nanos": 0, "seconds": 1 }	0
p01970 The Diversity of Prime Factorization	"Story\n\nAt UZIA High School in the sky city AIZU, the club activities of competitive programming a(...TRUNCATED)	{"input":["2 1 0\n","2 2 4\n0 1 2 1\n0 1 2 1\n1 2 1 0\n1 1 1 2\n"],"output":["FIRST\n1 0 1 1\n","SEC(...TRUNCATED)	{"input":["1 1\n1\n2\n","6 3\n1 2 3 4 5 6\n3 5 1\n","5 5\n5 6 3 2 1\n4 3 1 5 6\n","1 1\n1\n1\n","10 (...TRUNCATED)	{"input":["7\n5\n-1 10 -1 12 -1\n5\n-1 40 35 -1 35\n6\n-1 -1 9 -1 3 -1\n2\n-1 -1\n2\n0 -1\n4\n1 -1 3(...TRUNCATED)	2	0	{"language":[2,2,3,1,3,1,2,3,4,3,3,4,1,3,1,1,3,1,1,3,3,4,3,4,3,2,2,3,3,4,2,1,2,2,4,2,1,4,3,3,4,4,2,3(...TRUNCATED)	{ "language": [], "solution": [] }	0		500	0	[ "bitmasks", "dp", "games" ]	false		null	256,000,000
battle-of-stalingrad-1	"Two boys decided to compete in text typing on the site \"Key races\". During the competition, they (...TRUNCATED)	{"input":["3 5 4\nabacc\nccbba\nccabc\nabacc\nacbbc\nababa\nacbbc\n","6 4 4\ndaac\nbcba\nacad\ncbdc\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["10 7\n1 10\n2 10\n3 19\n4 10\n5 10\n1 2\n1 3\n1 4\n1 5\n1 6\n","20 7\n6047 35038\n15816 3(...TRUNCATED)	3	2	{"language":[1],"solution":["digits=[6,2,5,5,4,5,6,3,7,6]\nvalids=[{} for i in xrange(11)]\nst0={}\n(...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)	0	D2	0	800	[]	false		{ "nanos": 0, "seconds": 8 }	256,000,000
592_E. BCPC	"There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on(...TRUNCATED)	{"input":["3\n10 20 10\n6\n1 1\n2 1\n2 2\n3 1\n3 2\n3 3\n","7\n1 2 1 3 1 2 1\n9\n2 1\n2 2\n3 1\n3 2\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["2 7\n4\n2\n1\n0\n-1\n-2\n-4\n131\n137\n2 7\n4\n2\n1\n0\n-1\n-2\n-4\n124\n123\n10 7\n-4\n-(...TRUNCATED)	2	0	{"language":[2,2,2,2,2,2,4,2,2,2,2,2,2,2,3,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,2,2,2(...TRUNCATED)	{"language":[2,1,4,2,2,2,4,2,3,2,2,2,2,4,2,2,2,2,2,2,3,4,2,4,4,4,2,3,4,3,2,3,4,3,2,2,3,2,2,4,2,2,4,2(...TRUNCATED)	519		2,500	3,500	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000