Datasets:

TheFactoryX
/

edition_2464_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
p01083 RedBlue	"We have a tree with N vertices. The i-th edge connects Vertex A_i and B_i bidirectionally.\n\nTakah(...TRUNCATED)	{"input":["1 1 1\n\n0\n\n0\n\n1337\n\n0\n\n0\n\n0\n","1 1 1\n\n1337\n\n1337\n\n1337\n\n1337\n\n1337\(...TRUNCATED)	{"input":["2\nFF\n","5\nIIIIF\n","5\nFAFFF\n","2\nFA\n","3\nAAA\n","5\nFAIAF\n","5\nAIFFF\n","3\nFFF(...TRUNCATED)	{ "input": [], "output": [] }	3	0	{"language":[4,2,2,2,2,3,2,2,4,2,3,2,2,4,4,2,2,4,2,2,2,4,4,2,2,2,2,3,2,3,4,2,3,4,2,2,2,2,4,4,2,2,2,2(...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)	0	F	0	2,600	[ "" ]	false		{ "nanos": 0, "seconds": 6 }	268,435,456
519_B. A and B and Compilation Errors	"problem\n\nYou are looking for a constellation in a picture of the starry sky. The photo always con(...TRUNCATED)	{"input":["17\ntypedef void* b\ntypedef b* c\ntypeof b\ntypeof c\ntypedef &b b\ntypeof b\ntypeof(...TRUNCATED)	{"input":["4\n39 20\n183 11\n551 27\n85 16","8\n4 65\n5 12\n7 24\n9 38\n12 24\n14 10\n65 75\n31 26"](...TRUNCATED)	{"input":["1 1\n2\n2\n","1 1\n2\n1\n","10 10\n1 2 3 4 5 6 7 8 9 10\n6 7 8 9 10 1 0 3 4 5\n","10 10\n(...TRUNCATED)	2	13	{"language":[2,4,4,4,2,4,4,4,4,4,2,3,2,3,4,2,2,2,2,2,4,4,2,4,2,4,2,2,2,4,2,2,2,2,2,3,2,4,2,4,4,2,2,1(...TRUNCATED)	{"language":[3,2,2,2,2,2,3,2,2,2,2,2,2,3,2,2,2,3,2,2,3,2,2,2,3,2,4,2,2,2,2,2,2,3,2,2,2,2,2,2,2,4,2,2(...TRUNCATED)	0	D	3,000	0	[ "implementation" ]	false		{ "nanos": 0, "seconds": 8 }	256,000,000
p01931 Check answers	"Two players are playing a game. The game is played on a sequence of positive integer pairs. The pla(...TRUNCATED)	{ "input": [ "7\n", "9\n" ], "output": [ "210\n", "504\n" ] }	{ "input": [], "output": [] }	{"input":["4 3\n1 3 2 7","4 4\n1 3 2 4","4 4\n1 0 2 4","4 3\n1 3 2 8","2 4\n1 3 2 4","4 4\n1 -1 2 4"(...TRUNCATED)	3	0	{"language":[2,2,2,4,2,4,4,4,2,2,2,4,4,4,2,2,2,2,2,4,2,2,4,4,3,2,2,2,4,2,2,2,2,4,4,2,2,2,2,4,2,2,2,2(...TRUNCATED)	{"language":[3,3,2,4,4,4,4,3,3,3,3,3,2,2,4,1,3,4,2,3,2,3,3,3,4,4,4,2,3,4,3,4,4,3,3,3,2,4,3,3,4,2,3,4(...TRUNCATED)	1,257		0	1,100	[ "brute force", "math" ]	false		null	256,000,000
615_A. Bulbs	"A certain business maintains a list of all its customers' names. The list is arranged in order of i(...TRUNCATED)	{ "input": [ "5 3 2\naaaaa\naaa\naab" ], "output": [ "1 6" ] }	{"input":["2 1\n1 1\n","2 3\n3 1\n","100 5\n5 5 2 4 5 4 4 4 4 2 5 3 4 2 4 4 1 1 5 3 2 2 1 3 3 2 5 3 (...TRUNCATED)	{"input":["1 1 2 2 1\n2 1\n","5 2 2 1 8\n1 1 2\n1 5 3\n1 2 1\n2 2\n1 4 2\n1 3 0\n2 1\n2 3\n","5 2 2 (...TRUNCATED)	2	11	{"language":[4,1,4,3,1,4,4,2,2,4,2,2,2,2,4,1,2,1,4,4,2,4,4,4,4,4,4,2,4,2,2,2,4,2,4,2,4,2,4,2,2,4,2,4(...TRUNCATED)	{"language":[3,2,2,4,1,2,2,2,2,4,4,2,2,2,4,4,2,3,2,1,2,2,2,4,4,2,4,2,2,1,2,2,2,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED)	518	E	1,000	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	134,217,728
687_A. NP-Hard Problem	"Once upon a time, there was a king who loved beautiful costumes very much. The king had a special c(...TRUNCATED)	{ "input": [ "2\n3\n10" ], "output": [ "1\n3" ] }	{"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":["341143514535\n158\n143565553551655311343411652235654535651124615163\n551544654451431564\n(...TRUNCATED)	6	11	{"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":[3,2,2,1,2,4,2,2,2,2,2,3,2,3,3,4,3,2,4,1,4,2,2,2,2,1,2,2,2,2,2,4,2,2,2,2,2,4,2,4,2,2,4,3(...TRUNCATED)	1,311	D	0	1,800	[ "" ]	false		null	256,000,000
79_D. Password	"There are N stations in the city where JOI lives, and they are numbered 1, 2, ..., and N, respectiv(...TRUNCATED)	{"input":["2 2 1\n2 3 1\n3 2 3\n2 3 5"],"output":["3.9681187851\n6.7970540913\n6.5668891783\n13.9527(...TRUNCATED)	{"input":["4 4 3\n1 2 3\n1 2 1\n2 3 2\n1 3 3\n1 4 4\n","4 3 2\n1 4\n1 2 1\n2 3 5\n3 4 1\n","3 2 2\n1(...TRUNCATED)	{"input":["3\n9 5 8\n8 9 3\n9 5 2\n","50\n48 45 42\n32 45 8\n15 41 47\n32 29 38\n7 16 48\n19 9 21\n1(...TRUNCATED)	5	7	{"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,4,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	464	B	0	1,200	[ "dp", "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
sherlock-and-kgb	"Polycarp has an array a consisting of n integers.\n\nHe wants to play a game with this array. The g(...TRUNCATED)	{"input":["4\n2 1 2 3 4 3 2 6 1 1 2 2 1 2 3 2\n","1\n42\n","2\n1 1 1 1\n"],"output":["6 4 3 2 ","42 (...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	5	11	{"language":[3,3,2,2,3,2,2,2,3,3,3,2,3,4,3,2,3,2,3,2,2,2,2,3,3,3,3,2,2,3,3,2,3,2,3,4,3,2,3,2,4,1,4,3(...TRUNCATED)	{"language":[2,2,3,2,4,4,2,4,4,4,2,3,3,2,2,2,2,3,2,3,4,4,2,4,2,2,4,3,2,4,4,3,2,2,3,4,4,3,3,4,3,2,2,3(...TRUNCATED)	1,413	C	1,250	0	[]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1397_C. Multiples of Length	"4 different points on the plane Read the coordinates of $ A (x_a, y_a) $, $ B (x_b, y_b) $, $ C (x_(...TRUNCATED)	{ "input": [ "3\nAFI\n", "6\nAFFAAA\n" ], "output": [ "1", "4" ] }	{ "input": [], "output": [] }	{"input":["cba\naaac\n","bcbcdddbbd\ndbbdbdcbcb\n","cadaccbaaa\nacabbbabaa\n","b\nb\n","acaccaaadz\n(...TRUNCATED)	2	8	{"language":[2,2,2,3,2,2,2,3,4,3,2,2,3,2,4,3,2,2,2,3,3,3,2,3,3,2,2,3,2,2,1,2,3,2,3,4,4,3,2,2,2,2,3,3(...TRUNCATED)	{ "language": [], "solution": [] }	0		2,000	2,600	[ "constructive algorithms", "greedy", "number theory" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
5_A. Chat Server's Outgoing Traffic	"Programmers' kids solve this riddle in 5-10 minutes. How fast can you do it?\n\nInput\n\nThe input (...TRUNCATED)	{ "input": [ "3\n1\n2 3\n2\n4 5\n5 6\n2\n2 3\n3 5" ], "output": [ "NO\nNO\nYES" ] }	{ "input": [], "output": [] }	{"input":["1 2 101 42 99 -1","1 2 101 42 33 -1","1 2 101 36 33 -1","1 2 101 36 50 -1","0 2 101 36 50(...TRUNCATED)	2	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,2,1,2,4,1,4,3,1,2,4,3,1,4,2,2,3,2,4,2,2,4,4,3,4,3,2,4,1,1,4,1,3,4,2,3,3,1,3,2,4,2,4,4(...TRUNCATED)	1,500	C	1,250	2,100	[]	false		null	256,000,000
1189_A. Keanu Reeves	"Apple adventure\n\nsquare1001 and E869120 got lost in the grid world of $ H $ rows and $ W $ rows!\(...TRUNCATED)	{ "input": [ "3\nbba\nabb\nabb\n\nSAMPLE" ], "output": [ "2\n" ] }	{"input":["605 297 -251700323 -366763764 -445828791 325081312\n","14 9 44 45 -50 -9\n","18 17 -26078(...TRUNCATED)	{"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	0	{"language":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"solution":["n = int(raw_input())\nm = map(int, (...TRUNCATED)	{ "language": [], "solution": [] }	1,301	F	500	0	[ "" ]	true	"アイヅ放送協会の教育番組(ＡＨＫ教育)では、子供向けの工作番組「あそ(...TRUNCATED)	null	256,000,000