Datasets:

TheFactoryX
/

edition_0489_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
1424_N. BubbleSquare Tokens	"Taro is going to play a card game. However, now he has only n cards, even though there should be 52(...TRUNCATED)	{ "input": [ "1 -5 6\n" ], "output": [ "2\n2.000000\n3.000000\n" ] }	{ "input": [], "output": [] }	{"input":["7\n5\n-1 10 -1 12 -1\n5\n-1 40 35 -1 35\n6\n-1 -1 9 -1 3 -1\n2\n-1 -1\n2\n0 -1\n4\n1 -1 3(...TRUNCATED)	2	0	{"language":[2,4,2,4,2,2,2,2,2,2,2,2,4,4,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)	{"language":[2,4,1,2,3,4,4,2,4,2,4,2,4,2,3,3,3,3,2,2,2,4,4,2,2,4,4,3,4,4,3,1,1,4,3,1,3,1,2,3,4,4,3,2(...TRUNCATED)	1,144		20	0	[ "bitmasks", "brute force", "dp", "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
p00447 Searching Constellation	"Recently Johnny have learned bogosort sorting algorithm. He thought that it is too ineffective. So (...TRUNCATED)	{"input":["6\n3\n0 0\n1 1\n1 2\n2\n1 0\n1000 3\n4\n10 1\n15 2\n10 2\n15 2\n1\n765 432\n2\n4 4\n4 3\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	14	{"language":[4,3,4,2,4,4,3,3,4,2,2,2,2,3,4,2,3,3,3,3,4,3,2,4,2,3,4,4,3,4,3,4,3,2,2,2,3,2,2,2,3,3,2,2(...TRUNCATED)	{"language":[4,3,3,1,2,4,2,2,3,3,4,3,4,3,2,2,4,3,3,3,4,2,2,2,4,3,2,2,3,3,4,4,4,1,1,4,1,1,1,3,2,4,2,1(...TRUNCATED)	415	D	1,000	0	[ "geometry", "math" ]	false	"\n\n問題\n\nあなたは星空の写真の中から星座を探している．写真には必ず(...TRUNCATED)	{ "nanos": 0, "seconds": 6 }	256,000,000
p02157 Shuffle 2	"A string is called a k-string if it can be represented as k concatenated copies of some string. For(...TRUNCATED)	{"input":["2\n1000000 1000000\n","6\n5 1 2 4 6 3\n","5\n1 5 7 8 2\n"],"output":["1000000\n","0\n","0(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1 5000 2732\n","2 2 0\n","83 4122 123\n","19 862 387\n","100 843 30\n","45 1296 245\n","9(...TRUNCATED)	3	8	{"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": [], "solution": [] }	0	F	0	2,500	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	512,000,000
1413_F. Roads and Ramen	"A rabbit is playing a role-playing game. Just before entering the castle, he was ambushed by an ene(...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": [], "output": [] }	5	8	{"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],"solution":["def solve():\n\(...TRUNCATED)	{ "language": [], "solution": [] }	0		0	1,000	[ "implementation" ]	false		{ "nanos": 0, "seconds": 1 }	0
1311_C. Perform the Combo	"Vasya commutes by train every day. There are n train stations in the city, and at the i-th station (...TRUNCATED)	{ "input": [ "2\n" ], "output": [ "25\n" ] }	{"input":["9\n72 49 39 50 68 35 75 94 56\n","4\n2 3 1 2\n","8\n3 4 3 1 1 3 4 1\n","1\n4\n","7\n2 1 2(...TRUNCATED)	{"input":["5\n0 0\n2 1\n1 1\n2 2\n0 2","4\n0 0\n3 0\n2 1\n0 3","4\n0 0\n3 1\n2 1\n0 3","5\n0 0\n3 1\(...TRUNCATED)	2	9	{"language":[1],"solution":["t = int(raw_input())\nfor _ in range(t):\n n, m, k = map(int, raw_in(...TRUNCATED)	{"language":[4,4,4],"solution":["import java.io.IOException;\nimport java.io.InputStream;\nimport ja(...TRUNCATED)	0	C	0	3,000	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
p03771 AtCoder Grand Contest 012 - Camel and Oases	"E: Markup language has declined\n\nIt's been centuries since we humans have been declining slowly. (...TRUNCATED)	{"input":["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 2 17\n"],"output":(...TRUNCATED)	{"input":["15\ntxxtxttxxttxtxx\n","3\nmyw\n","127\nxixtxixnxixtxixlxixtxixnxixtxixoxixtxixnxixtxixlx(...TRUNCATED)	{"input":["2\n4 INDIAN\nCONTEST_WON 1\nTOP_CONTRIBUTOR\nBUG_FOUND 100\nCONTEST_HOSTED\n1 NON_INDIAN\(...TRUNCATED)	5	12	{"language":[2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,4,2,4(...TRUNCATED)	{ "language": [], "solution": [] }	1,470	C	0	1,900	[]	false	"E - Disappear Drive / 消えるドライヴ\n\nStory\n\nDのひとはバスケットボールが好(...TRUNCATED)	{ "nanos": 0, "seconds": 8 }	256,000,000
1012_E. Cycle sort	"Draw a chessboard which has a height of H cm and a width of W cm. For example, the following figure(...TRUNCATED)	{ "input": [ "10 30 10\n", "2 6 3\n", "5 20 11\n" ], "output": [ "85932500\n", "124780545\n", "1\n" ] }	{"input":["20 10000000\n8861863 2169292 3484361 511558 5975675 1413584 774309 5847326 6668965 253146(...TRUNCATED)	{"input":["3\n7089544 9134148 -5332724\n368810 1638695 13258988\n-3866235 -4257263 5802154\n","16\n-(...TRUNCATED)	2	9	{"language":[2,4,4,2,4,4,2,2,4,3,2,4,4,2,2,3,2,4,4,2,2,2,4,4,2,3,4,2,4,2,2,3,3,3,2,2,3,2,4,2,3,4,2,4(...TRUNCATED)	{ "language": [], "solution": [] }	0		0	0	[ "data structures", "greedy" ]	false		{ "nanos": 0, "seconds": 1 }	0
1012_B. Chemical table	"Ori and Sein have overcome many difficult challenges. They finally lit the Shrouded Lantern and fou(...TRUNCATED)	{ "input": [ "1\n", "4\n", "6\n", "2\n" ], "output": [ "1 1\n", "1 4\n", "2 3\n", "1 2\n" ] }	{"input":["1 0\n23333\n","3 3\n1 1 1\n1 2\n2 3\n3 1\n","5 4\n1 2 2 2 2\n1 2\n1 3\n1 4\n1 5\n","10 30(...TRUNCATED)	{ "input": [], "output": [] }	3	8	{"language":[1,1],"solution":["t = int(raw_input())\n\nd = {}\n\nfor i in range(t):\n\t\n\ts = raw_i(...TRUNCATED)	{"language":[3,1,2,2,2,2,2,1,2,1,2,2,4,2,4,1,2,2,4,4,2,2,1,4,2,4,4,3,2,4,2,4,3,4,2,2,4,2,3,4,2,4,2,2(...TRUNCATED)	1,490	D2	0	3,100	[ "binary search", "data structures", "greedy", "implementation" ]	false		null	256,000,000
playing-with-substrings	"We have a string s consisting of lowercase English letters. Snuke is partitioning s into some numbe(...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": [], "output": [] }	2	12	{"language":[3,2,4,3,2,4,2,3,4,3,3,4,2,2,3,3,2,2,3,2,3,2,3,4,2,2,2,2,2,2,3,3,2,2,2,2,2,3,2,3,2,2,2,2(...TRUNCATED)	{"language":[0,2,2,0,2,2,2,0,2,0,2,2,2,2,2,0,0,2,3,2,0,2,2,0,0,2,4,2,2,2,2,2,2,2,2,0,2,0,2,0,2,2,1,0(...TRUNCATED)	0		0	1,000	[ "binary search", "greedy", "ternary search" ]	false		{ "nanos": 0, "seconds": 1 }	268,435,456
luckybal	"Monocarp and Polycarp are learning new programming techniques. Now they decided to try pair program(...TRUNCATED)	{"input":["10\n10\n3 7\n1 4\n1 6\n5 5\n1 1\n3 9\n7 8\n1 2\n3 3\n7 10\n10\n2 4\n1 7\n3 4\n3 5\n2 8\n2(...TRUNCATED)	{"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":["2 7\n4\n2\n1\n0\n-1\n-2\n-4\n131\n137\n2 7\n4\n2\n1\n0\n-1\n-2\n-4\n124\n123\n10 7\n-4\n-(...TRUNCATED)	2	11	{"language":[1,1,1,1],"solution":["for t in xrange(input()):\n n, m = map(int, raw_input().strip((...TRUNCATED)	{"language":[2,2,2,4,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,3,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	963	B	0	1,300	[]	false		{ "nanos": 0, "seconds": 2 }	256,000,000