Datasets:

TheFactoryX
/

edition_0806_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
805_A. Fake NP	"You are given an array a_1, a_2, ... , a_n, which is sorted in non-decreasing order (a_i ≤ a_{i +(...TRUNCATED)	{ "input": [ "5 3 2\naaaaa\naaa\naab" ], "output": [ "1 6" ] }	{ "input": [], "output": [] }	{"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)	3	0	{"language":[2,2,2,2,2,2,2,4,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,4,2,2(...TRUNCATED)	{"language":[2,2,2,0,2,4,2,2,2,2,4,2,3,2,0,2,2,2,2,2,2,2,0,2,4,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2(...TRUNCATED)	385		0	2,300	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1354_F. Summoning Minions	"Some days ago, I learned the concept of LCM (least common multiple). I've played with it for severa(...TRUNCATED)	{ "input": [ "5\n1 2 4 7 10" ], "output": [ "2 10" ] }	{"input":["2\n1 2\n","100\n61 96 25 10 50 71 38 77 76 75 59 100 89 66 6 99 2 13 3 23 91 93 22 92 4 8(...TRUNCATED)	{"input":["3\n7089544 9134148 -5332724\n368810 1638695 13258988\n-3866235 -4257263 5802154\n","16\n-(...TRUNCATED)	2	10	{"language":[2,2,2],"solution":["#include<bits/stdc++.h>\nusing namespace std;\n\nint N,K;\nint dp[2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,1,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,4,2,2,2,2,2,1,2,4,2,2,1,2(...TRUNCATED)	0	B	500	1,400	[]	true		{ "nanos": 0, "seconds": 2 }	256,000,000
147_B. Smile House	"Taro is an elementary school student who has just learned multiplication. Somehow, he likes multipl(...TRUNCATED)	{"input":["1500 2000 1600 3 2","1500 2000 500 90000 100000","1500 2000 1900 3 2"],"output":["7900","(...TRUNCATED)	{"input":["aabbaaaa\naaaaabab\n","qgiufelsfhanx\naaaaaaaaaaaaa\n","abcddd\nbacddd\n","azzz\nzzaz\n",(...TRUNCATED)	{"input":["5 3 2\naaaaa\nbaa\naab","5 3 2\naaaaa\nabb\naac","6 3 2\naaaaa\naaa\naab","6 3 2\naabaa\n(...TRUNCATED)	2	10	{"language":[3,3,2,4,4,3,2,3,4,4,1,4,3,1,3,1,2,4,3,1,3,4,2,1,2,2,2,3,3,3,3,4,3,2,4,4,2,4,2,3,2,2,1,1(...TRUNCATED)	{"language":[2,4,2,2,2,2,3,2,2,2,1,2,2,2,4,2,2,2,4,4,1,2,4,4,2,1,4,4,4,2,2,2,2,4,2,2,2,1,2,4,2,2,2,2(...TRUNCATED)	0		1,500	1,900	[ "" ]	false		{ "nanos": 0, "seconds": 4 }	256,000,000
p04048 AtCoder Grand Contest 001 - Mysterious Light	"Ehab has an array a of length n. He has just enough free time to make a new array consisting of n c(...TRUNCATED)	{"input":["2 7\n4\n2\n1\n0\n-1\n-2\n-4\n131\n137\n2 7\n4\n2\n1\n0\n-1\n-2\n-4\n131\n123\n10 7\n-4\n-(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\nDSAWWAW\nD\nAW\n","3\nWSAWDAW\nD\nAW\n","3\nDAAWWSW\nD\nAW\n","3\nWAWWASD\nD\nWA\n","3(...TRUNCATED)	3	9	{"language":[3,1,3,2,3,3,3,1,2,2,2,1,4,4,1,4,2,2,4,2,4,2,3,2,2,4,3,3,3,3,1,3,2,1,1,3,2,3,4,4,4,4,3,4(...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)	1,037	E	0	1,000	[]	false		{ "nanos": 0, "seconds": 4 }	256,000,000
p02652 AtCoder Grand Contest 045 - 01 Unbalanced	"Bhavana and Bhuvana place bet every time they see something interesting that can occur with a proba(...TRUNCATED)	{"input":["byebye","abcdefghijklmnopqrstuvwxyz","aabxyyzz","abcabcxabcx"],"output":["1","26","2","3"(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["4 4","1 15","2 4","2 15","3 0","2 26","3 -1","2 32","0 -1","1 32","0 -2","1 17","-1 -2","(...TRUNCATED)	2	8	{"language":[1],"solution":["p=10**9+7;\n\ndef modpow(x,n):\n\tif(n==0):\n\t\treturn 1;\n\telif(n%2=(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,4,4,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	526	D	0	1,900	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
brcktsrm	"A rabbit is playing a role-playing game. Just before entering the castle, he was ambushed by an ene(...TRUNCATED)	{"input":["10\n1\n248618\n3\n12 10 8\n6\n100 11 15 9 7 8\n4\n0 1 1 0\n2\n0 0\n2\n0 1\n2\n1 0\n2\n1 1(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3 1\n-1 3\n-2 -2\n","-8360 9282\n2666 2344\n9109 -2730\n","0 45\n42 -47\n-51 -42\n","45 6(...TRUNCATED)	2	0	{"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,3,2,2,3,2,2,3,2,2,2,3,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0		0	0	[ "games", "math", "number theory" ]	true		{ "nanos": 0, "seconds": 1 }	256,000,000
354_E. Lucky Number Representation	"Takahashi went to an all-you-can-eat buffet with N kinds of dishes and ate all of them (Dish 1, Dis(...TRUNCATED)	{ "input": [ "8\nE7\nE7\nE7\n00\n00\nE7\nE7\nE7\n", "4\n7\nF\nF\nF\n" ], "output": [ "1", "1" ] }	{ "input": [], "output": [] }	{"input":["1100 0\n","6 6\n1 2 1 10\n2 3 1 10\n3 6 1 1\n1 4 1 6\n4 5 1 3\n5 6 1 3\n","4 4\n1 2 1 10\(...TRUNCATED)	2	2	{"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,4,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,2,2,2,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h(...TRUNCATED)	494		750	0	[ "dp", "greedy", "sortings" ]	false		null	0
p03940 AtCoder Grand Contest 007 - Shik and Game	"You are given an integer n. In one move, you can either multiply n by two or divide n by 6 (if it i(...TRUNCATED)	{ "input": [ "3\n3 4 2\n4 5 0\n325 265 1231232\n" ], "output": [ "7\n4\n76\n" ] }	{"input":["6\n396640239 62005863 473635171 329666981 510631133 207643327\n","4\n363034183 741262741 (...TRUNCATED)	{"input":["25\n11632 6805 12792 25513 4573 48789 42308 23247 17502 23125 43597 22173 52717 8637 3300(...TRUNCATED)	2	9	{"language":[3,2,3,3,4,2,3,3,3,3,3,3,3,4,2,3,2,2,3,3,3,3,3,3,2,3,3,3,1,2,3,4,3,3,2,3,2,4,2,4,4,3,3,4(...TRUNCATED)	{"language":[2,2,2,0,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,0,0,0,2,0,2,2,2,2,0,2,2,0,2,2,0,2,2,2,2,0,2,0,2,2(...TRUNCATED)	1,304	D	2,000	1,100	[ "brute force", "implementation" ]	false	"D：素因数分解の多様性 (The Diversity of Prime Factorization)\n\nProblem\n\nEbi-chan has (...TRUNCATED)	{ "nanos": 0, "seconds": 3 }	0
p02744 Panasonic Programming Contest 2020 - String Equivalence	"You are given a sequence of n integers a1, a2, ..., an. \n\nDetermine a real number x such that the(...TRUNCATED)	{ "input": [ "2\n1\n3\n\nSAMPLE" ], "output": [ "1\n26\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)	2	10	{"language":[2,3,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,3,2,4,2,4,2,3,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,1,2(...TRUNCATED)	{"language":[1,2,4,1,4,3,2,2,3,4,2,4,2,1,1,3,4,3,4,4,2,3,1,3,4,3,3,4,4,2,3,2,4,1,4,2,3,3,1,4,2,2,4,2(...TRUNCATED)	0	A	1,750	0	[ "math" ]	false		{ "nanos": 0, "seconds": 6 }	0
378_C. Maze	"Description\nYou are given two strings S and T, such that length of S is greater than the length of(...TRUNCATED)	{ "input": [ "3\n2999999 43 2999957\n", "6\n2 3 2 3 2 2\n" ], "output": [ "3\n", "3\n" ] }	{"input":["5\n12\n5 4 4 3 2 2 1 1 1 1 1 1\n4\n4 3 2 1\n1\n1000000\n20\n20 19 18 17 16 15 14 13 12 11(...TRUNCATED)	{"input":["5 4","7 4","6 1","9 4","6 3","14 4","8 1","28 4","15 2","28 3","19 2","32 2","29 5","26 3(...TRUNCATED)	6	0	{"language":[1,3,2,2,2,3,4,2,4,3,3,3,2,3,1,3,3,3,3,3,3,2,3,4,3,3,4,3,3,3,3,3,4,3,4,2,3,3,2,3,4,3,3,3(...TRUNCATED)	{"language":[3,3,4,3,2,3,1,4,4,3,2,4,3,4,2,2,2,2,2,3,4,4,4,2,4,4,2,3,3,2,2,3,4,3,3,3,2,4,3,2,3,3,1,2(...TRUNCATED)	0		0	0	[ "brute force" ]	false		{ "nanos": 0, "seconds": 2 }	0