Datasets:

TheFactoryX
/

edition_0602_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
405_E. Graph Cutting	"You are given an array of n integers. For each element output the sum of itself and the previous el(...TRUNCATED)	{"input":["3\n0 10 4\n10 0 4\n20 10 4\n"],"output":["(((0((1-abs((t-0)))+abs((abs((t-0))-1))))+(5((...TRUNCATED)	{ "input": [], "output": [] }	{"input":["2\n\nSBMPLE","2\n\nSBPMLE","2\n\nELMPBS","2\n\nELMPAS","2\n\nSAPMLE","2\n\nSAQMLE","2\n\n(...TRUNCATED)	2	11	{"language":[2,4,3,3,3,2,2,4,3,3,3,3,3,2,4,3,4,4,3,3,3,3,3,4,2,4,1,4,3,2,1,3,4,3,3,2,3,3,2,4,3,3,3,3(...TRUNCATED)	{ "language": [], "solution": [] }	70		500	0	[]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
p03616 AtCoder Regular Contest 082 - Sandglass	"You're given a simple, undirected, connected, weighted graph with n nodes and m edges.\n\nNodes are(...TRUNCATED)	{"input":["2 2 1\n2 3 1\n3 2 3\n2 3 5"],"output":["3.9681187851\n6.7970540913\n6.5668891783\n13.9527(...TRUNCATED)	{"input":["1\n5\n1 3 4 5 2\n","1\n3\n1 1 274005660\n","4\n7\n6 6 8 8 6 6 6\n1\n2\n5\n4 5 9 8 7\n7\n1(...TRUNCATED)	{"input":["2\n5\n4","3\n1\n0\n3","2\n3\n4","3\n1\n0\n2","2\n4\n4","3\n1\n0\n1","2\n4\n0","3\n1\n2\n1(...TRUNCATED)	2	10	{"language":[4,3,1,2,2,3,2,3,3,3,3,3,3,3,3,3,3,3,3,2,3,1,2,1,3,3,2,3,4,3,4,4,2,4,2,3,3,3,3,3,3,2,2,3(...TRUNCATED)	{"language":[2,0,2,3,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,0,0,2,2,2,2,2,3,2,2,2,2,2,2,2,3,2,2,2,2,2,2(...TRUNCATED)	0	F	0	1,800	[]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
354_E. Lucky Number Representation	"Problem Statement\n\nWe found a dictionary of the Ancient Civilization Mayo (ACM) during excavation(...TRUNCATED)	{ "input": [ "5\n1 2\n1 3\n3 4\n2 5" ], "output": [ "1" ] }	{"input":["7 20\n4 6\n6 7\n4 5\n1 2\n2 4\n1 7\n3 5\n2 1\n6 2\n6 1\n7 3\n3 2\n3 6\n3 1\n3 4\n2 5\n1 6(...TRUNCATED)	{"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)	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,1,1,1,1],"solution":["b=\"AEIOUaeiou\"\nt(...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)	161	E2	2,000	2,400	[ "" ]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
p00167 Bubble Sort	"Garfield the cat likes candies A LOT. He always keeps a huge stock of it at his home. Today John, h(...TRUNCATED)	{ "input": [ "5 10 25 12 4 1 \n3 16 28 100\n\nSAMPLE" ], "output": [ "4 12 10 \n100 28 16" ] }	{ "input": [], "output": [] }	{"input":["1 10\n700282491 332230980 954401907 59481241 188256336 995466811 463183048 725322957 8929(...TRUNCATED)	2	9	{"language":[2,2,2,4,2,2,2,2,2,2,2,2,3,2,2,2,4,2,3,2,2,2,4,2,2,4,2,2,2,2,2,2,4,2,2,2,4,2,2,2,4,2,2,2(...TRUNCATED)	{"language":[4,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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	405		1,500	2,100	[ "dp", "implementation" ]	false		{ "nanos": 0, "seconds": 1 }	268,435,456
438_A. The Child and Toy	"Given 2 numbers n1 and n2, following operations can be performed:\n1) Decrement n1 by 1(if n1>1)\n2(...TRUNCATED)	{"input":["3 3\n1 3\n2 3\n3 3\n","3 1\n1 1\n2 2\n3 3\n","7 3\n1 7\n3 8\n4 5\n6 7\n1 3\n5 10\n8 9\n",(...TRUNCATED)	{"input":["20\n76 86 70 7 16 24 10 62 26 29 40 65 55 49 34 55 92 47 43 100\n","100\n6591 1074 3466 3(...TRUNCATED)	{"input":["3\nDSAWWAW\nD\nAW\n","3\nWSAWDAW\nD\nAW\n","3\nDAAWWSW\nD\nAW\n","3\nWAWWASD\nD\nWA\n","3(...TRUNCATED)	3	10	{"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,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,3,2,4,2,2,2,4,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	702		3,000	1,600	[ "brute force", "implementation" ]	false		{ "nanos": 0, "seconds": 1 }	0
lexicographically-preceding-permutation	"Amr loves Geometry. One day he came up with a very interesting problem.\n\nAmr has a circle of radi(...TRUNCATED)	{ "input": [ "4\n4 4 4\n", "5\n2 3 5 5\n" ], "output": [ "6\n", "17\n" ] }	{"input":["6\nbabcdc\n","5\nbadec\n","3\naba\n","7\nbaaaccb\n","3\naaa\n","4\npara\n","3\nbac\n","7\(...TRUNCATED)	{"input":["1 10\n1 5 9 5\n1\n5 5 L 0\n","3 7\n2 4 2 7\n4 7 4 6\n7 3 5 3\n10\n6 7 L 1\n6 7 L 2\n6 7 L(...TRUNCATED)	3	10	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2],"solution":["#include<cmath>\n#include<queue>\(...TRUNCATED)	{"language":[2,4,2,4,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,4,4,2,4,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2(...TRUNCATED)	0	H	0	0	[ "games", "graphs" ]	false	"JOI 君が住む都市にはN 個の駅があり，それぞれ1, 2, ..., N の番号が付けら(...TRUNCATED)	null	1,073,741,824
614_C. Peter and Snow Blower	"You are given an array a of n integers.\n\nYou want to make all elements of a equal to zero by doin(...TRUNCATED)	{ "input": [ "2\nxa\nay\n", "2\nab\ncd\n", "3\naab\nbcb\nbac\n" ], "output": [ "FIRST\n", "DRAW\n", "DRAW\n" ] }	{"input":["4\n14723\n5512\n100\n28436\n33903\n100\n84816\n75747\n100\n92281\n31380\n100","1\n45819\n(...TRUNCATED)	{"input":["5 10\n2 1 2 2 2\n2\n2 4\n4 5\n","5 10\n2 1 2 2 1\n2\n2 4\n4 5\n","5 10\n3 1 4 2 1\n2\n2 4(...TRUNCATED)	5	8	{"language":[2,4,4,4,2,4,4,4,4,4,2,3,2,3,4,2,2,2,2,2,4,4,2,4,2,4,2,2,2,4,2,2,2,2,2,3,2,4,2,4,4,2,2,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],"solution":["#include <bits/stdc++.h>\nu(...TRUNCATED)	784		1,750	1,900	[ "brute force", "implementation" ]	false		null	0
774_K. Stepan and Vowels	"We have N integers. The i-th number is A_i.\n\n\\\\{A_i\\\\} is said to be pairwise coprime when GC(...TRUNCATED)	{ "input": [ "5 5\n1 2 3 4 5\n", "3 1\n1 1 2\n", "5 2\n1 1 2 1 3\n" ], "output": [ "16", "3", "14" ] }	{"input":["4\n439 79\n991800654 985952720 985538124 983840231 983710443 982377023 981242112 98021743(...TRUNCATED)	{"input":["4 1\n7 6 1 2\n3\n3\n2 1 9\n2 1 10\n2 1 6\n","3 5\n3 2 8\n1 2 8 1 1\n4\n2 3 3\n1 2 2\n2 2 (...TRUNCATED)	3	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,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)	0	D	1,000	0	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	512,000,000
1408_A. Circle Coloring	"Having learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclu(...TRUNCATED)	{ "input": [ "4\n2 10\n0 20\n1 5\n1 3\n", "3\n0 1\n0 10\n0 100\n" ], "output": [ "8", "111" ] }	{ "input": [], "output": [] }	{"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)	2	0	{"language":[2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,4,2,2,2,1,4,2,2,2,2,2,2,2,3,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,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	483	D	0	1,000	[ "data structures", "trees" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
161_B. Discounts	"Hexadecimal likes drawing. She has drawn many graphs already, both directed and not. Recently she h(...TRUNCATED)	{ "input": [ "5 1\nbacba", "10 2\nbbaabbbaab" ], "output": [ "aabca", "aaaabbaabb" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	8	{"language":[2,4,4,2,2,2,2,4,2,4,2,4,2,2,2,4,4,2,4,4,2,2,2,2,2,2,2,2,2,4,2,4,2,4,4,2,2,2,2,4,2,2,2,4(...TRUNCATED)	{"language":[3,1,3,2,1,2,2,2,4,2,3,4,2,4,2,4,2,3,1,3,4,3,2,2,4,3,2,2,1,2,4,2,4,3,4,2,4,2,4,4,4,3,2,4(...TRUNCATED)	1,043		1,750	0	[]	false		{ "nanos": 0, "seconds": 1 }	256,000,000