Datasets:

TheFactoryX
/

edition_3060_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	untranslated_description large_stringclasses 36 values	time_limit dict	memory_limit_bytes int64 0 1.07B
p04048 AtCoder Grand Contest 001 - Mysterious Light	"A new type of mobile robot has been developed for environmental earth observation. It moves around (...TRUNCATED)	{"input":["2 0\n1 1 1 1\n","2 2\n0 1 2 3\n2 5\n0 4\n","1 0\n2 3\n"],"output":["1.0000000000\n","1.50(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["176856\n","468424\n","371312\n","1559681\n","1362308\n","1165938\n","1001000\n","45859\n"(...TRUNCATED)	2	0	{ "language": [], "solution": [] }	{"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)	0	E	0	1,400	[]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
1208_D. Restore Permutation	"A certain business maintains a list of all its customers' names. The list is arranged in order of i(...TRUNCATED)	{ "input": [ "6\n1 2 3 4 5 6\n", "10\n10 9 7 8 6 5 3 4 2 1\n" ], "output": [ "0\n", "2\n" ] }	{"input":["384\n87 78 16 94 36 87 93 50 22 63 28 91 60 64 27 41 27 73 37 12 69 68 30 83 31 63 24 68 (...TRUNCATED)	{"input":["2\n1 20\n","10\n450661 128600 993228 725823 293549 33490 843121 528432 556169 448234\n","(...TRUNCATED)	2	8	{"language":[2,2,2,2,2],"solution":["\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define int (...TRUNCATED)	{"language":[4,1,2,2,2,1,2,2,2,4,2,3,2,4,4,2,4,2,4,2,2,4,4,2,4,3,2,2,2,2,4,2,4,2,1,2,2,4,2,2,2,2,2,2(...TRUNCATED)	167		1,000	0	[ "constructive algorithms", "implementation" ]	false		{ "nanos": 0, "seconds": 1 }	0
1398_A. Bad Triangle	"KM country has N kinds of coins and each coin has its value a_i.\n\nThe king of the country, Kita_m(...TRUNCATED)	{ "input": [ "1 30 0\n-1 -1 -1" ], "output": [ "00:30:00\n01:30:00" ] }	{"input":["89 1\n50 53 97 41 68 27 53 66 93 19 11 78 46 49 38 69 96 9 43 16 1 63 95 64 96 6 34 34 45(...TRUNCATED)	{"input":["3\n1\n2 3\n2\n4 5\n5 6\n2\n2 3\n1 5","3\n1\n2 3\n2\n4 5\n5 6\n1\n2 3\n3 5","3\n1\n1 3\n2\(...TRUNCATED)	2	7	{"language":[3,2,4,2,3,2,2,2,2,4,4,4,3,3,4,3,3,3,4,3,3,4,2,2,3,3,2,2,4,3,3,2,2,2,3,2,4,3,2,2,3,4,4,2(...TRUNCATED)	{ "language": [], "solution": [] }	483	C	0	900	[ "graphs" ]	false		{ "nanos": 0, "seconds": 4 }	256,000,000
p01316 Differential Pulse Code Modulation	"You are given a string of length n. Each character is one of the first p lowercase Latin letters.\n(...TRUNCATED)	{ "input": [ "3 2 1\n", "3 2 2\n", "4 2 2\n" ], "output": [ "2\n", "4\n", "4\n" ] }	{"input":["2\n-492673762 -496405053\n","13\n-958184557 -577042357 -616514099 -553646903 -719490759 -(...TRUNCATED)	{"input":["3\nDSAWWAW\nD\nAW\n","3\nWSAWDAW\nD\nAW\n","3\nDAAWWSW\nD\nAW\n","3\nWAWWASD\nD\nWA\n","3(...TRUNCATED)	2	7	{"language":[2,2,2,2,2,2,2,4,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,4,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,466		0	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
p03725 AtCoder Grand Contest 014 - Closed Rooms	"You are given a simple arithmetic expression of the form a?b, where a and b are integer constants, (...TRUNCATED)	{"input":["5 3\n1 2 3 4 0\n4 1 2 14 3\n","7 3\n1 2 3 4 3 2 6\n6 3 1 4 2 2 3\n","4 4\n0 1 2 3\n0 1 2 (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["4 1 1 12\n3 2 3","4 1 1 16\n3 2 3","4 1 1 16\n2 2 3","4 1 1 6\n3 1 3","4 0 1 12\n3 2 3","(...TRUNCATED)	2	11	{"language":[2,3,2,2,2,2,4,3,3,3,3,2,2,2,2,2,3,2,2,2,3,2,2,2,2,3,1,3,3,3,2,4,3,2,4,3,4,2,2,3,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,149		0	2,800	[ "*special", "implementation" ]	false		null	256,000,000
1155_A. Reverse a Substring	"PCK, which recycles Aizu's precious metal, Aizunium, has a network all over the country and collect(...TRUNCATED)	{ "input": [ "4 4\n1 2 -10 3\n1 3 1 -10\n2 4 -10 -1\n3 4 0 -3\n" ], "output": [ "4\n" ] }	{"input":["30 35 4 30\n14 2 7\n22 23 2\n5 26 3\n28 4 3\n7 5 29\n19 15 2\n11 20 12\n1 22 9\n30 21 24\(...TRUNCATED)	{"input":["5\n1 2 0\n1 3 0\n3 5 0\n3 4 0\n3\n3\n4\n1\n3\n4\n","20\n9 11 0\n1 5 0\n1 14 0\n5 17 0\n14(...TRUNCATED)	2	9	{"language":[3,3,2,4,4,3,2,3,4,4,1,4,3,1,3,1,2,4,3,1,3,4,2,1,2,2,2,3,3,3,3,4,3,2,4,4,2,4,2,3,2,2,1,1(...TRUNCATED)	{"language":[4,4,4,1,3,4,4,4,2,2,2,4,2,3,4,4,4,2,1,3,4,4,2,2,2,4,2,4,4,3,2,4,2,1,3,3,1,4,3,4,2,3,2,2(...TRUNCATED)	851	D	0	0	[ "constructive algorithms", "graphs" ]	false		{ "nanos": 0, "seconds": 1 }	512,000,000
p00953 Animal Companion in Maze	"You all know the Dirichlet principle, the point of which is that if n boxes have no less than n + 1(...TRUNCATED)	{ "input": [ "5\n0 1 2 1 2\n", "4\n0 1 2 3\n" ], "output": [ "YES\n1\n2\n3\n5\n4\n", "NO\n" ] }	{ "input": [], "output": [] }	{"input":["21\n11 19 4 19 6 0 13 7 6 2 5 3 16 16 1 9 15 21 9 21 2\n","100\n57 85 27 81 41 27 73 10 7(...TRUNCATED)	6	10	{"language":[4,2,2,4,2,4,4,2,2,4,2,2,4,2,4,2,2,2,4,2,2,1,4,2,2,2,2,2,2,2,4,2,2,4,4,2,4,2,2,2,3,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0	B	1,250	0	[ "brute force" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
p01738 Gravity Point	"You can't possibly imagine how cold our friends are this winter in Nvodsk! Two of them play the fol(...TRUNCATED)	{ "input": [ "1 1 1 4 4\n", "2 0 0 0 4\n", "4 5 6 5 6\n" ], "output": [ "3\n", "1\n", "0\n" ] }	{ "input": [], "output": [] }	{"input":["3\n1 3 2\n-100 2 6\n","2\n2 1\n-4 0\n","2\n0 1\n-4 0\n","2\n0 2\n-4 0\n","3\n1 5 2\n-167 (...TRUNCATED)	2	0	{"language":[1,1],"solution":["def isvalid(s, c):\n if c.difference(s):\n return False\n (...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)	643	F	0	0	[]	false	"r × c の2次元グリッド上の２つの座標 (a1,a2) と (b1,b2) が与えられる。ある(...TRUNCATED)	{ "nanos": 0, "seconds": 3 }	256,000,000
p00680 KND Factory	"A prime number is a natural number which has exactly two distinct natural number divisors: 1 and it(...TRUNCATED)	{"input":["2 1 2\n1 2","5 4 5\n1 2\n1 3\n1 4\n1 5","5 4 1\n1 2\n2 3\n3 4\n3 5","9 6 1\n1 2\n2 3\n3 4(...TRUNCATED)	{"input":["3 1\nerase -1\nerase 0\nerase -2147483648\n","26 25\ndefragment\nerase 1\nerase -15602008(...TRUNCATED)	{"input":["4 9\n5 1000000000 999999999 19\n","4 6\n5 1000000000 1790978867 12\n","3 5\n8 5 6\n","3 4(...TRUNCATED)	2	0	{"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":[2,0,2,2,0,2,2,0],"solution":["#include <bits/stdc++.h>\n#define pq priority_queue\nusin(...TRUNCATED)	1,199		2,000	1,400	[]	true		null	268,435,456
acdemy	"Differential pulse code modulation is one of the compression methods mainly used when compressing a(...TRUNCATED)	{"input":["4 1111\n1 10 100 1000","3 70\n20 30 10","3 10\n20 30 10","2 10\n20 20"],"output":["4","2"(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["51\n1732111733638718702525811518175029394157760329139501\n","55\n815096522892298714932212(...TRUNCATED)	6	9	{"language":[1,1],"solution":["t = int(raw_input())\n\nd = {}\n\nfor i in range(t):\n\t\n\ts = raw_i(...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,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	157	D	0	0	[ "brute force", "dp", "strings", "two pointers" ]	false		{ "nanos": 0, "seconds": 5 }	256,000,000