Datasets:

TheFactoryX
/

edition_0476_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
867_D. Gotta Go Fast	"You are given a permutation p_1,p_2,...,p_N consisting of 1,2,..,N. You can perform the following o(...TRUNCATED)	{ "input": [ "5 4\n2 4 8 2 4\n8\n5\n14\n10\n" ], "output": [ "1\n-1\n3\n2\n" ] }	{"input":["26\n0.98 0.64 0.06 0.90 0.01 0.73 0.21 0.98 0.65 1.00 0.87 0.85 0.01 0.06 0.65 0.00 0.65 (...TRUNCATED)	{"input":["2\n1 1 1 1 1 0 0 0 0 0\n0 0 0 0 0 1 1 1 1 1\n0 -2 -2 -2 -2 -2 -1 -1 -1 -1 -1\n0 -2 -2 -2 (...TRUNCATED)	6	9	{"language":[2,2,2,2,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,3,2,2,4,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	188		0	0	[ "*special", "implementation", "strings" ]	false	null	256,000,000
45_H. Road Problem	"Bearland is a dangerous place. Limak can’t travel on foot. Instead, he has k magic teleportation (...TRUNCATED)	{"input":["2\n2 2\n3 3\n","2\n2 2\n4 1\n"],"output":[" (...TRUNCATED)	{"input":["10\n669924290 408119795 804030560\n663737793 250734602 29671646\n431160679 146708815 2894(...TRUNCATED)	{"input":["10 1\n1 0 1 1 1 1 1 1 1 1\n","3 87\n78 165 54\n","9 13\n132 166 200 62 168 51 185 192 118(...TRUNCATED)	2	10	{"language":[1],"solution":["digits=[6,2,5,5,4,5,6,3,7,6]\nvalids=[{} for i in xrange(11)]\nst0={}\n(...TRUNCATED)	{"language":[4,2,1,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,0,0,2,2,2,2,4,2,2,2,3,0,2,2],(...TRUNCATED)	754	B	2,500	1,000	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
990_B. Micro-World	"Polycarp was dismantling his attic and found an old floppy drive on it. A round disc was inserted i(...TRUNCATED)	{"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)	{"input":["51 89 97\n18 25 63\n22 91 74\n","1 100 1\n100 100 100\n1 100 100\n","20 1 1\n100 100 100\(...TRUNCATED)	{"input":["5 3\n00011\n3\n1 2 3\n1\n4\n3\n2 4 5\n","1 1\n0\n1\n1\n","1 0\n1\n1\n1\n","8 6\n00100011\(...TRUNCATED)	2	11	{"language":[2,2,2,2,2,2,3,2,2,4,2,2,4,2,2,4,2,2,2,3,2,2,3,4,4,4,2,2,2,2,4,3,4,2,3,2,2,4,2,3,2,4,2,1(...TRUNCATED)	{"language":[4,2,2,4,4,4,4,2,3,2,4,1,4,4,2,4,4,2,4,3,2,2,3,3,2,2,1,4,2,3,4,3,2,2,1,2,2,2,4,2,2,4,2,2(...TRUNCATED)	903	F	500	2,500	[ "math", "number theory", "sortings" ]	false	{ "nanos": 0, "seconds": 2 }	1,073,741,824
p03503 AtCoder Beginner Contest 080 - Shopping Street	"Takahashi is participating in a programming contest called AXC002, and he has just submitted his co(...TRUNCATED)	{ "input": [ "ppqb", "pdbq" ], "output": [ "No", "Yes" ] }	{"input":["25\n1 8\n8 8\n64 8\n512 8\n4096 8\n32768 8\n262144 8\n2097152 8\n16777216 8\n134217728 8\(...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)	6	0	{"language":[2,2,4,2,4,3,4,4,2,2,3,1,4,3,3,2,3,3,2,4,2,4,2,2,2,3,3,3,3,3,3,2,4,3,2,2,3,2,2,4,3,4,4,4(...TRUNCATED)	{"language":[2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,4,2,2,4,2,2,2,2,2,2,1,2,2,4,2,2,2,2,2,2,2,4,2,4(...TRUNCATED)	0	D	1,250	1,400	[]	false	null	256,000,000
1037_E. Trips	"Malek has recently found a treasure map. While he was looking for a treasure he found a locked door(...TRUNCATED)	{"input":["5 7\nqcezchs\nhhedywq\nwikywqy\nqckrqzt\nbqexcxz\n3 2\n??\nyw\n?q\n","8 6\nibrgxl\nxqdcsg(...TRUNCATED)	{"input":["4\n39 20\n183 11\n551 27\n85 16","8\n4 65\n5 12\n7 24\n9 38\n12 24\n14 10\n65 75\n31 26"](...TRUNCATED)	{"input":["4\nRBRR","4\nBBRR","4\nRRCR","4\nRRAR","4\nRARR","4\nBQBR","4\nRCRR","4\nBPBR","4\nRRRC",(...TRUNCATED)	2	0	{"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": [], "solution": [] }	0		1,000	1,900	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
vowel	"In the rush of modern life, people often forget how beautiful the world is. The time to enjoy those(...TRUNCATED)	{ "input": [ "2\n2 9 17\n1 1\n\nSAMPLE" ], "output": [ "Yes\nNo\n" ] }	{ "input": [], "output": [] }	{"input":["15 12\n2 3\n2 14\n4 3\n4 10\n3 5\n1 4\n1 12\n4 15\n1 9\n10 7\n11 2\n12 8\n15 13\n1 6\n","(...TRUNCATED)	2	0	{"language":[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,4,2,4,4,2,2,2,2,4,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,3,2,2,4,2,2,2,2,2,2,4,2,2,2,3,2,2,2,2,2,2,2,2,2,2,4,3,2,2,2,3,2,2,4,3,2,2,2,2,2,2,4,2(...TRUNCATED)	319	C	0	1,100	[ "graphs" ]	false	null	256,000,000
306_C. White, Black and White Again	"A string is called a KEYENCE string when it can be changed to `keyence` by removing its contiguous (...TRUNCATED)	{ "input": [ "3\n2 3 4\n2 1\n1\n-1\n" ], "output": [ "56\n" ] }	{"input":["2\n1 1 3 1\n3\n0 1 2\n"],"output":[" (...TRUNCATED)	{"input":["5 6\n#.##\n.##.\n#...\n..##\n...#","13 27\n......#.........#.......#..\n...#.....###..\n.(...TRUNCATED)	2	2	{"language":[2,2,2,2,2],"solution":["#include<cmath>\n#include<cstdio>\n#include<vector>\n\n#define (...TRUNCATED)	{"language":[3,3,2,0,0,3,2,2,4,2,0,4,0,0,0,0,2,0,2,0,2,2,0,0,0,2,2,1,2,3,2,2,0,4,2,4,2,2,2,2,2,2,3,0(...TRUNCATED)	545		500	2,000	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	1,073,741,824
1257_G. Divisor Set	"The time has arrived when the world is going to end. But don't worry, because the new world yuga wi(...TRUNCATED)	{"input":["2 3\n1 2\n1 2\n1 2\n","5 7\n2 4\n5 1\n2 3\n3 4\n4 1\n5 3\n3 5\n"],"output":["5 6 ","10 9 (...TRUNCATED)	{"input":["bbbbbbbbaaaaaaaaaaaccccccaaaaaaaaaaaaaaccccccccaaaaaaaaabbbbbbccbbbaaaaaabccccccaaaacaaac(...TRUNCATED)	{"input":["10\n2 3 1 5 6 4 2 10 7 7\n5\n10 1\n5 7\n19 6\n1 1\n10 8\n","10\n2 3 1 5 6 4 1 10 7 7\n5\n(...TRUNCATED)	6	10	{"language":[2,2,2,2,2,2,4,4,2,2,4,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,3,2,2,2,1,4,3,2,2,1,2,2,2,2,2,2,2(...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)	670	C	0	0	[ "binary search", "greedy", "ternary search" ]	false	{ "nanos": 0, "seconds": 2 }	0
152_E. Garden	"Chef and his girlfriend are going to have a promenade. They are walking along the straight road whi(...TRUNCATED)	{ "input": [ "5\n0 0\n2 0\n1 1\n2 2\n0 2", "4\n0 0\n3 1\n2 3\n0 3" ], "output": [ "0", "1" ] }	{ "input": [ "3\n1234567\n1268501\n1268499\n" ], "output": [ "788765312\n999997375\n999999350\n" ] }	{"input":["10 9\n2 5\n2 4\n2 7\n2 9\n2 3\n2 8\n2 6\n4 10\n2 1\n","10 10\n6 4\n9 2\n3 6\n6 7\n4 2\n9 (...TRUNCATED)	2	6	{"language":[2,3,2,2,2,2,2,2,2,2,2,2,2,4,2,2,3,4,2,2,2,2,2,2,2,2,2,2,2,4,2,4,4,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,1,2,2,3,2,2,2,2,2,2,3,3,2,2,2,2,0,2,2,2,1,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,3,0,2,2,2,2(...TRUNCATED)	691	E	0	1,900	[ "constructive algorithms", "greedy", "number theory" ]	false	{ "nanos": 500000000, "seconds": 2 }	256,000,000
p02548 AtCoder Beginner Contest 179 - A x B + C	"Fox Ciel is playing a game. In this game there is an infinite long tape with cells indexed by integ(...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": [], "output": [] }	{"input":["20 20\n1 9\n11 9\n3 5\n15 13\n1 20\n11 18\n10 6\n10 8\n10 19\n12 16\n10 3\n9 18\n8 7\n15 (...TRUNCATED)	6	11	{"language":[2,3,2,3,3,2,2,1,3,2,3,4,4,3,4,4,3,2,2,2,2,2,2,4,4,4,4,4,3,2,2,4,2,4,2,2,3,2,2,4,2,4,2,4(...TRUNCATED)	{ "language": [], "solution": [] }	0	A	0	2,100	[ "*special", "dfs and similar", "trees" ]	true	null	512,000,000