Datasets:

TheFactoryX
/

edition_1393_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
p02117 Picnic	"Once upon a time, there was a king who loved beautiful costumes very much. The king had a special c(...TRUNCATED)	{"input":["18\naeiouyaaeeiioouuyy\n","22\niiiimpleeemeentatiioon\n","13\npobeeeedaaaaa\n","24\naaaoo(...TRUNCATED)	{"input":["6\nc armor 0 13 0 3\na weapon 23 0 0 3\nb weapon 20 0 0 4\ne orb 0 0 13 3\nd armor 0 15 0(...TRUNCATED)	{"input":["3 3\n1 2\n1 2\n1 3\n","5 3\n2 1\n5 4\n3 2\n","20 5\n3 12\n5 20\n16 4\n13 2\n9 14\n","3 2\(...TRUNCATED)	2	0	{"language":[3,2,3,1,2,3,3,3,4,4,2,3,1,2,3,1,3,1,1,3,4,3,4,2,3,2,4,3,3,1,2,3,3,2,3,1,3,1,2,4,3,3,4,3(...TRUNCATED)	{"language":[4,1,2,2,2,1,2,2,2,4,2,3,2,4,4,2,4,2,4,2,2,4,4,2,4,3,2,2,2,2,4,2,4,2,1,2,2,4,2,2,2,2,2,2(...TRUNCATED)	1,500	E	0	1,000	[ "dsu", "graphs", "trees" ]	false		null	512,000,000
1269_B. Modulo Equality	"In the town of Aalam-Aara (meaning the Light of the Earth), previously there was no crime, no crimi(...TRUNCATED)	{"input":["1 1 1\n\n0\n\n0\n\n1337\n\n0\n\n0\n\n0\n","1 1 1\n\n1337\n\n1337\n\n1337\n\n1337\n\n1337\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["8\n0 -1\n3 2\n6 2\n8 6\n6 5\n7 7\n0 4\n3 4\n8\n0 0\n5 3\n5 2\n4 1\n6 1\n8 6\n6 4\n2 4\n0"(...TRUNCATED)	5	12	{"language":[2,2,2,2,2],"solution":["\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define int (...TRUNCATED)	{"language":[2,2,2,2,2,3,2,2,4,4,4,2,4,4,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,506	D	0	0	[]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
p00860 The Morning after Halloween	"Problem Desrcription\nShil likes to play with trees a lot.He is playing with an undirected tree con(...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": [], "output": [] }	{"input":["1 36 0\n-1 -1 -1","0 30 0\n-1 -1 -1","0 32 0\n-1 -1 -1","1 16 0\n-1 -1 -1","0 36 0\n-1 -1(...TRUNCATED)	6	6	{"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,1,4,2,4,2,2,4,2,2,4,4,3,2,2,4,2,2,4,3,2,2,4,3,1,4,2,4,4,2,2,3,4,1,3,4,4,4,2,2,2,2,4,4(...TRUNCATED)	1,239	D	0	2,200	[ "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
p03225 Tenka1 Programmer Contest - Equilateral	"Snuke is conducting an optical experiment using mirrors and his new invention, the rifle of Mysteri(...TRUNCATED)	{ "input": [ "2\n3 1 1 5\n1 6 9\n3 2 6 7\n1 6 9" ], "output": [ "38\n36" ] }	{"input":["1\n1\n1\n1\n1\n1\n1\n","1\n3\n2 3 1\n1 2\n2 3\n1\n1\n1\n2\n","2\n6\n5 3 2 4 1 6\n1 2\n1 3(...TRUNCATED)	{"input":["ABM","BIB","1MI","MCA","MAC","M@C","C@M","@MC","?MC","M?C","C?M","CM?","DM?","?MD","@MD",(...TRUNCATED)	2	0	{"language":[2,2,2,2,2,4,2,2,2,2,1,4,4,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,4,3,4,2,4,4,4,4,4,2,1,4,2,4,2,2,2,4,2,2,2,4,1,4,2,4,4,1,4,2,2,2,1,2,2,2,3,4,4,3,3,2(...TRUNCATED)	526		0	800	[ "implementation" ]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
muffins3	"The bustling town of Siruseri has just one sports stadium. There\nare a number of schools, colleges(...TRUNCATED)	{"input":["4\nSSSSEEEECCCCEECCCC\nCCCCCSSSSEEECCCCSS\nSSSSSEEESSCCCCCCCS\nEESSSSCCCCCCSSEEEESAMPLE"](...TRUNCATED)	{"input":["25\n1 8\n8 8\n64 8\n512 8\n4096 8\n32768 8\n262144 8\n2097152 8\n16777216 8\n134217728 8\(...TRUNCATED)	{"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)	2	8	{"language":[2,4,3,2,3,2,2,3,2,3,4,3,2,3,3,2,2,2,2,2,2,4,2,4,3,4,3,2,2,2,2,2,2,3,3,3,3,3,2,3,2,3,4,3(...TRUNCATED)	{"language":[4,2,3,4,3,2,4,4,4,2,2,4,2,4,4,4,2,4,2,2,4,2,2,3,3,4,3,3,2,4,2,3,3,4,3,2,2,3,3,2,4,3,4,3(...TRUNCATED)	371	C	0	0	[ "constructive algorithms", "greedy", "number theory" ]	true		{ "nanos": 0, "seconds": 2 }	256,000,000
958_E2. Guard Duty (medium)	"There are n points on a coordinate axis OX. The i-th point is located at the integer point x_i and (...TRUNCATED)	{ "input": [ "3\nkek\npreceq\ncheburek\n", "4\nmail\nai\nlru\ncf\n" ], "output": [ "NO\n", "cfmailru\n" ] }	{ "input": [], "output": [] }	{"input":["10\n75 995991040 148627929 566366239 458028006 823890903 945174886 530827147 546010999 72(...TRUNCATED)	2	12	{"language":[1,3,3,3,2,4,4,3,4,3,2,4,2,3,3,4,3,2,4,1,3,3,4,4,4,4,3,2,2,1,3,1,3,1,4,1,3,3,2,3,4,3,4,1(...TRUNCATED)	{"language":[4,2,2,2,2,2,2,4,4,2,2,3,2,2,2,2,2,2,2,4,2,2,4,4,4,4,2,2,3,2,2,4,4,4,2,2,4,4,2,4,2,2,4,2(...TRUNCATED)	0	C	3,000	1,900	[ "brute force", "greedy" ]	false		{ "nanos": 0, "seconds": 1 }	0
1354_C2. Not So Simple Polygon Embedding	"Integer factorisation is hard. The RSA Factoring Challenge offered $100 000 for factoring RSA-1024,(...TRUNCATED)	{ "input": [ "5\n1 2 4 7 10" ], "output": [ "2 10" ] }	{ "input": [], "output": [] }	{"input":["2 2\n6 3\nMonday Tuesday Wednesday\n8 4\nThursday Friday Saturday Sunday\n2 2\n7 3\nMonda(...TRUNCATED)	2	6	{"language":[2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,1,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,2,2,2,1,2,2,2,2,2,2,4,2,2,4,2,4,3,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,0,4,2(...TRUNCATED)	0	D	0	2,700	[]	false		null	256,000,000
830_A. Office Keys	"E: Markup language has declined\n\nIt's been centuries since we humans have been declining slowly. (...TRUNCATED)	{"input":["2\n5\nTom Jones\nADAMS\nBOB ADAMS\nTom Jones\nSTEVE jONeS\n3\nTrudy\nTrudy\nTRUDY\n\nSAMP(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\nfdSgAe\nOut\nGet\n\nSAMPLE","3\nfdSgAe\ntuO\nFet\n\nSAMPLE","3\nBdSgfe\ntuO\nFet\n\nSA(...TRUNCATED)	2	6	{"language":[2,2,2,3,2,2,4,2,2,3,2,2,2,2,2,2,3,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,3,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2],"solution":["#include <bits/stdc++.h>\nint main() {\n std::priority_queue<std(...TRUNCATED)	0		0	0	[ "data structures", "greedy" ]	false		{ "nanos": 0, "seconds": 1 }	0
519_B. A and B and Compilation Errors	"Sherlock Holmes has decided to start a new academy to some of the young lads. He has conducted seve(...TRUNCATED)	{"input":["3\n0\n1\n2\n3\n4\n5\n","3\n10\n12\n-5\n8\n10\n12\n"],"output":["5.656854249\n","15.524174(...TRUNCATED)	{ "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,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":[2,0,2,2,0,0,2,2,0,2,0,0,0,0,2,2,2,0,0,0,0,2,2,2,2,2,0,0,2,2,0,0,0,2,0,4,0,0,0,0,2,2,0,0(...TRUNCATED)	147	E	0	0	[ "bitmasks", "constructive algorithms", "implementation", "interactive" ]	false		{ "nanos": 0, "seconds": 5 }	256,000,000
174_E. Ancient Berland Hieroglyphs	"Professor just has checked all the N students tests. Everything was fine but then he realised that(...TRUNCATED)	{ "input": [ "3 2 0 2\n0 1 3\n2 5\n" ], "output": [ "1\n" ] }	{"input":["66\n","652615\n","482331\n","336161\n","33\n","1000000\n","79531\n","768208\n","3\n","885(...TRUNCATED)	{"input":["3\n7089544 9134148 -5332724\n368810 1638695 13258988\n-3866235 -4257263 5802154\n","16\n-(...TRUNCATED)	2	14	{"language":[2,2,4,2,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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0		0	1,700	[ "constructive algorithms", "graphs" ]	false	"E - Disappear Drive / 消えるドライヴ\n\nStory\n\nDのひとはバスケットボールが好(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	256,000,000