Datasets:

TheFactoryX
/

edition_1122_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	time_limit dict	memory_limit_bytes int64 0 1.07B
p02807 Dwango Programming Contest 6th - Fusing Slimes	"Nadeko's birthday is approaching! As she decorated the room for the party, a long garland of Dianth(...TRUNCATED)	{ "input": [ "2 5 4 0 4\n", "4 5 9 2 1\n" ], "output": [ "3\n", "-1\n" ] }	{"input":["20\n1 1000000000 2\n1 1000000000 2\n1 1000000000 2\n1 1000000000 2\n1 1000000000 2\n1 100(...TRUNCATED)	{"input":["1 0\n25 47 15","1 0\n16 47 15","1 0\n31 47 15","2 0\n31 47 13","2 0\n31 47 20","2 0\n31 4(...TRUNCATED)	2	0	{"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,0,2,2,0,2,2,0],"solution":["#include <bits/stdc++.h>\n#define pq priority_queue\nusin(...TRUNCATED)	152	D	500	2,200	[]	false	{ "nanos": 0, "seconds": 8 }	256,000,000
784_B. Kids' Riddle	"You've got array A, consisting of n integers and a positive integer k. Array A is indexed by intege(...TRUNCATED)	{ "input": [ "5 10 25 12 4 1 \n3 16 28 100\n\nSAMPLE" ], "output": [ "4 12 10 \n100 28 16" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	8	{"language":[3,4,2,3,4,4,3,3,3,4,4,2,4,4,3,3,4,1,2,3,3,2,4,2,4,4,2,2,2,2,4,2,2,4,4,4,3,2,4,4,3,4,2,4(...TRUNCATED)	{ "language": [], "solution": [] }	0	E	2,000	2,000	[ "dp", "two pointers" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
20_B. Equation	"Find the number of ways to divide an array a of n integers into any number of disjoint non-empty se(...TRUNCATED)	{ "input": [ "7\n1\n2\n3\n12\n12345\n15116544\n387420489\n" ], "output": [ "0\n-1\n2\n-1\n-1\n12\n36\n" ] }	{"input":["5 0\n884430748 884430748 708433020 708433020 708433020\n","2 1\n1 1\n","2 0\n2 1\n","5 2\(...TRUNCATED)	{"input":["777 20\n","110 4\n","12 4\n","500 2\n","11 4\n","1 8\n","26 11\n","91 4\n","20 4\n","123 (...TRUNCATED)	6	0	{"language":[2,2,4,2,4,2,3,4,2,4,2,4,2,4,2,2,4,2,2,2,2,4,2,2,2,4,2,4,2,4,4,2,2,4,1,2,2,2,2,2,2,2,2,3(...TRUNCATED)	{"language":[2,2,2,2,4,4,4,4,4,4,4,2,4,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,4,2,2,2,2,2(...TRUNCATED)	0		2,000	2,100	[ "implementation" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
720_C. Homework	"Background\n\nThe kindergarten attached to the University of Aizu is a kindergarten where children (...TRUNCATED)	{"input":["6\n3 1\n3 2\n3 100\n4 3\n4 4\n5 2\n\nSAMPLE"],"output":["101\n121\n-1\n1313\n1414\n12121\(...TRUNCATED)	{"input":["19 20 196\n###.....##.#..#..##.\n####............##..\n###....#..#.#....#.#\n##....###...(...TRUNCATED)	{"input":["14 2 2012","14 4 2012","14 4 1177","20 4 1177","20 4 1433","20 3 1433","14 3 1433","14 3 (...TRUNCATED)	5	14	{"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,4,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,0,0,2,2,0,2,2,4,2,2,4,0,0,2,2,0,2,2,0,0,2,2,2,2,2,2,2,0,2,2,2,2,2,0,2,2,2(...TRUNCATED)	1,466	D	0	0	[ "games", "geometry", "math" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
p03943 AtCoder Beginner Contest 047 - Fighting over Candies	"We have a string s consisting of lowercase English letters. Snuke is partitioning s into some numbe(...TRUNCATED)	{ "input": [ "2 2\n2 3\n2 3\n2 3\n2 2\n3 2", "2 2\n2 3\n2 3\n2 3\n2 2\n2 2" ], "output": [ "yes", "no" ] }	{"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":["36\n2 2 2 8 9 4 8 5\n9 1 7 6 10 6 9 3\n10 2 4 6 6 2 1 1\n9 6 2 3 5 7 7 3\n6 6 3 9 10 9 1 (...TRUNCATED)	2	8	{"language":[1,1,1,1,1,1,1,1],"solution":["i=1\nfor _ in xrange(input()):\n\ta,b=map(int,raw_input()(...TRUNCATED)	{"language":[2,3,4,3,0,2,2,4,2,0,3,0,3,0,3,3,2,0,2,2,2,2,2,0,0,3,2,2,2,2,2,2,3,2,3,2,4,2,2,3,0,2,2,3(...TRUNCATED)	0		750	0	[ "data structures", "dfs and similar", "shortest paths", "trees" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
p01316 Differential Pulse Code Modulation	"Find the sum of the weights of edges of the Minimum-Cost Arborescence with the root r for a given w(...TRUNCATED)	{ "input": [ "73", "1" ], "output": [ "458.67252742410977361942", "6.28318530717958623200" ] }	{"input":["541\n54 98 68 63 83 94 55 35 12 63 30 17 97 62 96 26 63 76 91 19 52 42 55 95 8 97 6 18 96(...TRUNCATED)	{"input":["3\n1 3 2\n-100 2 6\n","2\n2 1\n-4 0\n","2\n0 1\n-4 0\n","2\n0 2\n-4 0\n","3\n1 5 2\n-167 (...TRUNCATED)	2	9	{"language":[2,2,2,4,2,4,2,4,2,2,2,2,4,2,2,2,2,2,4,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(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,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,2,4,2,2(...TRUNCATED)	1,184	E	0	0	[ "implementation" ]	false	{ "nanos": 0, "seconds": 3 }	256,000,000
650_B. Image Preview	"Today Peter has got an additional homework for tomorrow. The teacher has given three integers to hi(...TRUNCATED)	{"input":["18\naeiouyaaeeiioouuyy\n","22\niiiimpleeemeentatiioon\n","13\npobeeeedaaaaa\n","24\naaaoo(...TRUNCATED)	{"input":["4 9\n5 1000000000 999999999 12\n","4 6\n5 1000000000 999999999 12\n","1 1\n4\n","3 5\n4 5(...TRUNCATED)	{"input":["15 28\n10 7\n5 9\n2 13\n2 14\n6 1\n9 12\n2 10\n3 9\n10 15\n11 12\n12 6\n2 12\n12 8\n4 10\(...TRUNCATED)	1	0	{"language":[3,2,4,2,3,2,2,2,2,4,4,4,3,3,4,3,3,3,4,3,3,4,2,2,3,3,2,2,4,3,3,2,2,2,3,2,4,3,2,2,3,4,4,2(...TRUNCATED)	{"language":[4,2,3,3,4,4,2,3,3,2,2,4,4,3,3,2,3,4,2,4,2,3,3,1,2,2,2,3,3,4,2,4,3,4,2,2,2,4,2,4,1,3,4,4(...TRUNCATED)	519	E	0	0	[ "data structures", "greedy", "implementation" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
jumping-frog	"Roma found a new character in the game \"World of Darkraft - 2\". In this game the character fights(...TRUNCATED)	{"input":["2 2\n6 3\nMonday Tuesday Wednesday\n8 4\nThursday Friday Saturday Sunday\n2 2\n7 3\nMonda(...TRUNCATED)	{"input":["1\n3\nS01\n111\n00F\n","1\n5\nS0000\n00000\n00000\n00000\n0000F\n","1\n3\nS10\n010\n11F\n(...TRUNCATED)	{ "input": [], "output": [] }	2	3	{"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],"s(...TRUNCATED)	{"language":[2,2,4,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,2,2(...TRUNCATED)	1,091		0	2,100	[ "" ]	false	{ "nanos": 500000000, "seconds": 0 }	134,217,728
662_C. Binary Table	"Advertising has become part of our routine. And now, in the era of progressive technologies, we nee(...TRUNCATED)	{ "input": [ "2\n17 25\n4\n17 45\n4\n17 25\n7\n19 35\n0" ], "output": [ "250\n1300" ] }	{ "input": [], "output": [] }	{"input":["4\n1 4\n3 2\n3 4\n","21\n7 15\n13 1\n14 3\n4 10\n2 3\n16 18\n17 20\n16 20\n8 4\n3 12\n2 1(...TRUNCATED)	2	10	{"language":[2,2,2,2,2,2,2,2,2,3,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3(...TRUNCATED)	{ "language": [], "solution": [] }	0	B	2,000	0	[ "dp", "implementation", "math", "number theory" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
188_D. Asterisks	"Ehab has an array a of length n. He has just enough free time to make a new array consisting of n c(...TRUNCATED)	{"input":["9\ndo\nthe\nbest\nand\nenjoy\ntoday\nat\nacm\nicpc\n14\noh\nyes\nby\nfar\nit\nis\nwow\nso(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["5\n0 4\n3 4\n1 2\n2 0\n0 0\n","10\n1000 0\n100 0\n0 25\n100 50\n100 51\n99 102\n1001 102\(...TRUNCATED)	5	9	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,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,4(...TRUNCATED)	{"language":[2,2,3,1,4,3,4,4,3,3,2,2,2,1,4,4,2,3,4,3,4,2,2,2,4,4,4,3,3,3,2,3,2,4,1,2,3,3,3,4,1,2,3,4(...TRUNCATED)	133	E	0	0	[ "data structures", "dfs and similar", "dp", "trees" ]	false	{ "nanos": 0, "seconds": 3 }	256,000,000