Datasets:

TheFactoryX
/

edition_1515_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	time_limit dict	memory_limit_bytes int64 0 1.07B
925_E. May Holidays	"Sherlock Holmes and Dr. Watson played some game on a checkered board n × n in size. During the gam(...TRUNCATED)	{"input":["6 3\n2 1\n2 6\n4 2\n5 6\n2 3\n","8 4\n2 6\n2 7\n7 8\n1 2\n3 1\n2 4\n7 5\n"],"output":["1 (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["2\n1 20\n","10\n450661 128600 993228 725823 293549 33490 843121 528432 556169 448234\n","(...TRUNCATED)	3	10	{"language":[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>\nu(...TRUNCATED)	{"language":[2,2,2,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,1,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	19	A	0	1,900	[ "greedy" ]	false	null	0
new-world-11	"Problem:\n\nRani and Nandu decide to play a number game. Both play alternately, Rani playing the fi(...TRUNCATED)	{ "input": [ "6\n5 2 4 6 1 3", "6\n5 6 4 2 1 3" ], "output": [ "1 2 3 4 5 6\n3", "1 2 3 4 5 6\n4" ] }	{"input":["36\n2 2 2 8 9 4 8 5\n9 1 7 6 10 6 9 3\n10 2 4 6 6 2 1 1\n9 6 2 3 5 7 7 3\n6 6 3 9 10 9 1 (...TRUNCATED)	{"input":["xxoo\no.oo\nx...\nx..x\n","oo.x\nxo.o\nxx.o\n.oxx\n","xo..\nxo.x\no.xo\nxoox\n","..ox\n..(...TRUNCATED)	2	9	{"language":[2,4,3,2,3,2,2,3,2,3,4,3,2,3,3,2,2,2,2,2,2,4,2,4,3,4,3,2,2,2,2,2,2,3,3,3,3,3,2,3,2,3,4,3(...TRUNCATED)	{ "language": [], "solution": [] }	0	A	0	0	[ "constructive algorithms", "dfs and similar", "dp", "greedy", "trees" ]	false	null	256,000,000
donuts	"Garfield the cat likes candies A LOT. He always keeps a huge stock of it at his home. Today John, h(...TRUNCATED)	{"input":["2\n1000000 1000000\n","6\n5 1 2 4 6 3\n","5\n1 5 7 8 2\n"],"output":["1000000\n","0\n","0(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	11	{"language":[2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,4,2,2,2,4,2,2,2,4,2,4,2,2,2,2,2,2,4,2,2,2,4,2,2,2,2,4,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,366		0	2,600	[ "binary search", "dsu", "graphs", "shortest paths", "trees" ]	false	{ "nanos": 0, "seconds": 4 }	268,435,456
p02117 Picnic	"Let's denote a function \n\n<image>\n\nYou are given an array a consisting of n integers. You have (...TRUNCATED)	{"input":["10\n","3\n"],"output":["1 2 3 4 5 6 7 8 9 \n2 4 6 8 10 12 14 16 18 \n3 6 9 1(...TRUNCATED)	{"input":["20 101 100\n1 14 20 3 19 10 12 18 4 17 13 6 8 5 2 15 7 16 9 11\n69 53 101 100 41 38 63 84(...TRUNCATED)	{"input":["100 10\nigffabeaiaajhjaghjgfjcchheeigjhibadbbhdhcjiibhjjhbhcgidfebhbbjjgbjiafeffihjbeaidg(...TRUNCATED)	2	17	{"language":[4,2,1,3,3,3,2,3,3,3,3,3,2,4,4,3,3,4,4,2,4,3,1,4,2,3,3,3,3,4,4,2,3,4,2,3,2,1,3,2,3,4,4,2(...TRUNCATED)	{"language":[2,2,2,4,2,4,2,2,2,4,2,4,4,4,2,2,4,4,2,4,2,2,4,2,4,4,2,2,2,4,4,2,2,2,2,2,4,2,2,2,2,2,4,4(...TRUNCATED)	1,117	D	3,000	3,400	[ "dp", "implementation" ]	false	{ "nanos": 0, "seconds": 3 }	256,000,000
1420_D. Rescue Nibel!	"After playing Neo in the legendary \"Matrix\" trilogy, Keanu Reeves started doubting himself: maybe(...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":["4\n6\na b c d\nA\nThomas a\nd d\ned edgars\nal Adams\n1\nTurnipHeadJohnson\n3\na a a a a (...TRUNCATED)	6	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,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,2,4,3,2,2,3,4,2,4,3,3,3,4,2,2,4,3,4,2,2,2,3,4,2,2,2,2,4,3,4,2,2,4,2,2,4,3,2,3,4,2,2,2(...TRUNCATED)	720	D	0	3,200	[ "bitmasks", "brute force", "data structures", "string suffix structures", "strings" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
give-me-my-test-monk	"problem\n\nGiven $ N $ different natural numbers $ a_i $. I decided to make a pair by choosing a di(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["20 20\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n","10 4\n0 1 4 2 7 0 10 0 5 8\n","10 7\n1(...TRUNCATED)	{"input":["25\n91 57\n2 73\n54 57\n2 57\n23 57\n2 6\n57 54\n57 23\n91 54\n91 23\n57 23\n91 57\n54 2\(...TRUNCATED)	2	0	{"language":[2,2,4,2,2,2,3,4,2,2,2,4,2,4,2,3,2,2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,3,2,3(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,4,2,2,2,4,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(...TRUNCATED)	985		2,000	0	[]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1007_E. Mini Metro	"Everybody knows that we have been living in the Matrix for a long time. And in the new seventh Matr(...TRUNCATED)	{"input":["7\nC is A’s father’s brother’s son’s aunt\nC is A’s mother’s brother’s son(...TRUNCATED)	{"input":["xkbvkadjec gqjlhxpnsx 10\n2 7 1 0 0\n2 5 8 0 0\n4 7 8 0 4\n0 4 7 3 6\n5 5 9 3 7\n7 9 5 0 (...TRUNCATED)	{"input":["341143514535\n158\n143565553551655311343411652235654535651124615163\n551544654451431564\n(...TRUNCATED)	2	8	{"language":[2,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\nusing namespace std;\n\(...TRUNCATED)	{ "language": [], "solution": [] }	361	A	1,250	1,500	[ "math" ]	false	null	1,073,741,824
p02260 Selection Sort	"Two friends are on the coordinate axis Ox in points with integer coordinates. One of them is in the(...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":["9 12\n1 2\n2 3\n4 5\n5 6\n6 7\n7 8\n1 4\n4 7\n2 5\n5 8\n3 6\n6 9\n","5 4\n2 1\n3 2\n4 3\n(...TRUNCATED)	{"input":["13372 2590 2818\n","78 28 44\n","9178 2255 2041\n","6571 10325 8965\n","6151 6148 1348\n"(...TRUNCATED)	3	12	{ "language": [], "solution": [] }	{"language":[2,0,3,3,2,2,3,2,3,2,3,2,3,3,2,3,2,0,2,4,2,3,2,3,3,0,2,2,2,2,2,2,0,0,2,3,0,2,2,2,2,3,2,2(...TRUNCATED)	578		250	2,300	[ "brute force" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
295_D. Greg and Caves	"Igor is a post-graduate student of chemistry faculty in Berland State University (BerSU). He needs (...TRUNCATED)	{"input":["4\n3 3\n1 2\n2 3\n3 1\n3 6\n1 2\n2 1\n2 3\n3 2\n1 3\n3 1\n7 10\n1 2\n2 3\n3 1\n1 4\n4 5\n(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["51 89 97\n18 25 63\n41 91 74\n","1 100 1\n100 100 000\n1 100 100\n","2 10 29\n1 1 43\n1 1(...TRUNCATED)	2	7	{"language":[3,2,4,1,1,3,4,2,3,4,2,2,3,2,4,3,2,2,1,2,3,2,3,4,3,3,3,3,4,3,3,1,2,3,3,3,2,2,3,3,2,3,3,2(...TRUNCATED)	{"language":[0,2,2,0,2,2,2,0,2,0,2,2,2,2,2,0,0,2,3,2,0,2,2,0,0,2,4,2,2,2,2,2,2,2,2,0,2,0,2,0,2,2,1,0(...TRUNCATED)	954	G	0	0	[ "" ]	true	null	256,000,000
1030_E. Vasya and Good Sequences	"Disclaimer: there are lots of untranslateable puns in the Russian version of the statement, so ther(...TRUNCATED)	{ "input": [ "1 1 1 4 4\n", "2 0 0 0 4\n", "4 5 6 5 6\n" ], "output": [ "3\n", "1\n", "0\n" ] }	{"input":["3\n3 2 3\n","3\n1 3 1\n","5\n1 1 2 1 1\n","5\n1 1 1 1 2\n","4\n562617869 562617869 562617(...TRUNCATED)	{"input":["20\n............./.\n","97\n.**..**..*....*..**..............(...TRUNCATED)	2	0	{"language":[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 gcd(a,b):\n\tif b==0:\n(...TRUNCATED)	{"language":[2,2,2,4,2,4,2,2,4,2,2,2,2,4,2,4,2,2,2,4,2,2,2,4,2,2,2,4,2,4,4,2,2,3,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0		0	0	[ "dfs and similar", "graphs" ]	true	{ "nanos": 0, "seconds": 2 }	256,000,000