Datasets:

TheFactoryX
/

edition_1060_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
425_A. Sereja and Swaps	"Find the number of integers between 1 and N (inclusive) that contains exactly K non-zero digits whe(...TRUNCATED)	{"input":["3 3 1 10\n@#b\n.#.\n.#.\nb 100","3 3 1 20\n@C\n..\n...\nC 10","3 3 1 10\n@0.\n...\n...\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["xkbvkadjec gqjlhxpnsx 10\n2 7 1 0 0\n2 5 8 0 0\n4 7 8 0 4\n0 4 7 3 6\n5 5 9 3 7\n7 9 5 0 (...TRUNCATED)	6	9	{"language":[2,2,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,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,4,4,4,4,3,2,3,4,3,4,3,4,3,2,4,2,2,4,3,3,4,3,2,2,2,1,4,3,4,2,3,4,3,1,4,3,3,4,2(...TRUNCATED)	0	A	1,500	1,400	[ "" ]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
1391_C. Cyclic Permutations	"Greg has a pad. The pad's screen is an n × m rectangle, each cell can be either black or white. We(...TRUNCATED)	{"input":["2 0\n1 1 1 1\n","2 2\n0 1 2 3\n2 5\n0 4\n","1 0\n2 3\n"],"output":["1.0000000000\n","1.50(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3 2\n123 87 567\n1 2\n3 2\n","3 0\n4 1 8\n","3 2\n1 0 2\n3 2\n2 1\n","2 0\n1000000000 110(...TRUNCATED)	2	8	{"language":[2,2,4,1,1,2,4,1,4,2,2,2,2,4,2,2,2,2,3,1,4,2,4,2,1,4,2,2,2,1,1,2,2,2,1,4,1,4,4,2,1,4,2,4(...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)	0	A	0	1,700	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	268,435,456
1525_D. Armchairs	"Takahashi went to an all-you-can-eat buffet with N kinds of dishes and ate all of them (Dish 1, Dis(...TRUNCATED)	{ "input": [ "3\n1 2 10\n", "2\n1 2\n" ], "output": [ "0.0740740741", "0.0000000000" ] }	{"input":["1\n317 314 18260\n","1\n315 315 355287\n","1\n316 314 143218\n","1\n516 6 6571\n","1\n317(...TRUNCATED)	{"input":["qqqqqqqqqq qqqqqqqq\n3\nqqqqqqqq qqqqqqqqq\nqqqqqqqqq qqqqq\nqqqqq p\n","wwwww w\n8\nwwww(...TRUNCATED)	6	15	{"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":[4,2,2,2,4,4,1,2,4,2,2,4,2,2,4,3,2,3,2,4,2,2,4,2,3,4,1,2,2,4,4,2,2,2,2,4,2,4,2,2,2,2,4,4(...TRUNCATED)	846	E1	1,000	3,000	[]	false		null	0
p01086 Short Phrase	"You may know that Euclid was a mathematician. Well, as it turns out, Morpheus knew it too. So when (...TRUNCATED)	{ "input": [ "2\n2 9 17\n1 1\n\nSAMPLE" ], "output": [ "Yes\nNo\n" ] }	{"input":["? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ? + ?(...TRUNCATED)	{"input":["1 1 1000000000 1000000100\n100 1000000000\n1\n","1 1 10 18\n3 6\n5\n","4 13 400 600\n13 3(...TRUNCATED)	2	11	{"language":[2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,3,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(...TRUNCATED)	{"language":[4,3,2,4,4,3,4,2,2,4,3,2,4,2,2,2,2,4,4,4,2,4,2,4,3,3,4,4,2,4,4,2,2,4,2,2,4,4,2,2,3,3,4,2(...TRUNCATED)	39	F	0	2,700	[]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
79_D. Password	"In a simplified version of a \"Mini Metro\" game, there is only one subway line, and all the trains(...TRUNCATED)	{ "input": [ "6 6\n1 6\n1 4\n1 2 1\n2 3 1\n3 5 1\n2 4 3\n4 5 2\n5 6 1" ], "output": [ "2" ] }	{"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":["72\n111101100111001110000000100010100000111011100110001010111010101011111100\n","3\n001\n(...TRUNCATED)	5	13	{"language":[2,3,2,3,2,4,3,2,3,2,3,4,3,2,3,3,3,4,2,4,2,2,2,3,4,4,2,2,1,3,2,3,1,4,3,2,4,2,4,2,2,4,3,3(...TRUNCATED)	{ "language": [], "solution": [] }	1,227	B	500	2,300	[ "greedy", "math" ]	false	"JOI 君が住む都市にはN 個の駅があり，それぞれ1, 2, ..., N の番号が付けら(...TRUNCATED)	{ "nanos": 0, "seconds": 1 }	256,000,000
990_E. Post Lamps	"In Byteland, there are two political parties fighting for seats in the Parliament in the upcoming e(...TRUNCATED)	{"input":["4\nlu ru ld rd\n4\nlu ld lu ru\n1\nlu\n10\nru lu ld rd ru rd ru lu rd ld\n0"],"output":["(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["4\n4568\n4545992\n9265642\n1073637","4\n4568\n3988846\n9265642\n1073637","4\n9136\n398884(...TRUNCATED)	2	0	{"language":[2,4,4,2,3,4,4,4,4,2,2,3,4,3,3,3,3,3,4,2,2,4,3,3,4,3,2,3,4,2,3,3,2,3,3,4,3,3,2,2,3,4,3,2(...TRUNCATED)	{"language":[2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,0,2,2,2,2,2,3,2,2,4,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	560	D	0	0	[ "dfs and similar", "dsu", "graphs" ]	false		{ "nanos": 0, "seconds": 2 }	512,000,000
1144_B. Parity Alternated Deletions	"You are given a simple connected undirected graph G consisting of N vertices and M edges. The verti(...TRUNCATED)	{ "input": [ "1\n1\n", "6\n100011\n", "2\n10\n" ], "output": [ "1\n1\n", "2\n1 00011\n", "2\n1 0\n" ] }	{"input":["5\n12\n5 4 4 3 2 2 1 1 1 1 1 1\n4\n4 3 2 1\n1\n1000000\n20\n20 19 18 17 16 15 14 13 12 11(...TRUNCATED)	{"input":["1000 4 750160753\n","2 7 727733989\n","994 9 410957831\n","269 4 817408561\n","386 5 4292(...TRUNCATED)	5	0	{"language":[2,2,2,2,2,2,2,2],"solution":["#include <iostream>\n#include <iomanip>\n#include <comple(...TRUNCATED)	{"language":[2,2,4,4,4,4,2,3,3,3,3,3,3,3,3,2,3,2,4,3,1,4,2,2,2,3,2,4,4,2,3,3,4,2,2,3,1,3,2,4,4,4,3,2(...TRUNCATED)	0	E	0	2,200	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	1,073,741,824
963_B. Destruction of a Tree	"You are given a complete directed graph K_n with n vertices: each pair of vertices u ≠ v in K_n h(...TRUNCATED)	{ "input": [ "1\n", "4\n", "6\n", "2\n" ], "output": [ "1 1\n", "1 4\n", "2 3\n", "1 2\n" ] }	{"input":["6 4 2\n100010\n","4 2 1\n1000\n","8 5 2\n10000100\n","11 5 2\n11010000101\n","64 40 14\n1(...TRUNCATED)	{"input":["10 9 5\n0 0 0 0 0 0 0 -1 0 4\n10 3\n10 7\n10 5\n10 8\n10 9\n10 1\n10 4\n10 6\n10 2\n","10(...TRUNCATED)	2	9	{"language":[1,1],"solution":["def CheckIfProbablyPrime(x):\n return (2 << x - 2) % x\ndef primes(...TRUNCATED)	{"language":[2,4,4,3,2,2,2,2,3,4,4,4,4,2,2,4,3,4,2,3,4,2,2,4,1,2,2,1,2,4,4,3,2,3,2,4,4,2,4,2,1,4,1,2(...TRUNCATED)	0		0	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
battle-of-stalingrad-1	"Igor is a post-graduate student of chemistry faculty in Berland State University (BerSU). He needs (...TRUNCATED)	{ "input": [ "2\n2 999995\n", "3\n2 3 9\n" ], "output": [ "5\n", "8\n" ] }	{"input":["3 14\n8 9\n10 7\n","12 11\n11 12\n16 7\n","12 17\n10 19\n13 16\n","9 12\n3 17\n10 10\n","(...TRUNCATED)	{"input":["5 9 4\n4 1 46\n1 3 29\n3 2 58\n1 5 61\n2 4 175\n1 2 87\n4 5 58\n3 5 69\n3 4 28\n2 7\n5 7\(...TRUNCATED)	2	0	{"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		0	0	[ "data structures", "dfs and similar", "graphs", "greedy" ]	false	"Background\n\n会津大学付属幼稚園はプログラミングが大好きな子供が集まる(...TRUNCATED)	{ "nanos": 0, "seconds": 1 }	256,000,000
716_D. Complete The Graph	"You are given a matrix consisting of n rows and m columns. The matrix contains lowercase letters of(...TRUNCATED)	{"input":["99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3 3\n1 2 -10 23\n1 3 1 1\n2 3 -10 -1\n","10 9\n1 2 3 -5\n2 3 5 -7\n3 4 7 -9\n4 5 8 -11\n5(...TRUNCATED)	6	7	{"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,4,3,1,2,4,1,2,1,3,1,2,3,1,4,4,2,4,4,2,3,3,3,1,1,3,1,4,2,4,3,4,3,2,4,2,2,2,1,4,1,3,3,4(...TRUNCATED)	0		500	2,200	[ "dsu", "math" ]	false		{ "nanos": 0, "seconds": 2 }	1,073,741,824