Datasets:

TheFactoryX
/

edition_1185_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
990_E. Post Lamps	"In computer science, there is a method called \"Divide And Conquer By Node\" to solve some hard pro(...TRUNCATED)	{ "input": [ "2\nSHILPA\nAAMIR\nMATT\nDENISE" ], "output": [ "ENEMIES\nLOVE" ] }	{"input":["1\n2\n110 2\n115 112\n","10\n5\n88 60\n10 3\n48 21\n90 70\n40 88\n5\n20 81\n39 98\n34 87\(...TRUNCATED)	{"input":["4\n39 18\n183 11\n551 27\n85 16","8\n4 65\n5 12\n7 21\n9 38\n12 24\n14 10\n65 75\n31 26",(...TRUNCATED)	6	7	{"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": [], "solution": [] }	1,369		0	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1500_B. Two chandeliers	"Two coordinates (a1, a2) and (b1, b2) on a two-dimensional grid of r × c are given. The cost of mo(...TRUNCATED)	{ "input": [ "0 1 1 1 1 0\n", "1 1 0 0 1000 1000\n" ], "output": [ "Yes\n", "No\n" ] }	{ "input": [ "2\nacxz\nbcxz" ], "output": [ "Funny\nNot Funny\n" ] }	{"input":["12\n161735902 211047202 430302156 450968417 628894325 707723857 731963982 822804784 88089(...TRUNCATED)	1	2	{"language":[1,1,1,1,1,1,1,1,1,1,1],"solution":["def gcd(x,y):\n if y==0: return x\n else: ret(...TRUNCATED)	{"language":[2,2,3,2,2,4,4,2,2,2,4,2,2,2,2,2,3,2,2,2,4,3,3,3,2,3,3,2,3,4,2,3,2,2,2,2,4,4,3,2,2,3,2,2(...TRUNCATED)	455	D	0	900	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
discover-the-monk	"You are given a positive integer m and two integer sequence: a=[a_1, a_2, …, a_n] and b=[b_1, b_2(...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":["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":["4 1\n7 6 1 2\n3\n3\n2 1 9\n2 1 10\n2 1 6\n","3 5\n3 2 8\n1 2 8 1 1\n4\n2 3 3\n1 2 2\n2 2 (...TRUNCATED)	6	0	{"language":[2,2,4,2,4,3,4,4,3,4,4,2,2,4,2,2,4,3,4,3,4,4,2,4,4,2,2,4,4,3,2,3,2,4,2,4,1,2,3,3,4,3,4,2(...TRUNCATED)	{"language":[2,4,2,2,2,2,2,2,2,2,3,0,2,3,2,2,0,2,2,3,0,2,2,2,2,3,3,2,3,4,3,3,2,3,2,0,2,2,2,0,3,4,0,2(...TRUNCATED)	915	G	0	3,400	[ "implementation", "strings" ]	false		{ "nanos": 0, "seconds": 8 }	256,000,000
101_C. Vectors	"This is the hard version of the problem. The difference between the versions is in the constraints (...TRUNCATED)	{ "input": [ "5 3\n5 5 7 3 1\n", "4 2\n1 2 3 4\n", "2 3\n1 2\n" ], "output": [ "15\n", "8\n", "0\n" ] }	{"input":["10\n5 7 0\n2 10 1\n1 5 0\n6 8 0\n4 9 1\n2 5 1\n10 8 0\n2 3 1\n4 2 1\n10\n9\n9\n9\n5\n2\n5(...TRUNCATED)	{"input":["2 2\n6 3\nMonday Tuesday Wednesday\n8 4\nThursday Friday Saturday Sunday\n2 2\n7 3\nMonda(...TRUNCATED)	5	7	{"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,2,2,4,4,1,2,3,3,1,1,2,2,3,4,2,3,3,3,2,2,1,2,3,4,4,4,2,2,4,1,2,4,3,1,1,3,3,4,1,1,2,3,3(...TRUNCATED)	530	B	2,000	0	[ "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
p00914 Equal Sum Sets	"Employees of JebTrains are on their way to celebrate the 256-th day of the year! There are n employ(...TRUNCATED)	{"input":["3 3\n1 3\n2 3\n3 3\n","3 1\n1 1\n2 2\n3 3\n","7 3\n1 7\n3 8\n4 5\n6 7\n1 3\n5 10\n8 9\n",(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["6\nbabddc\n","7\nbd`dccd\n","2\nab\n","7\nxxyzyyy\n","6\naagcfb\n","7\nbbbcdbc\n","4\npbr(...TRUNCATED)	2	11	{"language":[4,2,4,2,2,2,3,2,1,2,2,2,4,2,2,2,4,2,2,2,2,2,4,2,2,2,3,2,4,4,2,4,2,2,2,2,4,4,4,4,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,4,4,4,3,2,2,3,2,4,4,2,3,4,4,2,4,4,2,2,2,2,2,4,2,2,4,4,4,2,4,2,2,4,4,2,2,2,2,2(...TRUNCATED)	1,091	C	0	1,900	[ "dfs and similar", "interactive", "trees" ]	false		null	268,435,456
lucky5	"Problem\n\nKND is a student programmer at the University of Aizu. There are N towns around his town(...TRUNCATED)	{ "input": [ "2\n2 999995\n", "3\n2 3 9\n" ], "output": [ "5\n", "8\n" ] }	{"input":["3 10\n2 3 1\n1 1\n3 3\n3 3\n3 2\n1 1\n2 2\n3 1\n1 3\n2 1\n3 3\n","7 20\n6 2 5 7 3 1 4\n7 (...TRUNCATED)	{"input":["2 2\n2 1 2 16\n2 1 2 7\n","1 2\n1 1 1 10\n2 1 1 5\n","6 5\n1 2 3 1\n2 1 2 8\n2 3 4 7\n1 1(...TRUNCATED)	2	9	{"language":[1],"solution":["N=int(input())\nD=[0]*N\nfor i in range(N-1):\n a,b=map(int,raw_inpu(...TRUNCATED)	{ "language": [], "solution": [] }	283	C	0	1,700	[ "graphs", "shortest paths" ]	false	"あなたは友人と旅行に行きたいと考えています。ところが、浪費癖のある(...TRUNCATED)	{ "nanos": 0, "seconds": 2 }	0
p02610 AIsing Programming Contest 2020 - Camel Train	"Monocarp and Polycarp are learning new programming techniques. Now they decided to try pair program(...TRUNCATED)	{ "input": [ "3 5\n1 2 3\n1 3 2 3 1\n" ], "output": [ "12\n" ] }	{ "input": [], "output": [] }	{"input":["100 3\n2 1 1 1 3 2 3 3 2 3 3 1 3 3 1 3 3 1 1 1 2 3 1 2 3 1 2 3 3 1 3 1 1 2 3 2 3 3 2 2 3 (...TRUNCATED)	2	0	{"language":[1,1,1,1],"solution":["M,N=map(int,raw_input().split())\nL=[]\nfor i in range(M):\n L(...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)	0	A	3,000	2,400	[ "*special", "dfs and similar", "trees" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
1199_E. Matching vs Independent Set	"You're trying to set the record on your favorite video game. The game consists of N levels, which m(...TRUNCATED)	{ "input": [ "3\nbba\nabb\nabb\n\nSAMPLE" ], "output": [ "2\n" ] }	{"input":["53812 4 967428361\n","7 2 400166453\n","75727 16 485722667\n","65536 10 802338989\n","655(...TRUNCATED)	{"input":["brtakoktrosttttttttttosafasfkalsfkodfdasiofhadfhasdsajfdsafoasodsafahaihfdisoadspapsapios(...TRUNCATED)	2	0	{"language":[1,1,1,1,1,1,1,1,1,1,1,1],"solution":["for _ in xrange(input()):\n\tn,c,m=map(int,raw_in(...TRUNCATED)	{"language":[3,2,2,2,2,1,2,2,2,4,1,2,3,4,2,2,3,1,2,2,2,2,2,3,2,1,4,3,2,4,3,1,2,4,3,2,4,3,2,3,2,2,4,2(...TRUNCATED)	830	D	250	0	[ "brute force", "greedy" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
814_C. An impassioned circulation of affection	"Given a string, S, we define some operations on the string as follows:\n\na. reverse(S) denotes the(...TRUNCATED)	{ "input": [ "10 30 10\n", "2 6 3\n", "5 20 11\n" ], "output": [ "85932500\n", "124780545\n", "1\n" ] }	{ "input": [], "output": [] }	{"input":["1\n7\n.......\n.*.....\n.......\n.......\n.......\n.......\n.......\n\nSAMQLE","1\n5\n...(...TRUNCATED)	2	2	{"language":[4,2,2,4,2,2,2,2,4,2,3,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,1,4,2,2,2,4,2,2,4,2,2,2,2,2,2,4,2,2(...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)	80	D	0	2,100	[ "games", "math", "number theory" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
392_D. Three Arrays	"You may know that Euclid was a mathematician. Well, as it turns out, Morpheus knew it too. So when (...TRUNCATED)	{ "input": [ "2\n11 3\n4 3 4\n6 3\n3 2 1" ], "output": [ "2\n1\n" ] }	{ "input": [ "1\n999838675\n" ], "output": [ "-1\n" ] }	{"input":["3\n7 7 3 5\n1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 5\n4 5 2 4\n1 2\n2 3\n3 4\n4 1\n4 2\n4 3 2 1\(...TRUNCATED)	2	9	{"language":[2,4,3,4,4,2,2,2,4,2,2,2,4,4,4,3,2,2,2,2,4,3,4,4,2,2,4,4,4,3,3,1,2,2,3,3,2,4,2,4,4,3,2,1(...TRUNCATED)	{"language":[4,3,2,2,4,2,3,3,4,2,2,3,2,2,4,2,2,4,3,2,3,4,3,4,2,2,2,3,3,2,4,2,3,2,3,4,4,3,4,4,4,4,3,2(...TRUNCATED)	371		0	800	[ "geometry", "math" ]	false		null	256,000,000