Datasets:

TheFactoryX
/

edition_2772_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	untranslated_description large_stringclasses 36 values	time_limit dict	memory_limit_bytes int64 0 1.07B
512_B. Fox And Jumping	"Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings(...TRUNCATED)	{"input":["4\n3\n4 5\n5 9\n7 7\n5\n11 19\n4 17\n16 16\n3 12\n14 17\n1\n1 10\n1\n1 1\n"],"output":["2(...TRUNCATED)	{"input":["7\n576460752303423487 2\n82 9\n101 104\n10 21\n31 10\n0 1\n10 30\n","1\n12881797281728299(...TRUNCATED)	{"input":["4\nlu ru ld rd\n4\nlu ld lu ru\n0\nlu\n10\nru lu ld rd ru rd ru lu rd ld\n0","4\nlu ru ld(...TRUNCATED)	2	8	{"language":[2,2,2,2,4,2,4,2,2,4,2,2,2,2,2,4,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4(...TRUNCATED)	{"language":[3,2,2,3,2,2,2,2,2,2,2],"solution":["from heapq import heappush, heappop\nINF = 10 **20\(...TRUNCATED)	283	E	1,250	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
5_A. Chat Server's Outgoing Traffic	"Chef has a an array A consisting of N elements. He wants to add some elements into the array as per(...TRUNCATED)	{"input":["7 2\n-10 -4 -2 0 2 4 10","16 19\n-49 -48 -33 -30 -21 -14 0 15 19 23 44 52 80 81 82 84","3(...TRUNCATED)	{"input":["1000 1001\n217 636 713 516\n","1000 1998\n833 681 19 233\n","4 5\n1 3 4 2\n","6 7\n3 1 2 (...TRUNCATED)	{"input":["176856\n","468424\n","371312\n","1559681\n","1362308\n","1165938\n","1001000\n","45859\n"(...TRUNCATED)	1	9	{"language":[2,3,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,3,2,4,2,4,2,3,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,1,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,0,2,2,4,2,1,0,0,2,2,4,2,2,2,2,2,2,2,4,0,2,2,2,2,0,1,2,2,2,2,2,0,2,4(...TRUNCATED)	650		500	2,300	[ "binary search", "data structures", "dfs and similar", "dsu", "shortest paths", "two pointers" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1334_D. Minimum Euler Cycle	"Sita loves chocolate and Ram being his boyfriend wants to give Sita as many chocolates as he can. S(...TRUNCATED)	{"input":["3\n1 0 1\n0 0 0\n","2\n1 4\n2 3\n","3\n0 0 0\n0 0 0\n"],"output":["0 0 1 \n1 0 0 ","1 3\n(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["314159\n1","25\n1","100\n2","314159\n3","999999999999999999999999999999999999999999999999(...TRUNCATED)	1	11	{"language":[4,1,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,4,4,2,2,2,2,2,2,4,2,2,2,2,2(...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)	0		2,750	1,900	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
571_E. Geometric Progressions	"Vasya's telephone contains n photos. Photo number 1 is currently opened on the phone. It is allowed(...TRUNCATED)	{"input":["1\n1 1 0 1 0 0 0 1 0 1\n3 4 5 6 7 8 9 -2 -3 4 -2","3\n1 1 1 1 1 1 0 0 1 1\n0 1 0 1 1 1 1 (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["30 1\n19 20 10 21 9 1 20 21 30 12 25 25 2 1 10 3 19 12 18 12 30 18 22 1 18 18 30 30 12\n"(...TRUNCATED)	2	9	{"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,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		0	0	[ "dp", "probabilities" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
roy-and-wobbly-numbers	"You are given a binary matrix A of size n × n. Let's denote an x-compression of the given matrix a(...TRUNCATED)	{"input":["100\n5\n48 141 231 314 425\n7\n0 19\n50 98\n143 30\n231 55\n342 0\n365 100\n600 10","180\(...TRUNCATED)	{"input":["2 313 856 964 421\n","61 464 623 89 548\n","37 261 207 1 1000\n","4 202 512 995 375\n","3(...TRUNCATED)	{"input":["10\n100000000 200000000 300000000 28 500000000 600000000 700000000 800000000 900000000 10(...TRUNCATED)	2	7	{"language":[3,3,3,1,2,3,1,4,3,4,3,2,3,2,4,4,3,4,1,1,1,3,3,3,3,1,3,1,1,4,4,3,3,4,4,4,4,3,4,3,4,3,3,1(...TRUNCATED)	{"language":[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,4,2,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2(...TRUNCATED)	0		1,000	1,400	[ "greedy", "strings" ]	false		{ "nanos": 0, "seconds": 2 }	0
1110_E. Magic Stones	"Find the number of ways to divide an array a of n integers into any number of disjoint non-empty se(...TRUNCATED)	{ "input": [ "4\n1 3 2 4\n" ], "output": [ "1 1\n-1\n2 4\n9 6 12 \n1 4\n0 -12 -8 -16 \n" ] }	{ "input": [], "output": [] }	{"input":["3\n6 5 15","3\n4 4 2","3\n4 3 1","3\n4 4 5","3\n4 8 2","3\n8 8 2","3\n4 4 1","3\n4 4 4","(...TRUNCATED)	2	7	{"language":[2,3,4,2,2,3,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,3,2,2,3,2,2,2,3,2,3,2,3,4,1,2,3(...TRUNCATED)	{"language":[2,4,2,2,4,2,2,2,2,2,4,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,4,2,2,2,4,2,2(...TRUNCATED)	1,304		500	2,800	[]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
donuts	"You've got array A, consisting of n integers and a positive integer k. Array A is indexed by intege(...TRUNCATED)	{ "input": [ "4 2\n1 2\n2 3\n", "3 3\n1 2\n2 3\n1 3\n" ], "output": [ "3\n1 3 4 \n1\n2 ", "-1" ] }	{"input":["80\n72 66 82 46 44 22 63 92 71 65 5 30 45 84 29 73 9 90 25 19 26 15 12 29 33 19 85 92 91 (...TRUNCATED)	{ "input": [], "output": [] }	2	0	{"language":[3,3,4,4,4,2,4,4,4,4,2,4,2,4,4,3,4,4,4,3,3,3,2,4,4,4,3,4,4,2,1,2,4,4,4,3,2,3,3,4,2,4,3,4(...TRUNCATED)	{"language":[2,3,4,4,3,2,2,2,3,3,2,3,4,4,1,3,2,4,2,4,1,3,2,3,2,3,3,4,3,3,4,2,3,2,2,4,4,4,4,3,3,2,4,3(...TRUNCATED)	754	B	500	3,400	[ "games", "geometry", "math" ]	false	"JOI 君が住む都市にはN 個の駅があり，それぞれ1, 2, ..., N の番号が付けら(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	0
xenny-and-range-sums	"Utkarsh is forced to play yet another one of Ashish's games. The game progresses turn by turn and a(...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": [ "1\n1\n1\n1\n1 1 1 1\n" ], "output": [ "1\n" ] }	{ "input": [], "output": [] }	5	12	{"language":[1,1],"solution":["t = int(raw_input())\n\nd = {}\n\nfor i in range(t):\n\t\n\ts = raw_i(...TRUNCATED)	{"language":[4,2,2,2,1,2,1,3,2,4,3,4,2,4,2,2,2,2,4,3,4,4,4,2,2,4,1,4,4,4,2,4,2,4,2,2,2,2,3,1,2,2,2,4(...TRUNCATED)	0	D	2,250	0	[ "dp", "implementation", "sortings" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1320_F. Blocks and Sensors	"The Chef likes to stay in touch with his staff. So, the Chef, the head server, and the sous-chef al(...TRUNCATED)	{ "input": [ "5\n5\n3\n2\n1\n4\n6\n1\n2\n3\n4\n5\n6\n3\n3\n2\n1\n0" ], "output": [ "7\n0\n3" ] }	{"input":["51\n8 10 Chandu\n2 2959 Daspal\n2903 6 Chandu\n9 2938 Daspal\n10 2907 Daspal\n8 2966 Dasp(...TRUNCATED)	{"input":["0.2 0.1 1.448460702857607\n","1.0 200.44854766953543 1.0\n","0.3 1.3846300094261417 0.6\n(...TRUNCATED)	2	11	{"language":[2,2,2,2,2,2,4,4,4,2,4,2,1,4,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2,4,2,4,2,4,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,2,4,2,2,2,2,2,2,1,4,2,2,2,2,1,4,2,2,3,2,2,2,2,2,2,4,2,2,2,1,2,1,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED)	483		0	0	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	0
p01691 Disappear Drive	"Takahashi is locked within a building.\n\nThis building consists of H×W rooms, arranged in H rows (...TRUNCATED)	{ "input": [ "4\n7 2 4 12\n7 15 10 12\n", "3\n4 4 4\n1 2 3\n" ], "output": [ "Yes\n", "No\n" ] }	{ "input": [], "output": [] }	{"input":["6 4 2\n100110\n","4 2 1\n1001\n","64 40 7\n1010011100101100101011000001000011110111011011(...TRUNCATED)	3	11	{"language":[3,3,4,2,1,3,2,3,4,3,2,4,3,3,3,3,3,3,3,1,3,3,3,1,3,2,3,2,3,3,3,1,3,1,1,1,1,4,1,3,2,3,3,3(...TRUNCATED)	{ "language": [], "solution": [] }	0		0	1,500	[ "constructive algorithms", "greedy", "implementation", "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000