Datasets:

TheFactoryX
/

edition_0978_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
990_B. Micro-World	"problem\n\nChairman K is a regular customer of the JOI pizza shop in the center of JOI city. For so(...TRUNCATED)	{"input":["4\nsword weapon 10 2 3 2\npagstarmor armor 0 15 3 1\niceorb orb 3 2 13 2\nlongbow weapon (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1\n78 1 79\n","1\n2 6 6\n","20\n1 1 1\n1 999999999 1\n1 999999999 1\n1 999999999 1\n1 999(...TRUNCATED)	2	0	{"language":[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,4,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,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)	449		1,000	2,400	[ "binary search", "greedy", "ternary search" ]	false		{ "nanos": 0, "seconds": 6 }	64,000,000
p02157 Shuffle 2	"You are given two arrays of integers a_1,…,a_n and b_1,…,b_m.\n\nYour task is to find a non-emp(...TRUNCATED)	{"input":["1.1 3.4 2.5\n","1.9 1.8 1.7\n","2.0 2.0 2.0\n"],"output":["z^y^x\n","(x^y)^z\n","x^y^z\n"(...TRUNCATED)	{"input":["4 0 0\n1 -1\n1 3\n3 3\n3 -1\n","3 0 0\n-10 1\n0 2\n1 1\n","3 0 0\n-1 1\n0 3\n1 1\n","20 -(...TRUNCATED)	{"input":["10\n-405 -230 252 -393 -271 -259 97 163 81 -129\n","10\n1 10 2 9 6 8 4 7 5 6\n","4\n1 2 5(...TRUNCATED)	6	0	{"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,1,1,1,1],"solut(...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)	0		1,000	0	[ "constructive algorithms", "greedy", "implementation" ]	false		{ "nanos": 0, "seconds": 1 }	0
1431_I. Cyclic Shifts	"You've got array A, consisting of n integers and a positive integer k. Array A is indexed by intege(...TRUNCATED)	{ "input": [ "8\nE7\nE7\nE7\n00\n00\nE7\nE7\nE7\n", "4\n7\nF\nF\nF\n" ], "output": [ "1", "1" ] }	{ "input": [], "output": [] }	{"input":["10 9 5\n0 0 0 0 0 0 0 -1 0 4\n10 3\n10 7\n10 5\n10 8\n10 9\n10 1\n10 4\n10 6\n10 2\n","10(...TRUNCATED)	2	10	{"language":[2,2,2,2,2,2,4,4,4,2,4,2,1,4,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2,4,2,4,2,4,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,4,2,3,2,4,2,3,4,3,3,2,2,4,2,3,4,2,2,3,3,3,1,4,4,3,4,4,2,1,2,1,2,3,2,2,4,3,2,2,3,2,1,2(...TRUNCATED)	0		1,000	3,400	[]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
monks-choice-of-numbers-1	"You are given a string s consisting of n lowercase Latin letters.\n\nLet's define a substring as a (...TRUNCATED)	{ "input": [ "3\n0 0 0\n", "5\n0 1 1 1 10\n", "2\n0 1\n" ], "output": [ "3 2 1 ", "1 4 3 2 5 ", "1 2 " ] }	{"input":["8587340257\n","9\n","81\n","27\n","1408514752349\n","25\n","49380563\n","266418\n","31975(...TRUNCATED)	{"input":["7 6\nalloc 2\nalloc 2\nalloc 3\nerase 1\ndefragment\nerase 3\nalloc 4\n","8 50\nalloc 51\(...TRUNCATED)	2	12	{"language":[2,3,4,3,3,4,1,3,3,2,4,4,3,3,1,3,2,3,3,2,3,4,3,3,3,2,3,4,4,3,3,3,2,3,3,3,2,3,2,3,3,3,3,3(...TRUNCATED)	{ "language": [], "solution": [] }	630	A	500	3,000	[ "greedy" ]	true		{ "nanos": 0, "seconds": 2 }	256,000,000
p02971 AtCoder Beginner Contest 134 - Exception Handling	"There are N stations in the city where JOI lives, and they are numbered 1, 2, ..., and N, respectiv(...TRUNCATED)	{ "input": [ "4\nRRBR", "4\nBRBR" ], "output": [ "Yes", "No" ] }	{ "input": [], "output": [] }	{"input":["10803140200\n","14\n","11\n","174813966899\n","13753962\n","601828654335\n","114141413978(...TRUNCATED)	2	2	{"language":[3,2,4,2,2,4,2,2,4,4,2,2,2,2,4,2,2,2,2,2,2,4,4,4,4,2,2,2,2,4,4,2,2,1,2,2,2,4,2,4,2,2,4,2(...TRUNCATED)	{ "language": [], "solution": [] }	716	D	2,000	0	[ "brute force", "implementation", "strings" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
p00781 Lattice Practices	"A rabbit is playing a role-playing game. Just before entering the castle, he was ambushed by an ene(...TRUNCATED)	{ "input": [ "5\nabvzx\n\nSAMPLE" ], "output": [ "zx\n" ] }	{"input":["12-12-201312-12-201312-12-201313--12-201313--12-201313--12-201313--12-201313--12-201313--(...TRUNCATED)	{"input":["3\ncan you meet me ouuside ccd today\na\nthis year hard kaur is coming to entertain us","(...TRUNCATED)	3	9	{"language":[2,4,3,4,4,4,1,3,3,2,4,3,2,3,1,3,3,4,4,4,3,2,4,2,3,2,3,2,2,2,2,3,2,1,1,1,4,2,3,4,4,2,2,2(...TRUNCATED)	{"language":[4,4,3,4,3,1,3,3,4,4,2,4,3,4,3,3,4,3,4,3,4,4,2,3,4,4,3,2,2,4,3,3,2,4,3,3,2,3,2,4,4,3,4,4(...TRUNCATED)	867		0	0	[]	false	"\n\n問題\n\n$N$ 個の相違なる自然数 $a_i$ が与えられる。与えられた自然数(...TRUNCATED)	{ "nanos": 0, "seconds": 6 }	512,000,000
560_D. Equivalent Strings	"Pink Floyd are pulling a prank on Roger Waters. They know he doesn't like [walls](https://www.youtu(...TRUNCATED)	{ "input": [ "2 5", "9 9", "5 10" ], "output": [ "10", "81", "-1" ] }	{"input":["20\n-1 -1\n1 0\n2 0\n2 1\n2 1\n4 0\n1 0\n4 0\n3 0\n9 0\n6 1\n3 1\n11 1\n2 0\n2 1\n8 1\n14(...TRUNCATED)	{"input":["2\n2 2\nyz\n1 1\n2 2\nzy\n1 1\n","1\n11 2\nthisisatest\n3 7\n","3\n4 2\nabca\n1 3\n10 5\n(...TRUNCATED)	5	0	{"language":[3,2,4,3,3,3,3,3,3,2,4,3,4,4,3,2,3,2,2,3,4,2,3,2,4,4,4,3,2,3,2,4,3,2,3,4,4,3,2,2,4,2,2,4(...TRUNCATED)	{"language":[4,4,1,3,4,1,4,2,3,4,3,1,3,2,4,4,4,1,1,3,2,4,4,4,2,2,4,2,4,2,4,4,1,2,2,4,1,1,4,4,2,2,4,3(...TRUNCATED)	0		0	2,000	[ "constructive algorithms", "graphs", "math", "shortest paths", "sortings" ]	false		null	268,435,456
p01576 Exciting Bicycle	"Friends Alex and Bob live in Bertown. In this town there are n crossroads, some of them are connect(...TRUNCATED)	{ "input": [ "2 3\n", "1 1\n", "49 1808\n" ], "output": [ "6\n", "0\n", "359087121\n" ] }	{"input":["100\n0 0 57 121 57 0 19 251 19 301 19 160 57 578 664 57 19 50 0 621 91 5 263 34 5 96 713 (...TRUNCATED)	{ "input": [], "output": [] }	2	0	{"language":[2,2,2,4,2,2,3,3,4,3,4,3,3,2,4,4,1,3,4,4,1,3,2,4,2,2,2,4,3,3,3,2,4,2,2,3,1,2,2,4,3,4,4,3(...TRUNCATED)	{"language":[4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,4,4,4,2,2,2,4,4,2,1,3,2,2,2,4,2,2,2,4,4,2,2,2,2(...TRUNCATED)	1,007	D	500	0	[]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
p04048 AtCoder Grand Contest 001 - Mysterious Light	"The bloodiest battle of World War II has started. Germany and its allies have attacked the Soviet u(...TRUNCATED)	{ "input": [ "2\n2 1\n3 2\n\nSAMPLE" ], "output": [ "Rani\nRani\n" ] }	{"input":["78 78\n-645462 -187679 693035 927066 431506 16023 -173045 698159 -995400 -687770 -747462 (...TRUNCATED)	{"input":["30\n10 1 8 10 2 6 37 7 3 7 1 3 1 1 14 2 5 19 4 1 13 3 5 6 1 5 1 1 23 1\n98 4 43 41 56 58 (...TRUNCATED)	2	11	{"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":[3,1,2,2,1,2,4,3,3,2,2,4,2,4,4,4,2,2,2,1,2,4,2,1,1,4,3,3,3,2,4,2,2,2,2,3,2,4,4,2,2,4,2,2(...TRUNCATED)	39		500	0	[ "bitmasks", "dp" ]	false	"りんごだいぼうけん\n\nsquare1001君とE869120君は縦 $H$ 行、横 $W$ 列のグリッ(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	256,000,000
1348_F. Phoenix and Memory	"Gildong was hiking a mountain, walking by millions of trees. Inspired by them, he suddenly came up (...TRUNCATED)	{"input":["3 3\n1 2 1\n2 3 1\n1 3 5","100 0","10 3\n8 7 100\n7 9 100\n9 8 100","3 3\n1 2 1\n2 3 1\n1(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["15 28\n10 7\n5 9\n2 13\n2 14\n6 1\n9 12\n2 10\n3 9\n10 15\n11 12\n12 6\n2 12\n12 8\n4 10\(...TRUNCATED)	5	10	{"language":[2,2,2,1,2,3,2,4,2,4,4,4,2,4,2,4,2,2,2,2,4,2,4,3,2,4,2,2,4,4,2,4,3,4,3,2,4,4,1,4,3,2,4,4(...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		2,500	1,600	[ "math" ]	false		{ "nanos": 0, "seconds": 1 }	1,073,741,824