Datasets:

TheFactoryX
/

edition_2231_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
846_B. Math Show	There are N cities in Republic of AtCoder. The size of the i-th city is A_{i}. Takahashi would like to build N-1 bidirectional roads connecting two cities so that any city can be reached from any other city by using these roads. Assume that the cost of building a road connecting the i-th city and the j-th city is \|i-j...	{ "input": [ "3 1\n1 100 1", "12 5\n43 94 27 3 69 99 56 25 8 15 46 8", "3 1000\n1 100 1", "6 14\n25 171 7 1 17 162" ], "output": [ "106", "658", "2202", "497" ] }	{ "input": [ "78 78\n-645462 -187679 693035 927066 431506 16023 -173045 698159 -995400 -687770 -747462 789670 862673 385513 579977 -156856 22209 378002 930156 353000 67263 -758921 572468 562437 125912 -422101 -513624 43409 25348 -214377 808094 -88292 293865 910587 -731480 -509056 901506 -374951 -135921 866114 660...	{ "input": [ "3\n1\n0 1\n0 -1\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1", "3\n2\n0 1\n0 -1\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1", "3\n2\n0 -1\n0 -1\n1 0\n2\n0 0\n0 0\n1 0\n2\n1 0\n1 2\n2 1", "3\n2\n0 -1\n-1 -1\n2 0\n2\n1 0\n0 -1\n1 -1\n2\n1 0\n1 2\n1 1", "3\n2\n0 -1\n0 -1\n2 0\n2\n2 0\n0 -1\n1 ...	5	7	{ "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, 1, 1, 1, 1, 1, 1, 1, ...	{ "language": [], "solution": [] }	962	B	2,000	2,000	[ "implementation", "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1291_E. Prefix Enlightenment	"Chef has a an array A consisting of N elements. He wants to add some elements into the array as per(...TRUNCATED)	{"input":["? - ? = 1\n","? + ? - ? + ? + ? = 42\n","? = 1000000\n"],"output":["Impossible\n","Possib(...TRUNCATED)	{"input":["5\n81 125 16\n19683 15625 8192\n59049 15630 32768\n59050 78125 131072\n177147 390625 1310(...TRUNCATED)	{"input":["19 23\nU..U..R........L...D...\n.D.....UL.U.U........DR\n..D.U..D....L......R...\nD......(...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,4,2,2,2,2,2,4,2,2,2,2,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,065	C	1,500	1,500	[ "dp" ]	false		{ "nanos": 0, "seconds": 1 }	0
ankit-and-race-team-10	"Disclaimer: there are lots of untranslateable puns in the Russian version of the statement, so ther(...TRUNCATED)	{ "input": [ "2\n\nSAMPLE" ], "output": [ "3\n" ] }	{ "input": [], "output": [] }	{"input":["10 1000000\n1 2 3 4 8 5 6 7 8 9\n","13 666\n84 89 29 103 128 233 190 122 117 208 119 97 3(...TRUNCATED)	2	0	{"language":[4,4,4,4,2,1,3,1,3,4,4,2,3,4,3,4,4,1,3,2,4,2,2,2,3,4,1,2,2,2,2,2,2,4,4,2,4,4,1,4,3,1,2,4(...TRUNCATED)	{"language":[3,4,3,3,2,3,3,3,3,2,3,3,4,2,2,2,2,4,3,3,2,4,2,3,4,2,4,4,2,3,2,3,4,2,4,2,2,4,3,2,3,2,2,4(...TRUNCATED)	1,311	B	500	0	[ "graphs" ]	false		{ "nanos": 0, "seconds": 4 }	256,000,000
1334_A. Level Statistics	"There are N+1 lights. Lights are placed at (0, 0), (1, 0), (2, 0) ... (N, 0). Initially all the li(...TRUNCATED)	{ "input": [ "3\n2 3 3" ], "output": [ "2" ] }	{"input":["10 1000000\n1 2 3 4 84 5 6 7 8 9\n","1 1\n3\n","13 666\n84 89 29 103 128 233 190 122 117 (...TRUNCATED)	{"input":["11\nadd 1\nsum\nadd 2\nsum\nadd 3\nsum\nadd 4\nsum\nadd 6\nsum\nadd 6\n","6\nadd 4\nadd 7(...TRUNCATED)	1	9	{"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],"solution":["t = int(raw_input())\nf(...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],"solution":["#include <bits/stdc++.h(...TRUNCATED)	0		0	1,900	[ "" ]	false	"機械に辺・対角線の長さのデータを入力し、プラスティック板の型抜きを(...TRUNCATED)	null	256,000,000
ism1	"Please note the non-standard memory limit.\n\nThere are n problems numbered with integers from 1 to(...TRUNCATED)	{"input":["3\n2\n1 5 10\n2 15 5\n3\n2 93 78\n1 71 59\n3 57 96\n19\n19 23 16\n5 90 13\n12 85 70\n19 6(...TRUNCATED)	{ "input": [ "aaaa a", "abcd cb", "a abab" ], "output": [ "4\n", "0\n", "0\n" ] }	{ "input": [], "output": [] }	2	0	{"language":[4,3,4,3,3,4,3,4,2,4,4,3,1,2,4,3,4,4,2,3,3,3,2,4,4,4,4,3,3,3,2,2,4,4,1,3,4,4,2,2,3,3,2,3(...TRUNCATED)	{"language":[2,2,2,2,2,4,3,3,2,4,2,2,2,2,2,2,2,2,2,4,2,3,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,4,2,2,3,2,2,2(...TRUNCATED)	1,211	C	0	0	[ "data structures", "implementation", "math" ]	false		{ "nanos": 0, "seconds": 5 }	536,870,912
1466_F. Euclid's nightmare	"Ilya is an experienced player in tic-tac-toe on the 4 × 4 field. He always starts and plays with X(...TRUNCATED)	{"input":["4 4\n1 2 1 10\n2 4 3 5\n1 3 1 5\n2 4 2 7\n","5 6\n1 2 1 10\n2 5 11 20\n1 4 2 5\n1 3 10 11(...TRUNCATED)	{"input":["1 100000 100000 100000 -100000\n","46456 -2621 -23623 -98302 -99305\n","9 20 0 40 0\n","1(...TRUNCATED)	{"input":["1 1\n-1\n","5 1\n-3 -2 -1 0 0\n","7 1\n-7 ? ? ? ? ? 2\n","3 2\n-5 ? 0\n","7 4\n-10 0 ? 1 (...TRUNCATED)	1	0	{"language":[3,4,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,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	464	D	0	800	[ "implementation" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
p01219 Private Teacher	"You're given an array a_1, …, a_n of n non-negative integers.\n\nLet's call it sharpened if and o(...TRUNCATED)	{"input":["3\n3 3 4\n3 3 5\n3 3 3\n"],"output":["**\n.\n\n\n\n.\n...\n\n*\n.\n*.\n\n(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["5\n2 8 1 7 9\n","4\n6 2 4 5\n","3\n3 1 3\n","200\n2 1 1 1 2 1 2 1 1 1 2 1 2 2 2 1 1 2 1 2(...TRUNCATED)	2	10	{"language":[1,1,2,2,2,2,2,2,2,3,2,4,4,2,2,2,2,4,2,2,2,2,2,2,4,2,4,1,4,2,2,2,2,2,4,2,4,4,4,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,3,2,4,3,2,2,2,2,2,2,3,4,2,2,2,0,2,0,2,2,2,2,2,3,2,2,2,2,2,0,2,2,2,2,2,2,4,2,1,1,3(...TRUNCATED)	0		500	1,200	[ "binary search", "brute force", "chinese remainder theorem", "math", "number theory" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1149_E. Election Promises	"Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits whe(...TRUNCATED)	{"input":["3\n5 2\n5 3\n7 0\n5 0\n4 0\n10 0\n2 1\n10 100\n50 10\n5 5\n1 5\n2 4\n3 3\n4 2\n5 1\n"],"o(...TRUNCATED)	{"input":["6\n396640239 62005863 473635171 329666981 510631133 207643327\n","4\n363034183 741262741 (...TRUNCATED)	{"input":["2 3\n1 1 0\n0 1 0","3 3\n0 1 0\n1 0 1\n0 1 -1","4 6\n1 0 1 1 0 1 \n0 0 1 1 1 1 \n1 1 1 1 (...TRUNCATED)	2	8	{"language":[1,3,4,3,4,4,3,1,3,2,1,2,3,4,3,2,1,1,4,4,3,3,3,3,4,2,3,3,4,3,1,2,3,3,4,3,3,3,2,2,4,3,4,4(...TRUNCATED)	{"language":[2,2,0,2,1,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,0,2,2,2(...TRUNCATED)	0		2,500	3,500	[]	false		{ "nanos": 0, "seconds": 2 }	134,217,728
p03986 AtCoder Grand Contest 005 - STring	"Peter got a new snow blower as a New Year present. Of course, Peter decided to try it immediately. (...TRUNCATED)	{ "input": [ "2 2 1 0 0 1\n", "2 2 10 11 0 1\n", "2 4 3 -1 3 7\n" ], "output": [ "1", "5", "2" ] }	{ "input": [], "output": [] }	{"input":["8\n0 1\n1 0\n0 1\n1 1\n0 0\n1 0\n0 1\n1 0\n","3\n0 1\n1 1\n1 0\n","8\n0 1\n1 1\n0 1\n1 1\(...TRUNCATED)	6	8	{"language":[3,4,2,3,4,4,4,2,3,4,3,2,4,3,4,3,4,3,2,4,2,4,2,3,4,4,2,4,4,4,3,3,4,4,3,2,4,4,3,3,4,4,3,2(...TRUNCATED)	{"language":[2,2,2,3,2,2,4,4,2,2,2,2,4,2,2,4,4,2,2,4,2,2,2,2,2,2,4,4,2,4,2,2,2,4,2,2,4,2,2,3,3,3,2,2(...TRUNCATED)	0	C	0	0	[]	false		{ "nanos": 0, "seconds": 3 }	0
626_D. Jerry's Protest	"You are given two arrays of integers a_1,…,a_n and b_1,…,b_m.\n\nYour task is to find a non-emp(...TRUNCATED)	{ "input": [ "5 1\nbacba", "10 2\nbbaabbbaab" ], "output": [ "aabca", "aaaabbaabb" ] }	{ "input": [], "output": [] }	{"input":["1\n4 5\n9 7 5 3\n8 6 4 1 0\n\nSAMPLE","1\n4 5\n9 7 5 3\n16 6 4 2 0\n\nSAMPLE","1\n4 5\n9 (...TRUNCATED)	2	2	{"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],"solution":["b=\"AEIOUaeiou\"\nt(...TRUNCATED)	{"language":[2,2,2,2,4,2,2,2,2,2,2,2,2,2,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,2,2,2(...TRUNCATED)	19		2,000	0	[ "dsu", "graphs", "trees" ]	false		{ "nanos": 0, "seconds": 2 }	64,000,000