Datasets:

TheFactoryX
/

edition_0972_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
ig01	"E: Markup language has declined\n\nIt's been centuries since we humans have been declining slowly. (...TRUNCATED)	{ "input": [ "ppqb", "pdbq" ], "output": [ "No", "Yes" ] }	{ "input": [], "output": [] }	{"input":["924896439 993098880\n","1 2\n","1 24\n","1000000000 4\n","396 7128\n","9 6\n","32 30\n","(...TRUNCATED)	2	10	{"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": [], "solution": [] }	0	G	0	1,800	[ "constructive algorithms", "greedy", "number theory" ]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
ism1	"Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings(...TRUNCATED)	{"input":["5 8\n1 2 6 7 10\n1 1 1 1 2\n1 1\n1 5\n1 3\n3 5\n-3 5\n-1 10\n1 4\n2 5\n"],"output":["0\n1(...TRUNCATED)	{"input":["30 2\n26 11 22 16 14 29 16 14 8 23 21 22 11 24 15 23 22 1 11 20 23 29 13 19 19 15 13 2 7\(...TRUNCATED)	{"input":["2 0\n1 1 0 1\n","2 2\n0 1 2 3\n2 1\n0 4\n","1 0\n2 1\n","2 0\n1 0 0 1\n","2 2\n0 1 2 4\n2(...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,1,4,1,4,3,2,2,2,4,3,3,2,4,3,2,2,2,2,4,4,2,2,2,4,2,3,4,4,2,3,3,2,3,4,3,3,2,4,2,2,3,4(...TRUNCATED)	0		0	1,600	[]	false		null	512,000,000
954_F. Runner's Problem	"You have multiset of n strings of the same length, consisting of lowercase English letters. We will(...TRUNCATED)	{ "input": [ "5\n1912 1\n5 6\n999 1\n88 2\n12 100\n" ], "output": [ "\n5\n2\n6\n4\n2115\n" ] }	{ "input": [], "output": [] }	{"input":["pH\n2\n","nifzlTLTeWxaD\n0\n","ysBKLtQXvmnCrldEceqXKkaZOrvjRbwlW\n5\n","LiqWMLEVLRhW\n1\n(...TRUNCATED)	2	0	{ "language": [], "solution": [] }	{"language":[2,2,2,2,2,4,2,2,1,4,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,2,2,2,2,4,2,2,2(...TRUNCATED)	438	C	2,000	1,900	[ "" ]	false	"20XX年に喜多方市熱塩加納町から南会津町までの6区間、総距離58kmの会津中(...TRUNCATED)	null	256,000,000
p01691 Disappear Drive	"Tree is a connected acyclic graph. Suppose you are given a tree consisting of n vertices. The verte(...TRUNCATED)	{"input":["6 4\n2 2 5 5 6 6\n1 3\n2 4\n3 5\n4 6\n","3 3\n314 159 265\n1 2\n1 3\n3 2\n","4 2\n2 1 1 5(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1\n5\n2 3 4 5 2\n","1\n3\n1 1 129021590\n","4\n7\n6 6 8 8 6 6 6\n1\n2\n5\n4 5 9 8 7\n7\n1(...TRUNCATED)	1	8	{"language":[1,1,1,1,1,1,1],"solution":["def power(x,m):\n\tglobal mod\n\tif m==0:\n\t\treturn 1\n\t(...TRUNCATED)	{"language":[4,2,2,2,2,2,2,4,2,3,2,2,4,2,2,2,2,4,4,2,2,2,2,2,2,2,2,4,2,2,4,3,3,2,2,2,2,4,3,4,2,2,2,4(...TRUNCATED)	0		0	0	[ "*special" ]	false		{ "nanos": 0, "seconds": 2 }	0
1497_D. Genius	"The blinds are known to consist of opaque horizontal stripes that can be rotated thus regulating th(...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": [ "1 1 2 1 1\n2 1\n" ], "output": [ "0\n" ] }	{"input":["3\n6 5 15","3\n4 4 2","3\n4 3 1","3\n4 4 5","3\n4 8 2","3\n8 8 2","3\n4 4 1","3\n4 4 4","(...TRUNCATED)	2	0	{"language":[3,2,2,4,2,2,2,4,3,3,4,4,4,4,2,2,4,2,1,2,2,3,3,4,1,4,4,4,3,3,3,4,3,3,2,2,2,2,2,2,3,4,2,2(...TRUNCATED)	{"language":[2,4,2,2,2,4,2,1,4,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,2,2,4,2,2,2(...TRUNCATED)	0	I	1,000	1,100	[ "brute force", "dp", "strings", "two pointers" ]	false		null	256,000,000
cdva1502	"Given the value of n, print the n'th prime number.\n\nInput : A single integer n. \nOutput : A sing(...TRUNCATED)	{ "input": [ "3 4", "1 21" ], "output": [ "Even", "Odd" ] }	{"input":["5\n10 50\n10 50\n10 50\n10 50\n10 50\n","2\n10000 10000\n10000 10000\n","3\n10000 10000\n(...TRUNCATED)	{"input":["3 313 856 964 421\n","3 3 1 11 9\n","2 2 9 8 1\n","61 538 623 89 548\n","7 202 512 995 37(...TRUNCATED)	2	0	{"language":[2,4,2,4,2,2],"solution":["#include <cstdio>\n#include <iostream>\n#include <sstream>\n#(...TRUNCATED)	{"language":[2,2,2,4,3,2,4,2,4,4,4,4,4,3,2,4,2,4,3,4,1,2,3,3,2,2,4,4,2,4,2,2,3,4,3,3,4,3,2,2,4,4,4,2(...TRUNCATED)	1,431		0	1,800	[]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
anuwta	"Story\n\nAt UZIA High School in the sky city AIZU, the club activities of competitive programming a(...TRUNCATED)	{ "input": [ "4 4\n1 2 -10 3\n1 3 1 -10\n2 4 -10 -1\n3 4 0 -3\n" ], "output": [ "4\n" ] }	{"input":["1 1\nt\n+ 2 p\n","2 12\naa\n+ 1 a\n+ 2 a\n+ 3 a\n- 1\n+ 1 a\n- 2\n+ 2 a\n- 3\n+ 3 a\n+ 2 (...TRUNCATED)	{"input":["2\n5\n6 5 4 3 2\n5\n3 4 6 1 1","2\n5\n6 5 4 3 2\n5\n3 7 9 1 1","2\n5\n6 5 4 3 3\n5\n3 7 9(...TRUNCATED)	2	0	{"language":[2,3,2,2,2,2,2,2,2,2,2,2,2,4,2,2,3,4,2,2,2,2,2,2,2,2,2,2,2,4,2,4,4,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[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,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,189	F	0	800	[ "" ]	false		{ "nanos": 0, "seconds": 3 }	0
rams-love-for-sita-2	"You are given a simple connected undirected graph G consisting of N vertices and M edges. The verti(...TRUNCATED)	{ "input": [ "CANDY", "SOLVING" ], "output": [ "AND", "LVI" ] }	{"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":["1\n0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0\n7\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n1 0 0 0 0 0 1 0 0(...TRUNCATED)	1	9	{"language":[2,2,2,2],"solution":["#include <iostream>\n#include <iomanip>\n#include <complex>\n#inc(...TRUNCATED)	{"language":[3,2,2,3,4,2,4,3,2,2,1,2,4,3,4,3,2,3,2,2,4,2,3,2,2,2,3,4,4,3,2,2,3,2,2,3,4,2,2,2,2,2,3,4(...TRUNCATED)	45	C	1,750	2,100	[ "geometry", "math" ]	false		null	0
1281_B. Azamon Web Services	"Consider an infinite triangle made up of layers. Let's number the layers, starting from one, from t(...TRUNCATED)	{ "input": [ "2\n2\n2 2\n1\n6" ], "output": [ "4\n2\n" ] }	{"input":["100 1 7\n83\n174\n191\n145\n167\n55\n232\n157\n51\n209\n85\n73\n216\n39\n72\n76\n132\n70\(...TRUNCATED)	{"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)	2	10	{"language":[2,2,2,4,2,2,2,4,4,2,4,2,2,4,2,2,4,2,2,2,2,2,2,3,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,4,4,2(...TRUNCATED)	{"language":[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,2,2,2,2,2,2,2,2,2],"solutio(...TRUNCATED)	0	G	1,750	0	[ "" ]	false	"アイヅ放送協会の教育番組(ＡＨＫ教育)では、子供向けの工作番組「あそ(...TRUNCATED)	{ "nanos": 0, "seconds": 4 }	0
p02211 Apple Adventure	"This is the easier version of the problem. In this version 1 ≤ n, m ≤ 100. You can hack this pr(...TRUNCATED)	{ "input": [ "3 1 3\n\nSAMPLE" ], "output": [ "833333340" ] }	{"input":["4\n3 4\n1 2\n3 4\n1 2\n","4\n2 4\n1 3\n4 4\n1 1\n","10\n6 6\n1 2\n2 2\n6 7\n8 8\n3 5\n5 5(...TRUNCATED)	{"input":["2\nca\nbc\n","2\ndc\nce\n","2\nza\nzb\n","2\nab\nb\n","25\nsw\nwt\nc\nl\nyo\nag\nz\nof\np(...TRUNCATED)	2	10	{"language":[1,1],"solution":["def isvalid(s, c):\n if c.difference(s):\n return False\n (...TRUNCATED)	{ "language": [], "solution": [] }	0	A	750	2,200	[ "brute force", "sortings" ]	false		null	0