Datasets:

TheFactoryX
/

edition_0941_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
p03010 diverta 2019 Programming Contest 2 - Diverta City	"Treeland consists of n cities and n-1 two-way roads connecting pairs of cities. From every city, yo(...TRUNCATED)	{"input":["500 500 0 0 200 200","4 4 0 0 1 1","4 4 0 0 3 3","2 3 0 0 1 2"],"output":["34807775","2",(...TRUNCATED)	{"input":["3\n2 2 3\n","5\n1 4 5 4 5\n","4\n2 2 4 4\n","3\n1 1 2\n","4\n1 2 1 2\n","4\n4 2 2 4\n","6(...TRUNCATED)	{ "input": [], "output": [] }	2	9	{"language":[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,4,2,4,4,2,2,2,2,4,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,3,3,4,4,2,2,4,3,1,2,4,2,3,4,2,3,1,4,3,2,2,3,4,3,2,3,2,3,2,4,4,3,2,2,2,2,2,2,4,2,4,2,3(...TRUNCATED)	1,227	B	2,500	0	[ "brute force", "combinatorics", "dp", "string suffix structures" ]	false	{ "nanos": 0, "seconds": 8 }	0
1291_E. Prefix Enlightenment	"BubbleSquare social network is celebrating 13^{th} anniversary and it is rewarding its members with(...TRUNCATED)	{"input":["9 4 12\nthis is a sample text for croc final round\n","9 1 9\nthis is a sample text for c(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1000 4 750160753\n","2 7 727733989\n","994 9 410957831\n","269 4 817408561\n","386 5 4292(...TRUNCATED)	6	7	{"language":[2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\n\n#pragma GCC optimize(\"O3\")\(...TRUNCATED)	{"language":[2,2,4,2,3,4,4,3,4,1,3,3,2,3,2,2,1,3,3,3,2,3,4,3,4,2,2,3,4,3,2,4,4,3,4,4,4,3,4,2,3,4,3,2(...TRUNCATED)	0	F	0	2,100	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	512,000,000
1374_E1. Reading Books (easy version)	"Problem\n\nThere is a bundle of $ n $ cards, with $ i $ written on the $ i $ th card from the botto(...TRUNCATED)	{ "input": [ "1\n9\n10\n1\n\nSAMPLE" ], "output": [ "10" ] }	{"input":["20\nadd 17\nadd 18\nadd 19\nsum\nadd 20\nadd 21\nadd 22\nsum\nadd 23\nadd 24\nadd 25\nsum(...TRUNCATED)	{"input":["2 0\n1 1\n","9 2\n2 6 1 5 5 8 6 8 7\n","15 1\n1 1 1 1 1 1 1 1 1 1 1 2 1 1 1\n","7 1\n101 (...TRUNCATED)	2	10	{"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":[2,3,2,2,0,2,2,2,4,2,2,2,2,1,2,2,2,4,2,3,2,2,2,2,2,2,2,2,0,4,0,2,1,2,3,2,2,2,3,3,2,2,2,2(...TRUNCATED)	1,424		3,000	0	[ "brute force", "sortings" ]	false	{ "nanos": 0, "seconds": 1 }	134,217,728
615_A. Bulbs	"Step up and down\n\nKazuki, commonly known as Kerr, who attends JAG University, was invited by your(...TRUNCATED)	{"input":["2 1 0\n","2 2 4\n0 1 2 1\n0 1 2 1\n1 2 1 0\n1 1 1 2\n"],"output":["FIRST\n1 0 1 1\n","SEC(...TRUNCATED)	{ "input": [ "1 1\n5\n2 1 6\n" ], "output": [ "1\n" ] }	{"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)	2	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,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,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],"solut(...TRUNCATED)	699	F	0	2,100	[ "" ]	false	null	256,000,000
p00490 Best Pizza	"There are N+1 lights. Lights are placed at (0, 0), (1, 0), (2, 0) ... (N, 0). Initially all the li(...TRUNCATED)	{"input":["1\nindex.dml\n<dml><title>Markup language has Declined</title><br>Programmers world</dml>(...TRUNCATED)	{"input":["3\n9 5 8\n8 9 10\n9 5 2\n","50\n48 45 42\n32 45 8\n15 41 47\n32 29 38\n7 16 48\n19 9 21\n(...TRUNCATED)	{"input":["1000 1001\n82 636 713 516\n","1000 1998\n316 681 19 233\n","4 8\n1 3 4 2\n","5 6\n4 3 2 1(...TRUNCATED)	2	10	{"language":[1],"solution":["T = int(raw_input())\nfor ti in xrange(T):\n\ta,b,c = map(int,raw_input(...TRUNCATED)	{"language":[2,0,2,2,0,0,2,2,0,2,0,0,0,0,2,2,2,0,0,0,0,2,2,2,2,2,0,0,2,2,0,0,0,2,0,4,0,0,0,0,2,2,0,0(...TRUNCATED)	1,216	A	500	1,200	[ "*special", "implementation" ]	false	null	0
867_D. Gotta Go Fast	"Petya and Vasya arranged a game. The game runs by the following rules. Players have a directed grap(...TRUNCATED)	{"input":["2\n2 2\n3 3\n","2\n2 2\n4 1\n"],"output":[" (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["4 9\n5 1000000000 999999999 19\n","4 6\n5 1000000000 1790978867 12\n","3 5\n8 5 6\n","3 4(...TRUNCATED)	2	0	{"language":[2,2,2,2],"solution":["#include <iostream>\n#include <iomanip>\n#include <complex>\n#inc(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,4,4,2,2,4,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,4,2,4,2,2,2,2(...TRUNCATED)	937		1,000	0	[]	false	{ "nanos": 0, "seconds": 6 }	256,000,000
1110_E. Magic Stones	"The blinds are known to consist of opaque horizontal stripes that can be rotated thus regulating th(...TRUNCATED)	{ "input": [ "5\net\neq\nbd\nbe\nbdp\n\nSAMPLE" ], "output": [ "8" ] }	{"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": [], "output": [] }	5	9	{"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,2,4,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,4,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)	1,037		0	0	[ "bitmasks", "brute force", "fft", "strings", "trees" ]	true	{ "nanos": 0, "seconds": 2 }	256,000,000
40_B. Repaintings	"After his wife's tragic death, Eurydice, Orpheus descended to the realm of death to see her. Reachi(...TRUNCATED)	{"input":["2 10\n0 0\n10000 0","4 50\n0 10000\n1 10000\n2 0\n10000 0","5 10\n0 0\n10 10\n20 0\n30 10(...TRUNCATED)	{"input":["1 1\n1\n2\n","6 3\n1 2 3 4 5 6\n3 5 1\n","5 5\n5 6 3 2 1\n4 3 1 5 6\n","1 1\n1\n1\n","10 (...TRUNCATED)	{"input":["5\n2 3 0 6 8","5\n2 3 4 6 5","5\n2 3 4 6 7","5\n2 3 0 6 7","5\n2 -1 8 6 4","5\n6 0 8 5 2"(...TRUNCATED)	2	9	{"language":[3,4,3,2,2,3,3,1,3,4,2,4,1,3,3,1,1,3,3,2,1,3,2,4,2,3,3,1,3,2,2,2,3,3,1,2,3,4,4,4,3,4,3,3(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,3,2,2,3,2,2,4,2,4,2,2,2,2,3,2,4,4,4,2,2,2,2,2,3,2,2,2,4,4,4,4,4,3,2,2,1,3(...TRUNCATED)	0		3,000	0	[ "math" ]	false	{ "nanos": 0, "seconds": 1 }	268,435,456
348_A. Mafia	"Problem Desrcription\nShil likes to play with trees a lot.He is playing with an undirected tree con(...TRUNCATED)	{ "input": [ "1 30 0\n-1 -1 -1" ], "output": [ "00:30:00\n01:30:00" ] }	{"input":["6\nc armor 0 13 0 3\na weapon 23 0 0 3\nb weapon 20 0 0 4\ne orb 0 0 13 3\nd armor 0 15 0(...TRUNCATED)	{"input":["1 5000 2732\n","2 2 0\n","83 4122 123\n","19 862 387\n","100 843 30\n","45 1296 245\n","9(...TRUNCATED)	5	9	{"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":[4,0,0,2,2,2,3,3,2,3,2,3,2,3,1,3,2,2,2,2,4,2,2,3,0,2,3,3,2,2,3,3,2,2,4,3,2,2,2,2,2,3,3,2(...TRUNCATED)	867		0	0	[ "" ]	false	null	134,217,728
295_D. Greg and Caves	"Diverta City is a new city consisting of N towns numbered 1, 2, ..., N.\n\nThe mayor Ringo is plann(...TRUNCATED)	{"input":["5 3 2\nSba\nccc\naac\nccc\nabT\n","3 4 1\nSxyy\nyxxx\nyyyT\n","1 3 3\nTyS\n","1 4 1\nSxyT(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["2\n1 20\n","10\n450661 128600 993228 725823 293549 33490 843121 528432 556169 448234\n","(...TRUNCATED)	2	11	{"language":[2,2,4,2,4,2,3,4,2,4,2,4,2,4,2,2,4,2,2,2,2,4,2,2,2,4,2,4,2,4,4,2,2,4,1,2,2,2,2,2,2,2,2,3(...TRUNCATED)	{ "language": [], "solution": [] }	0	E	2,500	0	[ "*special" ]	false	{ "nanos": 0, "seconds": 2 }	0