Datasets:

TheFactoryX
/

edition_0732_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
7_B. Memory Manager	"Problem\n\nKND is a student programmer at the University of Aizu. There are N towns around his town(...TRUNCATED)	{ "input": [ "2\n2 6\n10 11" ], "output": [ "2\n1\n" ] }	{ "input": [], "output": [] }	{"input":["10 10\n4 5 6 7 8 11 14 15 17 19\n1 4 12 10 13 20 14 20 13 16\n-7 16\n1 1\n7 9\n1 4\n4 8\n(...TRUNCATED)	1	10	{"language":[3,3,3,3,3,3,3,3,4,3,3,3,3,3,3,2,3,4,3,3,3,3,3,3,3,3,3,2,3,3,3,3,2,3,3,3,3,3,3,3,2,3,4,3(...TRUNCATED)	{"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4(...TRUNCATED)	985		250	900	[ "data structures", "implementation", "math" ]	true	{ "nanos": 0, "seconds": 2 }	64,000,000
1202_C. You Are Given a WASD-string...	"Note that this is the first problem of the two similar problems. You can hack this problem only if (...TRUNCATED)	{ "input": [ "3\n25\n46\n99" ], "output": [ "2\n1\n2\n" ] }	{"input":["7 20\n4 6\n6 7\n4 5\n1 2\n2 4\n1 7\n3 5\n2 1\n6 2\n6 1\n7 3\n3 2\n3 6\n3 1\n3 4\n2 5\n1 6(...TRUNCATED)	{"input":["3\n((()))\n(())()\n()())","3\n((()()\n(())()\n()(()","3\n((()))\n(())))\n()())","3\n)))(((...TRUNCATED)	5	0	{"language":[1,1],"solution":["t = int(raw_input())\n\nd = {}\n\nfor i in range(t):\n\t\n\ts = raw_i(...TRUNCATED)	{"language":[4,2,2,2,4,2,4,2,2,2,3,4,1,1,3,4,1,4,2,3,4,4,1,2,4,4,4,3,4,1,4,2,4,2,2,2,3,4,4,2,1,2,3,1(...TRUNCATED)	0		0	2,200	[ "brute force", "implementation", "strings" ]	false	null	0
512_B. Fox And Jumping	"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\n" ], "output": [ "25\n" ] }	{"input":["5\n42\n17\n444\n7\n51\n"],"output":[" (...TRUNCATED)	{"input":["20 10 3\nebebccacdb\neeebccddeT\neadebecaac\nadeeeaccbc\nbaccccdaed\nabbaecbaed\ndadbecba(...TRUNCATED)	2	11	{"language":[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,4,2,4,4,2,2,2,2,4,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[1,2,4,1,4,3,2,2,3,4,2,4,2,1,1,3,4,3,4,4,2,3,1,3,4,3,3,4,4,2,3,2,4,1,4,2,3,3,1,4,2,2,4,2(...TRUNCATED)	0	A	0	0	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
1439_C. Greedy Shopping	"The blinds are known to consist of opaque horizontal stripes that can be rotated thus regulating th(...TRUNCATED)	{ "input": [ "56 25 31", "10 30 20", "30 30 100" ], "output": [ "Yes", "Yes", "No" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	10	{"language":[1,3,2,2,2,4,1,4,4,2,4,3,4,4,4,4,2,2,1,4,2,2,4,2,2,4,1,4,4,2,2,2,2,2,4,4,3,2,4,4,4,3,2,2(...TRUNCATED)	{"language":[2,2,3,2,2,2,2,2,4,4,4,2,4,2,4,2,2,3,2,2,2,2,2,2,4,4,2,3,2,2,4,2,2,2,2,2,2,3,2,4,4,2,2,4(...TRUNCATED)	1,512	B	1,000	1,300	[ "combinatorics", "dp" ]	false	{ "nanos": 0, "seconds": 2 }	1,073,741,824
405_E. Graph Cutting	"The nation of Panel holds an annual show called The Number Games, where each district in the nation(...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":["10 1\n1 1 1 1 1 1 1 1 1 1\n","3 57\n78 165 54\n","1 1\n10000\n","2 2\n2 2\n","9 13\n132 8(...TRUNCATED)	{"input":["10\n75 995991040 148627929 566366239 458028006 823890903 945174886 530827147 546010999 72(...TRUNCATED)	2	8	{"language":[2],"solution":["#include <algorithm>\n#include <cassert>\n#include <climits>\n#include (...TRUNCATED)	{"language":[3,2,2,4,3,2,4,3,4,4,4,2,2,3,3,3,2,4,3,2,4,4,2,3,3,2,3,4,4,2,2,3,3,3,3,4,4,4,4,4,4,4,2,3(...TRUNCATED)	0	E	0	2,400	[ "" ]	false	{ "nanos": 0, "seconds": 8 }	256,000,000
p03225 Tenka1 Programmer Contest - Equilateral	"A recently found Ancient Prophesy is believed to contain the exact Apocalypse date. The prophesy is(...TRUNCATED)	{"input":["5 8\n1 2 6 7 10\n1 1 1 1 2\n1 1\n1 5\n1 3\n3 5\n-3 5\n-1 10\n1 4\n2 5\n"],"output":["0\n1(...TRUNCATED)	{"input":["5 3\n","1500 2000\n","500 1000\n","1000 1000\n","5 5\n","2000 2\n","1000 500\n","3 1000\n(...TRUNCATED)	{ "input": [], "output": [] }	5	9	{"language":[2,3,3,2,3,3,3,3,3,4,4,4,3,3,1,3,4,4,4,4,3,1,3,4,2,4,3,4,3,3,1,1,4,3,2,4,3,2,4,3,3,3,3,3(...TRUNCATED)	{"language":[4,2,2,2,2,1,4,2,3,3,4,1,4,1,2,2,2,2,2,2,3,2,1,3,3,2,2,1,2,2,4,3,1,4,1,1,3,4,4,3,2,3,4,3(...TRUNCATED)	0	A	0	2,600	[ "dfs and similar", "graphs", "hashing", "shortest paths" ]	false	null	1,073,741,824
354_B. Game with Strings	"In the game Lizard Era: Beginning the protagonist will travel with three companions: Lynn, Meliana (...TRUNCATED)	{ "input": [ "3\n5\n7\n10\n\nSAMPLE" ], "output": [ "2\n3\n5\n" ] }	{"input":["1 10\n778084 -205153\n778001 -205093\n778155 -205118\n778168 -204997\n778066 -205141\n778(...TRUNCATED)	{"input":["3\n2\n4\n10","3\n2\n6\n12","3\n4\n6\n12","3\n4\n6\n19","3\n2\n4\n19","3\n2\n3\n12","3\n4\(...TRUNCATED)	2	9	{"language":[3,2,4,3,3,3,3,3,3,2,4,3,4,4,3,2,3,2,2,3,4,2,3,2,4,4,4,3,2,3,2,4,3,2,3,4,4,3,2,2,4,2,2,4(...TRUNCATED)	{"language":[2,2,2,2,2,3,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	793	C	2,500	2,300	[ "brute force", "constructive algorithms", "math" ]	false	{ "nanos": 0, "seconds": 1 }	0
1402_A. Fancy Fence	"Stepan likes to repeat vowel letters when he writes words. For example, instead of the word \"pobed(...TRUNCATED)	{ "input": [ "1\n\n7\n\n1\n\n1\n\n0\n\n0\n\n1\n" ], "output": [ "? 3\n? 6\n? 5\n? 7\n= 3\n" ] }	{"input":["777 2\n","2 2\n","99900 1\n","50000 1\n","2 5\n","100000 99\n","22222 22\n","100000 4\n",(...TRUNCATED)	{"input":["3\n1\n0 1\n0 -1\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1","3\n2\n0 1\n0 -1\n1 0\n2\n0 1\n(...TRUNCATED)	2	0	{"language":[1],"solution":["mod=10*9+7\nA=[[0 for i in range(105)] for j in range(105)]\nB=[0]105(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,0,0,2,2,0,2,2,4,2,2,4,0,0,2,2,0,2,2,0,0,2,2,2,2,2,2,2,0,2,2,2,2,2,0,2,2,2(...TRUNCATED)	0	D	0	0	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1470_E. Strange Permutation	"For a given polygon g, print \"1\" if g is a convex polygon, \"0\" otherwise. Here, in a convex pol(...TRUNCATED)	{"input":["6\n3\n60\n100\n1024\n23456\n8735373\n\nSAMPLE"],"output":["0\n14\n24\n253\n5861\n2183837\(...TRUNCATED)	{"input":["3\n230967221047542071272908186525868331398921682471308664253988778356539397562182960087 1(...TRUNCATED)	{"input":["2\n1 20\n","10\n450661 128600 993228 725823 293549 33490 843121 528432 556169 448234\n","(...TRUNCATED)	6	0	{"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":[2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,4,2,2,2,1,2,2,4,2,2,2,2,4,4,4,2,2,2,3,2,4,2(...TRUNCATED)	0	E	0	1,800	[ "brute force", "implementation" ]	false	{ "nanos": 0, "seconds": 1 }	0
1490_D. Permutation Transformation	"We have caught N sardines. The deliciousness and fragrantness of the i-th sardine is A_i and B_i, r(...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":["3 4\n1 1\n1 2\n1 3\n","1 100\n99 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22(...TRUNCATED)	{"input":["1 10\n700282491 332230980 954401907 59481241 188256336 995466811 463183048 725322957 8929(...TRUNCATED)	6	9	{"language":[1,1],"solution":["t=input()\nwhile t>0:\n\tb=[]\n\ta=raw_input().split()\n\tfor i in ra(...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)	0		0	2,200	[ "brute force", "math", "number theory" ]	true	{ "nanos": 0, "seconds": 2 }	134,217,728