Datasets:

TheFactoryX
/

edition_0697_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
p01086 Short Phrase	"Every day Kotlin heroes analyze the statistics of their website. For n days, they wrote out n numbe(...TRUNCATED)	{ "input": [ "1 -5 6\n" ], "output": [ "2\n2.000000\n3.000000\n" ] }	{ "input": [], "output": [] }	{"input":["3,4,5\n5,5,8\n4,5,4\n5,4,3","3,3,5\n5,5,8\n4,4,4\n5,4,3","3,4,5\n5,5,8\n4,5,4\n3,4,5","3,(...TRUNCATED)	6	10	{"language":[2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,1,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,4,3,2,3,3,0,3,2,2,0,3,4,1,3,2,2,0,0,2,2,3,3,3,3,0,3,4,2,0,3,0,2,0,2,2,2,3,3,4,3,2,2(...TRUNCATED)	1,208	E	500	1,000	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	0
p01931 Check answers	"This is an interactive task.\n\nDasha and NN like playing chess. While playing a match they decided(...TRUNCATED)	{"input":["1.1 3.4 2.5\n","1.9 1.8 1.7\n","2.0 2.0 2.0\n"],"output":["z^y^x\n","(x^y)^z\n","x^y^z\n"(...TRUNCATED)	{"input":["3 4\n1 1\n1 2\n1 3\n","1 100\n99 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22(...TRUNCATED)	{ "input": [], "output": [] }	2	0	{"language":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"solution":["_ = int(raw_input())\nfor __ in range(...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)	1,451		0	2,000	[ "brute force", "dp", "strings", "two pointers" ]	false		{ "nanos": 0, "seconds": 6 }	0
914_F. Substrings in a String	"A prime number is a natural number which has exactly two distinct natural number divisors: 1 and it(...TRUNCATED)	{"input":["12\n1\n2\n3\n4\n5\n6\n7\n8\n9\n10\n39\n691\n"],"output":["\n1\n-1\n2\n3\n-1\n5\n4\n7\n-1\(...TRUNCATED)	{"input":["21\n11 19 4 19 6 0 13 7 6 2 5 3 16 10 1 9 15 21 9 21 2\n","100\n57 85 27 81 41 27 73 10 7(...TRUNCATED)	{"input":["1000 4 750160753\n","2 7 727733989\n","994 9 410957831\n","269 4 817408561\n","386 5 4292(...TRUNCATED)	3	9	{"language":[2,4,3,2,3,2,2,3,2,3,4,3,2,3,3,2,2,2,2,2,2,4,2,4,3,4,3,2,2,2,2,2,2,3,3,3,3,3,2,3,2,3,4,3(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,4,2,4,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,398		3,000	2,600	[ "brute force", "greedy" ]	false	"Problem\n\nKND君は会津大学に在籍する学生プログラマである。彼の住む町の(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	256,000,000
931_A. Friends Meeting	"There is a staircase with N steps. Takahashi is now standing at the foot of the stairs, that is, on(...TRUNCATED)	{ "input": [ "2\n5\n5", "3\n1\n4\n3" ], "output": [ "5\n5", "4\n3\n4" ] }	{ "input": [], "output": [] }	{"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)	6	8	{"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],"solution":["#include <bits/stdc(...TRUNCATED)	{"language":[2,3,3,3,4,1,2,2,2,4,1,4,3,3,2,3,4,4,2,1,2,3,4,3,2,3,3,4,1,4,2,4,3,4,3,3,2,4,2,2,3,4,1,3(...TRUNCATED)	0	E	0	2,000	[ "implementation" ]	false		{ "nanos": 0, "seconds": 1 }	512,000,000
1466_C. Canine poetry	"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": [ "-++-\n", "++\n", "+-\n", "-\n" ], "output": [ "YES\n", "YES\n", "NO\n", "NO\n" ] }	{"input":["4 15\n","4 2\n","467 4\n","4 11\n","4 7\n","3 1\n","4 14\n","500 125000\n","3 7\n","499 2(...TRUNCATED)	{"input":["12\n161735902 211047202 430302156 450968417 628894325 707723857 731963982 822804784 88089(...TRUNCATED)	2	9	{"language":[1,3,4,3,4,4,3,1,3,2,1,2,3,4,3,2,1,1,4,4,3,3,3,3,4,2,3,3,4,3,1,2,3,3,4,3,3,3,2,2,4,3,4,4(...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)	0	A	1,000	1,300	[]	false		{ "nanos": 0, "seconds": 2 }	0
etmx05	"Vasya has a sequence a consisting of n integers a_1, a_2, ..., a_n. Vasya may pefrom the following (...TRUNCATED)	{ "input": [ "2 3\n", "1 1\n", "49 1808\n" ], "output": [ "6\n", "0\n", "359087121\n" ] }	{"input":["85 30 123\n","100000 100000 1320777\n","94728 36278 300352\n","70386 4182 113682\n","6518(...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":[4,4,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,3,2,2,4,4,4,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)	{"language":[3,2,2,4,1,2,2,2,2,4,4,2,2,2,4,4,2,3,2,1,2,2,2,4,4,2,4,2,2,1,2,2,2,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED)	643	F	0	2,300	[ "binary search", "brute force", "dp", "greedy", "sortings" ]	false		{ "nanos": 0, "seconds": 1 }	0
720_C. Homework	"\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-piz(...TRUNCATED)	{"input":["1\n-1\n0"],"output":["? 0 0\n? 536870912 0\n? 0 536870912\n? 805306368 536870912\n? 53687(...TRUNCATED)	{"input":["4 10\n1 333333333 666666666 1000000000\n1000000000 1000000000 1000000000 1000000000\n1 1\(...TRUNCATED)	{"input":["1\n1\n3\n2\n","3\n1 1 2\n1 0 3\n1 1 4\n","3\n1 1 101\n1 2 1\n1 2 1\n","8\n148933105 19040(...TRUNCATED)	5	10	{"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED)	{"language":[3,4,2,4,2,3,3,3,3,2,2,3,3,3,3,3,3,3,3,2,2,3,3,3,3,3,1,3,1,1,2,2,3,2,3,1,2,2,4,3,3,3,3,3(...TRUNCATED)	277		0	0	[]	false		null	256,000,000
p03010 diverta 2019 Programming Contest 2 - Diverta City	"You are given a complete undirected graph. For each pair of vertices you are given the length of th(...TRUNCATED)	{ "input": [ "2\nacxz\nbcxz\n\nSAMPLE" ], "output": [ "Funny\nNot Funny\n" ] }	{"input":["50 5000\n2 35 46\n2 43 92\n2 16 88\n2 67 99\n2 36 93\n2 12 20\n2 33 96\n2 55 82\n2 18 32\(...TRUNCATED)	{"input":["3\n2\n1 5 10\n2 15 5\n3\n2 93 78\n1 71 59\n3 57 96\n19\n19 23 16\n5 90 13\n12 85 70\n19 6(...TRUNCATED)	2	7	{"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,4,4,2,2,2,4,2,2,4,4,4,2,4,1,4,2,2,1,4,4,2,2,2,2,2,2,4,4,4,2,2,2,3,4,2,1,2,4,2,4,4(...TRUNCATED)	1,165	E	1,000	0	[ "" ]	false		{ "nanos": 0, "seconds": 5 }	256,000,000
1512_G. Short Task	"You happened to get a special bicycle. You can run with it incredibly fast because it has a turbo e(...TRUNCATED)	{ "input": [ "3\n6 4 1\n", "4\n20 6 3 4\n" ], "output": [ "0\n", "2\n" ] }	{"input":["36 102 73 101 19\n5 9 2 2 6\n4 13\n","119 0 0 0 0\n2 0 0 0 0\n5 5\n","0 0 119 0 0\n0 0 2 (...TRUNCATED)	{"input":["10 7\n3 4\n8 6\n7 8\n3 1\n9 10\n10 6\n9 4\n","10 16\n9 8\n1 2\n9 5\n5 4\n9 2\n3 2\n1 6\n5(...TRUNCATED)	3	0	{"language":[2,4,2,3,3,3,2,2,2,1,2,2,3,2,4,2,4,4,2,3,3,2,4,4,3,3,3,1,2,4,4,3,3,2,4,2,2,3,2,3,1,3,4,1(...TRUNCATED)	{"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	D	1,750	2,000	[ "combinatorics", "divide and conquer" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
p03297 AtCoder Grand Contest 026 - rng_10s	"The court wizard Zigzag wants to become a famous mathematician. For that, he needs his own theorem,(...TRUNCATED)	{ "input": [ "5\n1 2\n1 3\n3 4\n2 5" ], "output": [ "1" ] }	{"input":["10 1 4 10 0\n","100 1 2 1000 0\n","1 11 12 0 10\n","1 2 3 0 0\n","8 6 13 2 5\n","8 3 5 1 (...TRUNCATED)	{"input":["2 0\n","3 1\n1 2 0\n","3 3\n1 2 2 3 2\n1 1 2 3 3\n2 3 2 2 3\n","11 17\n1 2 5 3 4 1 2 10\n(...TRUNCATED)	5	12	{"language":[1,1,1,1,1,1,1,1,1,1,1],"solution":["def gcd(x,y):\n if y==0: return x\n else: ret(...TRUNCATED)	{"language":[2,4,4,2,2,2,2,1,2,2,1,2,3,2,2,2,2,2,1,2,1,2,1,1,2,2,2,2,2,4,2,2,2,2,1,3,2,2,3,4,2,1,4,2(...TRUNCATED)	630	B	1,000	0	[ "binary search", "data structures", "sortings", "two pointers" ]	false		null	256,000,000