Datasets:

TheFactoryX
/

edition_0641_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
roy-and-wobbly-numbers	"In 20XX, the Aizu Chuo Road, which has a total distance of 58km and 6 sections from Atsushiokanomac(...TRUNCATED)	{"input":["2\n5\nTom Jones\nADAMS\nBOB ADAMS\nTom Jones\nSTEVE jONeS\n3\nTrudy\nTrudy\nTRUDY\n\nSAMP(...TRUNCATED)	{"input":["252662256 252662260\n","141650963 141650963\n","4 12\n","1002523 1002523\n","93 95\n","33(...TRUNCATED)	{"input":["5\nabvzx\n\nSAMOLE","5\nxbvza\n\nSAMOLE","5\nxbvya\n\nSAMOLE","5\nabvxz\n\nSAMOLE","5\nay(...TRUNCATED)	2	10	{"language":[3,3,3,3,3,2,3,3,3,3,3,4,4,4,3,2,3,3,3,2,3,2,2,3,2,4,2,3,3,3,4,2,2,3,2,2,2,3,3,3,3,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)	1,344	D	2,000	0	[ "binary search", "data structures", "graph matchings", "greedy", "implementation", "math", "trees" ]	false	{ "nanos": 0, "seconds": 3 }	256,000,000
etmx05	"In a mystical TimeLand, a person's health and wealth is measured in terms of time(seconds) left. \n(...TRUNCATED)	{ "input": [ "4 4\nDRLD\nU.UL\n.UUR\nRDDL\n", "3 5\n.D...\nRRRLL\n.U...\n" ], "output": [ "10 1\n", "6 2\n" ] }	{"input":["10 23\n6 9 8 10 4 3 7 1 5 2\n7 2\n3 2\n2 4\n2 3\n7 5\n6 4\n10 7\n7 1\n6 8\n6 2\n8 10\n3 5(...TRUNCATED)	{"input":["10\n3\n-15 -33 79\n16\n45 -84 19 85 69 -64 93 -70 0 -53 2 -52 -55 66 33 -60\n2\n14 -2\n4\(...TRUNCATED)	2	8	{"language":[2,4,4,4,4,4,4,2,4,4,2,2,4,4,3,3,1,4,4,3,2,2,3,4,4,2,2,4,4,4,4,2,2,4,2,2,2,2,2,2,2,4,2,4(...TRUNCATED)	{ "language": [], "solution": [] }	0	D	0	0	[ "math" ]	false	{ "nanos": 0, "seconds": 2 }	268,435,456
1506_F. Triangular Paths	"A monster is attacking the Cyberland!\n\nMaster Yang, a braver, is going to beat the monster. Yang (...TRUNCATED)	{"input":["5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\(...TRUNCATED)	{"input":["9\n","8\n","6\n","4\n","7\n","5\n","2\n"],"output":["1 2 3 4 5 6 7 8 \n2 4 6 8 (...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	7	{"language":[2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,4,2,2,4,4,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,4,3,3,2,4,2,2,2,2,2,2,2,2,2,4,2,3,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,4,2,2,3,2,2,2(...TRUNCATED)	0		0	0	[ "implementation", "math" ]	false	{ "nanos": 0, "seconds": 2 }	268,435,456
nopc10	"You are given an array a of n integers and an integer s. It is guaranteed that n is odd.\n\nIn one (...TRUNCATED)	{ "input": [ "2\n1\n3\n\nSAMPLE" ], "output": [ "1\n26\n" ] }	{"input":["10\ntypedef errtype ucywcaykzh\ntypeof &ucywcaykzh*****\ntypedef &&&&&&void******(...TRUNCATED)	{ "input": [], "output": [] }	2	9	{"language":[4,4,4,4,2,1,3,1,3,4,4,2,3,4,3,4,4,1,3,2,4,2,2,2,3,4,1,2,2,2,2,2,2,4,4,2,4,4,1,4,3,1,2,4(...TRUNCATED)	{"language":[4,3,4,2,1,4,3,3,2,4,2,2,4,4,2,2,4,4,3,3,4,2,4,1,2,2,3,2,3,3,3,4,4,3,2,3,2,1,3,3,3,2,3,4(...TRUNCATED)	0		2,500	0	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	0
p02257 Prime Numbers	"Polycarp starts his own business. Tomorrow will be the first working day of his car repair shop. Fo(...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":["1\n3\n1 3 1\n1 2\n2 3\n1\n1\n1\n2\n","1\n3\n1 2\n2 4\n1\n1\n1\n2\n2\n1\n","2\n6\n1 2\n1 3(...TRUNCATED)	2	11	{"language":[4,2,1,3,3,3,2,3,3,3,3,3,2,4,4,3,3,4,4,2,4,3,1,4,2,3,3,3,3,4,4,2,3,4,2,3,2,1,3,2,3,4,4,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,3,2,2,3,2,2,4,2,4,2,2,2,2,3,2,4,4,4,2,2,2,2,2,3,2,2,2,4,4,4,4,4,3,2,2,1,3(...TRUNCATED)	1,277	A	750	0	[ "brute force", "implementation" ]	false	{ "nanos": 0, "seconds": 8 }	256,000,000
925_E. May Holidays	"Jzzhu have n non-negative integers a1, a2, ..., an. We will call a sequence of indexes i1, i2, ...,(...TRUNCATED)	{ "input": [ "2 5", "9 9", "5 10" ], "output": [ "10", "81", "-1" ] }	{ "input": [], "output": [] }	{"input":["1\n7\n.......\n.*.....\n.......\n.......\n.......\n.......\n.......\n\nSAMQLE","1\n5\n...(...TRUNCATED)	2	8	{ "language": [], "solution": [] }	{"language":[2,2,4,3,4,2,4,4,4,4,4,2,1,4,2,4,2,2,2,4,2,2,2,4,1,4,2,4,4,1,4,2,2,2,1,2,2,2,3,4,4,3,3,2(...TRUNCATED)	0	F	0	3,000	[ "number theory" ]	false	{ "nanos": 0, "seconds": 8 }	0
83_C. Track	"You're trying to set the record on your favorite video game. The game consists of N levels, which m(...TRUNCATED)	{ "input": [ "1", "2" ], "output": [ "a", "aa\nab" ] }	{"input":["8 10\ncwcwcwcwcw\ncrcrcrcrcr\ncwcwcwcwcw\ncrcrcrcrcr\ncwcwcwcwcw\ncrcrcrcrcr\ncwcwcwcwcw\(...TRUNCATED)	{"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,2,2,2,4,2,3,2,2,2,4,2,2,4,4,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,4,2,2,4,4,2,2,2,2,2,2,1,4,2,2,4,2,2,2,2,2,2,2,4,2,2,2,3,2,2,2,3,2,3,2,2,2,2,2(...TRUNCATED)	977	D	750	2,100	[]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
p03194 CADDi 2018 for Beginners - Product and GCD	"Vasya is a CEO of a big construction company. And as any other big boss he has a spacious, richly f(...TRUNCATED)	{"input":["3 2\n1 2\n2 3\n","3 3\n1 2\n2 3\n3 1\n","8 12\n1 2\n2 3\n3 4\n4 1\n1 3\n2 4\n3 5\n3 6\n5 (...TRUNCATED)	{"input":["11\n54 91 4 6 88 23 38 71 77 26 84\n","20\n11 37 81 56 61 2 26 27 59 69 24 7 71 76 45 54 (...TRUNCATED)	{"input":["1\n2 2\n1 1\n1 3\n","1\n1 3\n3\n1 2 0\n","5\n4 5\n10 8 6 4\n1 2 3 4 5\n1 1\n3\n3\n1 1\n3\(...TRUNCATED)	5	0	{"language":[2],"solution":["#include <iostream>\n#include <string>\n#include <cstdio>\n#include <ve(...TRUNCATED)	{"language":[4,2,2,2,2,2,4,2,2,4,2,2,4,2,4,2,2,2,2,4,2,2,4,2,4,2,4,4,4,3,4,2,2,2,2,2,2,2,3,2,2,2,2,1(...TRUNCATED)	893		1,750	1,100	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
124_D. Squares	"To celebrate the opening of the Winter Computer School the organizers decided to buy in n liters of(...TRUNCATED)	{ "input": [ "3 1 2 3\n", "1 3 2 3\n" ], "output": [ "5\n", "4\n" ] }	{ "input": [], "output": [] }	{"input":["9 3 23\n9 3 22\n10 3 28\n16 10 107\n20 8 102\n20 10 105\n20 10 155\n3 5 3\n4 2 11\n0 0 0"(...TRUNCATED)	2	1	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,4,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,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	B	0	2,400	[]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
339_A. Helpful Maths	"Employees of JebTrains are on their way to celebrate the 256-th day of the year! There are n employ(...TRUNCATED)	{ "input": [ "ppqb", "pdbq" ], "output": [ "No", "Yes" ] }	{ "input": [], "output": [] }	{"input":["4\naaa\nabc\nabdbca\nabca","4\naaa\nabc\nabdbc`\naaca","4\naab\nacc\n`bd`cb\naaad","4\nba(...TRUNCATED)	6	7	{"language":[3,4,2,3,4,4,4,2,3,4,3,2,4,3,4,3,4,3,2,4,2,4,2,3,4,4,2,4,4,4,3,3,4,4,3,2,4,4,3,3,4,4,3,2(...TRUNCATED)	{"language":[4,2,2,2,1,2,1,3,2,4,3,4,2,4,2,2,2,2,4,3,4,4,4,2,2,4,1,4,4,4,2,4,2,4,2,2,2,2,3,1,2,2,2,4(...TRUNCATED)	83		500	2,300	[ "" ]	false	null	256,000,000