Datasets:

TheFactoryX
/

edition_0478_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
roys-life-cycle	"Problem Statement\n\nWe found a dictionary of the Ancient Civilization Mayo (ACM) during excavation(...TRUNCATED)	{"input":["10\n10\n3 7\n1 4\n1 6\n5 5\n1 1\n3 9\n7 8\n1 2\n3 3\n7 10\n10\n2 4\n1 7\n3 4\n3 5\n2 8\n2(...TRUNCATED)	{"input":["1 0\n23333\n","3 3\n1 1 1\n1 2\n2 3\n3 1\n","5 4\n1 2 2 2 2\n1 2\n1 3\n1 4\n1 5\n","10 30(...TRUNCATED)	{ "input": [], "output": [] }	2	11	{"language":[3,3,4,2,3,3,3,3,3,2,3,4,3,3,4,3,4,3,3,3,3,3,3,3,3,4,3,3,3,4,3,1,2,4,2,3,4,3,3,3,3,3,3,3(...TRUNCATED)	{"language":[2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,4,3,2,2,2,2,2,2,3,2,2,2(...TRUNCATED)	1,136	N	0	0	[ "graphs" ]	false		{ "nanos": 500000000, "seconds": 1 }	256,000,000
chsparr	"BCPC stands for Byteforces Collegiate Programming Contest, and is the most famous competition in By(...TRUNCATED)	{"input":["100\n5\n48 141 231 314 425\n7\n0 19\n50 98\n143 30\n231 55\n342 0\n365 100\n600 10","180\(...TRUNCATED)	{ "input": [], "output": [] }	{"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	11	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2],"solution":["#include <iostream>\n#inc(...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		0	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1081_D. Maximum Distance	"The nation of Panel holds an annual show called The Number Games, where each district in the nation(...TRUNCATED)	{"input":["6\n1 4 3 3 5 7\n3 7 5 4 3\n4 3 7 5\n","5\n1 5 8 123 7\n123 7 5 1\n5 1 7\n"],"output":["1\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["6 6\n1 6\n1 4\n1 2 1\n2 3 1\n2 5 1\n2 4 3\n4 5 2\n5 6 1","11 6\n1 6\n1 4\n1 2 1\n4 3 1\n2(...TRUNCATED)	6	9	{"language":[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,2,2,2,4,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,4,4,4,3,2,4,4,4,3,2,2,2,4,4,3,3,3,2,2,4,4,4,2,3,3,2,2,2,4,2,3,3,3,2,4,4,3,3,4,4,2,2(...TRUNCATED)	0	C	0	0	[]	false	"E: マークアップ言語は衰退しました\n\nわたしたち人類がゆるやかな衰退(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	256,000,000
415_E. Mashmokh and Reverse Operation	"You are given a square matrix of size n (it will be an odd integer). Rows are\nindexed 0 to n-1 fro(...TRUNCATED)	{ "input": [ "3\n1 2 4\n", "3\n5 3 1\n" ], "output": [ "3", "1" ] }	{"input":["143165576\n","1919020031\n","1204252996\n","210637432\n","724264821\n","1741\n","61948959(...TRUNCATED)	{"input":["5 4","7 4","6 1","9 4","6 3","14 4","8 1","28 4","15 2","28 3","19 2","32 2","29 5","26 3(...TRUNCATED)	2	7	{"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": [], "solution": [] }	331	B	1,750	2,100	[ "implementation" ]	false		{ "nanos": 0, "seconds": 2 }	1,073,741,824
1490_G. Old Floppy Drive	"Polycarp was dismantling his attic and found an old floppy drive on it. A round disc was inserted i(...TRUNCATED)	{"input":["3 3\n1 2\n2 3\n3 3","7 9\n1 7\n5 9\n5 7\n5 9\n1 1\n6 8\n3 4"],"output":["3\n2\n2","7\n6\n(...TRUNCATED)	{"input":["1\n10 2 20\n8 5 2 4 10 3 9 7 1 6\n5 10\n3 17\n6 31\n3 46\n10 42\n7 19\n9 36\n7 3\n3 13\n8(...TRUNCATED)	{"input":["6\n0 1 3 2 2 2\n","4\n0 2 1 1\n","4\n3 1 1 0\n","4\n1 2 1 0\n","6\n0 0 0 2 1 1\n","4\n1 1(...TRUNCATED)	2	2	{"language":[2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,3,2,4,2,2,2,4,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	626	B	0	0	[ "math", "number theory" ]	false		{ "nanos": 0, "seconds": 1 }	0
p00320 Cuboid	"Utkarsh is forced to play yet another one of Ashish's games. The game progresses turn by turn and a(...TRUNCATED)	{ "input": [ "5 5\n1 2 3 4 5\n", "3 1\n1 1 2\n", "5 2\n1 1 2 1 3\n" ], "output": [ "16", "3", "14" ] }	{"input":["4\n10 4\n15 1\n19 3\n20 1\n","2\n1 999999999\n1000000000 1000000000\n","67\n1 1\n3 8\n4 1(...TRUNCATED)	{"input":["3\n6 5 15","3\n4 4 2","3\n4 3 1","3\n4 4 5","3\n4 8 2","3\n8 8 2","3\n4 4 1","3\n4 4 4","(...TRUNCATED)	6	10	{"language":[2,2,3,2,4,4,2,2,1,4,2,2,4,2,4,4,3,3,3,3,4,3,1,4,4,1,3,2,4,4,4,3,3,2,3,2,3,2,3,3,3,3,4,4(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,0,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)	442		0	1,100	[ "implementation" ]	false	"D：素因数分解の多様性 (The Diversity of Prime Factorization)\n\nProblem\n\nEbi-chan has (...TRUNCATED)	{ "nanos": 0, "seconds": 1 }	0
805_A. Fake NP	"Nadeko's birthday is approaching! As she decorated the room for the party, a long garland of Dianth(...TRUNCATED)	{"input":["2 2\n6 3\nMonday Tuesday Wednesday\n8 4\nThursday Friday Saturday Sunday\n2 2\n7 3\nMonda(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	0	{"language":[2,2,4,2,2,3,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,4,4,2,2,4,2,2,2,2,2,4,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,4,4,1,3,4,4,4,2,2,2,4,2,3,4,4,4,2,1,3,4,4,2,2,2,4,2,4,4,3,2,4,2,1,3,3,1,4,3,4,2,3,2,2(...TRUNCATED)	0	E	500	1,700	[]	false		{ "nanos": 0, "seconds": 3 }	0
1081_G. Mergesort Strikes Back	"In the intergalactic empire Bubbledom there are N planets, of which some pairs are directly connect(...TRUNCATED)	{"input":["12\n161735902 211047202 430302156 450968417 628894325 707723857 731963982 822804784 88089(...TRUNCATED)	{ "input": [], "output": [] }	{ "input": [], "output": [] }	3	10	{"language":[2],"solution":["#include <bits/stdc++.h>\n#define INF 1000000007\nusing namespace std;\(...TRUNCATED)	{"language":[2,3,2,2,2,1,1,3,1,3,2,4,3,4,4,2,3,2,3,2,3,3,1,2,3,2,2,2,4,4,3,4,1,4,3,4,3,3,3,4,2,3,3,2(...TRUNCATED)	545	F	500	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	0
1369_D. TediousLee	"The King of a little Kingdom on a little island in the Pacific Ocean frequently has childish ideas.(...TRUNCATED)	{"input":["1\n1 1 1 1\n10000 10000 10000 10000","2\n10 3 1 2\n2 4 1 3\n2 2 1 1"],"output":["-1","4"](...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\n7089544 9134148 -5332724\n368810 1638695 13258988\n-3866235 -4257263 5802154\n","16\n-(...TRUNCATED)	2	6	{"language":[2,2,2,2,2],"solution":["#include<cmath>\n#include<cstdio>\n#include<vector>\n\n#define (...TRUNCATED)	{ "language": [], "solution": [] }	0	E	0	0	[ "binary search", "brute force", "chinese remainder theorem", "math", "number theory" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
512_B. Fox And Jumping	"Allen and Bessie are playing a simple number game. They both know a function f: \\{0, 1\\}^n → R,(...TRUNCATED)	{ "input": [ "3 4\n0110\n1010\n0111\n" ], "output": [ "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":["4 3\n1 3 2 7","4 4\n1 3 2 4","4 4\n1 0 2 4","4 3\n1 3 2 8","2 4\n1 3 2 4","4 4\n1 -1 2 4"(...TRUNCATED)	2	11	{"language":[2,4,2,4,2,2],"solution":["#include <cstdio>\n#include <iostream>\n#include <sstream>\n#(...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],"solution":["#include <bits/stdc++.h(...TRUNCATED)	0	F	0	2,500	[ "brute force", "greedy", "math" ]	false		{ "nanos": 0, "seconds": 2 }	134,217,728