Datasets:

TheFactoryX
/

edition_1242_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
1253_F. Cheap Robot	"We have a string s consisting of lowercase English letters. Snuke is partitioning s into some numbe(...TRUNCATED)	{"input":["3 3\n0 0 0 1\n0 2 2 2\n3 3 2 3\n12\n0 0 L 0\n0 0 L 1\n0 0 L 2\n0 0 L 3\n0 0 L 4\n0 0 L 5\(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	8	{"language":[2,4,2,4,4,2,2,2,4,4,3,2,4,3,3,4,2,4,2,4,3,4,3,4,3,2,1,4,3,1,3,3,2,2,3,3,2,4,2,3,2,2,4,4(...TRUNCATED)	{"language":[2,2,2,4,2,2,4,2,4,2,4,2,2,2,1,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,4,4,2,4,2,2,2,2,2,2(...TRUNCATED)	1,195	G	500	0	[ "" ]	false		null	256,000,000
1117_F. Crisp String	"Chef and his girlfriend are going to have a promenade. They are walking along the straight road whi(...TRUNCATED)	{"input":["6\n1\n14\n2\n1 -1\n4\n5 5 5 1\n3\n3 2 1\n2\n0 1\n5\n-239 -2 -100 -3 -11\n"],"output":["YE(...TRUNCATED)	{"input":["1\n2 2 3\n","1\n4 13 13\n","1\n3 1 1\n","10\n2 1 3\n2 1 3\n2 1 3\n2 1 3\n2 1 3\n2 1 3\n2 (...TRUNCATED)	{"input":["8\n2 4 5 7 11 13 17 19\n4 8 7 1 5 2 6 3\n","1\n4\n2\n","6\n1 2 6 8 16 32\n32 16 8 4 2 1\n(...TRUNCATED)	2	11	{"language":[3,2,3,2,4,2,4,4,2,4,4,4,4,3,4,4,4,4,1,4,2,2,2,4,2,3,1,4,3,4,2,4,3,2,2,3,2,4,4,4],"solut(...TRUNCATED)	{"language":[0,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\ntypedef struct {\n dou(...TRUNCATED)	219	A	500	1,000	[ "binary search", "graphs", "matrices" ]	false		{ "nanos": 0, "seconds": 1 }	1,073,741,824
868_A. Bark to Unlock	"There are n lamps on a line, numbered from 1 to n. Each one has an initial state off (0) or on (1).(...TRUNCATED)	{ "input": [ "3\nAFI\n", "6\nAFFAAA\n" ], "output": [ "1", "4" ] }	{"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":["byeybe","zyxwvutsrqponmlkjihgfedcba","aabwyyzz","axcabcbabcx","zyxwvutsrqponmlkjihgfedbba(...TRUNCATED)	5	10	{"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": [], "solution": [] }	379	A	0	2,300	[ "combinatorics", "math", "number theory" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
p01797 Kimagure Cleaner	"Your task is very simple. Given K numbers A1, A2, ..., AK. You need to find f(N) mod max(A1, A2, .(...TRUNCATED)	{ "input": [ "0.0,0.0,1.0,0.0,1.0,1.0,0.0,1.0\n0.0,0.0,3.0,0.0,1.0,1.0,1.0,3.0" ], "output": [ "YES\nNO" ] }	{"input":["993 992 991\n","100 1 10\n","960 935 994\n","99 8 99\n","60 16 1\n","759 10 258\n","24 19(...TRUNCATED)	{"input":["13\n1\n>\n1\n?\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n","3\n2(...TRUNCATED)	2	10	{"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": [], "solution": [] }	0	B	1,000	0	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
p02211 Apple Adventure	"A substring of some string is called the most frequent, if the number of its occurrences is not les(...TRUNCATED)	{"input":["2\n1 2\n1 2\n","4\n100 42\n42 100\n5 42\n100 5\n","3\n1 2\n2 4\n3 4\n"],"output":["0\n","(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["100\n5\n48 141 231 554 425\n7\n0 19\n50 98\n143 30\n231 55\n342 0\n365 100\n600 10","180\(...TRUNCATED)	2	15	{"language":[3,3,3,1,2,3,1,4,3,4,3,2,3,2,4,4,3,4,1,1,1,3,3,3,3,1,3,1,1,4,4,3,3,4,4,4,4,3,4,3,4,3,3,1(...TRUNCATED)	{"language":[2,4,1,3,2,2,4,4,2,1,2,2,4,1,3,2,4,2,3,2,2,2,2,2,2,3,3,2,2,4,2,4,2,3,4,4,3,4,2,4,2,2,2,2(...TRUNCATED)	500	D	1,000	0	[ "implementation", "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
p03052 diverta 2019 Programming Contest - Edge Ordering	"You are working for an amusement park as an operator of an obakeyashiki, or a haunted house, in whi(...TRUNCATED)	{"input":["100\n5\n48 141 231 314 425\n7\n0 19\n50 98\n143 30\n231 55\n342 0\n365 100\n600 10","180\(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	3	12	{"language":[4,3,2,4,3,2,3,2,2,4,2,4,3,3,2,3,2,2,2,3,3,3,3,3,3,3,3,2,4,3,3,4,3,3,3,4,3,3,3,4,3,3,3,3(...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)	235		0	2,000	[ "dfs and similar", "dp", "dsu", "ternary search", "trees" ]	false		null	536,870,912
p00490 Best Pizza	"Today on a lecture about strings Gerald learned a new definition of string equivalency. Two strings(...TRUNCATED)	{"input":["3\n10 20 10\n6\n1 1\n2 1\n2 2\n3 1\n3 2\n3 3\n","7\n1 2 1 3 1 2 1\n9\n2 1\n2 2\n3 1\n3 2\(...TRUNCATED)	{"input":["8\nFF\nFF\n00\n00\nFF\nFF\n00\n00\n","4\n0\n0\n0\n1\n","8\n33\n33\n33\n33\n33\n33\n11\n11(...TRUNCATED)	{"input":["50 100\n3 24 49\n2 10 12\n1 87 92\n2 19 60\n2 53 79\n3 65 82\n3 10 46\n1 46 86\n2 55 84\n(...TRUNCATED)	2	0	{"language":[3,2,3,2,2,3,3,3,3,4,4,2,3,3,4,2,3,4,2,3,2,2,3,2,2,3,4,2,2,3,3,3,3,3,2,2,2,3,4,3,3,2,1,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,208	D	0	0	[ "" ]	false	"Background\n\n会津大学付属幼稚園はプログラミングが大好きな子供が集まる(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	256,000,000
p00819 Unreliable Message	"Dima got into number sequences. Now he's got sequence a1, a2, ..., an, consisting of n positive int(...TRUNCATED)	{ "input": [ "4 1\n1 2 3 4\n1 3\n\nSAMPLE" ], "output": [ "6 0\n" ] }	{"input":["5\n42665793 142698407 856080769 176604645 248258165\n10\n1 5 141156007\n2 5 5 3\n2 4 4 2\(...TRUNCATED)	{"input":["10 15 10 5\n","20 0 2 3\n","7 3 2 2\n","29 10 5 10\n","3 2 2 2\n","20 17 20 30\n","101 18(...TRUNCATED)	6	2	{"language":[2,2,3,2,2,2,4,4,2,2,2,3,2,2,4,2,2,2,4,2,2,3,4,2,2,4,2,2,2,2,2,4,2,2,2,3,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,4,2,4,2,2,2,4,4,3,3,4,4,2,4,2,4,3,4,4,2,2,4,2,2,2,2,2,3,2,2,2,2,4,2,2,2,2,4,4,2(...TRUNCATED)	0	A	0	2,100	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	64,000,000
p01738 Gravity Point	"You are given a table consisting of n rows and m columns. Each cell of the table contains either 0 (...TRUNCATED)	{"input":["4\nSSSSEEEECCCCEECCCC\nCCCCCSSSSEEECCCCSS\nSSSSSEEESSCCCCCCCS\nEESSSSCCCCCCSSEEEESAMPLE"](...TRUNCATED)	{"input":["2 1\n1000000000 1000000000\n2 1\n","3 2\n123 345 567\n1 2\n3 2\n","3 0\n4 1 4\n","3 2\n1 (...TRUNCATED)	{"input":["47\nS 10\nS 11\nS 12\nS 13\nH 1\nH 2\nS 6\nS 7\nS 8\nS 9\nH 6\nH 8\nH 9\nH 10\nH 11\nH 4\(...TRUNCATED)	2	0	{"language":[2,3,2,2,4,3,3,3,3,4,4,4,3,4,2,3,3,2,3,3,2,4,3,3,3,2,2,1,3,3,3,3,4,3,1,4,3,3,3,2,3,2,3,3(...TRUNCATED)	{"language":[2,2,2,3,2,4,2,2,3,1,3,2,2,2,2,3,4,2,2,2,2,2,3,2,2,4,2,3,2,3,3,4,2,2,2,3,2,3,2,3,2,2,2,3(...TRUNCATED)	0	A	0	900	[ "dp", "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
ig01	"Garfield the cat likes candies A LOT. He always keeps a huge stock of it at his home. Today John, h(...TRUNCATED)	{"input":["2\n10 1\n1 2 -3 -5 4 6 -3 2 -1 2\n10 2\n1 2 -3 -5 4 6 -3 2 -1 2\n\nSAMPLE"],"output":["12(...TRUNCATED)	{"input":["49 749442\n8888888\n8888888\n8888888\n5777777\n5777777\n5777777\n5777777\n5777777\n577777(...TRUNCATED)	{"input":["2\n1 0\n50 50\n50","4\n2 3 4 1\n13 5 1 24\n45 9 15","4\n2 3 4 1\n13 5 1 24\n45 9 16","4\n(...TRUNCATED)	5	12	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\n\nusing names(...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)	7	C	1,000	0	[ "bitmasks", "dp", "games" ]	false		{ "nanos": 0, "seconds": 3 }	256,000,000