Datasets:

TheFactoryX
/

edition_3046_deepmind-code_contests-readymade

name large_stringlengths 4 70	description large_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 large_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 large_stringclasses 36 values	time_limit dict	memory_limit_bytes int64 0 1.07B
p00680 KND Factory	"Jzzhu have n non-negative integers a1, a2, ..., an. We will call a sequence of indexes i1, i2, ...,(...TRUNCATED)	{"input":["24\n1 2 3 4\n1 2 4 3\n1 3 2 4\n1 3 4 2\n1 4 2 3\n1 4 3 2\n2 1 3 4\n2 1 4 3\n2 3 1 4\n2 3 (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["2 2\n2 1 2 16\n2 1 2 7\n","1 2\n1 1 1 10\n2 1 1 5\n","6 5\n1 2 3 1\n2 1 2 8\n2 3 4 7\n1 1(...TRUNCATED)	2	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,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...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,2,2,2,2(...TRUNCATED)	0	D	1,250	2,300	[ "dp", "implementation", "math", "number theory" ]	false		{ "nanos": 500000000, "seconds": 1 }	256,000,000
1155_A. Reverse a Substring	"Serge came to the school dining room and discovered that there is a big queue here. There are m pup(...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":["11 11\n6 2\n6 2\n1 2\n2 2\n3 1\n6 2\n1 1\n1 1\n3 1\n3 1\n6 2\n","21 7\n14 1\n882797755 2\(...TRUNCATED)	{"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\n(...TRUNCATED)	5	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":[4,2,2,2,2,4,4,4,4,4,2,2,2,2,2,1,4,3,4,2,2,4,2,2,2,4,2,4,4,2,1,2,1,2,2,2,4,1,2,2,2,2,3,3(...TRUNCATED)	339	A	500	0	[ "data structures", "greedy", "trees" ]	false		null	512,000,000
556_C. Case of Matryoshkas	"Professor GukiZ doesn't accept string as they are. He likes to swap some letters in string to obtai(...TRUNCATED)	{ "input": [ "5\n7 46 11 20 11", "7\n994 518 941 851 647 2 581", "3\n3 4 6" ], "output": [ "90", "4527", "10" ] }	{"input":["99\n3\n5\n7\n9\n11\n13\n15\n17\n19\n21\n23\n25\n27\n29\n31\n33\n35\n37\n39\n41\n43\n45\n4(...TRUNCATED)	{"input":["5 2","1 972439611840","1 110","1 2","1 534720932937","1 18","1 010","1 3","1 867963093279(...TRUNCATED)	2	13	{"language":[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,2,2,2,4,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,0,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(...TRUNCATED)	1,490	E	1,500	0	[ "" ]	false		{ "nanos": 0, "seconds": 4 }	1,073,741,824
1369_D. TediousLee	"Today Peter has got an additional homework for tomorrow. The teacher has given three integers to hi(...TRUNCATED)	{"input":["12\n161735902 211047202 430302156 450968417 628894325 707723857 731963982 822804784 88089(...TRUNCATED)	{ "input": [], "output": [] }	{"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	7	{"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,4,2,2,4,2,2,2,2,2,4,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,4,2,2,2,4,2,2(...TRUNCATED)	1,037	C	0	2,300	[ "" ]	true		{ "nanos": 0, "seconds": 2 }	256,000,000
133_D. Piet	"problem\n\nGiven $ N $ different natural numbers $ a_i $. I decided to make a pair by choosing a di(...TRUNCATED)	{"input":["3 2\n0 0 0\n1 1 1\n","4 3\n0 0 2 1\n2 0 1 1\n","5 10\n0 0 0 1 2\n2 1 0 0 0\n"],"output":[(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	3	8	{"language":[4,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,4,4,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,4,1(...TRUNCATED)	{"language":[4,2,4,4,2,2,1,1,4,3,2,3,3,2,2,2,2,4,4,2,2,4,2,2,2,1,2,2,4,2,2,4,2,2,4,2,2,4,2,2,2,4,4,4(...TRUNCATED)	754		3,500	800	[]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1075_D. Intersecting Subtrees	"A prime number is a natural number which has exactly two distinct natural number divisors: 1 and it(...TRUNCATED)	{ "input": [ "2\n\nSAMPLE" ], "output": [ "3\n" ] }	{ "input": [], "output": [] }	{"input":["aa\n2\nbb\nbc\n","th\n1\nht\n","bb\n1\nab\n","bn\n100\ndf\nyb\nze\nml\nyr\nof\nnw\nfm\ndw(...TRUNCATED)	1	11	{"language":[2,2,2,4,2,2,2,4,2,2,2,2,4,2,2,2,2,1,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,1,4,2,4,2,2,2,4,2(...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)	1,189	D	0	1,800	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	268,435,456
526_A. King of Thieves	"Nick has n bottles of soda left after his birthday. Each bottle is described by two values: remaini(...TRUNCATED)	{ "input": [ "3\n3\n5\n199\n" ], "output": [ "1.931851653\n3.196226611\n126.687663797\n" ] }	{"input":["2 3\n1 1 1\n0 1 0","2 2\n1 0\n0 1","3 3\n0 1 0\n1 0 1\n0 1 0","2 2\n0 0\n1 0","2 2\n0 1\n(...TRUNCATED)	{"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)	2	8	{"language":[2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\n\n#pragma GCC optimize(\"O3\")\(...TRUNCATED)	{"language":[3,2,2,2,2,2,2,2,2,2,2,3,3,2,3,2,3,2,2,3,2,2,4,2,2,3,2,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,3,3(...TRUNCATED)	507	B	0	0	[ "combinatorics", "divide and conquer" ]	false	"データを並べ替えるための整列（ソート）アルゴリズムはコンピュータ科(...TRUNCATED)	{ "nanos": 0, "seconds": 6 }	268,435,456
p01356 Nearest Station	"A string is called a k-string if it can be represented as k concatenated copies of some string. For(...TRUNCATED)	{"input":["5\n10 20 30 40 50\n1 1 1 1 1\n","8\n4264 4921 6321 6984 2316 8432 6120 1026\n4264 4921 63(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["4\nRBRR","4\nBBRR","4\nRRCR","4\nRRAR","4\nRARR","4\nBQBR","4\nRCRR","4\nBPBR","4\nRRRC",(...TRUNCATED)	2	0	{"language":[4,4,4,4,3,3,2,2,4,3,4,2,4,4,4,2,3,2,4,3,3,2,4,3,2,1,2,2,4,4,2,3,3,2,3,2,3,3,2,3,3,4,1,4(...TRUNCATED)	{"language":[3,4,3,4,4,2,2,2,4,3,2,3,1,4,2,4,4,2,3,2,3,2,3,2,2,3,2,2,2,4,4,2,2,3,4,2,1,3,4,3,3,3,4,1(...TRUNCATED)	0		0	2,300	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1413_F. Roads and Ramen	"Recently Johnny have learned bogosort sorting algorithm. He thought that it is too ineffective. So (...TRUNCATED)	{ "input": [ "2\n2 999995\n", "3\n2 3 9\n" ], "output": [ "5\n", "8\n" ] }	{"input":["49 749442\n8888888\n8888888\n8888888\n5777777\n5777777\n5777777\n5777777\n5777777\n577777(...TRUNCATED)	{"input":["2 5 1\n0 4 6\n0 2 7\n","1 1 1000000000\n0 0 1\n","5 200 10\n1 1 1\n1000000000 200 1000000(...TRUNCATED)	6	0	{"language":[4,3,2,2,2,2,2,4,2,2,2,2,2,4,4,2,4,2,2,2,2,2,2,2,2,1,4,4,4,2,4,2,3,4,2,2,4,4,4,2,3,4,4,2(...TRUNCATED)	{"language":[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,4,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED)	188	F	20	1,300	[ "data structures", "greedy" ]	false		null	256,000,000
p01797 Kimagure Cleaner	"Manao works on a sports TV. He's spent much time watching the football games of some country. After(...TRUNCATED)	{ "input": [ "10 3 2\n", "13 12 1\n", "4 1 1\n" ], "output": [ "5\n", "1\n", "3\n" ] }	{ "input": [], "output": [] }	{"input":["4\n3\n1 4 2\n1 3 1\n2\n2 4\n2 3\n2\n1 1100000000\n1 1000000000\n4\n3 10 5 8\n2 5 2 4\n","(...TRUNCATED)	5	12	{"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,4,2,4,2,2,4,4,4,4,2,2,2,2,2,2,2,2,2,2,4,4,1,2,2,2,3,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)	0	A	0	0	[ "brute force", "constructive algorithms", "greedy", "math" ]	false		{ "nanos": 0, "seconds": 3 }	268,435,456