Datasets:

TheFactoryX
/

edition_3043_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
867_D. Gotta Go Fast	Bob came to a cash & carry store, put n items into his trolley, and went to the checkout counter to pay. Each item is described by its price ci and time ti in seconds that a checkout assistant spends on this item. While the checkout assistant is occupied with some item, Bob can steal some other items from his trolley. ...	{ "input": [ "5\n1 4 3 5 2", "9\n1 2 4 9 5 8 7 3 6", "2\n1 2", "2\n2 1" ], "output": [ "2", "3", "1", "0" ] }	{ "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 3 1 6 9\n", "213 480 811 134 745\n", "1 10 2 6 10\n", "6 5 7 10 4\n", "2 7 6 2 3\n", "29 344 406 900 1\n", "1 2 8 8 5\n", "1 1 1 1 1\n", "424 41 41 909 909\n"...	{ "input": [ "3 4\n5 6\n3 3\n2 2\n1 0\n0 0", "3 7\n5 6\n3 3\n2 2\n1 0\n0 0", "3 7\n5 6\n3 0\n2 2\n1 0\n0 0", "6 7\n5 6\n3 0\n2 2\n1 0\n0 0", "6 11\n5 6\n3 0\n2 2\n1 0\n0 0", "3 4\n5 6\n2 3\n2 2\n1 1\n0 0", "3 4\n5 6\n3 3\n2 4\n1 0\n0 0", "3 7\n5 6\n4 3\n2 2\n1 0\n0 0", "3 7\n5 5\n3...	2	9	{ "language": [ 1 ], "solution": [ "testcase = raw_input();\ntc = int(testcase)\n\nwhile (tc > 0):\n\t\n\tflames = \"FLAMES\"\n\t#flames[0] = 'X'\n\t\n\tname1=list((raw_input()).replace(' ',''))\n\tname2=list((raw_input()).replace(' ',''))\n\t\n\t\n\t#ht = {}\n\t\n\tcount =0\n\tcount1 = 0\n\t\n\ti=0\n\tw...	{ "language": [], "solution": [] }	663	D	1,000	2,500	[ "binary search", "brute force", "geometry", "math" ]	false	{ "nanos": 0, "seconds": 3 }	256,000,000
820_D. Mister B and PR Shifts	"Lee tried so hard to make a good div.2 D problem to balance his recent contest, but it still doesn'(...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":["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":["2 8","9 5","7 10","3 8","9 8","7 7","6 8","7 9","7 8","7 3","7 2","9 2","9 4","9 6","5 6"(...TRUNCATED)	1	0	{ "language": [], "solution": [] }	{"language":[4,2,4,4,2,2,1,1,4,3,2,3,3,2,2,2,2,4,4,2,2,4,2,2,2,1,2,2,4,2,2,4,2,2,4,2,2,4,2,2,2,4,4,4(...TRUNCATED)	0	B	1,500	0	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	268,435,456
mind-palaces-3	"You are given an equation: \n\nAx2 + Bx + C = 0. \n\nYour task is to find the number of distinct ro(...TRUNCATED)	{"input":["1 1\n4 10 0 0 10 0 10 10 0 10\n-5 -20 30 15\n135 45\n0 -15 15 0\n0 0"],"output":["11.213"(...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	11	{"language":[2,2,2,4,2,2,2,3,2,4,4,2,2,4,4,4,2,3,3,2,2,4,2,2,2,2,2,2,2,2,4,4,2,4,2,4,4,4,2,4,4,2,2,2(...TRUNCATED)	{"language":[3,2,1,2,3,2,2,3,4,2,2,2,2,3,2,2,2,2,4,2,4,2,2,2,3,3,2,2,3,4,4,4,1,4,2,2,3,2,4,2,2,2,4,4(...TRUNCATED)	0	A	0	0	[ "implementation" ]	false	null	0
max-min	"You are given an integer x represented as a product of n its prime divisors p_1 ⋅ p_2, ⋅ … (...TRUNCATED)	{"input":["3 3 2\n1 2 3\n1 2 3\n1 2 3\n1 2\n3 3\n","4 5 4\n1 4 5 1 2\n2 2 2 2 7\n2 4 1 4 5\n3 2 1 7 (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["5\n2 2 4 7 10","5\n1 2 22 7 0","5\n1 2 4 3 10","5\n0 2 3 7 1","5\n0 2 1 7 1","5\n1 2 4 3 (...TRUNCATED)	5	8	{"language":[2,2,4,2,2,2,2,2,2,2,2,2,2,4,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(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,0,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(...TRUNCATED)	0	A	500	1,000	[]	false	null	1,073,741,824
530_C. Diophantine equation	"For a given polygon g, print \"1\" if g is a convex polygon, \"0\" otherwise. Here, in a convex pol(...TRUNCATED)	{ "input": [ "1\n100000 2", "3\n2 1\n1 3\n2 2" ], "output": [ "100002 0", "3 0\n5 0" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	5	0	{"language":[2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,4,2,2,4,4,2,2,2,2,2,2,1,4,2,2,4,2,2,2,2,2,2,2,4,2,2,2,3,2,2,2,3,2,3,2,2,2,2,2(...TRUNCATED)	0	C	0	0	[ "*special" ]	false	null	256,000,000
283_D. Cows and Cool Sequences	"You are given three sequences: a_1, a_2, …, a_n; b_1, b_2, …, b_n; c_1, c_2, …, c_n.\n\nFor e(...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":["1 3 0\n6 3 4\n","5 4 32\n4 2 1 1\n","32 6 635\n3 4 2 1 7 7\n","3 7 20012\n1 1 1 1 1 1 100(...TRUNCATED)	{"input":["10 10\n4 5 6 7 8 11 14 15 17 19\n1 4 12 10 13 20 14 20 13 16\n-7 16\n1 1\n7 9\n1 4\n4 8\n(...TRUNCATED)	2	6	{"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":[4,2,3,2,4,2,2,4,4,2,2,2,1,2,2,2,4,2,3,4,2,4,2,4,2,4,2,1,2,3,2,2,2,1,4,3,2,4,2,2,4,4,2,2(...TRUNCATED)	277	C	0	2,200	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	1,073,741,824
582_A. GCD Table	"A certain business maintains a list of all its customers' names. The list is arranged in order of i(...TRUNCATED)	{ "input": [ "3\nSdfgAe\nOut\nGet\n\nSAMPLE" ], "output": [ "Ae\nOu\ne\n" ] }	{ "input": [], "output": [] }	{"input":["10\n3\n-15 -33 79\n16\n45 -84 19 85 69 -64 93 -70 0 -53 2 -52 -55 66 33 -60\n2\n14 -2\n4\(...TRUNCATED)	1	10	{"language":[2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[1,2,2,2,2,2,2,2,4,4,2,4,2,2,4,2,4,2,2,2,2,4,4,2,3,2,4,2,2,2,4,2,2,2,3,4,4,2,2,2,4,4,4,3(...TRUNCATED)	1,391	F	2,000	1,900	[ "games", "math" ]	false	{ "nanos": 0, "seconds": 2 }	268,435,456
168_A. Wizards and Demonstration	"Print the K-th element of the following sequence of length 32:\n\n\n1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1(...TRUNCATED)	{ "input": [ "3\n2 3 3\n", "4\n0 1 2 3\n", "6\n5 2 0 5 2 1\n" ], "output": [ "0\n", "10\n", "53\n" ] }	{"input":["50 1\n50 8 46 9 12 38 41 18 49 10 23 15 16 3 13 17 48 8 31 32 6 31 31 49 9 40 9 21 23 41 (...TRUNCATED)	{"input":["6 2 3 1","7834164883628 15 2189823423122 7725883688276","4 2 1 4","7 1 3 2","4 3 3 1","4 (...TRUNCATED)	2	10	{"language":[3,3,3,4,2,3,3,4,2,3,2,4,4,4,4,4,3,4,4,2,2,3,4,4,2,2,3,2,4,3,3,4,2,2,3,2,3,4,3,2,3,4,3,3(...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)	875	E	0	2,000	[ "dp" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1334_D. Minimum Euler Cycle	"Kevin Sun has just finished competing in Codeforces Round #334! The round was 120 minutes long and (...TRUNCATED)	{"input":["2 1\n1 2\n","3 3\n1 2\n1 3\n2 3\n"],"output":["1\n1 \n1 2 0\n","0\n\n1 2 0\n1 3 2\n2 3 1\(...TRUNCATED)	{"input":["7\n","2000000000000000000\n","1000000000000000000\n","987654321012345678\n"],"output":["2(...TRUNCATED)	{"input":["1 100000 100000 110000 -100000\n","46456 -250 -23623 -98302 -99305\n","10 6 3 7 2\n","1 -(...TRUNCATED)	6	11	{"language":[2,2,2,3,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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	161	E	0	2,100	[ "combinatorics", "math", "number theory" ]	false	{ "nanos": 500000000, "seconds": 0 }	256,000,000
223_C. Partial Sums	"Coach Ankit is forming a team for the Annual Inter Galactic Relay Race. He has N students that trai(...TRUNCATED)	{ "input": [ "3\n3 1 0\n1 2 3\nXOR\n3 1 0\n1 2 3\nAND\n3 1 0\n1 2 3\nOR" ], "output": [ "0\n0\n3\n" ] }	{ "input": [], "output": [] }	{"input":["1\n474 314 18260\n","1\n315 315 553688\n","1\n316 314 52289\n","1\n516 5 6571\n","1\n402 (...TRUNCATED)	3	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": [], "solution": [] }	962	F	0	0	[ "dfs and similar", "dsu", "graphs" ]	false	{ "nanos": 0, "seconds": 3 }	256,000,000