Datasets:

TheFactoryX
/

edition_1029_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
893_D. Credit Card	"Allen and Bessie are playing a simple number game. They both know a function f: \\{0, 1\\}^n → R,(...TRUNCATED)	{ "input": [ "1\n2 3 Chandu\n\nSAMPLE" ], "output": [ "Daspal\n" ] }	{ "input": [], "output": [] }	{"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	0	{"language":[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,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[3,3,3,2,3,2,3,2,4,2,2,3,3,4,4,3,2,2,4,3,2,3,2,2,4,2,2,4,2,3,2,2,2,2,2,2,2,2,4,2,2,3,2,4(...TRUNCATED)	0	A	750	1,900	[ "constructive algorithms", "dfs and similar", "dp" ]	false	"E - Disappear Drive / 消えるドライヴ\n\nStory\n\nDのひとはバスケットボールが好(...TRUNCATED)	{ "nanos": 0, "seconds": 1 }	256,000,000
709_E. Centroids	"Ali is Hamed's little brother and tomorrow is his birthday. Hamed wants his brother to earn his gif(...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": [ "1\n3 3\n1 2\n2 3\n1 3" ], "output": [ "2\n" ] }	{"input":["202763616\n","1778707511\n","181182141\n","1438\n","55068349\n","324423196\n","339071627\(...TRUNCATED)	2	9	{"language":[2,4,3,2,2,3,2,2,4,4,4,2,2,2,2,2,2,4,2,2,3,2,2,4,2,1,2,4,2,2,2,2,2,2,2,2,4,2,2,2,2,3,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0	C	0	2,100	[ "data structures", "dp" ]	false	"D：素因数分解の多様性 (The Diversity of Prime Factorization)\n\nProblem\n\nEbi-chan has (...TRUNCATED)	{ "nanos": 0, "seconds": 8 }	256,000,000
789_A. Anastasia and pebbles	"Problem description.\nVipul is a hardworking super-hero who maintains the bracket ratio of all the (...TRUNCATED)	{ "input": [ "4 1 1 6\n3 2 3" ], "output": [ "1" ] }	{ "input": [], "output": [] }	{"input":["3 5 999999997\n","1011 1 1000000000\n","1 30 33\n","29 3 1000000000\n","3 2 31\n","2 2 85(...TRUNCATED)	5	8	{"language":[2,4,2,3,3,3,2,2,2,1,2,2,3,2,4,2,4,4,2,3,3,2,4,4,3,3,3,1,2,4,4,3,3,2,4,2,2,3,2,3,1,3,4,1(...TRUNCATED)	{"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)	875		2,000	0	[ "bitmasks", "dfs and similar", "dsu", "graphs", "greedy", "math", "sortings" ]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
343_B. Alternating Current	"Bosky is a very curious child who turned 13 yesterday. His parents gifted him a digital watch which(...TRUNCATED)	{"input":["1 1\n1\n1\n1\n2 1 100\n","4 6\n1 8 2 4\n3 3 6 1 5 2\n3\n1 1 1\n2 5 10\n1 1 6\n","1 1\n1\n(...TRUNCATED)	{"input":["5 3\n","1000 3\n","777 17\n","4 3\n","2 2\n","100 4\n","10 4\n","999 2\n","6 4\n","1 2\n"(...TRUNCATED)	{"input":["2\n0 0\n","3\n0 1 1\n","3\n0 0 1\n","3\n0 2 0\n","5\n0 0 1 1 10\n","5\n0 0 1 1 6\n","15\n(...TRUNCATED)	2	0	{"language":[3,3,4,4,2,3,4,3,4,2,2,3,2,3,4,4,4,4,4,4,2,2,1,2,2,2,2,2,2,2,2,2,3,2,4,2,2,3,4,2,3,3,2,4(...TRUNCATED)	{"language":[2,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,1,2,2,2,2,2,2(...TRUNCATED)	754	E	1,000	2,200	[ "" ]	false		{ "nanos": 0, "seconds": 6 }	256,000,000
339_A. Helpful Maths	"The King of a little Kingdom on a little island in the Pacific Ocean frequently has childish ideas.(...TRUNCATED)	{ "input": [ "2\n5\n5", "3\n1\n4\n3" ], "output": [ "5\n5", "4\n3\n4" ] }	{"input":["2 2 1\n0 1 1 1\n","5 5 20\n3 1 3 3\n1 2 2 2\n4 3 4 2\n3 2 2 2\n3 4 2 4\n4 1 4 5\n4 3 5 3\(...TRUNCATED)	{"input":["1\n3 3\n1 2\n3 3\n1 3","1\n2 3\n0 0\n2 -1\n0 1\n\nSANPLE","1\n3 3\n1 2\n2 3\n1 3\n\nELPMA(...TRUNCATED)	2	10	{"language":[2,2,4,2,2,2,2,2,2,2,2,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,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,374		500	1,800	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	1,073,741,824
903_D. Almost Difference	"problem\n\nYou are looking for a constellation in a picture of the starry sky. The photo always con(...TRUNCATED)	{"input":["7\nC is A’s father’s brother’s son’s aunt\nC is A’s mother’s brother’s son(...TRUNCATED)	{ "input": [ "5\n1 1 1 1 1\n", "5\n2 1 1 1 1\n" ], "output": [ "4\n", "2\n" ] }	{"input":["11\n7\n8\n9\n10\n11\n12\n13\n14\n27\n16\n17","11\n7\n8\n9\n10\n11\n22\n13\n2\n27\n8\n17",(...TRUNCATED)	2	0	{"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],"solut(...TRUNCATED)	{ "language": [], "solution": [] }	1,413		0	2,200	[ "dfs and similar", "graphs" ]	false		{ "nanos": 0, "seconds": 2 }	0
p02445 Swap	"Polycarp takes part in a math show. He is given n tasks, each consists of k subtasks, numbered 1 th(...TRUNCATED)	{ "input": [ "2\nSHILPA\nAAMIR\nMATT\nDENISE" ], "output": [ "ENEMIES\nLOVE" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	0	{"language":[2,3,2,4,3,3,3,1,3,2,3,3,3,3,2,3,3,3,3,2,2,3,3,1,4,3,3,2,3,2,2,3,3,3,3,3,4,4,3,3,4,3,2,3(...TRUNCATED)	{"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)	846	B	0	800	[ "flows", "shortest paths" ]	false		null	134,217,728
p02157 Shuffle 2	"Professor just has checked all the N students tests. Everything was fine but then he realised that(...TRUNCATED)	{"input":["14\nadd 1\nadd 7\nadd 2\nadd 5\nsum\nadd 6\nadd 8\nadd 9\nadd 3\nadd 4\nadd 10\nsum\ndel (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3 2\n1 2 5\n","3 10\n5 3 10\n","3 4\n0 2 5\n","1 100\n5\n","7 20\n2 15 12 11 20 19 12\n",(...TRUNCATED)	2	9	{"language":[2,2,2,2],"solution":["#include <iostream>\n#include <iomanip>\n#include <complex>\n#inc(...TRUNCATED)	{"language":[4,4,2,1,2,3,2,4,3,4,3,3,4,2,3,3,3,3,2,4,3,3,3,4,4,2,3,2,3,4,2,2,2,4,2,3,2,3,4,3,2,3,3,3(...TRUNCATED)	1,075	B	2,000	0	[ "implementation" ]	false		{ "nanos": 0, "seconds": 2 }	268,435,456
sherlock-and-kgb	"You are given N positive integers a_1, a_2, ..., a_N.\n\nFor a non-negative integer m, let f(m) = ((...TRUNCATED)	{ "input": [ "4\n2 10\n0 20\n1 5\n1 3\n", "3\n0 1\n0 10\n0 100\n" ], "output": [ "8", "111" ] }	{"input":["100\n95 54 23 27 51 58 94 34 29 95 53 53 8 5 64 32 17 62 14 37 26 95 27 85 94 37 85 72 88(...TRUNCATED)	{"input":["10 20 11\njsnr u eq qas gcj rnnf fpb c dz g\n","10 10 19\nlguv zi riht pf jtbo qmj qp nvh(...TRUNCATED)	2	0	{"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,525	F	0	0	[ "bitmasks", "brute force", "dp", "math" ]	false		{ "nanos": 0, "seconds": 2 }	0
151_C. Win or Freeze	"There are N integers a_1, a_2, ..., a_N not less than 1. The values of a_1, a_2, ..., a_N are not k(...TRUNCATED)	{ "input": [ "3\n32\n100\n9085\n\nSAMPLE" ], "output": [ "2^5\n2^25^2\n2^05^123^179^1" ] }	{"input":["2 2 5\n","9 9 1000000000\n","3 17 999999997\n","3 3 64\n","5 1 64\n","29 2 1000000000\n",(...TRUNCATED)	{"input":["1\n782058266\n","7\n1\n2\n4\n12\n12345\n15116544\n387420489\n","7\n1\n2\n4\n24\n12345\n23(...TRUNCATED)	2	0	{"language":[3,2,3,4,3,2,3,3,3,2,3,2,2,2,3,3,4,3,3,2,4,3,2,3,3,2,2,3,3,2,4,3,4,2,4,2,4,2,2,2,3,4,2,2(...TRUNCATED)	{"language":[2,2,4,2,2,2,2,2,2,2,4,2,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(...TRUNCATED)	1,354	F	1,750	2,500	[ "bitmasks", "dp" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000