Datasets:

TheFactoryX
/

edition_1659_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
lucky5	"There are n armchairs, numbered from 1 to n from left to right. Some armchairs are occupied by peop(...TRUNCATED)	{ "input": [ "3\n3 2 1\n", "3\n1 2 3\n", "3\n2 3 1\n" ], "output": [ "2 1\n", "0 0\n", "0 1\n" ] }	{ "input": [], "output": [] }	{"input":["2 2\n6 3\nMonday Tuesday Wednesday\n8 4\nThursday Friday Saturday Sunday\n2 2\n7 3\nMonda(...TRUNCATED)	2	7	{"language":[1],"solution":["T = int(raw_input())\nfor ti in xrange(T):\n\ta,b,c = map(int,raw_input(...TRUNCATED)	{"language":[4,4,4,2,3,2,2,2,3,3,4,3,4,2,2,3,4,4,2,2,2,2,2,3,2,3,3,4,4,2,3,2,3,2,3,2,4,4,4,4,2,4,2,2(...TRUNCATED)	920	C	0	0	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	1,073,741,824
p00822 Weather Forecast	"We have a tree with N vertices. The i-th edge connects Vertex A_i and B_i bidirectionally.\n\nTakah(...TRUNCATED)	{"input":["abc\ndefg\n","czaaab\nabcdef\n","aad\naac\n","abad\nbob\n"],"output":["-1\n","abczaa\n","(...TRUNCATED)	{"input":["7\n576460752303423487 2\n82 9\n101 104\n10 21\n31 10\n0 1\n10 30\n","1\n12881797281728299(...TRUNCATED)	{"input":["2 2 1\n1 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)	2	0	{"language":[1],"solution":["p=10**9+7;\n\ndef modpow(x,n):\n\tif(n==0):\n\t\treturn 1;\n\telif(n%2=(...TRUNCATED)	{ "language": [], "solution": [] }	0	C	0	800	[]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
977_B. Two-gram	"Today, Osama gave Fadi an integer X, and Fadi was wondering about the minimum possible value of max(...TRUNCATED)	{ "input": [ "5\n1 4 3 5 2", "9\n1 2 4 9 5 8 7 3 6", "2\n1 2", "2\n2 1" ], "output": [ "2", "3", "1", "0" ] }	{ "input": [], "output": [] }	{"input":["1\n3\nS10\n111\n00F\n","1\n5\nS0000\n10000\n00000\n00000\n0000F\n","1\n3\nS10\n110\n11F\n(...TRUNCATED)	2	7	{"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":[4,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,4,2,2,2,4,2,4,2,2(...TRUNCATED)	9		1,000	1,300	[ "*special", "implementation" ]	false	{ "nanos": 0, "seconds": 1 }	0
p03889 CODE FESTIVAL 2016 Relay (Parallel) - Mirror String	"Xenia the beginner mathematician is a third year student at elementary school. She is now learning (...TRUNCATED)	{ "input": [ "2\n2 999995\n", "3\n2 3 9\n" ], "output": [ "5\n", "8\n" ] }	{"input":["15\ntxxtxttxxttxtxx\n","3\nmyw\n","127\nxixtxixnxixtxixlxixtxixnxixtxixoxixtxixnxixtxixlx(...TRUNCATED)	{ "input": [], "output": [] }	1	13	{"language":[2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,4,2,2,2,1,4,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,4,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,4,2,2,4,2,2,4(...TRUNCATED)	0	D2	500	1,900	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
walk	"Anastasia loves going for a walk in Central Uzhlyandian Park. But she became uninterested in simple(...TRUNCATED)	{"input":["5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\(...TRUNCATED)	{"input":["3 8\n2 4 4 4\n7 2 5 2\n6 5 6 3\n20\n3 2 U 1000000\n3 2 U 1\n3 2 U 2\n3 2 U 3\n3 2 U 4\n3 (...TRUNCATED)	{"input":["1 1\n5\n2 1 7\n","10 6\n10 10 10 6 6 5 5 5 3 1\n2 3 50\n2 4 10\n1 3 10\n2 2 36\n1 4 7\n2 (...TRUNCATED)	2	9	{"language":[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,4,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,4,2,1,4,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,4,2,3,2,2,1,2,4,2,2,2,2,2,4,2,2,1(...TRUNCATED)	990		2,500	0	[ "dp", "math", "number theory" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
mind-palaces-3	"You are given a permutation p_1, p_2, …, p_n.\n\nIn one move you can swap two adjacent values.\n\(...TRUNCATED)	{ "input": [ "4\n62 96 82 55\n\nSAMPLE" ], "output": [ "3 1 2 4\n" ] }	{"input":["4\n39 20\n183 11\n551 27\n85 16","8\n4 65\n5 12\n7 24\n9 38\n12 24\n14 10\n65 75\n31 26"](...TRUNCATED)	{"input":["1","0010","11011010001001","11001010001001","11001000001001","1010","01001000101000","110(...TRUNCATED)	2	0	{"language":[2,2,4,2,2,2,2,2,2,2,2,2,2,4,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(...TRUNCATED)	{"language":[2,4,2,2,2,2,2,2,2,2,1,2,2,3,1,2,2,2,4,4,2,2,1,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2(...TRUNCATED)	343	B	1,500	1,900	[ "brute force", "implementation", "sortings" ]	false	null	256,000,000
551_B. ZgukistringZ	"In a mystical TimeLand, a person's health and wealth is measured in terms of time(seconds) left. \n(...TRUNCATED)	{"input":["5 10\n-5 0 10 -11 0\n","5 10\n-1 5 0 -5 3\n","3 4\n-10 0 20\n"],"output":["2\n","0\n","-1(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["500 000 1000","31 123 143","19 123 141","50 100 127","500 101 1000","55 123 143","1 123 1(...TRUNCATED)	5	0	{"language":[2,2,2,4,2,4,2,4,4,4,4,2,4,2,4,2,4,3,2,2,2,4,2,2,2,2,1,4,4,4,4,2,2,2,2,4,4,2,4,4,2,4,2,3(...TRUNCATED)	{"language":[2,2,3,0,3,2,0,3,0,2,2,3,2,3,2,2,0,2,0,3,0,3,3,2,3,2,2,0,2,2,3,3,2,2,2,3,3,3,2,2,4,3,4,2(...TRUNCATED)	737		0	1,100	[ "brute force", "implementation" ]	false	null	256,000,000
1149_B. Three Religions	"The russian intelligence agency KGB make an encryption technique to send their passwords. Originall(...TRUNCATED)	{"input":["7 5\n1 2\n2 7\n7 6\n2 3\n3 4\n","2 1\n1 2\n","7 6\n1 2\n2 7\n7 6\n2 3\n3 4\n1 5\n"],"outp(...TRUNCATED)	{ "input": [ "1\n3 3\n1 2\n2 3\n1 3" ], "output": [ "2\n" ] }	{"input":["6\nc armor 0 13 0 3\na weapon 23 0 0 3\nb weapon 20 0 0 4\ne orb 0 0 13 3\nd armor 0 15 0(...TRUNCATED)	2	0	{"language":[1,1],"solution":["import sys\ndef numberToBase(n, b):\n temp=''\n while n:\n (...TRUNCATED)	{"language":[2,2,4,3,4,2,4,4,4,4,4,2,1,4,2,4,2,2,2,4,2,2,2,4,1,4,2,4,4,1,4,2,2,2,1,2,2,2,3,4,4,3,3,2(...TRUNCATED)	348	C	0	1,400	[ "bitmasks", "dp", "games" ]	false	null	134,217,728
p01219 Private Teacher	"Polycarp was dismantling his attic and found an old floppy drive on it. A round disc was inserted i(...TRUNCATED)	{"input":["5\n0 0\n0 2\n2 0\n2 2\n1 1\n","9\n0 0\n1 1\n2 2\n0 1\n1 0\n0 2\n2 0\n1 2\n2 1\n"],"output(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["2\n11 3\n2 3 4\n6 3\n3 2 1","2\n22 3\n2 0 3\n4 3\n3 2 1","2\n22 3\n0 0 3\n4 3\n3 2 1","2\(...TRUNCATED)	6	11	{"language":[1],"solution":["while True: \n try:\n s = raw_input()\n except: (...TRUNCATED)	{"language":[3,2,2,4,1,2,2,2,2,4,4,2,2,2,4,4,2,3,2,1,2,2,2,4,4,2,4,2,2,1,2,2,2,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED)	0	D	0	1,000	[ "binary search", "greedy", "sortings" ]	false	{ "nanos": 0, "seconds": 1 }	0
p02610 AIsing Programming Contest 2020 - Camel Train	"You are given a table consisting of n rows and m columns. Each cell of the table contains either 0 (...TRUNCATED)	{ "input": [ "3\n1 2 4\n", "3\n5 3 1\n" ], "output": [ "3", "1" ] }	{ "input": [], "output": [] }	{"input":["4\nRBRR","4\nBBRR","4\nRRCR","4\nRRAR","4\nRARR","4\nBQBR","4\nRCRR","4\nBPBR","4\nRRRC",(...TRUNCATED)	2	0	{"language":[3,4,3,2,2,3,3,1,3,4,2,4,1,3,3,1,1,3,3,2,1,3,2,4,2,3,3,1,3,2,2,2,3,3,1,2,3,4,4,4,3,4,3,3(...TRUNCATED)	{"language":[2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,4,4,1,1,2,4,2,1,2,4,2,2,2,4,2,4,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	A	0	1,600	[ "*special" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000