Datasets:

TheFactoryX
/

edition_0675_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
p02943 AtCoder Grand Contest 037 - Reversing and Concatenating	The year of 2012 is coming... According to an ancient choradrican legend in this very year, in 2012, Diablo and his brothers Mephisto and Baal will escape from hell, and innumerable hordes of demons will enslave the human world. But seven brave heroes have already gathered on the top of a mountain Arreat to protect us...	{ "input": [ "1", "2" ], "output": [ "a", "aa\nab" ] }	{ "input": [ "21 3 -3 3 -3 3 -3 19 3 -3 3 -3 3 -3 19 3 -3 3 -3 3 -3 19", "2 8 -100\n5 -1000 5 1000 500 250\n10 -1000 5 1000 500 250 -1000 5 1000 500 250\n7 3 -3 3 -3 3 -3 19\n5 44 7 11 -999 20", "5 10 25 12 4 1 \n3 16 28 100" ], "output": [ "None to display", "-100 8 \n250 500 1000 -1000 \n250...	{ "input": [ "3\nnxx", "3\nnwx", "3\nxxo", "3\nxwn", "3\nowx", "3\npxx", "3\npyx", "3\npzx", "3\npzw", "3\npwz", "3\nzwp", "3\nzxp", "3\npxz", "3\nzyp", "3\nyzp", "3\nyzq", "3\nyzr", "3\nxzr", "3\nrzx", "3\nxrz", "3\nwrz", "3\nzrw...	3	9	{ "language": [ 1, 1, 1, 1 ], "solution": [ "'''\n# Read input from stdin and provide input before running code\n\nname = raw_input('What is your name?\\n')\nprint 'Hi, %s.' % name\n'''\nnum_of_sugarcanes = int(raw_input())\nlist_of_sugarcanes = map(int,raw_input().split())\n\nmax_of_sugarcane...	{ "language": [ 4, 4, 4 ], "solution": [ "import java.io.IOException;\nimport java.io.InputStream;\nimport java.util.Comparator;\nimport java.util.HashSet;\nimport java.util.PriorityQueue;\n\npublic class Main {\n\tstatic boolean debug = false;\n\n\tpublic static void main(String[] args) throws IO...	614	A	750	3,100	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	134,217,728
746_F. Music in Car	The Chef likes to stay in touch with his staff. So, the Chef, the head server, and the sous-chef all carry two-way transceivers so they can stay in constant contact. Of course, these transceivers have a limited range so if two are too far apart, they cannot communicate directly. The Chef invested in top-of-the-line t...	{ "input": [ "3\nbba\nabb\nabb\n\nSAMPLE" ], "output": [ "2\n" ] }	{ "input": [ "+adabacaba\n-adabacaba\n+aca\naca:caba\n-aca\n+bacaba\n-bacaba\n+aba\n-aba\n+bad\n", "+cab\n+abac\n-abac\n+baca\n", "+8UjgAJ\n8UjgAJ:02hR7UBc1tqqfL\n-8UjgAJ\n+zdi\n-zdi\n", "+acabadab\n+caba0aba\n", "+Dmitry\n+Mike\nDmitry:All letters will be used\nDmitry:qwertyuiopasdfghjklzxcvbnm Q...	{ "input": [ "4\n1 4\n3 2\n3 4\n", "21\n7 15\n13 1\n14 3\n4 10\n2 3\n16 18\n17 20\n16 20\n8 4\n3 12\n2 17\n13 11\n16 1\n13 2\n13 5\n8 3\n6 14\n3 17\n16 9\n13 8\n", "3\n3 2\n3 2\n", "60\n17 34\n46 22\n50 44\n46 33\n41 21\n31 33\n48 6\n38 19\n35 60\n2 24\n49 29\n7 53\n34 1\n19 55\n32 1\n31 42\n27 28\n4 ...	2	0	{ "language": [ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 4, 2, 4, 2, 2, 2, 2, ...	{ "language": [], "solution": [] }	691	B	0	0	[ "constructive algorithms", "greedy", "sortings" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
p01219 Private Teacher	"A substring of some string is called the most frequent, if the number of its occurrences is not les(...TRUNCATED)	{"input":["3 3\n1 2\n2 3\n3 3","7 9\n1 7\n5 9\n5 7\n5 9\n1 1\n6 8\n3 4"],"output":["3\n2\n2","7\n6\n(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["5 7\n2 2\n2 3\n3 4\n1 5\n2 5\n3 5\n4 5\n","4 0\n","6 9\n1 2\n1 4\n1 5\n2 6\n2 5\n2 6\n3 5(...TRUNCATED)	2	9	{"language":[4,4,2,4,4,4,2,4,2,4,2,3,3,3,2,2,2,2,4,3,2,2,2,4,4,2,3,2,4,4,2,2,4,3,3,4,1,2,4,4,4,4,4,3(...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],"solution":["#include <bits/stdc++.h>\nu(...TRUNCATED)	1,155	N	0	0	[ "math" ]	false	{ "nanos": 0, "seconds": 2 }	134,217,728
1070_C. Cloud Computing	"Professor Sharma gives the following problem to his students: given two integers X( ≥ 2) and Y( (...TRUNCATED)	{ "input": [ "5\n1 2\n1 3\n3 4\n2 5" ], "output": [ "1" ] }	{ "input": [], "output": [] }	{"input":["3,4,5\n5,5,8\n4,5,4\n5,4,3","3,3,5\n5,5,8\n4,4,4\n5,4,3","3,4,5\n5,5,8\n4,5,4\n3,4,5","3,(...TRUNCATED)	3	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],"solution":["t = int(raw_input())\nf(...TRUNCATED)	{"language":[2,2,2,2,4,2,2,4,4,2,2,2,2,4,2,4,2,2,2,4,2,2,2,3,2,2,2,2,2,2,4,2,2,4,2,2,2,4,2,2,2,2,2,2(...TRUNCATED)	455	C	500	0	[]	false	{ "nanos": 0, "seconds": 2 }	1,073,741,824
1413_F. Roads and Ramen	"Programmer Vasya is studying a new programming language &K. The &K language resembles the languag(...TRUNCATED)	{ "input": [ "2\n17 25\n4\n17 45\n4\n17 25\n7\n19 35\n0" ], "output": [ "250\n1300" ] }	{"input":["100 3\n45 1 2 3 4 5 6 7 8 9 19 21 24 27 28 30 34 35 37 39 40 41 42 43 46 47 48 51 52 55 5(...TRUNCATED)	{"input":["5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\(...TRUNCATED)	6	0	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include<iostream>\n#include<algo(...TRUNCATED)	{"language":[2,0,2,2,2,2,2,1,2,2,2,2,2,2,2,1,2,2,2,2,0,2,0,0,2,0,0,0,4,1,2,2,0,2,0,0,2,2,2,0,2,2,2,2(...TRUNCATED)	0	C	0	2,100	[ "dfs and similar", "dp", "dsu", "ternary search", "trees" ]	false	null	256,000,000
class-homework	"We know that lucky digits are digits 4 and 7, however Vasya's got another favorite digit 0 and he a(...TRUNCATED)	{ "input": [ "3\n3\n5\n199\n" ], "output": [ "1.931851653\n3.196226611\n126.687663797\n" ] }	{"input":["2 3\n1 1 1\n0 1 0","2 2\n1 0\n0 1","3 3\n0 1 0\n1 0 1\n0 1 0","2 2\n0 0\n1 0","2 2\n0 1\n(...TRUNCATED)	{"input":["3\n2\n4\n10","3\n2\n6\n12","3\n4\n6\n12","3\n4\n6\n19","3\n2\n4\n19","3\n2\n3\n12","3\n4\(...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,4,2,2,2,2,2,2(...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,4,2,2,2,2,2,2,2,2(...TRUNCATED)	0	B	0	2,200	[]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1046_D. Interstellar battle	"You are given a number n. Print n lines, i-th line should consist of i characters \"*\". Lines' ind(...TRUNCATED)	{ "input": [ "3\n3 4 5\n1 0 5\n5 3 2\n" ], "output": [ "9\n0\n6\n" ] }	{"input":["100\n95 54 23 27 51 58 94 34 29 95 53 53 8 5 64 32 17 62 14 37 26 95 27 85 94 37 85 72 88(...TRUNCATED)	{"input":["100 10000\n337491026 878382762 942177429 998998997 292784016 407647544 813626083 20338593(...TRUNCATED)	5	10	{"language":[4,2,3,3,2,4,4,2,4,2,4,3,3,3,2,4,3,2,4,2,3,2,4,2,4,4,3,3,3,4,3,4,2,4,3,3,4,4,4,2,3,4,3,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)	1,144	A	1,500	0	[ "brute force", "geometry", "math" ]	false	null	256,000,000
even-from-end-1	"You can't possibly imagine how cold our friends are this winter in Nvodsk! Two of them play the fol(...TRUNCATED)	{ "input": [ "5\n3\n1\n2\n3\n4\n5\n\nSAMPLE" ], "output": [ "2\n" ] }	{"input":["5 5\n1 5 9403 40347\n1 3 13851 29314\n4 5 1315 561894\n3 5 2748 33090\n5 3 10717 32306\n"(...TRUNCATED)	{"input":["4\n3 4\n1 2\n3 4\n1 4\n","4\n2 4\n1 3\n3 4\n1 1\n","4\n1 4\n2 4\n2 4\n1 2\n","7\n7 7\n2 3(...TRUNCATED)	5	11	{"language":[3,3,3,3,3,3,3,3,4,3,3,3,3,3,3,2,3,4,3,3,3,3,3,3,3,3,3,2,3,3,3,3,2,3,3,3,3,3,3,3,2,3,4,3(...TRUNCATED)	{"language":[4,2,3,4,3,2,4,4,4,2,2,4,2,4,4,4,2,4,2,2,4,2,2,3,3,4,3,3,2,4,2,3,3,4,3,2,2,3,3,2,4,3,4,3(...TRUNCATED)	133	B	0	1,600	[ "" ]	false	null	256,000,000
830_A. Office Keys	"There are N oases on a number line. The coordinate of the i-th oases from the left is x_i.\n\nCamel(...TRUNCATED)	{ "input": [ "2\n2 9 17\n1 1\n\nSAMPLE" ], "output": [ "Yes\nNo\n" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	0	{"language":[4,2,2,2,2,4,3,2,2,2,2,2,2,4,3,4,4,4,1,4,3,4,3,3,2,4,2,3,1,4,3,4,4,2,2,3,3,3,3,3,3,1,4,1(...TRUNCATED)	{"language":[2,2,2,4,2,4,2,2,4,2,2,2,2,4,2,4,2,2,2,4,2,2,2,4,2,2,2,4,2,4,4,2,2,3,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,129		0	2,400	[ "constructive algorithms", "graphs" ]	false	{ "nanos": 0, "seconds": 1 }	0
252_B. Unsorting Array	"Having learned the multiplication table, Takahashi can multiply two integers between 1 and 9 (inclu(...TRUNCATED)	{"input":["4","3"],"output":["0 111 157 193\n111 0 224 239\n157 224 0 258\n193 239 258 0","0 6 15\n6(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["36 102 73 101 19\n5 9 2 4 6\n4 13\n","0 0 119 0 1\n0 0 2 0 0\n5 5\n","0 0 0 0 0\n10 10 10(...TRUNCATED)	3	0	{"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,1,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	720	A	0	2,200	[ "dfs and similar", "dp", "trees" ]	false	{ "nanos": 0, "seconds": 3 }	256,000,000