Datasets:

TheFactoryX
/

edition_3117_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
p02120 Cluster Network	"Everybody knows that we have been living in the Matrix for a long time. And in the new seventh Matr(...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":["9\n100 100 100 200 100 100 200 100 200\n","3\n100 100 100\n","7\n200 200 200 100 200 200 (...TRUNCATED)	{ "input": [], "output": [] }	6	10	{"language":[1,2,3,2,2,2,4,4,3,4,4,3,2,2,2,2,2,3,2,2,2,1,2,2,2,4,4,1,2,2,2,2,2,4,2,2,2,4,2,4,2,2,2,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)	1,257		500	2,100	[ "dfs and similar", "divide and conquer", "implementation" ]	false	{ "nanos": 0, "seconds": 8 }	256,000,000
70_C. Lucky Tickets	"Bob is travelling from one city to another. In his way, he sees many other cities pass by. What he (...TRUNCATED)	{ "input": [ "1\n", "4\n", "6\n", "2\n" ], "output": [ "1 1\n", "1 4\n", "2 3\n", "1 2\n" ] }	{"input":["10 20 11\nisnr u eq qas gcj rnnf fpb c dz g\n","10 4 3\nuzu bl fl ou uist j lp e gkp fmo\(...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)	6	0	{"language":[2,2,4,2,4,3,4,4,3,4,4,2,2,4,2,2,4,3,4,3,4,4,2,4,4,2,2,4,4,3,2,3,2,4,2,4,1,2,3,3,4,3,4,2(...TRUNCATED)	{"language":[4,4,4,2,3,2,2,2,3,3,4,3,4,2,2,3,4,4,2,2,2,2,2,3,2,3,3,4,4,2,3,2,3,2,3,2,4,4,4,4,2,4,2,2(...TRUNCATED)	0		1,500	0	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
1227_A. Math Problem	"Bhavana and Bhuvana place bet every time they see something interesting that can occur with a proba(...TRUNCATED)	{ "input": [ "8 2\n1 1 2 3 4 5 5\n", "7 1\n1 1 3 3 4 4\n" ], "output": [ "2", "4" ] }	{"input":["? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ?(...TRUNCATED)	{"input":["5 5\n-993655555 -758584352 -725954642 -696391700 -649643547\n-591473088 -568010221 -43211(...TRUNCATED)	6	0	{"language":[1,2,4,2,3,3,3,4,3,3,4,3,4,2,3,3,4,4,2,3,4,2,4,4,2,3,3,2,2,1,3,3,3,3,2,4,3,4,4,4,3,3,3,2(...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,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	85	C	500	3,400	[ "implementation", "math" ]	false	{ "nanos": 0, "seconds": 2 }	0
the-competitive-class-3	"George is getting tired of the decimal number system. He intends to switch and use the septenary ((...TRUNCATED)	{"input":["(((#)((#)\n","#\n","()((#((#(#()\n","(#)\n"],"output":["1\n2\n","-1\n","1\n1\n3\n","-1\n"(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["50 50\n75 54 23 37 28 23 69 75 5 62 3 11 96 100 13 50 57 51 8 90 4 6 84 27 11 89 95 81 10(...TRUNCATED)	2	8	{"language":[2,2,2,2,2,4,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,4,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0		0	0	[ "games", "math" ]	false	{ "nanos": 0, "seconds": 2 }	0
316_B2. EKG	"Serge came to the school dining room and discovered that there is a big queue here. There are m pup(...TRUNCATED)	{"input":["5\n1 2\n2 1\n5 10\n10 9\n20 1\n","5\n1 2\n2 1\n5 10\n10 9\n19 1\n"],"output":["4\n","3\n"(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3 4\n3 2 1\n","5 97\n1 10 76 97 2\n","2 16\n12 4\n","2 100\n132 1\n","5 76\n1 10 50 100 2(...TRUNCATED)	2	6	{"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],"solution":["def solve():\n\(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,1,2,2,4,2,2,2,2,2,2,4(...TRUNCATED)	835	F	0	2,100	[ "brute force", "combinatorics", "dp", "string suffix structures" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
p02574 AtCoder Beginner Contest 177 - Coprime	"The nation of Panel holds an annual show called The Number Games, where each district in the nation(...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":["30 2\n-999999924 -499999902 500000091 -999999998 500000030 -999999934 500000086 -49999991(...TRUNCATED)	{"input":["2\n1 1 1 1 1 0 0 0 0 0\n0 0 0 0 0 1 1 1 1 1\n0 -2 -2 -2 -2 -2 -1 -1 -1 -1 -1\n0 -2 -2 -2 (...TRUNCATED)	5	7	{"language":[1,3,2,2,2,4,1,4,4,2,4,3,4,4,4,4,2,2,1,4,2,2,4,2,2,4,1,4,4,2,2,2,2,2,4,4,3,2,4,4,4,3,2,2(...TRUNCATED)	{"language":[0,3,0,2,4,0,0,4,0,0,3,1,3,4,0,2,2,0,2,3,2,2,4,4,0,3,4,4,4,2,0,0,2,0,2,3,0,0,0,0,0,0,2,0(...TRUNCATED)	663	B	1,000	0	[ "*special" ]	false	{ "nanos": 0, "seconds": 2 }	268,435,456
1037_B. Reach Median	"Treeland consists of n cities and n-1 two-way roads connecting pairs of cities. From every city, yo(...TRUNCATED)	{"input":["6\n4 2\nbbab\n7 5\ncceddda\n6 5\necdaed\n7 4\ndcdbdaa\n8 3\nccabbaca\n5 7\neabba\n"],"out(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["0.0,0.0,1.0,0.0,1.0,1.0,0.0,0.1\n0.0,0.0,3.0,0.0,1.0,1.0,1.0,3.0","1.0,0.0,0.1,0.1,0.0,0.(...TRUNCATED)	6	7	{"language":[4,3,3,3,3,3,3,3,3,2,3,3,4,3,3,3,4,4,3,3,4,3,3,3,3,3,3,3,4,2,3,1,3,3,3,3,3,3,3,3,3,3,4,3(...TRUNCATED)	{"language":[3,2,4,4,2,2,2,4,1,4,4,2,2,4,2,2,4,4,4,2,2,2,2,2,1,2,4,4,2,2,2,2,2,2,2,3,2,2,2,3,2,2,2,2(...TRUNCATED)	405	A	0	1,900	[ "brute force", "greedy" ]	false	{ "nanos": 0, "seconds": 1 }	512,000,000
235_D. Graph Game	"Manao works on a sports TV. He's spent much time watching the football games of some country. After(...TRUNCATED)	{"input":["2\n4 INDIAN\nCONTEST_WON 1\nTOP_CONTRIBUTOR\nBUG_FOUND 100\nCONTEST_HOSTED\n4 NON_INDIAN\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["42 28\n7 19\n15 24\n3 42\n18 5\n32 27\n26 20\n40 30\n35 2\n14 8\n22 8\n36 4\n16 14\n21 29(...TRUNCATED)	2	7	{"language":[3,2,4,2,2,4,2,2,4,4,2,2,2,2,4,2,2,2,2,2,2,4,4,4,4,2,2,2,2,4,4,2,2,1,2,2,2,4,2,4,2,2,4,2(...TRUNCATED)	{"language":[2,1,4,2,4,2,2,4,2,2,4,4,3,2,2,4,2,2,4,3,2,2,4,3,1,4,2,4,4,2,2,3,4,1,3,4,4,4,2,2,2,2,4,4(...TRUNCATED)	1,398	H	0	1,600	[]	true	{ "nanos": 0, "seconds": 5 }	256,000,000
737_A. Road to Cinema	"In a mystical TimeLand, a person's health and wealth is measured in terms of time(seconds) left. \n(...TRUNCATED)	{ "input": [ "27", "6" ], "output": [ "5", "2" ] }	{"input":["9 13\n6 14 19 5 -5 6 -10 20 8\n","8 9\n6 -1 5 -5 -8 -7 -8 -7\n","10 7\n-9 3 -4 -22 4 -17 (...TRUNCATED)	{"input":["20 20\n00010110100100010111\n11110000001100101110\n01110101110001111000\n1011110100011111(...TRUNCATED)	5	9	{"language":[1,1,1,1,1],"solution":["import math\nfor _ in xrange(int(raw_input())):\n\tn = int(raw_(...TRUNCATED)	{"language":[2,0,0,2,0,2,0,0,0,2,2,2,2,0,0,0,0,2,0,4,2,0,4,0,0,0,0,0,2,0,4,2,4,2,0,2,0,0,2,2,2,0,0,0(...TRUNCATED)	0	B	0	3,100	[]	false	{ "nanos": 0, "seconds": 2 }	0
405_E. Graph Cutting	"Kolya has a turtle and a field of size 2 × n. The field rows are numbered from 1 to 2 from top to (...TRUNCATED)	{ "input": [ "2 5 4 0 4\n", "4 5 9 2 1\n" ], "output": [ "3\n", "-1\n" ] }	{"input":["16\n2 2 2 2 2 3 3 3 3 5 5 7 7 11 13 17\n","16\n2 2 2 2 2 2 2 2 3 3 5 5 7 11 13 17\n","16\(...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)	1	0	{"language":[2,2,4,2,4,3,4,4,2,2,3,1,4,3,3,2,3,3,2,4,2,4,2,2,2,3,3,3,3,3,3,2,4,3,2,2,3,2,2,4,3,4,4,4(...TRUNCATED)	{"language":[2,4,3,1,2,4,1,2,1,3,1,2,3,1,4,4,2,4,4,2,3,3,3,1,1,3,1,4,2,4,3,4,3,2,4,2,2,2,1,4,1,3,3,4(...TRUNCATED)	0	B	0	1,100	[ "" ]	true	{ "nanos": 0, "seconds": 3 }	1,073,741,824