Datasets:

TheFactoryX
/

edition_2829_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
814_C. An impassioned circulation of affection	"Monk's birthday is coming this weekend! He wants to plan a Birthday party and is preparing an invit(...TRUNCATED)	{ "input": [ "2\n2\n3\n\n\nSAMPLE" ], "output": [ "2\n4\n" ] }	{"input":["26\n0.98 0.64 0.06 0.90 0.01 0.73 0.21 0.98 0.65 1.00 0.87 0.85 0.01 0.06 0.65 0.00 0.65 (...TRUNCATED)	{"input":["4\nSSSSEEEECCCCEECCCC\nCCCCCSSSSEEECCCCSS\nSCCCCCCCSSEEESSSSS\nEESSSSCCCCCCSSEEEESAMPLE",(...TRUNCATED)	6	8	{"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,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED)	{"language":[2,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,4,0,2,3,2,3,2(...TRUNCATED)	0	B	0	1,900	[ "combinatorics", "data structures", "sortings" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
1334_D. Minimum Euler Cycle	"Linda likes to change her hair color from time to time, and would be pleased if her boyfriend Archi(...TRUNCATED)	{ "input": [ "4\n1 14\n1 50\n4 28\n5 700\n\nSAMPLE" ], "output": [ "1\n10\n3\n32491" ] }	{ "input": [], "output": [] }	{"input":["11\nadd 1\nsum\nadd 2\nsum\nadd 3\nsum\nadd 4\nsum\nadd 6\nsum\nadd 6\n","6\nadd 4\nadd 7(...TRUNCATED)	2	0	{"language":[4,2,2,2,2,3,2,2,4,2,3,2,2,4,4,2,2,4,2,2,2,4,4,2,2,2,2,3,2,3,4,2,3,4,2,2,2,2,4,4,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0	B	0	0	[ "constructive algorithms", "dp", "flows", "graph matchings", "greedy", "sortings" ]	false	{ "nanos": 0, "seconds": 1 }	268,435,456
roy-and-wobbly-numbers	"You are given an equation: \n\nAx2 + Bx + C = 0. \n\nYour task is to find the number of distinct ro(...TRUNCATED)	{ "input": [ "3\n1 2 3\n", "5\n5 4 3 2 1\n" ], "output": [ "0 0 0\n", "0 1 3 6 10\n" ] }	{"input":["205078485761\n","873109054817\n","518649879439\n","401021537803\n","821985629174\n","6146(...TRUNCATED)	{"input":["1\n2 3 Chandu\n\nSBMPLE","1\n2 4 Chandu\n\nELPMBT","51\n8 10 Chandu\n2 2959 Daspal\n2903 (...TRUNCATED)	5	0	{"language":[2,2,2,2,2,2,2,2,2,3,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,4,2(...TRUNCATED)	{"language":[2,4,2,2,4,2,2,2,2,2,4,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,4,2,2,2,4,2,2(...TRUNCATED)	228		0	1,700	[ "" ]	false	null	64,000,000
p03452 AtCoder Regular Contest 090 - People on a Line	"Leonard has decided to quit living with Dr. Sheldon Cooper and has started to live with Penny. Yes,(...TRUNCATED)	{"input":["17\ntypedef void* b\ntypedef b* c\ntypeof b\ntypeof c\ntypedef &b b\ntypeof b\ntypeof(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["5\nFFFAF\n","5\nIIAAF\n","5\nAAFFA\n","6\nAAAFFA\n","2\nAF\n","8\nIFFFIAAI\n","3\nFFA\n",(...TRUNCATED)	5	8	{"language":[1,1],"solution":["import datetime\ndt='21/03/2012'\nday, month, year = (int(x) for x in(...TRUNCATED)	{ "language": [], "solution": [] }	1,354	D	0	900	[ "" ]	false	null	256,000,000
substrings-count-3	"BCPC stands for Byteforces Collegiate Programming Contest, and is the most famous competition in By(...TRUNCATED)	{"input":["6\n3 1\n3 2\n3 100\n4 3\n4 4\n5 2\n\nSAMPLE"],"output":["101\n121\n-1\n1313\n1414\n12121\(...TRUNCATED)	{"input":["20\n...............\n","97\n*..*.......**......................(...TRUNCATED)	{"input":["5\n42665793 93310343 856080769 176604645 248258165\n10\n1 5 141156007\n2 5 5 3\n2 4 4 2\n(...TRUNCATED)	2	0	{"language":[1],"solution":["mod=10*9+7\nA=[[0 for i in range(105)] for j in range(105)]\nB=[0]105(...TRUNCATED)	{"language":[2,2,4,3,2,3,3,0,3,2,2,0,3,4,1,3,2,2,0,0,2,2,3,3,3,3,0,3,4,2,0,3,0,2,0,2,2,2,3,3,4,3,2,2(...TRUNCATED)	20	C	0	800	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
pcsc1	"\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-piz(...TRUNCATED)	{"input":["6\n3\n60\n100\n1024\n23456\n8735373\n\nSAMPLE"],"output":["0\n14\n24\n253\n5861\n2183837\(...TRUNCATED)	{"input":["53812 4 967428361\n","7 2 400166453\n","75727 16 485722667\n","65536 10 802338989\n","655(...TRUNCATED)	{"input":["21 6\n12 15 14 4 4 7 3 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)	3	10	{"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":[3,1,3,2,1,2,2,2,4,2,3,4,2,4,2,4,2,3,1,3,4,3,2,2,4,3,2,2,1,2,4,2,4,3,4,2,4,2,4,4,4,3,2,4(...TRUNCATED)	0	C	0	0	[]	false	null	134,217,728
p04048 AtCoder Grand Contest 001 - Mysterious Light	"Vasya's telephone contains n photos. Photo number 1 is currently opened on the phone. It is allowed(...TRUNCATED)	{ "input": [ "0 1 1 1 1 0\n", "1 1 0 0 1000 1000\n" ], "output": [ "Yes\n", "No\n" ] }	{ "input": [], "output": [] }	{"input":["5 4 5\n1 2\n1 3\n2 4\n1 5","5 4 1\n1 2\n1 3\n3 4\n3 5","9 6 1\n1 2\n2 3\n3 4\n4 5\n5 6\n4(...TRUNCATED)	2	0	{"language":[2,2,4,4,2,2,2,2,2,2,2,4,2,4,4,2,2,4,2,4,4,4,2,2,4,4,2,2,2,3,2,4,4,4,2,2,2,2,2,4,2,2,2,4(...TRUNCATED)	{"language":[2,0,0,2,0,2,0,0,0,2,2,2,2,0,0,0,0,2,0,4,2,0,4,0,0,0,0,0,2,0,4,2,4,2,0,2,0,0,2,2,2,0,0,0(...TRUNCATED)	0		1,000	1,000	[ "binary search", "math" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1257_G. Divisor Set	"The King of a little Kingdom on a little island in the Pacific Ocean frequently has childish ideas.(...TRUNCATED)	{ "input": [ "2\n1 23\n\nSAMPLE" ], "output": [ "NO\n" ] }	{"input":["1 1\na\n10\n","1 20\naaaaaaaaaaaaaaaaaaaa\n924705 786913 546594 427698 741583 189683 3540(...TRUNCATED)	{"input":["1 1 2000000000\n1\n3\n","28 3 2099\n768 115 416 934 926 65 802 980 551 213 335 202 784 91(...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":["b=\"AEIOUaeiou\"\nt(...TRUNCATED)	{"language":[2,3,4,3,0,2,2,4,2,0,3,0,3,0,3,3,2,0,2,2,2,2,2,0,0,3,2,2,2,2,2,2,3,2,3,2,4,2,2,3,0,2,2,3(...TRUNCATED)	1,285	D2	1,000	2,400	[ "" ]	false	null	1,073,741,824
85_D. Sum of Medians	"A and B are preparing themselves for programming contests.\n\nB loves to debug his code. But before(...TRUNCATED)	{"input":["1 1\n4 10 0 0 10 0 10 10 0 10\n-5 -20 30 15\n135 45\n0 -15 15 0\n0 0"],"output":["11.213"(...TRUNCATED)	{"input":["4 15\n","4 2\n","467 4\n","4 11\n","4 7\n","3 1\n","4 14\n","500 125000\n","3 7\n","499 2(...TRUNCATED)	{ "input": [], "output": [] }	2	9	{"language":[3,2,4,4,2,3,3,2,3,3,4,2,2,4,2,2,2,2,4,3,3,2,4,2,2,3,4,3,4,2,3,2,4,2,2,4,2,3,2,4,2,3,3,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,3,2,3,2,2,3,3,2,3,2,2,2,2,2,2,2,3,2,2,2,3,2,3,2,3,2,3,2,3,2,2,2,2,2,3,2,2(...TRUNCATED)	716		1,000	0	[]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
1117_F. Crisp String	"Andrewid the Android is a galaxy-famous detective. He is now investigating the case of vandalism at(...TRUNCATED)	{ "input": [ "5\n2 3 4 6 8" ], "output": [ "1" ] }	{ "input": [], "output": [] }	{"input":["2 8","9 5","7 10","3 8","9 8","7 7","6 8","7 9","7 8","7 3","7 2","9 2","9 4","9 6","5 6"(...TRUNCATED)	6	0	{"language":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"solution":["n=int(raw_input())\nin_array=[]\nfo(...TRUNCATED)	{"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,354	C	1,250	2,300	[]	false	{ "nanos": 0, "seconds": 1 }	256,000,000