Datasets:

TheFactoryX
/

edition_1397_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
1398_A. Bad Triangle	"Treeland consists of n cities and n-1 two-way roads connecting pairs of cities. From every city, yo(...TRUNCATED)	{ "input": [ "5 5\n1 2 3 4 5\n", "3 1\n1 1 2\n", "5 2\n1 1 2 1 3\n" ], "output": [ "16", "3", "14" ] }	{"input":["50\n16 4\n17 9\n31 19\n22 10\n8 1\n40 30\n3 31\n20 29\n47 27\n22 25\n32 34\n12 15\n40 32\(...TRUNCATED)	{"input":["5\nFFFAF\n","5\nIIAAF\n","5\nAAFFA\n","6\nAAAFFA\n","2\nAF\n","8\nIFFFIAAI\n","3\nFFA\n",(...TRUNCATED)	5	0	{"language":[2,2,2,2,2,4,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,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,3,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)	1,199		500	1,400	[ "constructive algorithms", "implementation" ]	true		{ "nanos": 0, "seconds": 2 }	256,000,000
306_C. White, Black and White Again	"Problem\n\nThere is a bundle of $ n $ cards, with $ i $ written on the $ i $ th card from the botto(...TRUNCATED)	{ "input": [ "2\nacxz\nbcxz\n\nSAMPLE" ], "output": [ "Funny\nNot Funny\n" ] }	{ "input": [], "output": [] }	{"input":["2 0\n1 2\n","2 1\n1 3\n","3 3\n1 2\n1 5\n2 3\n","2 0\n1 0\n","4 0\n1 0\n","4 0\n1 -1\n","(...TRUNCATED)	6	0	{"language":[4,4,3,4,3,3,3,3,4,4,3,1,4,3,3,3,3,4,2,3,3,3,3,4,3,3,3,3,4,3,3,2,4,3,3,4,2,2,3,3,4,3,3,3(...TRUNCATED)	{"language":[2,2,0,0,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,0,2,0,2,2,2,2,2,2,0,2,2,0,2,2,2,2,2,0,0,0(...TRUNCATED)	0	B	2,500	2,500	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	0
p02408 Finding Missing Cards	"There are n cities in Berland and some pairs of them are connected by two-way roads. It is guarante(...TRUNCATED)	{"input":["17\ntypedef void* b\ntypedef b* c\ntypeof b\ntypeof c\ntypedef &b b\ntypeof b\ntypeof(...TRUNCATED)	{"input":["8\n2 3 5 7 11 13 17 19\n4 8 7 1 5 2 6 3\n","1\n2\n2\n","1\n1000000000\n100000\n","1\n1\n1(...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)	2	9	{"language":[2,1,3,4,1,4,1,4,2,3,4,2,4,1,2,3,2,2,4,3,2,4,2,2,2,4,4,3,2,4,4,4,4,1,1,3,2,2,2,4,1,4,1,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,285	A	1,750	2,300	[ "" ]	false		null	256,000,000
1100_D. Dasha and Chess	"We have caught N sardines. The deliciousness and fragrantness of the i-th sardine is A_i and B_i, r(...TRUNCATED)	{"input":["5 3\n1 2 3 4 0\n4 1 2 14 3\n","7 3\n1 2 3 4 3 2 6\n6 3 1 4 2 2 3\n","4 4\n0 1 2 3\n0 1 2 (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["4 1 1 12\n3 2 3","4 1 1 16\n3 2 3","4 1 1 16\n2 2 3","4 1 1 6\n3 1 3","4 0 1 12\n3 2 3","(...TRUNCATED)	2	6	{"language":[1,1,1,1],"solution":["t=int(raw_input())\ndef z(x):\n i=5\n c=0\n while x/i>=1(...TRUNCATED)	{"language":[0,0,0,0,2,0,2,0,2,2,2,1,2,4,2,2,1,4,2,2,0,2,0,4,2,0,0,0,2,0,2,0,3,0,0,2,2,0,2,3,0,2,4,2(...TRUNCATED)	507		0	2,000	[ "constructive algorithms", "graphs", "greedy", "sortings" ]	false		null	134,217,728
give-me-my-test-monk	"There are N students and M checkpoints on the xy-plane.\nThe coordinates of the i-th student (1 \\l(...TRUNCATED)	{ "input": [ "3\n1 1 1\n", "1\n1\n", "2\n1 2\n", "4\n1 2 3 4\n" ], "output": [ "-1\n", "-1\n", "-1\n", "1 2\n" ] }	{ "input": [], "output": [] }	{"input":["2\n2\n7","2\n2\n3","2\n1\n3","2\n3\n5","2\n4\n4","2\n3\n8","2\n4\n7","2\n4\n8","2\n2\n16"(...TRUNCATED)	1	11	{"language":[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,1,2,2,2,2,2,2,2,4,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,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	A	500	0	[ "binary search", "dp" ]	false		{ "nanos": 0, "seconds": 2 }	512,000,000
new-world-11	"Given a string s. Can you make it a palindrome by deleting exactly one character? Note that size of(...TRUNCATED)	{"input":["4\n2 1 2 3 4 3 2 6 1 1 2 2 1 2 3 2\n","1\n42\n","2\n1 1 1 1\n"],"output":["6 4 3 2 ","42 (...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	1	0	{"language":[2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2(...TRUNCATED)	{"language":[2,2,2,4,2,4,2,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,4,2,2,2,2,4,2,2,4,2,2,4(...TRUNCATED)	0	C	0	3,200	[ "dfs and similar", "dsu", "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
p01535 Markup language has Declined	"Mister B once received a gift: it was a book about aliens, which he started read immediately. This (...TRUNCATED)	{ "input": [ "3\n2 3 4\n2 1\n1\n-1\n" ], "output": [ "56\n" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	1	10	{"language":[1,2,4,2,3,3,3,4,3,3,4,3,4,2,3,3,4,4,2,3,4,2,4,4,2,3,3,2,2,1,3,3,3,3,2,4,3,4,4,4,3,3,3,2(...TRUNCATED)	{"language":[2,2,2,2,4,2,2,2,1,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,2(...TRUNCATED)	0	C	1,000	2,000	[ "geometry", "math" ]	false		{ "nanos": 0, "seconds": 2 }	134,217,728
p04048 AtCoder Grand Contest 001 - Mysterious Light	"Sorting arrays is traditionally associated with high-level languages. How hard can it be in Roco? S(...TRUNCATED)	{"input":["3 4\n10 10\n-10 -10\n3 3\n1 2\n2 3\n3 5\n3 5","2 2\n2 0\n0 0\n-1 0\n1 0","5 5\n-100000000(...TRUNCATED)	{"input":["5\n81 125 16\n19683 15625 8192\n59049 15630 32768\n59050 78125 131072\n177147 390625 1310(...TRUNCATED)	{"input":["2\n3 3 2\n8 3 2\n3 0\n3 7\n8 0\n5 7","2\n3 3 2\n8 3 2\n1 3\n3 7\n8 0\n8 7","1\n10 10 17\n(...TRUNCATED)	2	10	{"language":[1,1,1,1,1,1,1,1,1,1,1,1],"solution":["for _ in xrange(input()):\n\tn,c,m=map(int,raw_in(...TRUNCATED)	{"language":[4,3,2,4,4,3,4,2,2,4,3,2,4,2,2,2,2,4,4,4,2,4,2,4,3,3,4,4,2,4,4,2,2,4,2,2,4,4,2,2,3,3,4,2(...TRUNCATED)	793	C	0	3,200	[]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
931_A. Friends Meeting	"Finally Fox Ciel arrived in front of her castle!\n\nShe have to type a password to enter her castle(...TRUNCATED)	{ "input": [ "2\n17 25\n4\n17 45\n4\n17 25\n7\n19 35\n0" ], "output": [ "250\n1300" ] }	{ "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,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,4,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,3,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)	174	C	0	1,500	[ "" ]	false		{ "nanos": 0, "seconds": 4 }	256,000,000
1451_D. Circle Game	"Ali is Hamed's little brother and tomorrow is his birthday. Hamed wants his brother to earn his gif(...TRUNCATED)	{ "input": [ "1 -5 6\n" ], "output": [ "2\n2.000000\n3.000000\n" ] }	{ "input": [], "output": [] }	{"input":["3\nAZAMON APPLE\nAZOMAN AAAAAAAAAAALIBABA\nAPPLE BANANA\n","3\nAZAMNO ELPPA\nAZAMON AAAAA(...TRUNCATED)	2	10	{"language":[2,2,2,2,2,2,2,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(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,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(...TRUNCATED)	586		2,750	1,900	[ "" ]	false	"20XX年に喜多方市熱塩加納町から南会津町までの6区間、総距離58kmの会津中(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	256,000,000