Datasets:

TheFactoryX
/

edition_0542_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
760_F. Bacterial Melee	"Recenlty Luba got a credit card and started to use it. Let's consider n consecutive days Luba uses (...TRUNCATED)	{"input":["5 4\n1 2 3 4 5\n1 3 5 6\n","3 3\n1 2 3\n3 2 1\n","4 6\n1 3 5 2\n1 2 3 4 5 6\n"],"output":(...TRUNCATED)	{"input":["4\n1 4\n3 1\n3 4\n","5\n4 1\n4 3\n5 3\n2 4\n","21\n7 15\n13 1\n14 3\n4 10\n2 3\n16 18\n17(...TRUNCATED)	{"input":["10\n9 8 7 6 1\n","100\n41 13 29 11 25 15 6 23 28 50 48 17 3 9 44 24 5 19 34 22 33 32 20 1(...TRUNCATED)	5	12	{"language":[2,4,3,3,3,2,2,4,3,3,3,3,3,2,4,3,4,4,3,3,3,3,3,4,2,4,1,4,3,2,1,3,4,3,3,2,3,3,2,4,3,3,3,3(...TRUNCATED)	{"language":[3,2,0,2,0,2,2,3,0,2,2,2,3,2,2,3,2,2,2,2,2,2,4,4,2,2,2,3,3,2,2,3,2,2,3,3,3,2,3,2,2,0,3,2(...TRUNCATED)	868	E	1,750	1,000	[ "implementation" ]	true	{ "nanos": 0, "seconds": 3 }	0
248_A. Cupboards	"Finally Fox Ciel arrived in front of her castle!\n\nShe have to type a password to enter her castle(...TRUNCATED)	{ "input": [ "4 2\n", "6 3\n" ], "output": [ "7\n", "8\n" ] }	{"input":["7 2\n-10 0 ? 1 ? 2 10\n","1 1\n0\n","5 1\n-3 -2 -1 0 1\n","7 1\n-4 ? ? ? ? ? 2\n","17 1\n(...TRUNCATED)	{"input":["7 9 999999999 0 4\n0 1 0\n1 2 0\n2 3 0\n0 4 1\n4 1 1\n1 5 499999999\n5 2 499999999\n2 6 1(...TRUNCATED)	2	8	{"language":[2,2,4,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,1,2,2,2,2,2,2,2,4,2,2,2,2,4,2(...TRUNCATED)	{"language":[4,4,3,2,2,4,3,1,4,2,4,2,1,2,4,2,2,4,2,4,4,2,2,3,2,3,2,4,4,4,2,2,4,2,2,4,2,4,4,2,2,3,3,2(...TRUNCATED)	0		1,750	0	[ "brute force" ]	false	{ "nanos": 0, "seconds": 2 }	268,435,456
p03297 AtCoder Grand Contest 026 - rng_10s	"The blinds are known to consist of opaque horizontal stripes that can be rotated thus regulating th(...TRUNCATED)	{ "input": [ "100\n200\n5" ], "output": [ "13" ] }	{"input":["72\n909 34\n420 51\n621 76\n65 48\n82 41\n665 53\n43 33\n309 21\n942 51\n156 13\n997 11\n(...TRUNCATED)	{"input":["2\n4 1\n2 15 36 43 \n3 2\n27 29 35 \n\nSAMPLE","2\n4 1\n4 15 36 43 \n3 2\n27 29 35 \n\nSA(...TRUNCATED)	6	2	{"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":[0,0,0,0,2,0,0,2,2,1,1,0,2,4,0,2,0,0,0,0,0,0,2,2,0,0,0,2,2,2,3,2,2,2,1,3,4,2,0,2,2,0,2,2(...TRUNCATED)	0	A	0	1,800	[ "constructive algorithms", "graphs", "implementation" ]	false	null	512,000,000
39_E. What Has Dirichlet Got to Do with That?	"You are given three sequences: a_1, a_2, …, a_n; b_1, b_2, …, b_n; c_1, c_2, …, c_n.\n\nFor e(...TRUNCATED)	{ "input": [ "4 5\n10 4 18 3\n", "2 2\n1 2\n" ], "output": [ "4", "1" ] }	{"input":["1\n10 2 20\n8 5 2 4 10 3 9 7 1 6\n5 10\n3 17\n6 31\n3 46\n10 42\n7 19\n9 36\n7 3\n3 13\n8(...TRUNCATED)	{"input":["5\n3\n1 1\n1 1\n1 1\n3\n1 1\n1 1\n1 1\n3\n1 1\n1 1\n1 1\n3\n1 2\n1 1\n1 1\n3\n1 100\n1 1\(...TRUNCATED)	3	0	{"language":[1],"solution":["t = int(raw_input())\nfor _ in range(t):\n n, m, k = map(int, raw_in(...TRUNCATED)	{ "language": [], "solution": [] }	0		0	0	[ "dfs and similar", "dp", "trees" ]	false	null	0
p01974 Pigeonhole principle	"Polycarp often uses his smartphone. He has already installed n applications on it. Application with(...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": [], "output": [] }	{"input":["10\n100000000 200000000 300000000 28 500000000 600000000 700000000 800000000 900000000 10(...TRUNCATED)	2	7	{"language":[2,2,2,2,2,2],"solution":["#include <stdio.h>\n#include <string.h>\n#include <algorithm>(...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		2,000	1,900	[ "dfs and similar", "dsu", "graphs" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
954_F. Runner's Problem	"Malek has recently found a treasure map. While he was looking for a treasure he found a locked door(...TRUNCATED)	{"input":["3\n4\nS010\n0001\n1000\n111F\n3\nS10\n101\n01F\n5\nS0101\n00000\n01111\n11111\n0001F\n"],(...TRUNCATED)	{"input":["777 2\n","2 2\n","99900 1\n","50000 1\n","2 5\n","100000 99\n","22222 22\n","100000 4\n",(...TRUNCATED)	{"input":["1000 1001\n82 636 713 516\n","1000 1998\n316 681 19 233\n","4 8\n1 3 4 2\n","5 6\n4 3 2 1(...TRUNCATED)	6	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":[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)	470	E	0	0	[ "implementation", "strings" ]	false	{ "nanos": 0, "seconds": 2 }	0
268_A. Games	"Polycarp was dismantling his attic and found an old floppy drive on it. A round disc was inserted i(...TRUNCATED)	{ "input": [ "4\naaa\nabc\nabdbca\nabba" ], "output": [ "YES\nNO\nYES\nYES\n" ] }	{ "input": [], "output": [] }	{"input":["2 2\n1\n0 1\n2 1\n","10 10\n1 8 2 4 1 8 2 6 6\n4 0 0 0 0 0 0 1 0 0\n3 4 9 10 8 1 7 -8 -10(...TRUNCATED)	1	11	{"language":[2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\n\n#pragma GCC optimize(\"O3\")\(...TRUNCATED)	{"language":[4,2,2,2,4,2,4,2,2,2,3,4,1,1,3,4,1,4,2,3,4,4,1,2,4,4,4,3,4,1,4,2,4,2,2,2,3,4,4,2,1,2,3,1(...TRUNCATED)	1,227		1,500	0	[ "interactive", "math", "number theory" ]	false	{ "nanos": 0, "seconds": 2 }	0
582_A. GCD Table	"Sorting arrays is traditionally associated with high-level languages. How hard can it be in Roco? S(...TRUNCATED)	{ "input": [ "7\nabacaba\n", "3\naaa\n", "2\nab\n", "4\nbabb\n" ], "output": [ "589\n", "1\n", "3\n", "11\n" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	10	{"language":[2,4,4,2,4,4,2,2,4,3,2,4,4,2,2,3,2,4,4,2,2,2,4,4,2,3,4,2,4,2,2,3,3,3,2,2,3,2,4,2,3,4,2,4(...TRUNCATED)	{"language":[4,3,2,3,2,2,2,4,2,2,4,2,2,3,3,3,2,4,3,2,3,2,3,2,2,2,2,2,3,3,3,3,3,3,3,3,2,3,2,4,4,3,4,2(...TRUNCATED)	0		2,500	0	[ "dfs and similar" ]	false	null	134,217,728
1253_F. Cheap Robot	"You are given a string of length n. Each character is one of the first p lowercase Latin letters.\n(...TRUNCATED)	{"input":["icm codeforces\n1\ncodeforces technex\n","ross rachel\n4\nross joey\nrachel phoebe\nphoeb(...TRUNCATED)	{"input":["3\n1 2 6\n","10\n7 7 7 7 7 7 7 7 7 7\n","76\n13 13 5 6 20 20 6 1 18 18 13 15 20 3 9 11 3 (...TRUNCATED)	{"input":["1 1\nb\n10\n","20 2\ned\nci\ngg\nib\nae\ndd\nka\nce\naf\ngb\nag\nke\ngj\nab\nie\nif\ngb\n(...TRUNCATED)	6	10	{"language":[3,2,4,4,2,3,3,2,3,3,4,2,2,4,2,2,2,2,4,3,3,2,4,2,2,3,4,3,4,2,3,2,4,2,2,4,2,3,2,4,2,3,3,2(...TRUNCATED)	{"language":[3,3,2,2,2,3,2,3,4,3,3,2,4,4,2,2,4,4,4,3,4,3,3,2,1,4,4,1,1,3,4,2,3,4,3,2,2,1,3,3,3,2,4,2(...TRUNCATED)	0	E	3,000	0	[ "*special", "implementation" ]	false	{ "nanos": 0, "seconds": 1 }	268,435,456
list-sort	"You are given a matrix consisting of n rows and m columns. The matrix contains lowercase letters of(...TRUNCATED)	{"input":["5\n4 5\n10 8 6 4\n1 2 3 4 5\n1 1\n3\n3\n1 1\n3\n2\n5 3\n1000 2 2 2 3\n3 1 5\n5 5\n1 2 3 4(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	11	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,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,4(...TRUNCATED)	{"language":[2,2,4,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,2,2(...TRUNCATED)	0		0	0	[ "binary search", "data structures", "greedy", "implementation" ]	true	{ "nanos": 0, "seconds": 1 }	256,000,000