Datasets:

TheFactoryX
/

edition_1000_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
p00127 Pocket Pager Input	"The court wizard Zigzag wants to become a famous mathematician. For that, he needs his own theorem,(...TRUNCATED)	{"input":["o.x.\no...\n.x..\nooxx\n","x.ox\nox..\nx.o.\noo.x\n","xx..\n.oo.\nx...\noox.\n","x..x\n..(...TRUNCATED)	{"input":["1 10\n700282491 332230980 954401907 59481241 188256336 995466811 463183048 725322957 8929(...TRUNCATED)	{"input":["11\n1 2 3 4 5 6 7 8 9 10 11\n2\n1 4 7","11\n1 2 3 4 5 6 2 8 9 10 11\n2\n1 4 1","11\n1 2 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,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2],"solutio(...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)	0		2,000	1,100	[ "binary search", "data structures", "greedy", "implementation" ]	false	{ "nanos": 0, "seconds": 3 }	0
professor-sharma	"Hackers! Hackers! Everywhere!\nSome days back your email ID was hacked. Some one read the personal (...TRUNCATED)	{"input":["5 10\n50 40 30 20 10\n10\n20\n30\n40\n50\n60\n70\n80\n90\n100\n\nSAMPLE"],"output":["YES\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["2 2\n6 3\nMonday Tuesday Wednesday\n8 4\nThursday Friday Saturday Sunday\n2 2\n7 3\nMonda(...TRUNCATED)	2	11	{"language":[4,3,2,2,2,2,2,4,2,2,2,2,2,4,4,2,4,2,2,2,2,2,2,2,2,1,4,4,4,2,4,2,3,4,2,2,4,4,4,2,3,4,4,2(...TRUNCATED)	{"language":[3,4,2,4,2,3,3,3,3,2,2,3,3,3,3,3,3,3,3,2,2,3,3,3,3,3,1,3,1,1,2,2,3,2,3,1,2,2,4,3,3,3,3,3(...TRUNCATED)	621	A	250	2,300	[]	false	{ "nanos": 0, "seconds": 10 }	256,000,000
7_B. Memory Manager	"Hasan loves playing games and has recently discovered a game called TopScore. In this soccer-like g(...TRUNCATED)	{ "input": [ "5\n4 8\n8 8\n9 4\n4 0\n0 4\n", "5\n4 8\n5 8\n5 4\n7 4\n2 2\n" ], "output": [ "5\n", "0\n" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	6	8	{"language":[2,4,2,2,2,2,2,4,4,2,2,4,2,2,2,3,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	730		0	1,600	[ "math" ]	false	{ "nanos": 0, "seconds": 2 }	0
roy-and-wobbly-numbers	"This is the easy version of the problem. The only difference is that in this version q = 1. You can(...TRUNCATED)	{ "input": [ "-++-\n", "++\n", "+-\n", "-\n" ], "output": [ "YES\n", "YES\n", "NO\n", "NO\n" ] }	{"input":["9 530792195 6\n","0 0 10\n","1944219055 454183506 1369298327\n","914835 2742837 9234739\n(...TRUNCATED)	{"input":["2\n0 1\n","5\n0 0 1 0 1\n","100\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 (...TRUNCATED)	2	0	{"language":[4,4,4,4,4,4,4,3,3,2,4,4,4,3,3,4,2,2,4,3,3,3,4,3,1,2,2,3,1,2,4,1,1,4,2,2,4,1,3,3,4,4,4,3(...TRUNCATED)	{ "language": [], "solution": [] }	1,012	A	0	2,600	[]	false	{ "nanos": 0, "seconds": 1 }	0
228_D. Zigzag	"We are definitely not going to bother you with another generic story when Alice finds about an arra(...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":["10 23\n6 9 8 10 4 3 7 1 5 2\n7 2\n3 2\n2 4\n2 3\n7 5\n6 4\n10 7\n7 1\n6 8\n6 2\n8 10\n3 5(...TRUNCATED)	{"input":["5\nAJMP\naB33d\nE\n86AE\nAM\n6\nJPEM\nWaEaETC302Q\nCP\nrTurnAGundam1isdefferentf","5\nAJM(...TRUNCATED)	2	7	{"language":[4,2,2,2,4,2,2,4,2,3,4,3,2,4,2,2,2,3,4,4,2,2,2,3,4,4,4,2,3,1,4,4,2,2,2,4,2,3,4,2,2,2,3,2(...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)	1,277	A	0	1,000	[ "dfs and similar" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
820_D. Mister B and PR Shifts	"The time has arrived when the world is going to end. But don't worry, because the new world yuga wi(...TRUNCATED)	{"input":["5 3\n1 2 3 4 0\n4 1 2 14 3\n","7 3\n1 2 3 4 3 2 6\n6 3 1 4 2 2 3\n","4 4\n0 1 2 3\n0 1 2 (...TRUNCATED)	{ "input": [ "1\n1\n1\n1\n1 1 1 1\n" ], "output": [ "1\n" ] }	{ "input": [], "output": [] }	2	7	{"language":[2,3,2,2,2,2,4,3,3,3,3,2,2,2,2,2,3,2,2,2,3,2,2,2,2,3,1,3,3,3,2,4,3,2,4,3,4,2,2,3,2,2,2,2(...TRUNCATED)	{"language":[2,4,4,3,4,2,3,2,2,4,4,1,2,1,2,4,3,4,3,3,4,3,1,3,2,4,2,3,3,3,3,2,4,3,2,3,3,4,2,2,3,4,4,2(...TRUNCATED)	0	C	1,000	0	[ "implementation" ]	false	null	0
1320_F. Blocks and Sensors	"Problem Description\n\nGiven a list of integers, find and display all even numbers from the end of (...TRUNCATED)	{"input":["3 3 10\n2 4 10\n3 3 9\n4 2 8\n","4 10 5\n1 1 1\n1 0 1\n0 5 8\n2 7 100\n"],"output":["2\n"(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3 10 10\n1\n1 1 1\n1\n3 3 3\n1\n5 5 5\n0 1 1\n1 0 0\n0 1 0","1 10 3\n3\n1 10 1\n2 20 2\n3(...TRUNCATED)	2	7	{"language":[2,2,2,2,2,2,2,2,2,4,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,4,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,4,2,0,2,2,4,2,2,2,2,2,4,2,2,2,2,0,2,2,2],"solution":["#include <bits/(...TRUNCATED)	0	D	0	2,500	[ "*special", "strings" ]	false	{ "nanos": 0, "seconds": 1 }	512,000,000
stadium	"You have a string s of length n consisting of only characters > and <. You may do some operations w(...TRUNCATED)	{ "input": [ "3 1 8 10\n10 8\n5 7\n11 9\n3\n", "2 2 10 18\n10 4\n20 6\n5 3\n" ], "output": [ "10\n", "20\n" ] }	{"input":["8\nFF\nFF\n00\n00\nFF\nFF\n00\n00\n","4\n0\n0\n0\n1\n","8\n33\n33\n33\n33\n33\n33\n11\n11(...TRUNCATED)	{"input":["384\n87 78 16 94 36 87 93 50 22 63 28 91 60 64 27 41 27 73 37 12 69 68 30 83 31 63 24 68 (...TRUNCATED)	2	0	{"language":[2,4,4,2,4,2,4,2,4,4,2,2,4,4,2,2,3,4,4,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	914	A	0	0	[ "brute force", "geometry", "math" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
295_D. Greg and Caves	"Alice had a permutation p_1, p_2, …, p_n. Unfortunately, the permutation looked very boring, so s(...TRUNCATED)	{ "input": [ "3\nkek\npreceq\ncheburek\n", "4\nmail\nai\nlru\ncf\n" ], "output": [ "NO\n", "cfmailru\n" ] }	{ "input": [], "output": [] }	{"input":["5\n2 8 1 7 9\n","4\n6 2 4 5\n","3\n3 1 3\n","200\n2 1 1 1 2 1 2 1 1 1 2 1 2 2 2 1 1 2 1 2(...TRUNCATED)	2	10	{"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,2,2,2,2,2,2,2,2,2,2,2,4,4,4,2,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,2,2(...TRUNCATED)	1,007		0	0	[ "dfs and similar", "dsu", "math" ]	false	{ "nanos": 0, "seconds": 2 }	0
371_B. Fox Dividing Cheese	"You are given a square with 'n' points on each side of the square. None of these points co-incide w(...TRUNCATED)	{ "input": [ "4\n6 6 5 5\n", "5\n1 2 3 1 3\n", "4\n6 6 4 4\n" ], "output": [ "0", "4", "-8" ] }	{ "input": [ "5\n1 1 1 1 1\n", "5\n2 1 1 1 1\n" ], "output": [ "4\n", "2\n" ] }	{ "input": [], "output": [] }	2	0	{"language":[2,2,2,4,4,2,2,2,2,2,4,2,2,2,4,2,4,2,4,4,2,4,2,4,2,2,4,2,2,2,4,2,2,4,4,4,2,4,2,4,4,1,4,4(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,3,2,2,1,4,2,2,2,2,2,2,2,2,3,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,1,2,4,2,2,2(...TRUNCATED)	691	F	2,000	0	[ "" ]	false	null	256,000,000