Datasets:

TheFactoryX
/

edition_1993_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
1053_C. Putting Boxes Together	"There are N integers a_1, a_2, ..., a_N not less than 1. The values of a_1, a_2, ..., a_N are not k(...TRUNCATED)	{ "input": [ "5 3 2\naaaaa\naaa\naab" ], "output": [ "1 6" ] }	{ "input": [], "output": [] }	{"input":["264193194 -448876521 716456020 -633906160 -328597212 -47935734\n","1 0 2 1 3 0\n","-35753(...TRUNCATED)	5	9	{"language":[4,3,1,3,2,2,4,2,4,2,4,2,3,2,3,2,2,3,3,2,3,3,2,3,4,2,2,4,3,2,4,2,3,2,3,2,2,4,4,3,2,3,2,3(...TRUNCATED)	{"language":[2,4,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],"solutio(...TRUNCATED)	0	B	1,000	1,100	[]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
483_B. Friends and Presents	"Every day Ruslan tried to count sheep to fall asleep, but this didn't help. Now he has found a more(...TRUNCATED)	{"input":["9\ndo\nthe\nbest\nand\nenjoy\ntoday\nat\nacm\nicpc\n14\noh\nyes\nby\nfar\nit\nis\nwow\nso(...TRUNCATED)	{"input":["997 6 680633279\n","989 8 990767311\n","999 2 750160753\n","1 4 904448911\n","1000 3 7501(...TRUNCATED)	{"input":["30 35 4 30\n14 2 7\n22 23 4\n5 26 3\n28 4 3\n7 5 29\n19 15 2\n11 20 12\n1 22 9\n30 21 24\(...TRUNCATED)	2	6	{"language":[1,1],"solution":["import sys\ndef numberToBase(n, b):\n temp=''\n while n:\n (...TRUNCATED)	{"language":[1,3,4,2,4,2,2,1,4,3,1,1,2,2,2,1,4,1,3,4,4,2,4,4,4,2,3,1,1,2,4,4,3,4,2,3,4,2,1,3,2,4,3,2(...TRUNCATED)	977		750	0	[ "constructive algorithms", "expression parsing", "greedy", "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
monks-birthday-party	"Problem\n\nTomorrow is finally the day of the excursion to Maizu Elementary School. Gatcho, who att(...TRUNCATED)	{"input":["47\nS 10\nS 11\nS 12\nS 13\nH 1\nH 2\nS 6\nS 7\nS 8\nS 9\nH 6\nH 8\nH 9\nH 10\nH 11\nH 4\(...TRUNCATED)	{"input":["143165576\n","1919020031\n","1204252996\n","210637432\n","724264821\n","1741\n","61948959(...TRUNCATED)	{"input":["1 1\n5\n2 1 7\n","10 6\n10 10 10 6 6 5 5 5 3 1\n2 3 50\n2 4 10\n1 3 10\n2 2 36\n1 4 7\n2 (...TRUNCATED)	2	7	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2],"solution":["#include <iostream>\n#inc(...TRUNCATED)	{ "language": [], "solution": [] }	79	C	1,500	800	[]	false		{ "nanos": 0, "seconds": 2 }	512,000,000
675_E. Trains and Statistic	"The black king is standing on a chess field consisting of 109 rows and 109 columns. We will conside(...TRUNCATED)	{ "input": [ "2\n2 6\n10 11" ], "output": [ "2\n1\n" ] }	{"input":["10\n669924290 408119795 804030560\n663737793 250734602 29671646\n431160679 146708815 2894(...TRUNCATED)	{"input":["5\ncbbbb\nbcbab\naacbb\naaacb\naaaac\n","20\nbifcabiabgfibfccdbgd\ncffaheagahcbacafbgeb\n(...TRUNCATED)	3	9	{"language":[4,4,4,4,2,1,3,1,3,4,4,2,3,4,3,4,4,1,3,2,4,2,2,2,3,4,1,2,2,2,2,2,2,4,4,2,4,4,1,4,3,1,2,4(...TRUNCATED)	{ "language": [], "solution": [] }	1,129	F	2,000	0	[ "brute force", "implementation", "sortings" ]	false	"\n\n問題\n\n$N$ 個の相違なる自然数 $a_i$ が与えられる。与えられた自然数(...TRUNCATED)	null	134,217,728
925_E. May Holidays	"In PrimeLand, there existed a very handsome young prince named Prima. He greatly desired the Prince(...TRUNCATED)	{"input":["9 3 23\n9 3 22\n10 3 28\n16 10 107\n20 8 102\n20 10 105\n20 10 155\n3 4 3\n4 2 11\n0 0 0"(...TRUNCATED)	{"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":["5 10\n2 1 2 2 2\n2\n2 4\n4 5\n","5 10\n2 1 2 2 1\n2\n2 4\n4 5\n","5 10\n3 1 4 2 1\n2\n2 4(...TRUNCATED)	2	8	{"language":[2,2,2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\nusing namespace std;\n#defi(...TRUNCATED)	{ "language": [], "solution": [] }	1,158	E	0	0	[ "brute force", "math", "number theory" ]	false		{ "nanos": 0, "seconds": 5 }	0
p01353 Rabbit Plays Games!	"Little Petya likes arrays of integers a lot. Recently his mother has presented him one such array c(...TRUNCATED)	{"input":["3\n4 1\n5 2\n6 3","4\n1 5\n4 7\n2 1\n8 4","2\n3 2\n1 2","10\n866111664 178537096\n7054450(...TRUNCATED)	{"input":["5 1\n3 2\n","3 3\n1 2\n1 2\n1 2\n","5 3\n2 4\n5 4\n3 2\n","20 5\n3 12\n5 20\n16 4\n13 3\n(...TRUNCATED)	{ "input": [], "output": [] }	2	9	{"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,2,2,2,2],"solution":["#include <iostream>\n#include <cstdio>\n#include <vector>\n#inc(...TRUNCATED)	0		0	1,200	[ "games", "implementation" ]	false		null	256,000,000
209_B. Pixels	"You are given a string s consisting of n characters. These characters are among the first k lowerca(...TRUNCATED)	{ "input": [ "3\n3 1 0\n1 2 3\nXOR\n3 1 0\n1 2 3\nAND\n3 1 0\n1 2 3\nOR" ], "output": [ "0\n0\n3\n" ] }	{"input":["6\n0 41 48 86 94 14\n41 0 1 30 59 39\n48 1 0 9 31 49\n86 30 9 0 48 30\n94 59 31 48 0 33\n(...TRUNCATED)	{"input":["25\n11632 6805 12792 25513 4573 48789 42308 23247 17502 23125 43597 22173 52717 8637 3300(...TRUNCATED)	3	0	{"language":[2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,1,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[1,4,2,4,3,2,1,1,1,4,3,4,2,4,2,4,2,3,4,1,4,1,2,2,1,4,4,4,1,2,4,1,2,2,4,1,3,2,2,4,1,3,4,2(...TRUNCATED)	1,053		2,500	0	[ "" ]	false		{ "nanos": 525000000, "seconds": 2 }	512,000,000
820_A. Mister B and Book Reading	"You are given an array a of n integers.\n\nYou want to make all elements of a equal to zero by doin(...TRUNCATED)	{"input":["5 10\n50 40 30 20 10\n10\n20\n30\n40\n50\n60\n70\n80\n90\n100\n\nSAMPLE"],"output":["YES\(...TRUNCATED)	{"input":["1 999999999 29983 29989\n","9999999 10000 29983 29989\n","808351 17767 433 509\n","197 2 (...TRUNCATED)	{"input":["2 1 5\n1 1 1 8\n2 2 1 1\n1 2 1 1\n1 2 1 3\n2 2 1 2\n","5 1 5\n1 5 1 3\n1 5 1 2\n2 2 2 5\n(...TRUNCATED)	2	10	{"language":[1,1,1,1],"solution":["def func(s,val):\n\tcfc=0\n\tx=0\n\tlength=len(s)\n\tfor i in ran(...TRUNCATED)	{"language":[2,4,4,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,4,2,2,4,2,2,4,2,4,2,2,2,2,2,2,2,2,2,4,2,4,2(...TRUNCATED)	1,110	C	0	1,600	[ "brute force", "constructive algorithms", "implementation", "strings" ]	false		{ "nanos": 0, "seconds": 2 }	134,217,728
simple-prime-factorization	"The nation of Panel holds an annual show called The Number Games, where each district in the nation(...TRUNCATED)	{ "input": [ "4 4\n1 2\n2 3\n2 4\n3 4\n", "4 3\n1 2\n2 3\n3 4\n" ], "output": [ "1\n1 3\n", "1\n1 4\n" ] }	{ "input": [], "output": [] }	{"input":["3\nooe\n","36\naaiouyaaeeiioouuyyaaeeeeiiiooouuuyyy\n","3\npoo\n","1\nb\n","4\nooee\n","5(...TRUNCATED)	2	0	{"language":[2,4,2,2,2,1,2,2,4,2,2,2,4,2,2,2,4,2,4,2,2,2,4,2,2,3,3,4,2,1,2,2,4,4,4,4,2,2,1,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0	E	0	2,100	[ "" ]	false		null	256,000,000
886_D. Restoration of string	"Now that Chef has finished baking and frosting his cupcakes, it's time to package them. Chef has N (...TRUNCATED)	{"input":["5\n1 2\n2 3\n3 4\n4 5\n5\n1 3 1 2 2\n1 4 1 3 2\n1 4 1 3 3\n4 2 3 3 9\n5 2 3 3 9\n"],"outp(...TRUNCATED)	{"input":["2 1\n7 1 1\n2 1 1\n","5 1\n2 1 0\n2 0 1\n1 0 1\n1 1 0\n1 0 1\n","6 2\n6 0 0\n11 1 0\n9 0 (...TRUNCATED)	{"input":["85 36 123\n","100000 100000 1937540\n","70386 8300 113682\n","48701 4854 24164\n","84324 (...TRUNCATED)	1	0	{"language":[2,2,2,2,2,2,4,2,2,2,2,2,2,2,3,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,2(...TRUNCATED)	{"language":[3,2,2,4,1,2,2,2,2,4,4,2,2,2,4,4,2,3,2,1,2,2,2,4,4,2,4,2,2,1,2,2,2,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED)	643	A	0	800	[ "" ]	true		null	256,000,000