Datasets:

TheFactoryX
/

edition_2732_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
p00950 Infallibly Crack Perplexing Cryptarithm	"Ilya is an experienced player in tic-tac-toe on the 4 × 4 field. He always starts and plays with X(...TRUNCATED)	{"input":["5 6 5\n5 4 86\n5 1 0\n1 3 38\n2 1 33\n2 4 28\n2 3 40\n3 5\n2 6\n1 3\n2 3\n1 6\n"],"output(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["5\n2 1\n5 2\n10 3\n25 4\n25479 33\n","5\n2 1\n9 1\n10 3\n25 4\n25479 33\n","5\n1 1\n9 1\n(...TRUNCATED)	6	6	{"language":[3,4,3,3,3,2,3,3,1,3,3,2,2,2,1,3,4,2,3,3,2,3,3,3,3,3,3,2,3,3,4,3,1,4,3,3,3,3,4,3,3,3,3,3(...TRUNCATED)	{"language":[2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,0,2,2,2,2,2,3,2,2,4,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	272	E2	0	1,400	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1149_E. Election Promises	"There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on(...TRUNCATED)	{"input":["2 3\n1 2\n1 2\n1 2\n","5 7\n2 4\n5 1\n2 3\n3 4\n4 1\n5 3\n3 5\n"],"output":["5 6 ","10 9 (...TRUNCATED)	{"input":["10 1\n1 1 1 1 1 1 1 1 1 1\n","3 57\n78 165 54\n","1 1\n10000\n","2 2\n2 2\n","9 13\n132 8(...TRUNCATED)	{"input":["5 7\n2 2\n2 3\n3 4\n1 5\n2 5\n3 5\n4 5\n","4 0\n","6 9\n1 2\n1 4\n1 5\n2 6\n2 5\n2 6\n3 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,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,3,2,2,3,0,3,2,2,2,2,2,2,3,2,2,2,4,2,2,2,2,2,2,3,3,3,2,4,2,4,3,3,2,3,2,0,2,2,2,3,2,2,3(...TRUNCATED)	1,334		0	2,600	[ "" ]	false	{ "nanos": 0, "seconds": 4 }	256,000,000
p01262 Adaptive Time Slicing Quantization	"We have caught N sardines. The deliciousness and fragrantness of the i-th sardine is A_i and B_i, r(...TRUNCATED)	{ "input": [ "14 3 2012" ], "output": [ "Wednesday" ] }	{"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)	{"input":["100\n303\n5","100\n256\n5","100\n407\n5","100\n407\n2","100\n407\n3","100\n407\n6","100\n(...TRUNCATED)	6	0	{"language":[2,4,2,2,2,2,2,4,4,2,2,4,2,2,2,3,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2],"solution":["#include <bits/stdc++.h>\nint main() {\n std::priority_queue<std(...TRUNCATED)	1,117	G	0	2,500	[ "constructive algorithms", "implementation" ]	false	{ "nanos": 0, "seconds": 2 }	1,073,741,824
1424_N. BubbleSquare Tokens	"Polycarp plays a well-known computer game (we won't mention its name). In this game, he can craft t(...TRUNCATED)	{ "input": [ "2\n11 3\n4 3 4\n6 3\n3 2 1" ], "output": [ "2\n1\n" ] }	{"input":["1\n2 2\n1 1\n1 2\n","1\n1 3\n3\n1 2 3\n","1\n1 1\n1000\n1000\n","1\n2 2\n2 2\n2 2\n","5\n(...TRUNCATED)	{ "input": [], "output": [] }	2	11	{"language":[2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,3,2,2,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,0,2,2,4,2,2,2,2,0,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,0(...TRUNCATED)	1,451		0	2,100	[]	false	{ "nanos": 0, "seconds": 1 }	268,435,456
188_G. Array Sorting	"KM country has N kinds of coins and each coin has its value a_i.\n\nThe king of the country, Kita_m(...TRUNCATED)	{ "input": [ "3\n5\n7\n10\n\nSAMPLE" ], "output": [ "2\n3\n5\n" ] }	{"input":["1\n1\n","100\n98 52 63 2 18 96 31 58 84 40 41 45 66 100 46 71 26 48 81 20 73 91 68 76 13 (...TRUNCATED)	{ "input": [], "output": [] }	2	7	{"language":[2,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,4,3,2,3,3,3,3,3,2,3,3,3,3,4,4,3,3,2,3,3,3,3,3,3,2,3,3,3(...TRUNCATED)	{"language":[2,2,2,2,2,4,2,2,2,2,0,2,2,0,0,2,2,2,4,2,2,0,2,4,3,2,2,2,4,2,2,3,2,2,0,0,2,2,2,2,2,0,2,2(...TRUNCATED)	0		0	0	[ "binary search", "constructive algorithms", "graphs", "shortest paths" ]	false	{ "nanos": 0, "seconds": 1 }	134,217,728
1065_F. Up and Down the Tree	"A prime number is a natural number which has exactly two distinct natural number divisors: 1 and it(...TRUNCATED)	{"input":["3\n4\nS010\n0001\n1000\n111F\n3\nS10\n101\n01F\n5\nS0101\n00000\n01111\n11111\n0001F\n"],(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1 10\n778084 -205153\n778001 -205093\n778155 -205118\n778168 -204997\n778066 -205141\n778(...TRUNCATED)	2	0	{"language":[3,4,3,4,3,2,2,3,3,3,4,3,3,2,3,2,1,2,3,3,2,3,3,2,4,4,4,2,3,3,3,3,3,4,3,3,2,3,3,3,2,3,3,4(...TRUNCATED)	{"language":[4,3,2,2,2,2,4,1,2,2,2,3,1,3,3,1,2,3,2,4,4,2,3,3,4,1,4,3,3,2,4,4,2,3,2,2,2,4,2,3,2,3,2,2(...TRUNCATED)	1,281	E	0	1,000	[ "constructive algorithms", "implementation" ]	false	{ "nanos": 0, "seconds": 1 }	1,073,741,824
385_A. Bear and Raspberry	"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":["pozdravstaklenidodiri\nniste\ndobri\n","aaa\na\nb\n","abbbaaccca\nab\naca\n"],"output":["(...TRUNCATED)	{"input":["3 1\n-2 3\n-2 -2\n","-8916 9282\n2666 2344\n9109 -2730\n","0 45\n42 -47\n-51 -82\n","45 6(...TRUNCATED)	{"input":["10 7\n3 4\n8 6\n7 8\n3 1\n9 10\n10 6\n9 4\n","10 16\n9 8\n1 2\n9 5\n5 4\n9 2\n3 2\n1 6\n5(...TRUNCATED)	6	0	{"language":[2,3,2,3,2,4,3,2,3,2,3,4,3,2,3,3,3,4,2,4,2,2,2,3,4,4,2,2,1,3,2,3,1,4,3,2,4,2,4,2,2,4,3,3(...TRUNCATED)	{"language":[2,0,3,0,2,3,3,3,3,3,3,3,3,3,3,2,2,0,2,3,2,2,1,2,0,2,0,2,3,0,2,3,3,2,2,0,3,2,0,3,3,2,2,3(...TRUNCATED)	1,328	D	0	1,900	[ "data structures", "string suffix structures" ]	false	{ "nanos": 0, "seconds": 2 }	268,435,456
784_B. Kids' Riddle	"One day Polycarpus stopped by a supermarket on his way home. It turns out that the supermarket is h(...TRUNCATED)	{"input":["3 3\n0 0 0 1\n0 2 2 2\n3 3 2 3\n12\n0 0 L 0\n0 0 L 1\n0 0 L 2\n0 0 L 3\n0 0 L 4\n0 0 L 5\(...TRUNCATED)	{ "input": [ "1\n999838675\n" ], "output": [ "-1\n" ] }	{"input":["1000\n999001\n999002\n999003\n999004\n999005\n999006\n999007\n999008\n999009\n999010\n999(...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,1,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,466		0	0	[ "brute force", "dp", "math", "number theory" ]	false	null	1,073,741,824
p02613 AtCoder Beginner Contest 173 - Judge Status Summary	"Integer factorisation is hard. The RSA Factoring Challenge offered $100 000 for factoring RSA-1024,(...TRUNCATED)	{"input":["5 5 13 0 4\n0 1 5\n2 1 2\n3 2 3\n1 4 0\n4 3 4\n","2 1 123456789 0 1\n0 1 0\n","2 1 999999(...TRUNCATED)	{"input":["6\nbabcdc\n","5\nbadec\n","3\naba\n","7\nbaaaccb\n","3\naaa\n","4\npara\n","3\nbac\n","7\(...TRUNCATED)	{"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)	6	0	{"language":[2,4,2,2,4,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,4,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,3,4,1,2,4,3,2,2,4,4,4,1,4,4,3,4,3,4,1,2,2,4,4,2,3,4,2,4,2,4,2,2,4,2,4,3,2,2,4,4,2,4,2(...TRUNCATED)	0		2,000	0	[ "binary search", "brute force", "chinese remainder theorem", "math", "number theory" ]	false	{ "nanos": 0, "seconds": 5 }	536,870,912
478_A. Initial Bet	"You are given an array A of size N, and Q queries to deal with. For each query, you are given an in(...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":["30 35 4 30\n14 2 7\n22 23 2\n5 26 3\n28 4 3\n7 5 29\n19 15 2\n11 20 12\n1 22 9\n30 21 24\(...TRUNCATED)	{"input":["6\nbabddc\n","7\nbd`dccd\n","2\nab\n","7\nxxyzyyy\n","6\naagcfb\n","7\nbbbcdbc\n","4\npbr(...TRUNCATED)	2	11	{"language":[3,2,4,2,2,2,2,4,3,2,2,3,2,1,4,2,4,3,4,4,2,1,4,3,2,3,4,2,3,4,2,2,4,4,2,2,4,3,3,2,4,3,4,2(...TRUNCATED)	{"language":[4,4,4,4,3,2,2,2,1,2,2,2,2,4,4,2,2,4,2,4,4,2,2,3,2,1,3,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	87		0	0	[ "implementation" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000