Datasets:

TheFactoryX
/

edition_0816_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
p01691 Disappear Drive	"Monk loves cakes! He visits the Binary Bakery to buy some of his favorite cheesecakes. \nThe owner(...TRUNCATED)	{ "input": [ "2 2\n2 3\n2 3\n2 3\n2 2\n3 2", "2 2\n2 3\n2 3\n2 3\n2 2\n2 2" ], "output": [ "yes", "no" ] }	{ "input": [], "output": [] }	{"input":["11\n54 91 4 6 88 23 38 71 77 10 84\n","20\n12 37 81 56 61 2 26 27 59 69 24 7 71 76 45 54 (...TRUNCATED)	3	10	{"language":[4,3,3,3,3,3,3,3,3,2,3,3,4,3,3,3,4,4,3,3,4,3,3,3,3,3,3,3,4,2,3,1,3,3,3,3,3,3,3,3,3,3,4,3(...TRUNCATED)	{ "language": [], "solution": [] }	1,513		500	0	[ "brute force", "constructive algorithms", "implementation", "strings" ]	false		{ "nanos": 0, "seconds": 5 }	256,000,000
p01219 Private Teacher	"There are n cities in Berland and some pairs of them are connected by two-way roads. It is guarante(...TRUNCATED)	{ "input": [ "3\n25\n46\n99" ], "output": [ "2\n1\n2\n" ] }	{"input":["1\n9\n>>>>>>>><\n","13\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\(...TRUNCATED)	{"input":["993 992 471\n","960 935 1422\n","105 8 99\n","60 1 1\n","759 10 123\n","31 19 9\n","1705 (...TRUNCATED)	6	2	{"language":[2,2,2,2,2,2],"solution":["#include <stdio.h>\n#include <stdlib.h>\n#include <assert.h>\(...TRUNCATED)	{"language":[3,4,3,4,3,2,4,4,4,3,2,3,3,2,4,1,2,4,2,4,4,4,3,4,1,3,2,2,2,3,2,4,3,3,2,3,2,2,3,1,4,2,3,3(...TRUNCATED)	0		0	1,000	[ "dp" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
670_B. Game of Robots	"Manao works on a sports TV. He's spent much time watching the football games of some country. After(...TRUNCATED)	{"input":["abc\ndefg\n","czaaab\nabcdef\n","aad\naac\n","abad\nbob\n"],"output":["-1\n","abczaa\n","(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["4\nlu ru ld rd\n4\nlu ld lu ru\n0\nlu\n10\nru lu ld rd ru rd ru lu rd ld\n0","4\nlu ru ld(...TRUNCATED)	2	0	{"language":[2,2,2,2,2,2,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,2,2,2,2,2,2,2,2,2,2,4,2,2(...TRUNCATED)	{"language":[4,2,2,2,2,2,2,2,2,1,2,2,2,1,3,2,2,2,1,2,2,3,2,3,2,2,2,2,2,2,2,2,2,2,3,2,2,4,4,3,2,2,3,2(...TRUNCATED)	977	A	1,000	0	[ "" ]	false		null	256,000,000
242_C. King's Path	"The bear decided to store some raspberry for the winter. He cunningly found out the price for a bar(...TRUNCATED)	{ "input": [ "3\n2 3 3" ], "output": [ "2" ] }	{ "input": [], "output": [] }	{"input":["19 23\nU..U..R........L...D...\n.D.....UL.U.U........DR\n..D.U..D....L......R...\nD......(...TRUNCATED)	2	0	{"language":[3,4,3,4,3,2,2,3,3,3,4,3,3,2,3,2,1,2,3,3,2,3,3,2,4,4,4,2,3,3,3,3,3,4,3,3,2,3,3,3,2,3,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)	615	B	2,000	2,500	[ "*special", "dfs and similar", "trees" ]	true		{ "nanos": 0, "seconds": 1 }	256,000,000
663_A. Rebus	"Polycarp plays a well-known computer game (we won't mention its name). In this game, he can craft t(...TRUNCATED)	{ "input": [ "16\n.*......\n", "11\n.......\n" ], "output": [ "yes", "no" ] }	{ "input": [ "1\n3 3\n1 2\n2 3\n1 3" ], "output": [ "2\n" ] }	{"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	13	{"language":[3,2,4,2,2,2,3,3,3,4,3,3,3,2,4,3,2,4,2,3,2,2,3,2,2,4,2,2,3,3,4,3,3,2,2,2,4,3,3,3,3,3,2,2(...TRUNCATED)	{"language":[3,2,3,2,4,4,2,4,3,4,4,4,2,4,3,4,4,4,2,4,2,2,3,4,4,3,2,3,3,3,3,2,2,4,4,4,2,3,4,4,4,4,4,2(...TRUNCATED)	366		0	0	[ "combinatorics", "dp" ]	false		{ "nanos": 0, "seconds": 1 }	268,435,456
323_C. Two permutations	"ZS the Coder has drawn an undirected graph of n vertices numbered from 0 to n - 1 and m edges betwe(...TRUNCATED)	{ "input": [ "1\n5 3\n200 6 9" ], "output": [ "120" ] }	{"input":["5 3\n","1500 2000\n","500 1000\n","1000 1000\n","5 5\n","2000 2\n","1000 500\n","3 1000\n(...TRUNCATED)	{"input":["3703 4549\n433\n","2931 2881\n710\n","3762 947\n1073\n","4583 2774\n986\n","7 10\n1\n","1(...TRUNCATED)	2	9	{"language":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"solution":["d(...TRUNCATED)	{"language":[2,1,2,2,2,2,2,2,0,2,4,2,2,3,2,2,2,2,2,2,2,4,3,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,4,0,2(...TRUNCATED)	0		0	0	[ "" ]	false	"E - Disappear Drive / 消えるドライヴ\n\nStory\n\nDのひとはバスケットボールが好(...TRUNCATED)	null	256,000,000
p02260 Selection Sort	"You are given a sequence of length N: A_1, A_2, ..., A_N. For each integer i between 1 and N (inclu(...TRUNCATED)	{ "input": [ "2\n2\n3\n\n\nSAMPLE" ], "output": [ "2\n4\n" ] }	{ "input": [], "output": [] }	{"input":["3\nooe\n","36\naaiouyaaeeiioouuyyaaeeeeiiiooouuuyyy\n","3\npoo\n","1\nb\n","4\nooee\n","5(...TRUNCATED)	2	7	{"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":[2,2,2,2,2,2,2,0,2,2,2,0,3,2,2,3,2,4,0,2,2,2,2,0,2,2,2,2,4,2,2,2,2,2,0,2,2,2,2,2,2,3,2,2(...TRUNCATED)	188	H	0	1,500	[]	false		{ "nanos": 0, "seconds": 8 }	268,435,456
p00260 Cats Going Straight	"Petya studies positional notations. He has already learned to add and subtract numbers in the syste(...TRUNCATED)	{"input":["6 2\n100 1 10 40 10 40\n","5 1\n5 10 7 3 20\n","3 0\n1 2 3\n"],"output":["97\n","3\n","0\(...TRUNCATED)	{"input":["xoox\n.xx.\no..o\n..xo\n","o.xx\nxo.o\n...o\n..x.\n","xxoo\no.oo\n...x\nx..x\n","o..x\n..(...TRUNCATED)	{"input":["9\n3 9 7 6 9 7 8 9\n","4\n3 4 4\n","8\n3 5 7 8 8 7 8\n","8\n3 8 7 8 8 7 8\n","7\n7 3 4 7 (...TRUNCATED)	2	0	{"language":[2,4,2,3,1,4,1,2,4,3,4,1,3,3,3,3,4,1,2,3,4,2,2,3,3,4,3,3,3,1,1,2,4,2,1,1,3,3,3,1,2,4,1,1(...TRUNCATED)	{"language":[2,4,2,2,4,2,2,2,2,2,2,4,2,2,4,2,4,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,4,2,2(...TRUNCATED)	0		0	0	[ "implementation" ]	false		null	0
470_F. Pairwise Sums	"You are given an integer n. You have to apply m operations to it.\n\nIn a single operation, you mus(...TRUNCATED)	{"input":["4 6 0\n0 1 3\n0 2 2\n2 0 1\n2 3 1\n3 0 1\n3 1 5","6 10 0\n0 2 7\n0 1 1\n0 3 5\n1 4 9\n2 1(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	8	{"language":[2,2,3,1,3,1,2,3,4,3,3,4,1,3,1,1,3,1,1,3,3,4,3,4,3,2,2,3,3,4,2,1,2,2,4,2,1,4,3,3,4,4,2,3(...TRUNCATED)	{"language":[2,2,2,2],"solution":["#include <bits/stdc++.h>\nint main() {\n std::priority_queue<std(...TRUNCATED)	1,397		2,000	2,300	[ "binary search", "geometry", "two pointers" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
38_C. Blinds	"A certain business maintains a list of all its customers' names. The list is arranged in order of i(...TRUNCATED)	{ "input": [ "4\n6 6 5 5\n", "5\n1 2 3 1 3\n", "4\n6 6 4 4\n" ], "output": [ "0", "4", "-8" ] }	{"input":["7\n7 3 4 6 6 7\n","4\n3 3 4\n","6\n3 3 6 6 6\n","5\n4 4 4 5\n","9\n2 9 7 6 9 7 8 9\n","3\(...TRUNCATED)	{"input":["3\n((()))\n(())()\n()())","3\n((()()\n(())()\n()(()","3\n((()))\n(())))\n()())","3\n)))(((...TRUNCATED)	3	8	{"language":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"solution":["# @author Kil(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,3,4,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,4,2(...TRUNCATED)	425	D	500	1,700	[ "constructive algorithms", "expression parsing", "greedy", "math" ]	false		null	256,000,000