Datasets:

TheFactoryX
/

edition_0772_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
rrcode	"After hard work Igor decided to have some rest.\n\nHe decided to have a snail. He bought an aquariu(...TRUNCATED)	{ "input": [ "4\n2 10\n0 20\n1 5\n1 3\n", "3\n0 1\n0 10\n0 100\n" ], "output": [ "8", "111" ] }	{"input":["10\n9 8 7 6 5\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)	{"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	11	{"language":[3,4,3,3,3,2,3,3,1,3,3,2,2,2,1,3,4,2,3,3,2,3,3,3,3,3,3,2,3,3,4,3,1,4,3,3,3,3,4,3,3,3,3,3(...TRUNCATED)	{"language":[4,3,3,4,4,2,2,4,3,1,2,4,2,3,4,2,3,1,4,3,2,2,3,4,3,2,3,2,3,2,4,4,3,2,2,2,2,2,2,4,2,4,2,3(...TRUNCATED)	0		0	1,600	[ "constructive algorithms", "dp", "flows", "graph matchings", "greedy", "sortings" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1129_A2. Toy Train	"The russian intelligence agency KGB make an encryption technique to send their passwords. Originall(...TRUNCATED)	{ "input": [ "" ], "output": [ "" ] }	{ "input": [], "output": [] }	{"input":["ABM","BIB","1MI","MCA","MAC","M@C","C@M","@MC","?MC","M?C","C?M","CM?","DM?","?MD","@MD",(...TRUNCATED)	2	11	{"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,4,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,3,4,3,3,4,2,2,3,3,2,2,2,3,3,3,2,2,3,3,3,4,2,3,2,2,3,2,3,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2(...TRUNCATED)	483		500	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
p01356 Nearest Station	"Given the value of n, print the n'th prime number.\n\nInput : A single integer n. \nOutput : A sing(...TRUNCATED)	{ "input": [ "5\n3\n1\n2\n3\n4\n5\n\nSAMPLE" ], "output": [ "2\n" ] }	{"input":["20 20\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n","10 4\n0 1 4 2 7 0 10 0 5 8\n","10 7\n1(...TRUNCATED)	{"input":["1 10\n1 5 9 5\n1\n5 5 L 0\n","3 7\n2 4 2 7\n4 7 4 6\n7 3 5 3\n10\n6 7 L 1\n6 7 L 2\n6 7 L(...TRUNCATED)	5	12	{"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,4,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,4,3,2,2,2,2,2,4,2,2,3,2,2,2,2,3,2,2,4,2,2,2,2,2,2,2,2,3,2,2,2(...TRUNCATED)	1,428	G	1,250	0	[ "data structures", "greedy", "trees" ]	false		{ "nanos": 0, "seconds": 2 }	512,000,000
discover-the-monk	"Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits whe(...TRUNCATED)	{ "input": [ "5\n1 2 3 4 5\n", "5\n1 100 101 100 1\n", "5\n3 1 5 2 6\n" ], "output": [ "6", "102", "11" ] }	{"input":["50 100\n1 71 96\n2 34 52\n2 16 95\n1 54 55\n1 65 85\n1 76 92\n2 19 91\n1 26 43\n2 83 95\n(...TRUNCATED)	{"input":["5 6\n#.##\n.##.\n#...\n..##\n...#","13 27\n......#.........#.......#..\n...#.....###..\n.(...TRUNCATED)	6	10	{"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": [], "solution": [] }	0	B2	0	1,900	[ "dfs and similar", "dp", "dsu", "ternary search", "trees" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1277_E. Two Fairs	"There are N cubes stacked vertically on a desk.\n\nYou are given a string S of length N. The color (...TRUNCATED)	{"input":["5 4\n#.##\n.##.\n#...\n..##\n...#","13 27\n......#.........#.......#..\n...#.....###..\n.(...TRUNCATED)	{"input":["5\n42665793 142698407 856080769 176604645 248258165\n10\n1 5 141156007\n2 5 5 3\n2 4 4 2\(...TRUNCATED)	{"input":["21 6\n12 15 14 4 4 7 3 4 11 1 15 4 12 11 12 8 11 12 3 4 4\n","50 25\n19 1 17 6 4 21 9 16 (...TRUNCATED)	5	8	{"language":[2,2,2,1,4,2,4,2,4,3,4,1,4,4,2,4,2,2,2,3,4,3,2,2,2,2,2,4,2,4,2,4,2,2,3,2,4,4,2,2,4,2,2,4(...TRUNCATED)	{"language":[2,2,2,2,2,3,2,2,3,2,2,2,2,4,3,3,2,4,2,2,2,2,4,2,3,4,2,2,2,2,2,2,4,2,2,2,2,2,3,2,2,2,2,2(...TRUNCATED)	0	C	2,000	0	[ "" ]	false	"\n\n問題\n\nあなたは星空の写真の中から星座を探している．写真には必ず(...TRUNCATED)	null	0
9_E. Interesting Graph and Apples	"Polycarp plays a well-known computer game (we won't mention its name). Every object in this game co(...TRUNCATED)	{ "input": [ "2 3\n", "1 1\n", "49 1808\n" ], "output": [ "6\n", "0\n", "359087121\n" ] }	{"input":["10 1\n1 1 1 1 1 1 1 1 1 1\n","3 57\n78 165 54\n","1 1\n10000\n","2 2\n2 2\n","9 13\n132 8(...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)	2	10	{"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":[4,3,2,2,4,2,3,3,4,2,2,3,2,2,4,2,2,4,3,2,3,4,3,4,2,2,2,3,3,2,4,2,3,2,3,4,4,3,4,4,4,4,3,2(...TRUNCATED)	1,369	G	500	0	[ "data structures" ]	false		{ "nanos": 0, "seconds": 4 }	256,000,000
p03225 Tenka1 Programmer Contest - Equilateral	"Bosky is a very curious child who turned 13 yesterday. His parents gifted him a digital watch which(...TRUNCATED)	{"input":["6 2\n2 3 0 5 6 0\n","6 2\n0 0 1 0 4 5\n","6 1\n2 0 4 0 6 0\n","4 1\n0 0 0 0\n"],"output":(...TRUNCATED)	{"input":["80\n72 66 82 46 44 22 63 92 71 65 5 30 45 84 29 73 9 90 25 19 26 15 12 29 33 19 85 92 91 (...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)	6	11	{ "language": [], "solution": [] }	{"language":[4,4,4,4,3,2,2,2,1,2,2,2,2,4,4,2,2,4,2,4,4,2,2,3,2,1,3,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	925	A	1,000	1,300	[]	false		{ "nanos": 0, "seconds": 1 }	0
724_F. Uniformly Branched Trees	"There are five people playing a game called \"Generosity\". Each person gives some non-zero number (...TRUNCATED)	{"input":["5\n1 2\n2 1\n5 10\n10 9\n20 1\n","5\n1 2\n2 1\n5 10\n10 9\n19 1\n"],"output":["4\n","3\n"(...TRUNCATED)	{"input":["10 20 10 5\n","20 1 2 3\n","7 2 2 2\n","25 10 5 10\n","999 999 899 299\n","10000 5000 0 5(...TRUNCATED)	{"input":["7 9\n1 9\n5 9\n5 7\n5 9\n1 1\n6 8\n3 4","7 9\n1 9\n9 9\n5 7\n5 9\n1 1\n6 8\n3 4","7 11\n1(...TRUNCATED)	5	10	{"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,3,4,2,3,3,2,4,4,2,3,4,4,3,2,4,2,4,2,4,4,4,2,3,3,2,3,2,4,2,2,4,2,3,2,3,2,4,3,2,3,3,4,4(...TRUNCATED)	0		2,500	1,600	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	512,000,000
1334_A. Level Statistics	"Awruk is taking part in elections in his school. It is the final round. He has only one opponent (...TRUNCATED)	{ "input": [ "3 5\n", "1 1\n", "4 4\n" ], "output": [ "451\n", "0\n", "485\n" ] }	{"input":["10 7\n1 10\n2 10\n3 10\n4 10\n5 10\n1 2\n1 3\n1 4\n1 5\n1 6\n","2 2\n1 1\n1 1\n","20 12\n(...TRUNCATED)	{"input":["4","6","3","7","5","8","4","3","5","6","8","7"],"output":["aaaa\naaab\naaba\naabb\naabc\n(...TRUNCATED)	2	11	{"language":[2,4,2,3,4,2,4,2,2,3,4,2,2,2,2,2,4,2,2,1,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,1,4,2,2,3,2,2,2,2(...TRUNCATED)	{"language":[3,4,3,3,2,3,3,3,3,2,3,3,4,2,2,2,2,4,3,3,2,4,2,3,4,2,4,4,2,3,2,3,4,2,4,2,2,4,3,2,3,2,2,4(...TRUNCATED)	0	F	0	1,500	[]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
acdemy	"A chessboard n × m in size is given. During the zero minute we repaint all the black squares to th(...TRUNCATED)	{ "input": [ "3\n0 1 1\n1 0 4\n1 4 0\n", "4\n0 1 2 3\n1 0 4 5\n2 4 0 6\n3 5 6 0\n" ], "output": [ "2", "5" ] }	{"input":["3 3 1\n","300 2 300\n","4000 4000 1\n","4000 4000 100\n","4 2 3\n","3 300 300\n","4000 10(...TRUNCATED)	{"input":["6\n3\n60\n100\n1024\n23456\n8735373\n\nELPMAS","6\n5\n60\n100\n1024\n23456\n8735373\n\nEL(...TRUNCATED)	6	10	{"language":[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,3,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2],"solution":["#include <iostream>\n#include <cstdio>\n#include <vector>\n#inc(...TRUNCATED)	0	H	1,750	1,100	[ "*special", "strings" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000