Datasets:

TheFactoryX
/

edition_0505_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
188_G. Array Sorting	"The HR manager was disappointed again. The last applicant failed the interview the same way as 24 p(...TRUNCATED)	{"input":["3 4\n5 6\n3 3\n2 2\n1 1\n0 0"],"output":["#.#.\n.#.#\n#.#.\n\n#.#.#.\n.#.#.#\n#.#.#.\n.#.(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1\n1 0 1 1\n10000 10000 10000 10000","2\n10 3 1 2\n2 4 1 3\n1 2 1 1","2\n10 3 1 2\n2 4 1 (...TRUNCATED)	2	9	{"language":[2,2,4,2,4,2,2,4,2,2,4,4,2,1,1,4,4,4,1,2,2,2,4,3,2,4,1,4,2,1,4,2,3,2,4,4,2,2,1,1,2,2,2,4(...TRUNCATED)	{"language":[2,2,2,2,2,0,4,0,0,2,4,0,2,0,2,0,0,4,0,2,2,2,0,2,2,0,2,3,4,2,4,0,4,0,2,0,2,2,2,2,2,0,2,4(...TRUNCATED)	235	C	1,000	1,500	[ "*special", "data structures", "dsu", "implementation", "math", "sortings" ]	false		{ "nanos": 0, "seconds": 10 }	256,000,000
76_B. Mice	"Polycarpus enjoys studying Berland hieroglyphs. Once Polycarp got hold of two ancient Berland pictu(...TRUNCATED)	{"input":["4\n10 4\n4 5\n5 2\n2 1\n1 3\n1 9\n9 10\n2 7\n7 8\n5 6\n4 3\n1 2\n2 3\n3 4\n5 3\n1 2\n1 3\(...TRUNCATED)	{"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":["5\n1 2 0\n1 3 0\n3 5 0\n3 4 0\n3\n3\n4\n1\n3\n4\n","20\n9 11 0\n1 5 0\n1 14 0\n5 17 0\n14(...TRUNCATED)	3	14	{"language":[4,2,2,4,2,4,4,2,2,4,2,2,4,2,4,2,2,2,4,2,2,1,4,2,2,2,2,2,2,2,4,2,2,4,4,2,4,2,2,2,3,2,2,2(...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)	1,297		0	1,600	[]	false		{ "nanos": 0, "seconds": 5 }	256,000,000
582_A. GCD Table	"Frank explained its friend Felman the algorithm of Euclides to calculate the GCD \nof two numbers. (...TRUNCATED)	{ "input": [ "5\n5\n3\n2\n1\n4\n6\n1\n2\n3\n4\n5\n6\n3\n3\n2\n1\n0" ], "output": [ "7\n0\n3" ] }	{"input":["20 10000000\n8861863 2169292 3484361 511558 5975675 1413584 774309 5847326 6668965 253146(...TRUNCATED)	{"input":["1\n297754\n","16\n2 2 2 3 5 3 5 5 5 7 7 7 11 11 13 17\n","16\n2 2 2 2 2 3 3 5 5 5 5 7 7 1(...TRUNCATED)	2	7	{"language":[2,2,2,2,2,2,2,2,3,2,2,2,4,3,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(...TRUNCATED)	{"language":[3,2,2,2,2,1,2,2,2,4,1,2,3,4,2,2,3,1,2,2,2,2,2,3,2,1,4,3,2,4,3,1,2,4,3,2,4,3,2,3,2,2,4,2(...TRUNCATED)	0		0	1,800	[ "" ]	false	Time Limit: 8 sec / Memory Limit: 64 MB	{ "nanos": 0, "seconds": 2 }	256,000,000
124_D. Squares	"Sita loves chocolate and Ram being his boyfriend wants to give Sita as many chocolates as he can. S(...TRUNCATED)	{"input":["6 2\n100 1 10 40 10 40\n","5 1\n5 10 7 3 20\n","3 0\n1 2 3\n"],"output":["97\n","3\n","0\(...TRUNCATED)	{"input":["2 1\n1 1\n","2 3\n3 1\n","100 5\n5 5 2 4 5 4 4 4 4 2 5 3 4 2 4 4 1 1 5 3 2 2 1 3 3 2 5 3 (...TRUNCATED)	{"input":["9 10\n1 2 3 4 5 6 7 8 9\n1 2\n2 1\n2 4\n3 4\n4 5\n4 6\n2 7\n7 8\n7 9\n9 1","16 19\n1 2 3 (...TRUNCATED)	2	0	{"language":[4,4,4,4,3,3,2,2,4,3,4,2,4,4,4,2,3,2,4,3,3,2,4,3,2,1,2,2,4,4,2,3,3,2,3,2,3,3,2,3,3,4,1,4(...TRUNCATED)	{"language":[3,3,2,2,3,2,1,1,2,3,2,4,2,2,4,1,4,4,3,2,3,3,4,4,4,4,1,3,2,2,4,2,4,4,4,2,2,2,4,4,1,2,3,2(...TRUNCATED)	488	C	0	1,300	[ "games", "math", "number theory" ]	false		{ "nanos": 0, "seconds": 3 }	536,870,912
949_C. Data Center Maintenance	"You are given a number n. Print n lines, i-th line should consist of i characters \"*\". Lines' ind(...TRUNCATED)	{"input":["5\n0.50 0.29 0.49 0.95 0.83\n2 3\n0 3\n3 4\n2 1\n3\n4 0.66\n1 0.69\n0 0.36\n"],"output":[(...TRUNCATED)	{"input":["0 1073741823\n","10 5\n","16384 36739846\n","727373493 346368330\n","62914844 1044381411\(...TRUNCATED)	{"input":["5\n2 1\n5 2\n10 3\n25 4\n25479 33\n","5\n2 1\n9 1\n10 3\n25 4\n25479 33\n","5\n1 1\n9 1\n(...TRUNCATED)	6	8	{"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": [] }	0	A	0	1,800	[ "combinatorics", "dp", "math" ]	false		null	32,000,000
634_C. Factory Repairs	"There are N slimes standing on a number line. The i-th slime from the left is at position x_i.\n\nI(...TRUNCATED)	{"input":["500 500 0 0 200 200","4 4 0 0 1 1","4 4 0 0 3 3","2 3 0 0 1 2"],"output":["34807775","2",(...TRUNCATED)	{"input":["48 1976\n30 97 84\n80 81 84\n41 70 86\n23 57 80\n17 60 85\n36 48 81\n51 87 81\n38 85 81\n(...TRUNCATED)	{"input":["5\n10\nbb\nbb\nab\naa\nbb\nbb\nba\naa\nbb\nab\n10\nbb\nab\nba\nab\nba\nba\nab\nba\nba\nba(...TRUNCATED)	2	1	{"language":[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,4,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,0,3,2,3,2,2,3,3,3,2,2,2,2,3,2,2,0,2,2,2,2,2,4,3,2,2,2,2,2,0,2,3,2,2,2,2,2,2,2,4,2,2,3(...TRUNCATED)	306	D	0	0	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	0
765_D. Artsem and Saunders	"Andrew plays a game called \"Civilization\". Dima helps him.\n\nThe game has n cities and m bidirec(...TRUNCATED)	{ "input": [ "100 5\n1\n23\n45\n67\n89", "10 2\n4\n5", "6 1\n3" ], "output": [ "608200469", "0", "4" ] }	{ "input": [], "output": [] }	{"input":["51\n1732111733638718702525811518175029394157760329139501\n","55\n815096522892298714932212(...TRUNCATED)	2	7	{"language":[2],"solution":["#include <algorithm>\n#include <cassert>\n#include <climits>\n#include (...TRUNCATED)	{"language":[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,2(...TRUNCATED)	633	E	1,250	2,100	[ "bitmasks", "brute force", "dp", "math" ]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
1391_C. Cyclic Permutations	"The rebels have saved enough gold to launch a full-scale attack. Now the situation is flipped, the (...TRUNCATED)	{ "input": [ "4 1 1 6\n3 2 3" ], "output": [ "1" ] }	{ "input": [], "output": [] }	{"input":["7\n0 1\n1 2\n2 3\n3 0\n2 4\n2 5\n1 6\n","15\n0 1\n1 2\n2 3\n3 4\n4 5\n5 0\n0 6\n0 7\n2 8\(...TRUNCATED)	2	8	{"language":[3,2,4,1,1,3,4,2,3,4,2,2,3,2,4,3,2,2,1,2,3,2,3,4,3,3,3,3,4,3,3,1,2,3,3,3,2,2,3,3,2,3,3,2(...TRUNCATED)	{"language":[3,2,4,4,2,2,2,4,1,4,4,2,2,4,2,2,4,4,4,2,2,2,2,2,1,2,4,4,2,2,2,2,2,2,2,3,2,2,2,3,2,2,2,2(...TRUNCATED)	0	D	0	1,000	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1439_C. Greedy Shopping	"4 different points on the plane Read the coordinates of $ A (x_a, y_a) $, $ B (x_b, y_b) $, $ C (x_(...TRUNCATED)	{"input":["7\n0 8 9\n5 9 -2\n6 -8 -7\n9 4 5\n-4 -9 9\n-4 5 2\n-6 8 -7\n","2\n1 0 0\n1 1 0\n","3\n1 0(...TRUNCATED)	{ "input": [ "1\n999838675\n" ], "output": [ "-1\n" ] }	{"input":["8 9\n6 -1 5 -5 -1 -7 -8 -7\n","10 7\n-9 3 -4 -22 4 -17 1 -14 3 -2\n","5 10\n-8 -24 0 -5 1(...TRUNCATED)	2	13	{"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,2,2,2,2,2,2,2,2,3,2,2,0,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)	0		0	2,400	[ "data structures" ]	true		{ "nanos": 0, "seconds": 2 }	268,435,456
gameaam	Example Input 4 3 1 3 4 7 Output 6	{ "input": [ "2\n2\n3\n\n\nSAMPLE" ], "output": [ "2\n4\n" ] }	{"input":["188\n762\n","352\n445\n","596\n777\n","1000\n999\n","1000\n2\n","773\n70\n","1\n1000\n","(...TRUNCATED)	{"input":["10\n1000 910\n94625 95469 92038 95916 93405 95533 97004 92469 99853 94992 90361 99819 932(...TRUNCATED)	2	0	{"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":[3,4,3,4,3,2,4,4,4,3,2,3,3,2,4,1,2,4,2,4,4,4,3,4,1,3,2,2,2,3,2,4,3,3,2,3,2,2,3,1,4,2,3,3(...TRUNCATED)	1,500	A	0	1,700	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	1,073,741,824