Datasets:

TheFactoryX
/

edition_0826_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
295_D. Greg and Caves	"Kitahara Haruki has bought n apples for Touma Kazusa and Ogiso Setsuna. Now he wants to divide all (...TRUNCATED)	{ "input": [ "2\nacxz\nbcxz\n\nSAMPLE" ], "output": [ "Funny\nNot Funny\n" ] }	{"input":["10\n5 7 0\n2 10 1\n1 5 0\n6 8 0\n4 9 1\n2 5 1\n10 8 0\n2 3 1\n4 2 1\n10\n9\n9\n9\n5\n2\n5(...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)	2	10	{"language":[4,4,3,2,4,2,1,3,2,3,1,4,4,3,1,2,1,4,2,3,2,4,4,2,4,3,3,1,4,2,2,2,3,1,3,2,4,3,4,4,4,1,1,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,366	C	0	0	[ "" ]	false	"\n\n問題\n\n$N$ 個の相違なる自然数 $a_i$ が与えられる。与えられた自然数(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	256,000,000
1311_F. Moving Points	"In a mystical TimeLand, a person's health and wealth is measured in terms of time(seconds) left. \n(...TRUNCATED)	{"input":["2\n1 2\n50 50\n50","4\n2 3 4 1\n13 5 8 24\n45 9 15","3\n3 1 2\n2 5 4\n3 6"],"output":["15(...TRUNCATED)	{"input":["4\n10 4\n15 1\n19 3\n20 1\n","2\n1 999999999\n1000000000 1000000000\n","67\n1 1\n3 8\n4 1(...TRUNCATED)	{"input":["11\n1 2 3 4 5 6 7 8 9 10 11\n2\n1 4 7","11\n1 2 3 4 5 6 2 8 9 10 11\n2\n1 4 1","11\n1 2 3(...TRUNCATED)	2	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,4,2,2,2,2,4,3,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,3,2,2,2,2,2(...TRUNCATED)	478		1,500	0	[ "" ]	false	"20XX年に喜多方市熱塩加納町から南会津町までの6区間、総距離58kmの会津中(...TRUNCATED)	{ "nanos": 500000000, "seconds": 2 }	268,435,456
1497_D. Genius	"Rupsa recently started to intern under Chef. He gave her N type of ingredients of varying quantity (...TRUNCATED)	{ "input": [ "2\n3\n10" ], "output": [ "1\n3" ] }	{ "input": [], "output": [] }	{"input":["2\n1 1 6 1\n3\n0 1 2\n","2\n2 0 4 3\n4\n1 2 0 2\n","2\n1 1 6 2\n3\n0 1 2\n","2\n2 0 4 6\n(...TRUNCATED)	5	0	{"language":[3,2,4,2,2,2,3,3,3,4,3,3,3,2,4,3,2,4,2,3,2,2,3,2,2,4,2,2,3,3,4,3,3,2,2,2,4,3,3,3,3,3,2,2(...TRUNCATED)	{"language":[2,2,2,4,2,3,4,4,2,2,4,4,1,1,4,4,2,4,4,2,1,2,2,2,2,2,4,2,2,2,2,4,2,3,4,3,1,4,2,2,2,2,2,3(...TRUNCATED)	0	C	500	1,900	[]	false		{ "nanos": 0, "seconds": 2 }	536,870,912
79_D. Password	"You are given a square with 'n' points on each side of the square. None of these points co-incide w(...TRUNCATED)	{ "input": [ "3\nkek\npreceq\ncheburek\n", "4\nmail\nai\nlru\ncf\n" ], "output": [ "NO\n", "cfmailru\n" ] }	{"input":["99\n3\n5\n7\n9\n11\n13\n15\n17\n19\n21\n23\n25\n27\n29\n31\n33\n35\n37\n39\n41\n43\n45\n4(...TRUNCATED)	{"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)	5	0	{"language":[1,1,1,1],"solution":["for t in xrange(input()):\n n, m = map(int, raw_input().strip((...TRUNCATED)	{ "language": [], "solution": [] }	151		0	2,100	[ "trees" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
p03819 AtCoder Regular Contest 068 - Snuke Line	"There are n persons who initially don't know each other. On each morning, two of them, who were not(...TRUNCATED)	{"input":["5 8\n1 2 6 7 10\n1 1 1 1 2\n1 1\n1 5\n1 3\n3 5\n-3 5\n-1 10\n1 4\n2 5\n"],"output":["0\n1(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1 11 4 0 10\n","17 10 12 6 8\n","6 4 4 0 2\n","50 4 5 5 -1\n","20 2 40 1 2\n","1000 501 5(...TRUNCATED)	3	9	{"language":[2,2,2,2,2,3,2,4,2,2,4,2,3,2,2,2,2,2,2,2,4,4,2,2,2,2,4,2,4,2,2,2,2,3,4,2,2,2,2,4,1,2,2,4(...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)	571	A	0	800	[]	true		{ "nanos": 0, "seconds": 2 }	64,000,000
new-world-11	"You're given a simple, undirected, connected, weighted graph with n nodes and m edges.\n\nNodes are(...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": [], "output": [] }	{"input":["1 10\n778084 -205153\n778001 -205093\n778155 -205118\n778168 -204997\n778066 -205141\n778(...TRUNCATED)	2	9	{"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,0,2,0,3,2,0,2,2,2,2,2,0,3,2,2,2,3,2,2,4,2,2,2,2,2,2,2,0,3,4,2,2,2,2,2,2,2,2,0,2,0,0,2(...TRUNCATED)	79	B	0	0	[ "math" ]	false		null	512,000,000
p03725 AtCoder Grand Contest 014 - Closed Rooms	"Polycarp is working on a new project called \"Polychat\". Following modern tendencies in IT, he dec(...TRUNCATED)	{"input":["1\n1 1 0 1 0 0 0 1 0 1\n3 4 5 6 7 8 9 -2 -3 4 -2","3\n1 1 1 1 1 1 0 0 1 1\n0 1 0 1 1 1 1 (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["10\n-1 -1\n1 1\n1 1\n3 0\n4 1\n2 0\n3 1\n2 1\n5 0\n5 0\n8\n1 2 6\n2 3 7\n2 4 7\n1 3 4\n2 (...TRUNCATED)	6	11	{"language":[4,3,2,4,3,2,3,2,2,4,2,4,3,3,2,3,2,2,2,3,3,3,3,3,3,3,3,2,4,3,3,4,3,3,3,4,3,3,3,4,3,3,3,3(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,4,4,2,2,4,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2(...TRUNCATED)	1,301	N	0	1,100	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	0
868_A. Bark to Unlock	"Polycarpus is sure that his life fits the description: \"first there is a white stripe, then a blac(...TRUNCATED)	{ "input": [ "3 1 8 10\n10 8\n5 7\n11 9\n3\n", "2 2 10 18\n10 4\n20 6\n5 3\n" ], "output": [ "10\n", "20\n" ] }	{"input":["1\n5 39\n1 2\n3 4\n5 6\n7 8\n1 9\n3 10\n3 11\n5 12\n5 13\n7 14\n7 15\n9 2\n10 2\n11 2\n12(...TRUNCATED)	{"input":["5 6\n#.##\n.##.\n#...\n..##\n...#","13 27\n......#.........#.......#..\n...#.....###..\n.(...TRUNCATED)	2	8	{"language":[2,2,1,2,2,4,3,2,4,4,2,4,2,3,2,4,2,2,4,2,4,3,2,2,2,2,4,4,4,2,2,2,2,2,2,4,2,2,2,2,4,4,2,4(...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)	295	D	0	900	[ "binary search", "graphs", "matrices" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
gcd2	"Buber is a Berland technology company that specializes in waste of investor's money. Recently Buber(...TRUNCATED)	{ "input": [ "5\n2 4 2\n5 10 4\n3 10 1\n1 2 3\n4 6 5\n" ], "output": [ "6\n4\n1\n3\n10\n" ] }	{"input":["61\n17357774\n248290406\n171408490\n20054376\n118774144\n110228788\n8827234\n85304880\n15(...TRUNCATED)	{"input":["1 1 2000000000\n1\n3\n","28 3 2099\n768 115 416 934 926 65 802 980 551 213 335 202 784 91(...TRUNCATED)	2	0	{"language":[2,2,4,4,2,2,2,2,2,2,4,4,4,4,2,2,2,2,2,2,2,4,2,2,2,4,4,4,4,4,4,2,4,2,2,2,2,4,4,4,4,2,2,2(...TRUNCATED)	{"language":[2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,0,2,2,2,2,2,3,2,2,4,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	B3	0	2,000	[ "binary search", "dsu", "graphs", "shortest paths", "trees" ]	false	"問題\n\n正の整数を (先頭に 0 をつけずに) 10 進法で書いて桁の数字を順番(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	536,870,912
178_A1. Educational Game	"Given a string, S, we define some operations on the string as follows:\n\na. reverse(S) denotes the(...TRUNCATED)	{"input":["3 4 2\n#..#\n..#.\n#...\n","5 4 5\n#...\n#.#.\n.#..\n...#\n.#.#\n"],"output":["#..#\n..#X(...TRUNCATED)	{"input":["5\n3\n1 1\n1 1\n1 1\n3\n1 1\n1 1\n1 1\n3\n1 1\n1 1\n1 1\n3\n1 1\n1 1\n1 1\n3\n1 100\n1 1\(...TRUNCATED)	{"input":["2\n11 3\n2 3 4\n6 3\n3 2 1","2\n22 3\n2 0 3\n4 3\n3 2 1","2\n22 3\n0 0 3\n4 3\n3 2 1","2\(...TRUNCATED)	2	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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,4,4,1,1,2,4,2,1,2,4,2,2,2,4,2,4,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	621	F	0	2,500	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000