Datasets:

TheFactoryX
/

edition_0786_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	time_limit dict	memory_limit_bytes int64 0 1.07B
play-with-string	"Advertising has become part of our routine. And now, in the era of progressive technologies, we nee(...TRUNCATED)	{"input":["byebye","abcdefghijklmnopqrstuvwxyz","aabxyyzz","abcabcxabcx"],"output":["1","26","2","3"(...TRUNCATED)	{"input":["3\nAZAMON APPLE\nAZAMON AAAAAAAAAAALIBABA\nAPPLE BANANA\n"],"output":["AAZMON\n---\nAEPLP(...TRUNCATED)	{"input":["1 1 1\n\n0\n\n0\n\n2344\n\n0\n\n0\n\n0\n","1 1 1\n\n0\n\n0\n\n0\n\n0\n\n0\n\n1\n","4 3 2\(...TRUNCATED)	2	7	{"language":[1,1],"solution":["import datetime\ndt='21/03/2012'\nday, month, year = (int(x) for x in(...TRUNCATED)	{"language":[2,2,3,2,2,4,4,2,2,2,4,2,2,2,2,2,3,2,2,2,4,3,3,3,2,3,3,2,3,4,2,3,2,2,2,2,4,4,3,2,2,3,2,2(...TRUNCATED)	1,158		0	2,400	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	0
87_B. Vasya and Types	"Our beloved detective, Sherlock is currently trying to catch a serial killer who kills a person eac(...TRUNCATED)	{ "input": [ "3\nAFI\n", "6\nAFFAAA\n" ], "output": [ "1", "4" ] }	{ "input": [], "output": [] }	{"input":["1 0\n40654\n","3 3\n1 1 0\n1 2\n2 3\n3 1\n","5 4\n1 2 2 2 2\n1 2\n2 3\n1 4\n1 5\n","4 4\n(...TRUNCATED)	1	9	{"language":[4,2,2,4,2,2,2,2,4,2,3,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,1,4,2,2,2,4,2,2,4,2,2,2,2,2,2,4,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,0,2,2,2,0,2,2,2,2,2],"solution":["#include <stdio.h>\n#include <string.h>\n#i(...TRUNCATED)	19	A	0	1,300	[]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1470_E. Strange Permutation	"A string is called a KEYENCE string when it can be changed to `keyence` by removing its contiguous (...TRUNCATED)	{"input":["2 10\n0 0\n10000 0","4 50\n0 10000\n1 10000\n2 0\n10000 0","5 10\n0 0\n10 10\n20 0\n30 10(...TRUNCATED)	{"input":["3 14\n8 9\n10 7\n","12 11\n11 12\n16 7\n","12 17\n10 19\n13 16\n","9 12\n3 17\n10 10\n","(...TRUNCATED)	{"input":["1\n1 0 1 1\n10000 10000 10000 10000","2\n10 3 1 2\n2 4 1 3\n1 2 1 1","2\n10 3 1 2\n2 4 1 (...TRUNCATED)	2	8	{"language":[4,2,4,2,2,2,3,2,1,2,2,2,4,2,2,2,4,2,2,2,2,2,4,2,2,2,3,2,4,4,2,4,2,2,2,2,4,4,4,4,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)	846	B	0	1,000	[ "implementation", "math" ]	false	{ "nanos": 500000000, "seconds": 0 }	256,000,000
277_C. Game	"You are running through a rectangular field. This field can be represented as a matrix with 3 rows (...TRUNCATED)	{"input":["3 8\n10 20\n0 0\n20 40\n300 600\n30 60\n170 340\n50 100\n28 56\n90 180\n-4 -8\n-1 -2\n","(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["4","6","3","7","5","8","4","3","5","6","8","7"],"output":["aaaa\naaab\naaba\naabb\naabc\n(...TRUNCATED)	2	8	{"language":[4,4,2,4,4,4,2,4,2,4,2,3,3,3,2,2,2,2,4,3,2,2,2,4,4,2,3,2,4,4,2,2,4,3,3,4,1,2,4,4,4,4,4,3(...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)	0	D	0	2,700	[ "implementation", "sortings", "strings" ]	false	{ "nanos": 0, "seconds": 1 }	0
special-matrix-1	"Jack is the most intelligent student in the class.To boost his intelligence,his class teacher gave (...TRUNCATED)	{ "input": [ "2\n" ], "output": [ "25\n" ] }	{"input":["20\nadd 17\nadd 18\nadd 19\nsum\nadd 20\nadd 21\nadd 22\nsum\nadd 23\nadd 24\nadd 25\nsum(...TRUNCATED)	{"input":["4 0 1\n1 -1\n1 3\n3 3\n3 -1\n","3 0 0\n-10 1\n1 2\n1 1\n","20 -999719 -377746\n-999718 -3(...TRUNCATED)	2	12	{"language":[2,2,2,1,2,3,2,4,2,4,4,4,2,4,2,4,2,2,2,2,4,2,4,3,2,4,2,2,4,4,2,4,3,4,3,2,4,4,1,4,3,2,4,4(...TRUNCATED)	{"language":[2,3,2,4,4,1,4,2,3,4,2,2,4,2,2,4,1,2,2,4,3,2,4,2,3,1,4,4,4,2,1,3,1,2,2,4,3,2,2,2,4,1,2,2(...TRUNCATED)	0	B	2,750	2,300	[ "brute force", "constructive algorithms", "greedy", "math" ]	false	{ "nanos": 0, "seconds": 2 }	134,217,728
331_D2. Escaping on Beaveractor	Example Input 2 -3 4 L 2 5 ? 3 5 Output 2 L 4 L 3	{ "input": [ "6\n2 3 1 3 2 4\n2\n1 0 4\n2 3 5\n\nSAMPLE" ], "output": [ "2\n-1" ] }	{"input":["10 9 5\n0 0 0 0 0 0 0 0 0 4\n10 3\n10 7\n10 5\n10 8\n10 9\n10 1\n10 4\n10 6\n10 2\n","10 (...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	6	{"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)	{"language":[2,2,2,2,2,2,2,4,4,2,2,4,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2(...TRUNCATED)	0	B	0	0	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
substrings-count-3	"You might have heard about our new goodie distribution program aka the \"Laddu Accrual System\". Th(...TRUNCATED)	{ "input": [ "1\n4 5\n9 7 5 3\n8 6 4 2 0\n\nSAMPLE" ], "output": [ "9 8 7 6 5 4 3 2 0\n" ] }	{ "input": [], "output": [] }	{"input":["3\n9 5 8\n8 9 3\n9 5 2\n","50\n48 45 42\n32 45 8\n15 41 47\n32 29 38\n7 16 48\n19 9 21\n1(...TRUNCATED)	2	0	{"language":[1,1,1],"solution":["t=input()\nfrom fractions import gcd\nfor x in range(t):\n\tn1=inpu(...TRUNCATED)	{"language":[3,4,3,3,2,3,2,4,2,3,2,2,4,3,2,2,4,3,4,4,4,3,2,2,4,3,1,2,3,2,4,4,4,3,4,3,3,2,4,2,4,3,3,4(...TRUNCATED)	283	B	1,750	1,600	[ "brute force", "implementation" ]	true	{ "nanos": 0, "seconds": 5 }	268,435,456
284_B. Cows and Poker Game	"I have n tickets for a train with a rabbit. Each ticket is numbered from 0 to n − 1, and you can (...TRUNCATED)	{ "input": [ "5 3 2\naaaaa\naaa\naab" ], "output": [ "1 6" ] }	{"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":["13372 2590 2818\n","78 28 44\n","9178 2255 2041\n","6571 10325 8965\n","6151 6148 1348\n"(...TRUNCATED)	3	10	{"language":[2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,1,2,2,2,2,2,4,2,2,2,2,2,2,1,4,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0	D	1,500	0	[ "binary search", "bitmasks", "combinatorics", "data structures", "divide and conquer" ]	false	{ "nanos": 0, "seconds": 1 }	268,435,456
brcktsrm	"You have a Petri dish with bacteria and you are preparing to dive into the harsh micro-world. But, (...TRUNCATED)	{"input":["3 4\n10 10\n-10 -10\n3 3\n1 2\n2 3\n3 5\n3 5","2 2\n2 0\n0 0\n-1 0\n1 0","5 5\n-100000000(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3 4\n10 10\n-10 -10\n3 3\n1 2\n2 3\n3 5\n3 10","2 2\n2 0\n0 0\n-1 -1\n1 0","3 4\n10 10\n-(...TRUNCATED)	2	0	{"language":[3,4,3,1,3,1,2,3,4,3,3,2,3,2,4,3,2,2,2,1,1,2,3,3,3,3,3,2,4,4,4,2,4,4,2,4,3,3,4,1,3,4,1,2(...TRUNCATED)	{"language":[2,2,2,3,2,4,3,2,2,2,2,2,2,3,4,2,2,2,0,2,0,2,2,2,2,2,3,2,2,2,2,2,0,2,2,2,2,2,2,4,2,1,1,3(...TRUNCATED)	0		0	1,800	[ "brute force", "math" ]	false	{ "nanos": 0, "seconds": 2 }	268,435,456
1374_E1. Reading Books (easy version)	"A chessboard n × m in size is given. During the zero minute we repaint all the black squares to th(...TRUNCATED)	{ "input": [ "3\n4\n", "5\n10\n", "101\n99\n" ], "output": [ "1", "9", "2" ] }	{"input":["2 5 1\n0 5 6\n0 2 7\n","1 1 1000000000\n0 0 0\n","2 200 5\n1 1 1\n12 3 15\n","2 10 5\n1 1(...TRUNCATED)	{"input":["10 20 11\njsnr u eq qas gcj rnnf fpb c dz g\n","10 10 19\nlguv zi riht pf jtbo qmj qp nvh(...TRUNCATED)	6	0	{"language":[2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2(...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)	0		2,000	2,500	[ "" ]	false	{ "nanos": 0, "seconds": 3 }	0