Datasets:

TheFactoryX
/

edition_0955_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
1466_C. Canine poetry	"This is an interactive problem!\n\nEhab plays a game with Laggy. Ehab has 2 hidden integers (a,b). (...TRUNCATED)	{ "input": [ "1 30 0\n-1 -1 -1" ], "output": [ "00:30:00\n01:30:00" ] }	{ "input": [], "output": [] }	{"input":["1000\n999001\n999002\n999003\n999004\n999005\n999006\n999007\n999008\n999009\n999010\n999(...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],"solution":["a,b=raw_input().spl(...TRUNCATED)	{"language":[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,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	339	C	2,000	1,000	[]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
1101_A. Minimum Integer	"problem\n\nAOR Ika is studying to pass the test.\n\nAOR Ika-chan solved the $ N $ question. After t(...TRUNCATED)	{"input":["3\ncan you meet me outside ccd today\na\nthis year hard kaur is coming to entertain us"],(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["85 36 123\n","100000 100000 1937540\n","70386 8300 113682\n","48701 4854 24164\n","84324 (...TRUNCATED)	2	0	{"language":[4,4,4,2,4,1,2,2,2,2,3,2,2,4,3,2,1,3,2,3,2,2,1,2,2,4,2,4,2,4,2,2,1,4,1,2,2,4,2,1,3,4,2,2(...TRUNCATED)	{"language":[4,4,3,4,3,1,3,3,4,4,2,4,3,4,3,3,4,3,4,3,4,4,2,3,4,4,3,2,2,4,3,3,2,4,3,3,2,3,2,4,4,3,4,4(...TRUNCATED)	1,189	C	0	1,600	[ "brute force" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
p02652 AtCoder Grand Contest 045 - 01 Unbalanced	"New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He has n (...TRUNCATED)	{ "input": [ "1\n3 3\n1 2\n2 3\n1 3\n\nSAMPLE" ], "output": [ "2\n" ] }	{ "input": [], "output": [] }	{"input":["1 11 4 0 10\n","17 10 12 6 8\n","6 4 4 0 2\n","50 4 5 5 -1\n","20 2 40 1 2\n","1000 501 5(...TRUNCATED)	2	0	{"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,4,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,3,2,2,4,2,3,3,4,2,2,3,2,2,4,2,2,4,3,2,3,4,3,4,2,2,2,3,3,2,4,2,3,2,3,4,4,3,4,4,4,4,3,2(...TRUNCATED)	662		1,000	2,400	[]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
1547_C. Pair Programming	"You are given a square matrix of size n (it will be an odd integer). Rows are\nindexed 0 to n-1 fro(...TRUNCATED)	{"input":["5\n0.50 0.29 0.49 0.95 0.83\n2 3\n0 3\n3 4\n2 1\n3\n4 0.66\n1 0.69\n0 0.36\n"],"output":[(...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":["48 1976\n30 97 84\n80 81 84\n41 70 45\n23 57 80\n17 60 85\n36 48 81\n51 87 81\n38 85 81\n(...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,1,1,1,1,1,1],"s(...TRUNCATED)	{"language":[2,2,2,1,1,2,2,2,2,4,2,2,2,4,2,4,4,2,3,2,2,2,2,1,4,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,2,1,2,4(...TRUNCATED)	1,470	E	0	0	[ "*special", "graphs" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
p02120 Cluster Network	"Alice is playing with some stones.\n\nNow there are three numbered heaps of stones. The first of th(...TRUNCATED)	{ "input": [ "4 3\n1 3 4 7" ], "output": [ "6" ] }	{"input":["bbbbbbbbaaaaaaaaaaaccccccaaaaaaaaaaaaaaccccccccaaaaaaaaabbbbbbccbbbaaaaaabccccccaaaacaaac(...TRUNCATED)	{"input":["+--+-+\n","+--+--+------+++++++-+-+++--++---+--+-+---+--+++-+++-------+++++-+-++++--+-+-+(...TRUNCATED)	2	9	{"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": [], "solution": [] }	1,354	A	0	2,400	[ "brute force", "geometry", "math" ]	false		{ "nanos": 0, "seconds": 3 }	512,000,000
7_B. Memory Manager	"Tavas is a cheerleader in the new sports competition named \"Pashmaks\".\n\n<image>\n\nThis competi(...TRUNCATED)	{ "input": [ "2\n2\nbhopal\ndelhi\n3\nbhopal\ndelhi\ndehradun\n\nSAMPLE" ], "output": [ "YES\nNO\n" ] }	{"input":["1 10\n1\n","10 1\n-1 1 1 1 1 1 1 1 1 1\n","78 8\n-230 -757 673 -284 381 -324 -96 975 249 (...TRUNCATED)	{"input":["1\n474 314 18260\n","1\n315 315 553688\n","1\n316 314 52289\n","1\n516 5 6571\n","1\n402 (...TRUNCATED)	6	2	{"language":[1],"solution":["mod=10*9+7\nA=[[0 for i in range(105)] for j in range(105)]\nB=[0]105(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,0,0,2,2,0,2,2,4,2,2,4,0,0,2,2,0,2,2,0,0,2,2,2,2,2,2,2,0,2,2,2,2,2,0,2,2,2(...TRUNCATED)	0	G	2,000	2,200	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
rams-love-for-sita-2	Example Input ACM Output 0	{ "input": [ "3 2 0 2\n0 1 3\n2 5\n" ], "output": [ "1\n" ] }	{"input":["30 2\n26 11 22 16 14 29 16 14 8 23 21 22 11 24 15 23 22 1 11 20 23 29 13 19 19 15 13 2 7\(...TRUNCATED)	{ "input": [], "output": [] }	6	0	{"language":[3,4,3,2,2,3,3,1,3,4,2,4,1,3,3,1,1,3,3,2,1,3,2,4,2,3,3,1,3,2,2,2,3,3,1,2,3,4,4,4,3,4,3,3(...TRUNCATED)	{"language":[2,4,4,3,2,2,2,2,3,4,4,4,4,2,2,4,3,4,2,3,4,2,2,4,1,2,2,1,2,4,4,3,2,3,2,4,4,2,4,2,1,4,1,2(...TRUNCATED)	687		0	3,100	[ "brute force", "sortings" ]	false		{ "nanos": 0, "seconds": 5 }	64,000,000
153_E. Euclidean Distance	"As you know Appu created aversion to Maths after that maths problem given by his teacher.So he stop(...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":["21 6\n12 15 14 4 4 7 2 4 11 1 15 4 12 11 12 8 11 12 3 4 4\n","50 25\n19 1 17 6 4 21 9 16 (...TRUNCATED)	{"input":["1\n3\nS10\n111\n00F\n","1\n5\nS0000\n10000\n00000\n00000\n0000F\n","1\n3\nS10\n110\n11F\n(...TRUNCATED)	2	9	{"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],"solut(...TRUNCATED)	{"language":[2,2,2,2,2,4,2,4,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,4,2,4,2,2,2,2,2,4,4,2,4,2,4,2,2,2,2,2,2,4(...TRUNCATED)	0	D	0	900	[]	false	"りんごだいぼうけん\n\nsquare1001君とE869120君は縦 $H$ 行、横 $W$ 列のグリッ(...TRUNCATED)	{ "nanos": 0, "seconds": 1 }	512,000,000
p01970 The Diversity of Prime Factorization	"Two players play the following game. Initially, the players have a knife and a rectangular sheet of(...TRUNCATED)	{ "input": [ "3\nAFI\n", "6\nAFFAAA\n" ], "output": [ "1", "4" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	8	{"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,4,1,3,2,2,4,4,2,1,2,2,4,1,3,2,4,2,3,2,2,2,2,2,2,3,3,2,2,4,2,4,2,3,4,4,3,4,2,4,2,2,2,2(...TRUNCATED)	851	A2	0	2,100	[ "" ]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
p01219 Private Teacher	"G: Destiny Draw-\n\nproblem\n\nMr. D will play a card game. This card game uses a pile of N cards. (...TRUNCATED)	{ "input": [ "2\n27 25 4\n25 26 16\n\nSAMPLE" ], "output": [ "K-G-B\nX-Y-B" ] }	{ "input": [], "output": [] }	{"input":["25\n91 57\n2 73\n54 57\n2 57\n23 57\n2 6\n57 54\n57 23\n91 54\n91 23\n57 23\n91 57\n54 2\(...TRUNCATED)	2	14	{"language":[2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,1,2,2,2,2,2,4,2,2,2,2,2,2,1,4,2,2(...TRUNCATED)	{"language":[2,2,4,3,2,3,3,0,3,2,2,0,3,4,1,3,2,2,0,0,2,2,3,3,3,3,0,3,4,2,0,3,0,2,0,2,2,2,3,3,4,3,2,2(...TRUNCATED)	0		0	1,500	[ "math" ]	true		{ "nanos": 0, "seconds": 2 }	0