Datasets:

TheFactoryX
/

edition_0438_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
p01484 Icy Composer	"Given 2 numbers n1 and n2, following operations can be performed:\n1) Decrement n1 by 1(if n1>1)\n2(...TRUNCATED)	{"input":["9 3 23\n9 3 22\n10 3 28\n16 10 107\n20 8 102\n20 10 105\n20 10 155\n3 4 3\n4 2 11\n0 0 0"(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\n5\n3 5 1 2 4\n1\n1\n4\n4 3 1 2\n","3\n5\n4 5 2 1 3\n1\n1\n4\n4 3 1 2\n","3\n5\n3 4 2 1(...TRUNCATED)	3	10	{"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,3,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,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	E	500	0	[ "implementation" ]	false	"データを並べ替えるための整列（ソート）アルゴリズムはコンピュータ科(...TRUNCATED)	null	256,000,000
633_H. Fibonacci-ish II	"Kevin Sun has just finished competing in Codeforces Round #334! The round was 120 minutes long and (...TRUNCATED)	{"input":["3 4\n10 10\n-10 -10\n3 3\n1 2\n2 3\n3 5\n3 5","2 2\n2 0\n0 0\n-1 0\n1 0","5 5\n-100000000(...TRUNCATED)	{ "input": [ "5\n90 94\n26 25\n64 84\n14 6\n20 96\n" ], "output": [ "1842\n12\n1015\n3\n1908\n" ] }	{ "input": [], "output": [] }	2	0	{"language":[2,2,2,2,2,2,2,2,3,2,2,2,4,3,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(...TRUNCATED)	{"language":[4,0,0,0,2,0,0,4,2,2,0,0,2,2,0,4,4,2,0,0,2,2,2,4,2,2,0,0,2,4,2,2,4,2,0,4,4,0,0,0,0,0,0,2(...TRUNCATED)	25	C	0	1,000	[ "dp" ]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
p03343 AtCoder Regular Contest 098 - Range Minimum Queries	"E: Markup language has declined\n\nIt's been centuries since we humans have been declining slowly. (...TRUNCATED)	{ "input": [ "5 5 10 5 4\n", "12 4 12 4 1\n", "15 1 100 0 0\n" ], "output": [ "1\n", "3\n", "15\n" ] }	{"input":["2 1\n7 1 1\n2 1 1\n","5 1\n2 1 0\n2 0 1\n1 0 1\n1 1 0\n1 0 1\n","6 2\n6 0 0\n11 1 0\n9 0 (...TRUNCATED)	{"input":["16\nFFC0\nFFC0\nFFC0\nFFC0\nFFC0\nFFD0\nFFC0\nFFC0\nFFC0\nFFC0\nFFC0\nFFC0\nFFC0\nFFC0\nF(...TRUNCATED)	5	0	{"language":[4,4,2,2,2,4,4,4,2,2,4,2,2,4,4,4,2,2,2,2,2,2,4,4,4,4,4,2,2,2,4,2,2,2,4,4,2,4,2,4,2,4,4,2(...TRUNCATED)	{"language":[2,2,4,4,4,4,2,2,2,2,2,2,2,3,2,4,3,3,2,2,2,2,2,2,2,2,2,4,4,4,2,2,2,2,4,2,2,4,2,2,2,2,2,2(...TRUNCATED)	0	D	1,500	3,000	[ "binary search", "dp" ]	false		null	0
give-me-my-test-monk	"Leonard has decided to quit living with Dr. Sheldon Cooper and has started to live with Penny. Yes,(...TRUNCATED)	{ "input": [ "11 5 2\n11010100101\n", "11 5 1\n11010100101\n" ], "output": [ "1\n", "3\n" ] }	{ "input": [ "aaaa a", "abcd cb", "a abab" ], "output": [ "4\n", "0\n", "0\n" ] }	{"input":["3\n((()))\n(())()\n()())","3\n((()()\n(())()\n()(()","3\n((()))\n(())))\n()())","3\n)))(((...TRUNCATED)	2	9	{"language":[3,3,4,3,2,2,3,4,3,3,3,3,3,2,2,3,2,4,3,3,4,3,3,3,2,3,3,2,3,3,4,4,3,3,3,4,3,4,2,4,3,3,3,3(...TRUNCATED)	{"language":[2,0,2,2,2,2,0,2,4,2,2,2,0,0,2,2,2,2,2,2,2,0,2,2,2,2,2,2,0,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,012	B	500	3,100	[ "constructive algorithms", "greedy", "implementation", "math" ]	false		null	256,000,000
p02365 Minimum-Cost Arborescence	"Joisino is planning to open a shop in a shopping street.\n\nEach of the five weekdays is divided in(...TRUNCATED)	{ "input": [ "3\nkek\npreceq\ncheburek\n", "4\nmail\nai\nlru\ncf\n" ], "output": [ "NO\n", "cfmailru\n" ] }	{ "input": [], "output": [] }	{"input":["3\n1000000000 1000000000 11000000\n","3\n2 2 1\n","3\n2 10 11\n","5\n1000010000 5 5 4 4\n(...TRUNCATED)	3	10	{ "language": [], "solution": [] }	{"language":[4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,4,4,4,2,2,2,4,4,2,1,3,2,2,2,4,2,2,2,4,4,2,2,2,2(...TRUNCATED)	512	D	0	1,900	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
1007_E. Mini Metro	"Snuke has decided to play a game, where the player runs a railway company. There are M+1 stations o(...TRUNCATED)	{"input":["4 5\n1 2 3 1\n2 1 2 8\n2 3 4 7\n1 1 3 3\n2 3 4 8\n","4 5\n1 2 3 1\n2 1 2 8\n2 3 4 7\n1 1 (...TRUNCATED)	{"input":["3\n3 2 3\n","3\n1 3 1\n","5\n1 1 2 1 1\n","5\n1 1 1 1 2\n","4\n562617869 562617869 562617(...TRUNCATED)	{"input":["2 0\n","3 1\n1 2 0\n","3 3\n1 2 2 3 2\n1 1 2 3 3\n2 3 2 2 3\n","11 17\n1 2 5 3 4 1 2 10\n(...TRUNCATED)	2	12	{"language":[2,2,2,2,2,2,2,2,2,4,4,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,4,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,4,4,2,2,2,4,2,2,4,4,4,2,4,1,4,2,2,1,4,4,2,2,2,2,2,2,4,4,4,2,2,2,3,4,2,1,2,4,2,4,4(...TRUNCATED)	1,446	A	500	0	[ "combinatorics", "divide and conquer" ]	false		{ "nanos": 0, "seconds": 2 }	0
p01422 Beautiful Currency	"You're given a simple, undirected, connected, weighted graph with n nodes and m edges.\n\nNodes are(...TRUNCATED)	{"input":["11 7 5\n24979445 861648772 623690081 433933447 476190629 262703497 211047202 971407775 62(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\n230967221047542071272908186525868331398921682471308664253988778356539397562182960087 3(...TRUNCATED)	2	10	{"language":[3,4,4,2,2,4,2,4,4,2,4,2,4,2,4,3,2,1,3,2,3,3,2,4,3,3,3,3,2,3,3,2,3,4,2,2,3,2,4,4,4,3,3,2(...TRUNCATED)	{"language":[2,2,4,2,2,2,2,4,3,3,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(...TRUNCATED)	1,344		2,000	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1291_B. Array Sharpening	"You already know that Valery's favorite sport is biathlon. Due to your help, he learned to shoot wi(...TRUNCATED)	{ "input": [ "4\n4 4\n1000000000 0\n7 15\n8 7\n" ], "output": [ "2\n0\n7\n5\n" ] }	{"input":["11 11\n6 2\n6 2\n1 2\n2 2\n3 1\n6 2\n1 1\n1 1\n3 1\n3 1\n6 2\n","21 7\n14 1\n882797755 2\(...TRUNCATED)	{"input":["1\n4 5\n9 7 5 3\n8 6 4 1 0\n\nSAMPLE","1\n4 5\n9 7 5 3\n16 6 4 2 0\n\nSAMPLE","1\n4 5\n9 (...TRUNCATED)	2	0	{"language":[1],"solution":["testcase = raw_input();\ntc = int(testcase)\n\nwhile (tc > 0):\n\t\n\t(...TRUNCATED)	{"language":[2,3,2,2,0,2,2,2,4,2,2,2,2,1,2,2,2,4,2,3,2,2,2,2,2,2,2,2,0,4,0,2,1,2,3,2,2,2,3,3,2,2,2,2(...TRUNCATED)	1,239	A	0	0	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	0
hermione-vs-draco	"Professor GukiZ doesn't accept string as they are. He likes to swap some letters in string to obtai(...TRUNCATED)	{ "input": [ "3 2 0 2\n0 1 3\n2 5\n" ], "output": [ "1\n" ] }	{"input":["9 13\n6 14 19 5 -5 6 -10 20 8\n","8 9\n6 -1 5 -5 -8 -7 -8 -7\n","10 7\n-9 3 -4 -22 4 -17 (...TRUNCATED)	{"input":["10\n2 3 1 5 6 4 2 10 7 7\n5\n10 1\n5 7\n19 6\n1 1\n10 8\n","10\n2 3 1 5 6 4 1 10 7 7\n5\n(...TRUNCATED)	2	0	{"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],"solution":["a,b=raw_input().spl(...TRUNCATED)	{"language":[2,2,4,2,3,4,4,3,4,1,3,3,2,3,2,2,1,3,3,3,2,3,4,3,4,2,2,3,4,3,2,4,4,3,4,4,4,3,4,2,3,4,3,2(...TRUNCATED)	0		500	2,000	[ "data structures", "dfs and similar", "dsu", "graphs" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
820_A. Mister B and Book Reading	"Sherlock Holmes and Dr. Watson played some game on a checkered board n × n in size. During the gam(...TRUNCATED)	{ "input": [ "3\n4251\n52310\n00006\n\nSAMPLE" ], "output": [ "12\n56\nunlucky" ] }	{ "input": [], "output": [] }	{"input":["2 2\n6 3\nMonday Tuesday Wednesday\n8 4\nThursday Friday Saturday Sunday\n2 2\n7 3\nMonda(...TRUNCATED)	2	0	{"language":[3,3,3,1,2,3,1,4,3,4,3,2,3,2,4,4,3,4,1,1,1,3,3,3,3,1,3,1,1,4,4,3,3,4,4,4,4,3,4,3,4,3,3,1(...TRUNCATED)	{"language":[2,3,2,4,3,2,2,4,2,3,4,4,2,4,2,2,2,3,2,3,2,3,2,3,2,4,2,4,2,3,4,3,2,4,2,4,3,4,2,4,4,4,4,4(...TRUNCATED)	39	D	2,500	3,500	[ "" ]	false		null	1,073,741,824