Datasets:

TheFactoryX
/

edition_1009_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
1257_G. Divisor Set	"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": [ "777-444---21-12-2013-12-2013-12-2013---444-777\n" ], "output": [ "13-12-2013\n" ] }	{ "input": [], "output": [] }	{"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)	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,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED)	{"language":[3,2,2,1,2,4,2,2,2,2,2,3,2,3,3,4,3,2,4,1,4,2,2,2,2,1,2,2,2,2,2,4,2,2,2,2,2,4,2,4,2,2,4,3(...TRUNCATED)	630		2,750	1,900	[ "" ]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
494_A. Treasure	"This is the hard version of the problem. The difference between the versions is in the constraints (...TRUNCATED)	{"input":["3\n7 7 3 5\n1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 5\n4 5 2 3\n1 2\n2 3\n3 4\n4 1\n4 2\n4 3 2 1\(...TRUNCATED)	{"input":["6\n396640239 62005863 473635171 329666981 510631133 207643327\n","4\n363034183 741262741 (...TRUNCATED)	{"input":["2 3 3\n.#\nS.","7 8 2\n\n\n...##\n###S\n.#.##\n.###","7 7 2\n\n\n##...\nS###\n.#.##\n.###(...TRUNCATED)	5	0	{"language":[2,2,2,2,2,2,2,2,2,4,4,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,2,2,4,2,2,2,2,2(...TRUNCATED)	{"language":[3,3,2,4,4,4,4,3,3,3,3,3,2,2,4,1,3,4,2,3,2,3,3,3,4,4,4,2,3,4,3,4,4,3,3,3,2,4,3,3,4,2,3,4(...TRUNCATED)	868	B	2,000	0	[ "" ]	true	"\n\n問題\n\nAORイカちゃんはテストに合格するため勉強しています。\n\nAORイ(...TRUNCATED)	null	256,000,000
746_F. Music in Car	"You are given a set of points on a straight line. Each point has a color assigned to it. For point (...TRUNCATED)	{ "input": [ "4\n6 6 5 5\n", "5\n1 2 3 1 3\n", "4\n6 6 4 4\n" ], "output": [ "0", "4", "-8" ] }	{"input":["1 0\n1 1 0\n1 446844829 77109657 780837560\n1 754808995 539371459\n","1 1\n1 1\n2 2 0\n1 (...TRUNCATED)	{"input":["1\n5 3\n200 12 9","1\n9 3\n200 12 9","1\n7 3\n200 12 9","1\n7 3\n141 12 9","1\n9 0\n141 1(...TRUNCATED)	2	0	{"language":[2,2,2,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,2,4,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,3,2,2,4,2,3,3,4,2,2,3,2,2,4,2,2,4,3,2,3,4,3,4,2,2,2,3,3,2,4,2,3,2,3,4,4,3,4,4,4,4,3,2(...TRUNCATED)	0		500	0	[ "implementation", "math" ]	false		{ "nanos": 0, "seconds": 1 }	0
621_D. Rat Kwesh and Cheese	"In Byteland, there are two political parties fighting for seats in the Parliament in the upcoming e(...TRUNCATED)	{"input":["+Mike\nMike:hello\n+Kate\n+Dmitry\n-Dmitry\nKate:hi\n-Kate\n","+Mike\n-Mike\n+Mike\nMike:(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["384\n87 78 16 94 36 87 93 50 22 63 28 91 60 64 27 41 27 73 37 12 69 68 30 83 31 63 24 68 (...TRUNCATED)	5	0	{"language":[2,2,2,2,2,2],"solution":["#include <stdio.h>\n#include <stdlib.h>\n#include <assert.h>\(...TRUNCATED)	{ "language": [], "solution": [] }	633	A	0	0	[ "brute force", "greedy" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
1007_E. Mini Metro	"Ilya is an experienced player in tic-tac-toe on the 4 × 4 field. He always starts and plays with X(...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 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":["5\nFFFAF\n","5\nIIAAF\n","5\nAAFFA\n","6\nAAAFFA\n","2\nAF\n","8\nIFFFIAAI\n","3\nFFA\n",(...TRUNCATED)	6	0	{"language":[3,3,3,3,3,3,3,3,3,3,2,3,3,3,1,3,3,3,3,3,3,3,3,3,3,3,4,3,3,3,3,3,3,1,3,3,1,3,3,3,4,3,3,3(...TRUNCATED)	{"language":[3,1,2,2,1,2,4,3,3,2,2,4,2,4,4,4,2,2,2,1,2,4,2,1,1,4,3,3,3,2,4,2,2,2,2,3,2,4,4,2,2,4,2,2(...TRUNCATED)	67		0	2,400	[]	false		{ "nanos": 0, "seconds": 1 }	134,217,728
1301_B. Motarack's Birthday	"Chouti was tired of the tedious homework, so he opened up an old programming problem he created yea(...TRUNCATED)	{"input":["(((#)((#)\n","#\n","()((#((#(#()\n","(#)\n"],"output":["1\n2\n","-1\n","1\n1\n3\n","-1\n"(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["2008 2 29\n2015 1 1","1505 9 9\n2001 11 3","1505 9 9\n2619 11 3","1505 13 9\n2619 11 3","(...TRUNCATED)	2	0	{"language":[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,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4(...TRUNCATED)	{"language":[2,2,4,2,2,2,2,3,3,2,3,3,4,2,2,3,2,3,2,2,2,2,2,2,2,3,2,4,2,4,1,2,4,3,2,4,4,2,2,3,4,2,2,2(...TRUNCATED)	1,490	A	0	1,100	[ "constructive algorithms", "dfs and similar", "dp" ]	false		null	256,000,000
909_D. Colorful Points	"Everybody knows that we have been living in the Matrix for a long time. And in the new seventh Matr(...TRUNCATED)	{ "input": [ "5 3 \n1 2 3 4 5\n2 1 5\n1 2 5\n2 1 5" ], "output": [ "9 \n10" ] }	{"input":["10\n5 1 33242121\n5 7 535463871\n9 1 202863787\n5 4 874413088\n6 1 623012241\n6 8 7866591(...TRUNCATED)	{"input":["4000 4000 2\n","3 300 167\n","3 300 2\n","4 4 2\n","3 2 70\n","1625 3998 2\n","300 403 30(...TRUNCATED)	2	11	{"language":[4,2,2,2,2,2,2,2,2,4,4,2,2,4,4,2,2,2,4,2,2,4,2,4,2,2,2,2,3,2,2,2,2,2,2,2,2,4,2,2,4,4,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,3,2,2,3,2,2,2,2,4,3,3,2,4,2,2,2,2,4,2,3,4,2,2,2,2,2,2,4,2,2,2,2,2,3,2,2,2,2,2(...TRUNCATED)	174	D	0	2,500	[]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
990_B. Micro-World	"Polycarp has recently created a new level in this cool new game Berlio Maker 85 and uploaded it onl(...TRUNCATED)	{"input":["3 3\n1 2 1\n2 3 1\n1 3 5","100 0","10 3\n8 7 100\n7 9 100\n9 8 100","3 3\n1 2 1\n2 3 1\n1(...TRUNCATED)	{"input":["3\n230967221047542071272908186525868331398921682471308664253988778356539397562182960087 1(...TRUNCATED)	{"input":["100\n5\n48 141 231 554 425\n7\n0 19\n50 98\n143 30\n231 55\n342 0\n365 100\n600 10","180\(...TRUNCATED)	2	9	{"language":[1,2,2,2,2,4,4,4,3,2,4,2,4,2,4,2,3,2,2,2,3,4,2,1,3,2,3,4,3,2,1,4,3,2,2,2,1,2,4,2,4,4,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,1,2,2,2,4,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2(...TRUNCATED)	1,239	E1	2,000	2,200	[ "implementation", "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
709_E. Centroids	"Chef had a hard time arguing with his friend, and after getting a great old kick Chef saw a colored(...TRUNCATED)	{ "input": [ "5 5 10 5 4\n", "12 4 12 4 1\n", "15 1 100 0 0\n" ], "output": [ "1\n", "3\n", "15\n" ] }	{ "input": [ "5\n90 94\n26 25\n64 84\n14 6\n20 96\n" ], "output": [ "1842\n12\n1015\n3\n1908\n" ] }	{"input":["100 5\n1\n23\n45\n47\n89","10 2\n4\n1","4 1\n3","100 3\n1\n23\n45\n47\n89","100 0\n1\n23\(...TRUNCATED)	6	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,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"solut(...TRUNCATED)	{"language":[2,2,2,2,2,4,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(...TRUNCATED)	0	C	1,000	2,600	[ "" ]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
p01083 RedBlue	"Buber is a Berland technology company that specializes in waste of investor's money. Recently Buber(...TRUNCATED)	{"input":["4\n1 3\n2 4\n3 4\n2 3\n","4\n4 4\n1 3\n2 4\n3 4\n"],"output":["NO\n1 3 4 2\n1 2 4 3\n","Y(...TRUNCATED)	{"input":["5 4\n1 2 1 -1\n2 3 1 -1\n3 1 1 -1\n4 5 2 -1\n","3 3\n1 2 -10 30\n1 3 1 1\n2 3 -10 -1\n","(...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)	5	0	{"language":[1,2,2,2,2,4,2,4,4,2,2,3,2,4,2,2,1,2,2,4,4,2,2,3,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[3,2,0,2,0,2,2,3,0,2,2,2,3,2,2,3,2,2,2,2,2,2,4,4,2,2,2,3,3,2,2,3,2,2,3,3,3,2,3,2,2,0,3,2(...TRUNCATED)	1,060	E	500	2,500	[ "" ]	false		null	1,073,741,824