Datasets:

TheFactoryX
/

edition_2559_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
p00914 Equal Sum Sets	"Little Petya likes arrays of integers a lot. Recently his mother has presented him one such array c(...TRUNCATED)	{"input":["11 7 5\n24979445 861648772 623690081 433933447 476190629 262703497 211047202 971407775 62(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["10\n669924290 408119795 283272835\n663737793 250734602 29671646\n431160679 146708815 2894(...TRUNCATED)	2	7	{"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":[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)	760		0	0	[]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
p01353 Rabbit Plays Games!	"Levko loves array a1, a2, ... , an, consisting of integers, very much. That is why Levko is playing(...TRUNCATED)	{"input":["9 4 12\nthis is a sample text for croc final round\n","9 1 9\nthis is a sample text for c(...TRUNCATED)	{"input":["aabbaaaa\naaaaabab\n","qgiufelsfhanx\naaaaaaaaaaaaa\n","abcddd\nbacddd\n","azzz\nzzaz\n",(...TRUNCATED)	{"input":["3\n3 2 0\n","3\n1 2 0\n","3\n2 0 2\n","11\n1 1 1 1 1 2 4 2 2 2 1\n","5\n1 1 2 1 2\n","5\n(...TRUNCATED)	2	11	{"language":[2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,3,4,2,4,2,2,3,1,2,3,2,4,2,3,3,4,2,2,4,4,2,2,4,3,2,2,4,4,4,3,4,4,2,2,4,4,3,2,3,2,4,2,1(...TRUNCATED)	0	B	1,000	0	[ "greedy", "two pointers" ]	false		{ "nanos": 0, "seconds": 2 }	512,000,000
512_B. Fox And Jumping	"Princess Heidi decided to give orders to all her K Rebel ship commanders in person. Unfortunately, (...TRUNCATED)	{ "input": [ "4 2\n1 2\n2 3\n", "3 3\n1 2\n2 3\n1 3\n" ], "output": [ "3\n1 3 4 \n1\n2 ", "-1" ] }	{"input":["9 12\n1 2\n2 3\n4 5\n5 6\n6 7\n7 8\n1 4\n4 7\n2 5\n5 8\n3 6\n6 9\n","5 4\n2 1\n3 2\n4 3\n(...TRUNCATED)	{"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":[2,3,2,2,4,3,3,3,3,4,4,4,3,4,2,3,3,2,3,3,2,4,3,3,3,2,2,1,3,3,3,3,4,3,1,4,3,3,3,2,3,2,3,3(...TRUNCATED)	{"language":[3,4,3,4,4,2,2,2,4,3,2,3,1,4,2,4,4,2,3,2,3,2,3,2,2,3,2,2,2,4,4,2,2,3,4,2,1,3,4,3,3,3,4,1(...TRUNCATED)	1,297		0	0	[ "data structures", "greedy", "two pointers" ]	false		{ "nanos": 0, "seconds": 1 }	0
167_C. Wizards and Numbers	"This is the easier version of the problem. In this version 1 ≤ n, m ≤ 100. You can hack this pr(...TRUNCATED)	{ "input": [ "4 5\n10 4 18 3\n", "2 2\n1 2\n" ], "output": [ "4", "1" ] }	{ "input": [], "output": [] }	{"input":["0 -2 -1\n","563 -23532 1232\n","0 2 0\n","0 10 20\n","-50000 100001 -50000\n","50000 1100(...TRUNCATED)	3	7	{"language":[1,2,3,2,2,2,4,4,3,4,4,3,2,2,2,2,2,3,2,2,2,1,2,2,2,4,4,1,2,2,2,2,2,4,2,2,2,4,2,4,2,2,2,1(...TRUNCATED)	{"language":[2,4,2,2,3,3,4,3,3,4,1,3,2,3,2,4,2,3,4,2,3,3,2,2,2,4,3,2,3,4,2,2,4,4,3,2,4,2,3,2,4,3,4,3(...TRUNCATED)	0		0	0	[]	false		{ "nanos": 0, "seconds": 2 }	536,870,912
1110_E. Magic Stones	"Monocarp and Polycarp are learning new programming techniques. Now they decided to try pair program(...TRUNCATED)	{ "input": [ "2\naazz\n", "3\nabcabcabz\n" ], "output": [ "azaz", "-1\n" ] }	{"input":["2\n1 2\n","100\n61 96 25 10 50 71 38 77 76 75 59 100 89 66 6 99 2 13 3 23 91 93 22 92 4 8(...TRUNCATED)	{"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)	6	0	{"language":[3,2,3,3,4,2,3,3,3,3,3,3,3,4,2,3,2,2,3,3,3,3,3,3,2,3,3,3,1,2,3,4,3,3,2,3,2,4,2,4,4,3,3,4(...TRUNCATED)	{"language":[2,1,4,4,2,2,3,2,4,2,2,2,4,2,2,4,4,2,4,2,2,2,2,3,2,2,2,2,2,2,2,4,3,4,2,1,2,2,4,2,2,4,4,2(...TRUNCATED)	284		2,500	3,100	[ "" ]	false	Time Limit: 8 sec / Memory Limit: 64 MB	{ "nanos": 0, "seconds": 2 }	256,000,000
1311_C. Perform the Combo	"An established group of scientists are working on finding solution to NP hard problems. They claim (...TRUNCATED)	{ "input": [ "1\n5 3\n200 6 9" ], "output": [ "120" ] }	{ "input": [], "output": [] }	{"input":["280 2\n","0 2\n","99900 2\n","79086 1\n","1 5\n","100000 96\n","2523 22\n","100000 2\n","(...TRUNCATED)	2	8	{"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,2,2,2,4,2,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,4,2,2,2,4,2,4,2,2(...TRUNCATED)	0	D	0	1,500	[ "data structures", "dp", "greedy" ]	false	"データを並べ替えるための整列（ソート）アルゴリズムはコンピュータ科(...TRUNCATED)	{ "nanos": 0, "seconds": 3 }	256,000,000
405_E. Graph Cutting	"Snuke is conducting an optical experiment using mirrors and his new invention, the rifle of Mysteri(...TRUNCATED)	{ "input": [ "2\n3\n3 2 1\n6\n3 1 4 1 5 9\n" ], "output": [ "3\n5\n" ] }	{"input":["2\n1 31\n","2\n1 0\n","10\n450661 128600 993228 725823 293549 33490 843121 903634 556169 (...TRUNCATED)	{"input":["3\n184427 500001 500002\n","1\n413243\n","1\n256223\n","2\n3 999999\n","1\n576559\n","2\n(...TRUNCATED)	5	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,1,1,1,1(...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],"sol(...TRUNCATED)	0	C	1,500	0	[ "binary search", "brute force", "dp", "two pointers" ]	false		null	512,000,000
p02260 Selection Sort	"George is getting tired of the decimal number system. He intends to switch and use the septenary ((...TRUNCATED)	{"input":["2\n1 1\n100 100\n","5\n10 30 5 6 24\n10 41 7 8 24\n","4\n3 3 4 3\n4 7 6 5\n"],"output":["(...TRUNCATED)	{"input":["20 101 100\n1 14 20 3 19 10 12 18 4 17 13 6 8 5 2 15 7 16 9 11\n69 53 101 100 41 38 63 84(...TRUNCATED)	{ "input": [], "output": [] }	2	9	{"language":[3,4,2,2,3,3,3,3,3,4,4,2,3,4,4,2,2,4,2,3,1,3,2,3,4,3,3,2,3,2,2,3,2,2,2,2,2,4,2,4,3,3,3,2(...TRUNCATED)	{"language":[1,2,4,1,4,3,2,2,3,4,2,4,2,1,1,3,4,3,4,4,2,3,1,3,4,3,3,4,4,2,3,2,4,1,4,2,3,3,1,4,2,2,4,2(...TRUNCATED)	614		0	0	[ "brute force", "sortings" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
p00032 Plastic Board	"You want to go on a trip with a friend. However, friends who have a habit of spending money cannot (...TRUNCATED)	{"input":["4\n3 3\n1 2\n2 3\n3 1\n3 6\n1 2\n2 1\n2 3\n3 2\n1 3\n3 1\n7 10\n1 2\n2 3\n3 1\n1 4\n4 5\n(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["5\n2 3 0 6 8","5\n2 3 4 6 5","5\n2 3 4 6 7","5\n2 3 0 6 7","5\n2 -1 8 6 4","5\n6 0 8 5 2"(...TRUNCATED)	2	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": [], "solution": [] }	0		0	800	[ "combinatorics", "divide and conquer" ]	false		null	64,000,000
670_B. Game of Robots	"After hard work Igor decided to have some rest.\n\nHe decided to have a snail. He bought an aquariu(...TRUNCATED)	{ "input": [ "2\n5\n6 5 4 3 2\n5\n3 4 3 1 1" ], "output": [ "6\n5\n" ] }	{ "input": [], "output": [] }	{"input":["5\n7 46 11 17 11","7\n994 518 941 851 647 2 568","3\n3 1 6","5\n7 46 11 17 13","7\n994 51(...TRUNCATED)	2	0	{"language":[2],"solution":["#include <iostream>\n#include <string>\n#include <cstdio>\n#include <ve(...TRUNCATED)	{"language":[4,4,4,3,2,4,4,2,2,4,2,4,2,4,4,3,4,2,2,4,2,2,4,1,2,4,2,4,4,2,2,2,2,2,3,4,3,4,2,3,2,3,3,4(...TRUNCATED)	1,144	B	0	0	[ "greedy", "implementation", "sortings" ]	false		{ "nanos": 500000000, "seconds": 0 }	1,073,741,824