Datasets:

TheFactoryX
/

edition_2744_deepmind-code_contests-readymade

name large_stringlengths 4 70	description large_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 large_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
gameaam	"You all know the Dirichlet principle, the point of which is that if n boxes have no less than n + 1(...TRUNCATED)	{"input":["3\n1 3 2\n-100 2 3\n","2\n2 1\n-3 0\n","5\n2 1 4 3 5\n2 2 2 3 4\n"],"output":["3\n","0\n"(...TRUNCATED)	{"input":["1\n3\nS01\n111\n00F\n","1\n5\nS0000\n00000\n00000\n00000\n0000F\n","1\n3\nS10\n010\n11F\n(...TRUNCATED)	{"input":["6\n0 41 48 86 94 14\n41 0 1 30 59 39\n48 1 0 9 31 49\n86 30 9 0 48 30\n94 59 31 48 0 33\n(...TRUNCATED)	3	0	{"language":[2,2,2,2,2,2,2,2,4,4,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,4,3,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		2,500	0	[ "implementation", "strings" ]	false	{ "nanos": 0, "seconds": 5 }	512,000,000
p02744 Panasonic Programming Contest 2020 - String Equivalence	"Let c be some positive integer. Let's call an array a_1, a_2, …, a_n of positive integers c-array(...TRUNCATED)	{"input":["8\n0 0\n3 2\n6 2\n8 6\n6 5\n7 7\n0 4\n3 4\n8\n0 0\n5 3\n5 2\n4 1\n6 1\n8 6\n6 4\n2 4\n0"](...TRUNCATED)	{"input":["9\n53 80 94 41 58 49 88 24 42\n85 11 32 64 40 56 63 95 73\n17 85 60 41 13 71 54 67 87\n38(...TRUNCATED)	{"input":["9 10\n1 2 3 4 5 6 7 8 9\n1 2\n2 1\n2 4\n3 4\n4 5\n4 6\n2 7\n7 8\n7 9\n9 1","16 19\n1 2 3 (...TRUNCATED)	6	0	{"language":[2,2,2,2,2,2,2,2,3,3,4,2,2,2,4,4,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,4,2,2,2,2,4,1,3,4,4,2,2,4(...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,4,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	B	0	2,300	[ "binary search", "brute force", "dp", "two pointers" ]	false	{ "nanos": 0, "seconds": 1 }	0
526_A. King of Thieves	"You are given three sequences: a_1, a_2, …, a_n; b_1, b_2, …, b_n; c_1, c_2, …, c_n.\n\nFor e(...TRUNCATED)	{ "input": [ "2\n" ], "output": [ "25\n" ] }	{"input":["21 6\n12 15 14 4 4 7 2 4 11 1 15 4 12 11 12 8 11 12 3 4 4\n","50 25\n19 1 17 6 4 21 9 16 (...TRUNCATED)	{"input":["2\n\nSBMPLE","2\n\nSBPMLE","2\n\nELMPBS","2\n\nELMPAS","2\n\nSAPMLE","2\n\nSAQMLE","2\n\n(...TRUNCATED)	2	6	{"language":[1,1],"solution":["def CheckIfProbablyPrime(x):\n return (2 << x - 2) % x\ndef primes(...TRUNCATED)	{ "language": [], "solution": [] }	478		0	1,600	[ "greedy", "implementation" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
1176_F. Destroy it!	"Peter got a new snow blower as a New Year present. Of course, Peter decided to try it immediately. (...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":["1 1\nt\n+ 2 p\n","2 12\naa\n+ 1 a\n+ 2 a\n+ 3 a\n- 1\n+ 1 a\n- 2\n+ 2 a\n- 3\n+ 3 a\n+ 2 (...TRUNCATED)	{"input":["19 23\nU..U..R........L...D...\n.D.....UL.U.U........DR\n..D.U..D....L......R...\nD......(...TRUNCATED)	5	7	{"language":[2,2,2,2,4,2,4,2,2,4,2,2,2,2,2,4,2,2,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,4(...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)	1,328		0	0	[]	false	{ "nanos": 0, "seconds": 3 }	256,000,000
1046_D. Interstellar battle	"Taro is going to play a card game. However, now he has only n cards, even though there should be 52(...TRUNCATED)	{"input":["15\nyamatonadeshiko\n10\n1 a\n2 a\n3 a\n4 a\n5 a\n1 b\n2 b\n3 b\n4 b\n5 b\n","6\nkoyomi\n(...TRUNCATED)	{ "input": [ "60 0 58", "7 3 7" ], "output": [ "630738177", "195634923" ] }	{"input":["2\n0 1\n","5\n0 0 1 0 1\n","100\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 (...TRUNCATED)	2	0	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2],"solution":["#include <iostream>\n#inc(...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		1,000	3,500	[ "greedy", "two pointers" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
938_B. Run For Your Prize	"Little Petya likes arrays of integers a lot. Recently his mother has presented him one such array c(...TRUNCATED)	{ "input": [ "3", "100", "1000000" ], "output": [ "3", "473", "13969985" ] }	{"input":["1\n2\n3\n2\n","8\n190409007 190409007 352375776 190409007 352375776 352375776 352375776 3(...TRUNCATED)	{"input":["cba\naaac\n","bcbcdddbbd\ndbbdbdcbcb\n","cadaccbaaa\nacabbbabaa\n","b\nb\n","acaccaaadz\n(...TRUNCATED)	1	0	{"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],"solution":["#include (...TRUNCATED)	{"language":[2,3,3,0,2,2,2,4,2,2,2,2,2,2,0,3,3,2,2,3,4,3,2,3,3,2,2,2,3,2,2,2,2,4,0,2,3,0,2,3,2,4,2,2(...TRUNCATED)	0	B	0	0	[ "implementation" ]	false	{ "nanos": 0, "seconds": 1 }	1,073,741,824
tech07	"Friends Alex and Bob live in Bertown. In this town there are n crossroads, some of them are connect(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1\n2\n999999997 999999998\n999999999 1000000000\n","4\n1\n1 1000000000\n5\n1 1\n12 18\n10(...TRUNCATED)	{"input":["3\n1\n2 3\n2\n4 5\n5 6\n2\n2 3\n1 5","3\n1\n2 3\n2\n4 5\n5 6\n1\n2 3\n3 5","3\n1\n1 3\n2\(...TRUNCATED)	2	0	{"language":[2,1,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,1,2,4,1,1,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,4,2(...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)	0		250	800	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
p00260 Cats Going Straight	"After his wife's tragic death, Eurydice, Orpheus descended to the realm of death to see her. Reachi(...TRUNCATED)	{ "input": [ "0", "0011", "11011010001011" ], "output": [ "0", "4", "12" ] }	{"input":["728961319347 33282698448966372 52437 42819\n","461788563846 36692905412962338 93797 64701(...TRUNCATED)	{"input":["4\n1 4\n3 2\n3 4\n","21\n7 15\n13 1\n14 3\n4 10\n2 3\n16 18\n17 20\n16 20\n8 4\n3 12\n2 1(...TRUNCATED)	3	0	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2(...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)	925	D	500	0	[ "greedy", "math" ]	false	{ "nanos": 0, "seconds": 8 }	256,000,000
1030_E. Vasya and Good Sequences	"Little Chris is participating in a graph cutting contest. He's a pro. The time has come to test his(...TRUNCATED)	{ "input": [ "2\n5\n2 3 5 1 2\n3\n1 2 3" ], "output": [ "3\n3" ] }	{ "input": [], "output": [] }	{"input":["2\n5\n6 5 4 3 2\n5\n3 4 6 1 1","2\n5\n6 5 4 3 2\n5\n3 7 9 1 1","2\n5\n6 5 4 3 3\n5\n3 7 9(...TRUNCATED)	5	9	{ "language": [], "solution": [] }	{"language":[2,2,2,2,2,0,4,0,0,2,4,0,2,0,2,0,0,4,0,2,2,2,0,2,2,0,2,3,4,2,4,0,4,0,2,0,2,2,2,2,2,0,2,4(...TRUNCATED)	0	C	1,000	2,600	[ "binary search", "data structures", "hashing" ]	false	null	256,000,000
1334_D. Minimum Euler Cycle	"Problem description.\n The problem statement is simple , you are given an array and you have to p(...TRUNCATED)	{"input":["3\n1 1 101\n1 2 1\n3 2 1\n","5\n1 1 2 2 3\n2 2 4 3 3\n3 3 1 1 1\n"],"output":["5\n","5\n"(...TRUNCATED)	{"input":["50 100\n1 71 96\n2 34 52\n2 16 95\n1 54 55\n1 65 85\n1 76 92\n2 19 91\n1 26 43\n2 83 95\n(...TRUNCATED)	{"input":["10 9 5\n0 0 0 0 0 0 0 -1 0 4\n10 3\n10 7\n10 5\n10 8\n10 9\n10 1\n10 4\n10 6\n10 2\n","10(...TRUNCATED)	5	7	{"language":[2,2,2,2,2,4,4,4,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,4,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)	0		0	2,400	[ "brute force", "greedy" ]	false	{ "nanos": 0, "seconds": 1 }	0