Datasets:

TheFactoryX
/

edition_2038_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
p01222 Walk under a Scorching Sun	"You are given a complete undirected graph. For each pair of vertices you are given the length of th(...TRUNCATED)	{ "input": [ "2\n2 1\n5 4\n3 2\n1 0 2\n\nSAMPLE" ], "output": [ "9\n1\n" ] }	{"input":["10\ntypedef errtype ucywcaykzh\ntypeof &ucywcaykzh*****\ntypedef &&&&&&void******(...TRUNCATED)	{"input":["30 1\n19 20 10 21 9 1 20 21 30 12 25 25 2 1 10 3 19 12 18 12 30 18 22 1 18 18 30 30 12\n"(...TRUNCATED)	2	0	{"language":[1,3,2,2,2,3,4,2,4,3,3,3,2,3,1,3,3,3,3,3,3,2,3,4,3,3,4,3,3,3,3,3,4,3,4,2,3,3,2,3,4,3,3,3(...TRUNCATED)	{"language":[2,4,2,2,2,2,2,2,4,2,2,4,4,2,2,4,2,4,2,4,2,2,2,2,4,4,4,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,4,2(...TRUNCATED)	920	B	0	1,800	[ "greedy", "math" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
p03819 AtCoder Regular Contest 068 - Snuke Line	"Jzzhu have n non-negative integers a1, a2, ..., an. We will call a sequence of indexes i1, i2, ...,(...TRUNCATED)	{"input":["3 2\n1 1\n1 2\n2 2 1\n","3 5\n2 1 2\n1 3\n1 4\n","2 3\n2 1 3\n2 1 2\n"],"output":["\n4 2\(...TRUNCATED)	{ "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	10	{"language":[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,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[3,3,2,2,3,2,1,1,2,3,2,4,2,2,4,1,4,4,3,2,3,3,4,4,4,4,1,3,2,2,4,2,4,4,4,2,2,2,4,4,1,2,3,2(...TRUNCATED)	0		0	1,800	[]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
lucky5	"Kevin Sun has just finished competing in Codeforces Round #334! The round was 120 minutes long and (...TRUNCATED)	{"input":["3 10\n2 3 2\n6\n1 5\n2 1 10\n2 2 9\n2 5 6\n3 1 7 8\n4 1 2 3 4\n"],"output":["\nYES\nYES\n(...TRUNCATED)	{"input":["21\n11 19 4 19 6 0 13 7 6 2 5 3 16 10 1 9 15 21 9 21 2\n","100\n57 85 27 81 41 27 73 10 7(...TRUNCATED)	{"input":["9\n72 49 39 50 68 35 75 158 56\n","4\n2 4 1 2\n","8\n3 4 3 1 1 3 6 1\n","1\n1\n","7\n2 1 (...TRUNCATED)	2	0	{"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":[4,3,3,1,2,4,2,2,3,3,4,3,4,3,2,2,4,3,3,3,4,2,2,2,4,3,2,2,3,3,4,4,4,1,1,4,1,1,1,3,2,4,2,1(...TRUNCATED)	0	C	2,250	2,000	[]	false	{ "nanos": 0, "seconds": 3 }	256,000,000
615_A. Bulbs	"Utkarsh is forced to play yet another one of Ashish's games. The game progresses turn by turn and a(...TRUNCATED)	{ "input": [ "5\n7 46 11 20 11", "7\n994 518 941 851 647 2 581", "3\n3 4 6" ], "output": [ "90", "4527", "10" ] }	{ "input": [], "output": [] }	{"input":["3\n230967221047542071272908186525868331398921682471308664253988778356539397562182960087 3(...TRUNCATED)	6	9	{"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":[2,2,3,2,4,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,3,3,2,2,2,2,2,2,2,2(...TRUNCATED)	586	E	0	0	[ "dp", "flows", "graph matchings", "greedy" ]	true	{ "nanos": 0, "seconds": 3 }	134,217,728
p03570 CODE FESTIVAL 2017 qual C - Yet Another Palindrome Partitioning	"You are given an array a_1, a_2, …, a_n of integers. This array is non-increasing.\n\nLet's consi(...TRUNCATED)	{"input":["500 500 0 0 200 200","4 4 0 0 1 1","4 4 0 0 3 3","2 3 0 0 1 2"],"output":["34807775","2",(...TRUNCATED)	{"input":["2 1\n1000000000 1000000000\n2 1\n","3 2\n123 345 567\n1 2\n3 2\n","3 0\n4 1 4\n","3 2\n1 (...TRUNCATED)	{"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":[2,2,3,3,1,3,4,3,2,2,4,3,2,4,2,4,4,4,3,3,2,4,3,2,2,2,3,2,3,4,2,3,2,2,4,4,3,3,2,3,4,3,3,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,1,2,2,4,2,2,2,2,2,2,4(...TRUNCATED)	290	C	0	1,800	[ "greedy" ]	false	{ "nanos": 0, "seconds": 1 }	64,000,000
1149_B. Three Religions	"4 different points on the plane Read the coordinates of $ A (x_a, y_a) $, $ B (x_b, y_b) $, $ C (x_(...TRUNCATED)	{ "input": [ "1\n3 3\n1 2\n2 3\n1 3\n\nSAMPLE" ], "output": [ "2\n" ] }	{"input":["xoox\n.xx.\no..o\n..xo\n","o.xx\nxo.o\n...o\n..x.\n","xxoo\no.oo\n...x\nx..x\n","o..x\n..(...TRUNCATED)	{"input":["8","0","4","-1","2","-2","3","-4","6","-3","-6","-9","-8","-12","-5","7","-10","10","-17"(...TRUNCATED)	1	0	{"language":[4,3,3,2,1,4,3,4,3,3,4,4,3,3,3,3,3,3,3,3,2,3,3,3,2,3,3,4,3,3,3,3,3,4,4,2,3,3,3,3,3,3,1,3(...TRUNCATED)	{"language":[2,2,2,2,2,4,2,2,4,4,2,2,2,2,2,2,1,4,2,2,4,2,2,2,2,2,2,2,4,2,2,2,3,2,2,2,3,2,3,2,2,2,2,2(...TRUNCATED)	846		0	0	[ "binary search", "data structures", "divide and conquer", "greedy", "implementation" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
ig01	"Bearland is a dangerous place. Limak can’t travel on foot. Instead, he has k magic teleportation (...TRUNCATED)	{ "input": [ "30 60 3 1\n", "20 0 15 5\n", "10 51 5 4\n" ], "output": [ "20 0 10\n", "0 0 20\n", "-1\n" ] }	{"input":["8\n0 1\n1 0\n0 1\n1 1\n0 1\n1 0\n0 1\n1 0\n","8\n1 0\n1 0\n1 0\n0 1\n0 1\n1 1\n1 1\n0 1\n(...TRUNCATED)	{"input":["6\n3 1\n3 2\n5 100\n4 3\n4 4\n5 2\n\nSAMPLE","6\n6 1\n3 2\n5 100\n4 3\n4 4\n5 2\n\nSAMPLE(...TRUNCATED)	6	7	{"language":[4,2,4,3,2,4,4,4,4,4,2,4,3,4,3,2,3,2,4,3,2,3,2,3,3,4,3,2,3,4,3,4,2,3,4,2,4,3,4,4,4,2,2,3(...TRUNCATED)	{"language":[2,2,0,0,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,0,2,0,2,2,2,2,2,2,0,2,2,0,2,2,2,2,2,0,0,0(...TRUNCATED)	737		0	0	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
p02445 Swap	"Problem description.\nVipul is a hardworking super-hero who maintains the bracket ratio of all the (...TRUNCATED)	{ "input": [ "3\n2\n6\n10" ], "output": [ "2\n1826/189\n877318/35343\n" ] }	{ "input": [], "output": [] }	{"input":["aa\n2\nbb\nbc\n","th\n1\nht\n","bb\n1\nab\n","bn\n100\ndf\nyb\nze\nml\nyr\nof\nnw\nfm\ndw(...TRUNCATED)	5	7	{"language":[3,1,2,2,2,2,2,4,2,2,2,3,3,3,2,2,3,4,2,2,2,3,2,3,2,3,3,3,2,3,2,3,1,4,1,3,2,2,2,1,1,2,2,2(...TRUNCATED)	{"language":[2,2,1,4,3,3,3,2,4,2,2,3,3,4,4,4,3,3,3,3,4,2,3,2,3,2,2,2,2,3,3,1,4,4,3,2,2,4,4,3,2,3,2,2(...TRUNCATED)	0	E	0	1,900	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
1012_E. Cycle sort	"Problem Desrcription\nShil likes to play with trees a lot.He is playing with an undirected tree con(...TRUNCATED)	{ "input": [ "2\n5\n2 3 5 1 2\n3\n1 2 3" ], "output": [ "3\n3" ] }	{"input":["10 9\n7 9\n8 9\n8 2\n10 6\n8 3\n9 4\n2 6\n8 5\n9 1\n","2 1\n1 2\n","20 20\n1 9\n11 9\n3 5(...TRUNCATED)	{"input":["500 500 0 0 107 200","4 1 0 0 1 1","4 4 1 0 3 3","2 3 0 0 1 1","500 500 0 0 107 239","2 1(...TRUNCATED)	3	9	{"language":[2,2,2,2,2,2,2,2,2,4,2,2,4,2,3,2,2,4,4,2,4,4,2,2,4,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,2,4,2,2(...TRUNCATED)	{"language":[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,4,2,2,2,2,2,2,4,2,2,4,2,4,2,2,2,2,2(...TRUNCATED)	1,208	B	0	1,600	[]	false	null	268,435,456
937_D. Sleepy Game	"You are given a multiset of points on the plane with integer coordinates. Find the maximum distance(...TRUNCATED)	{"input":["3\n3 0 2 5\n1 1 1 6\n3 2 1 10\n1 -2 3 6\n2\n1 2\n3 3\n1\n2\n3\n0\n3 0 2 5\n1 1 1 6\n3 2 1(...TRUNCATED)	{"input":["1000 1001\n217 636 713 516\n","1000 1998\n833 681 19 233\n","4 5\n1 3 4 2\n","6 7\n3 1 2 (...TRUNCATED)	{"input":["2 3\n1 1 0\n0 1 0","3 3\n0 1 0\n1 0 1\n0 1 -1","4 6\n1 0 1 1 0 1 \n0 0 1 1 1 1 \n1 1 1 1 (...TRUNCATED)	2	7	{"language":[2,4,4,4,4,4,4,4,4,4,4,4,2,2,4,4,4,4,2,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,2,4,4,4,4(...TRUNCATED)	{"language":[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,2,2,2,2,2,2(...TRUNCATED)	1,043	C	1,250	1,600	[ "*special", "strings" ]	false	null	256,000,000