Datasets:

TheFactoryX
/

edition_2727_deepmind-code_contests-readymade

name large_stringlengths 4 70	description large_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 large_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
925_E. May Holidays	"Given an n × n table T consisting of lowercase English letters. We'll consider some string s good (...TRUNCATED)	{"input":["3 4 3 10\n3\n3 1 4\n4 5 9\n3 10 10\n","1 1 2 10\n2\n1 1 3\n2 6 10\n","5 7 6 11\n3\n5 3 8\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\nnxx","3\nnwx","3\nxxo","3\nxwn","3\nowx","3\npxx","3\npyx","3\npzx","3\npzw","3\npwz",(...TRUNCATED)	2	0	{"language":[2,2,2,4,2,4,4,4,2,2,2,4,4,4,2,2,2,2,2,4,2,2,4,4,3,2,2,2,4,2,2,2,2,4,4,2,2,2,2,4,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,4,4,2,2,2,2,2,2,4,2,2,4,2,4,2,2,2,2,2(...TRUNCATED)	1,176		250	2,500	[ "" ]	false	null	256,000,000
p00490 Best Pizza	"Ilya is an experienced player in tic-tac-toe on the 4 × 4 field. He always starts and plays with X(...TRUNCATED)	{ "input": [ "aaba\nabaa\n", "aabb\nabab\n" ], "output": [ "YES\n", "NO\n" ] }	{"input":["1\n656 656\n","1\n666 666\n","2\n7 4\n1 5\n","1\n33993 5\n","1\n1656 5\n","1\n1319 1777\n(...TRUNCATED)	{"input":["1\n5\n2 3 4 5 2\n","1\n3\n1 1 129021590\n","4\n7\n6 6 8 8 6 6 6\n1\n2\n5\n4 5 9 8 7\n7\n1(...TRUNCATED)	2	10	{"language":[4,3,3,4,4,3,3,3,3,2,3,3,4,2,2,3,2,4,2,3,2,3,2,1,4,4,4,3,2,3,3,2,2,3,4,2,3,4,3,4,4,3,3,4(...TRUNCATED)	{"language":[2,4,2,2,0,2,4,2,3,2,3,2,2,2,2,2,2,0,2,2,2,3,2,2,2,2,2,3,2,0,0,2,2,0,3,0,2,2,2,2,2,2,2,2(...TRUNCATED)	0	A	500	0	[ "brute force", "greedy" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1475_D. Cleaning the Phone	"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 6\n1 2 3 4\n4 0 0 1 0\n1 5 2 3 -5 -1\n","7 8\n4 5 1 1 5 5\n0 0 0 1 2 0 0\n2 6 3 7 -2 4 (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["4\n4 3 2 1\n2 3 4 1\n3\n1 2 3 4\n1 3 2 1\n2 4 2 3\n","4\n4 3 2 1\n2 3 4 1\n3\n1 2 3 4\n1 (...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,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2(...TRUNCATED)	1,208		500	2,600	[ "bitmasks", "dp", "graphs", "trees" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
p00365 Age Difference	"One day n friends gathered together to play \"Mafia\". During each round of the game some player mu(...TRUNCATED)	{"input":["341143514535\n314\n143565553551655311343411652235654535651124615163\n551544654451431564\n(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["10\n1\n248618\n3\n12 10 8\n6\n100 11 15 9 2 8\n4\n0 1 1 0\n2\n0 0\n2\n0 1\n2\n1 0\n2\n1 1(...TRUNCATED)	6	0	{"language":[3,3,3,3,4,4,2,3,3,3,4,3,3,2,1,3,3,3,2,1,3,4,4,4,2,3,4,4,3,4,3,4,2,3,3,3,4,1,2,2,3,3,3,1(...TRUNCATED)	{"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,3(...TRUNCATED)	174		0	2,200	[ "binary search", "math" ]	false	{ "nanos": 0, "seconds": 2 }	134,217,728
p02613 AtCoder Beginner Contest 173 - Judge Status Summary	"Let's denote a function \n\n<image>\n\nYou are given an array a consisting of n integers. You have (...TRUNCATED)	{ "input": [ "2 2 1 0 0 1\n", "2 2 10 11 0 1\n", "2 4 3 -1 3 7\n" ], "output": [ "1", "5", "2" ] }	{ "input": [], "output": [] }	{"input":["2 2\n2 1 2 16\n2 1 2 7\n","1 2\n1 1 1 10\n2 1 1 5\n","6 5\n1 2 3 1\n2 1 2 8\n2 3 4 7\n1 1(...TRUNCATED)	2	0	{"language":[2,3,2,4,3,4,3,4,4,3,3,2,2,4,3,4,4,4,2,4,2,2,4,3,3,3,3,2,3,1,4,3,3,2,4,2,4,2,4,2,3,3,3,2(...TRUNCATED)	{"language":[3,2,2,2,2,1,2,2,2,4,1,2,3,4,2,2,3,1,2,2,2,2,2,3,2,1,4,3,2,4,3,1,2,4,3,2,4,3,2,3,2,2,4,2(...TRUNCATED)	0	G	0	0	[ "games", "graphs" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
p03343 AtCoder Regular Contest 098 - Range Minimum Queries	"Vasily the Programmer loves romance, so this year he decided to illuminate his room with candles.\n(...TRUNCATED)	{"input":["5 5 2\n#####\n#A#B#\n# #\n#b#a#\n#####\n16 4 3\n################\n## ########## ##\n# (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["11\nadd 1\nsum\nadd 2\nsum\nadd 3\nsum\nadd 4\nsum\nadd 6\nsum\nadd 6\n","6\nadd 4\nadd 7(...TRUNCATED)	2	0	{"language":[2,2,2,2],"solution":["#include <iostream>\n#include <iomanip>\n#include <complex>\n#inc(...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,184		500	1,000	[ "data structures", "greedy" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
p01694 Step Aerobics	"To improve the boomerang throwing skills of the animals, Zookeeper has set up an n × n grid with s(...TRUNCATED)	{"input":["5 2 4 13\nhhwhh\n","3 1 100 10\nwhw\n","5 2 4 1000\nhhwhh\n","4 2 3 10\nwwhw\n"],"output"(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["10\ntypedef errtype ucywcaykzh\ntypeof &ucywcaykzh*****\ntypedef &&&&&&void******(...TRUNCATED)	6	0	{"language":[2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,4,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,4,2,4(...TRUNCATED)	{"language":[4,2,4,4,4,4,2,2,2,2,2,2,1,2,1,2,4,2,4,1,2,2,4,2,4,4,2,2,4,3,2,4,4,2,4,4,4,2,2,2,2,2,2,1(...TRUNCATED)	1,311		1,500	1,700	[ "brute force", "sortings" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
dbyz15t	"Draw a chessboard which has a height of H cm and a width of W cm. For example, the following figure(...TRUNCATED)	{"input":["1\n3\n1 2\n2 3\n1\n1\n1\n2\n2\n1\n","2\n6\n1 2\n1 3\n1 4\n4 5\n4 6\n4\n1 3 4 5\n3\n3 5 2\(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	0	{"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": [], "solution": [] }	494	F	500	0	[ "binary search", "dp" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
p01646 Dictionary	"One foggy Stockholm morning, Karlsson decided to snack on some jam in his friend Lillebror Svantens(...TRUNCATED)	{"input":["3\nTroll likes Dracul\nDracul likes Anka\nSnowy likes Hexadecimal\n210 200 180\n","2\nAnk(...TRUNCATED)	{"input":["50 50\n75 71 23 37 28 23 69 75 5 62 3 11 96 100 13 50 57 51 8 90 4 6 84 27 11 89 95 81 10(...TRUNCATED)	{"input":["3\n2 3\n3 6\n1 2\n3\n2 3\n3 5\n2 2\n0","3\n2 3\n3 6\n2 2\n3\n3 3\n3 6\n2 2\n0","3\n2 1\n3(...TRUNCATED)	2	11	{"language":[3,4,1,3,4,2,4,2,2,2,3,3,4,3,2,2,3,3,2,2,2,2,1,3,2,3,4,3,3,1,4,3,3,2,2,3,2,3,4,3,3,3,4,4(...TRUNCATED)	{"language":[3,2,3,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,3,3,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,3(...TRUNCATED)	592	B	1,250	0	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	0
p01123 Let's Move Tiles!	"Suppose you have a string S which has length N and is indexed from 0 to N−1. String R is the reve(...TRUNCATED)	{ "input": [ "1 2 10\n11\n15 7\n", "2 4 50\n20 100\n60 10 40 80\n" ], "output": [ "7", "50" ] }	{ "input": [], "output": [] }	{"input":["3 70\n20 30 5","3 10\n20 18 10","2 10\n29 20","4 1111\n1 5 100 1000","4 1111\n-1 2 110 10(...TRUNCATED)	3	7	{"language":[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,2(...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)	151	B	0	0	[ "brute force", "implementation" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000