Datasets:

TheFactoryX
/

edition_3017_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
chsparr	"Roy is going through the dark times of his life. Recently his girl friend broke up with him and to (...TRUNCATED)	{"input":["3 2 998244353\n","9 3 998244353\n","3 1 998244353\n","9 4 998244353\n"],"output":["665496(...TRUNCATED)	{"input":["4\n889308 0\n110692 0\n0 461939\n146447 815492\n","5\n0 4\n3 4\n2 2\n2 0\n0 0\n","5\n0 10(...TRUNCATED)	{ "input": [], "output": [] }	5	7	{"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)	{ "language": [], "solution": [] }	277		0	1,300	[ "" ]	false	{ "nanos": 0, "seconds": 3 }	256,000,000
p03774 AtCoder Beginner Contest 057 - Checkpoints	"Two friends are on the coordinate axis Ox in points with integer coordinates. One of them is in the(...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":["50 100\n3 24 49\n2 10 12\n1 87 92\n2 19 60\n2 53 79\n3 65 82\n3 10 46\n1 46 86\n2 55 84\n(...TRUNCATED)	6	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,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED)	{"language":[4,2,1,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,0,0,2,2,2,2,4,2,2,2,3,0,2,2],(...TRUNCATED)	1,043		0	1,600	[ "math" ]	false	{ "nanos": 0, "seconds": 2 }	0
1053_C. Putting Boxes Together	"The nation of Panel holds an annual show called The Number Games, where each district in the nation(...TRUNCATED)	{ "input": [ "3\n2 3 3" ], "output": [ "2" ] }	{ "input": [], "output": [] }	{"input":["384\n87 78 16 94 36 87 93 50 22 63 28 91 60 64 27 41 27 73 37 12 69 68 30 83 31 63 24 68 (...TRUNCATED)	2	12	{"language":[1],"solution":["N=int(input())\nD=[0]*N\nfor i in range(N-1):\n a,b=map(int,raw_inpu(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,3,2,2,3,2,2,4,2,4,2,2,2,2,3,2,4,4,4,2,2,2,2,2,3,2,2,2,4,4,4,4,4,3,2,2,1,3(...TRUNCATED)	980	C	0	2,700	[ "greedy" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
161_B. Discounts	"You are given two permutations p and q, consisting of n elements, and m queries of the form: l1, r1(...TRUNCATED)	{ "input": [ "4 5\n10 4 18 3\n", "2 2\n1 2\n" ], "output": [ "4", "1" ] }	{"input":["10\n62159435 282618243 791521863 214307200 976959598 590907019 166397456 708291256 853773(...TRUNCATED)	{"input":["2\n4 INDIAN\nCONTEST_WON 1\nTOP_CONTRIBUTOR\nBUG_FOUND 100\nCONTEST_HOSTED\n1 NON_INDIAN\(...TRUNCATED)	2	11	{"language":[1,1],"solution":["t=input()\nwhile t>0:\n\tb=[]\n\ta=raw_input().split()\n\tfor i in ra(...TRUNCATED)	{"language":[2,0,2,2,2,2,2,1,2,2,2,2,2,2,2,1,2,2,2,2,0,2,0,0,2,0,0,0,4,1,2,2,0,2,0,0,2,2,2,0,2,2,2,2(...TRUNCATED)	1,325	D	2,000	0	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	0
find-the-nth-prime	"We have a sandglass consisting of two bulbs, bulb A and bulb B. These bulbs contain some amount of (...TRUNCATED)	{ "input": [ "2\n1\n2" ], "output": [ "2\n5\n" ] }	{ "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	11	{"language":[2,2,2,2,2,3,2,4,2,2,4,2,3,2,2,2,2,2,2,2,4,4,2,2,2,2,4,2,4,2,2,2,2,3,4,2,2,2,2,4,1,2,2,4(...TRUNCATED)	{"language":[3,2,3,2,4,4,2,4,3,4,4,4,2,4,3,4,4,4,2,4,2,2,3,4,4,3,2,3,3,3,3,2,2,4,4,4,2,3,4,4,4,4,4,2(...TRUNCATED)	0	D	0	0	[ "data structures", "greedy", "implementation" ]	false	{ "nanos": 0, "seconds": 2 }	268,435,456
1446_D2. Frequency Problem (Hard Version)	"Little Susie listens to fairy tales before bed every day. Today's fairy tale was about wood cutters(...TRUNCATED)	{"input":["1 1 1\n","3 1 0\n"],"output":[" (...TRUNCATED)	{"input":["5\n27468 7465 74275 40573 40155\n112071 76270 244461 264202 132397\n1 777133331\n2 107454(...TRUNCATED)	{"input":["2008 2 29\n2015 1 1","1505 9 9\n2001 11 3","1505 9 9\n2619 11 3","1505 13 9\n2619 11 3","(...TRUNCATED)	6	0	{"language":[4,2,4,2,4,2,2,2,2,2,2,4,2,2,2,2,2,2,4,2,1,4,4,2,2,4,3,4,4,4,3,2,2,2,2,2,2,2,2,2,2,4,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,4,2,4,4,2,4,2,2,4,2,2,4,4,2,2,2,2,3,2,2,2,2,2,3,2,2,2,4,2,2,2,2,2,2,2,4,2,4,2(...TRUNCATED)	1,030	D	1,500	1,400	[ "geometry", "math" ]	false	{ "nanos": 0, "seconds": 3 }	256,000,000
p00127 Pocket Pager Input	"This is the hard version of the problem. The difference between the versions is in the constraints (...TRUNCATED)	{"input":["10\n","3\n"],"output":["1 2 3 4 5 6 7 8 9 \n2 4 6 8 10 12 14 16 18 \n3 6 9 1(...TRUNCATED)	{"input":["4\n3 4\n1 2\n3 4\n1 2\n","4\n2 4\n1 3\n4 4\n1 1\n","10\n6 6\n1 2\n2 2\n6 7\n8 8\n3 5\n5 5(...TRUNCATED)	{"input":["100\n591 417 888 251 792 847 31 3 182 461 102 348 555 956 771 901 712 878 580 631 342 333(...TRUNCATED)	2	11	{"language":[2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,1,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,158	C	0	1,600	[ "greedy", "implementation" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1065_F. Up and Down the Tree	"There is little time left before the release of the first national operating system BerlOS. Some of(...TRUNCATED)	{"input":["3\n3 3 4\n3 3 5\n3 3 3\n"],"output":["**\n.\n\n\n\n.\n...\n\n*\n.\n*.\n\n(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["36\n2 2 2 8 9 4 8 5\n9 1 7 6 10 6 9 3\n10 2 4 6 6 2 1 1\n9 6 2 3 5 7 7 3\n6 6 3 9 10 9 1 (...TRUNCATED)	1	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,1,1,1,1,1,1,1,1,1],"solution":["d(...TRUNCATED)	{"language":[4,3,2,4,4,3,4,2,2,4,3,2,4,2,2,2,2,4,4,4,2,4,2,4,3,3,4,4,2,4,4,2,2,4,2,2,4,4,2,2,3,3,4,2(...TRUNCATED)	1,344	C	0	0	[ "brute force" ]	false	{ "nanos": 0, "seconds": 3 }	0
366_D. Dima and Trap Graph	"You are given a permutation p_1, p_2, …, p_n.\n\nIn one move you can swap two adjacent values.\n\(...TRUNCATED)	{"input":["7\nC is A’s father’s brother’s son’s aunt\nC is A’s mother’s brother’s son(...TRUNCATED)	{"input":["2\n1 2\n","100\n61 96 25 10 50 71 38 77 76 75 59 100 89 66 6 99 2 13 3 23 91 93 22 92 4 8(...TRUNCATED)	{ "input": [], "output": [] }	2	2	{"language":[2,4,3,4,2,4,4,2,2,2,3,2,2,3,4,3,2,2,3,4,2,4,3,2,2,4,2,2,2,2,4,2,2,3,2,3,2,4,2,4,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,397	E	0	0	[]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
1334_D. Minimum Euler Cycle	"You are given a square board, consisting of n rows and n columns. Each tile in it should be colored(...TRUNCATED)	{ "input": [ "6 5\n1 2 2 4 2 3\n", "7 5\n3 3 2 1 1 1 3\n" ], "output": [ "4\n", "2\n" ] }	{"input":["100 10000\n337491026 878382762 942177429 998998997 292784016 407647544 813626083 20338593(...TRUNCATED)	{"input":["3 5 999999997\n","1011 1 1000000000\n","1 30 33\n","29 3 1000000000\n","3 2 31\n","2 2 85(...TRUNCATED)	3	7	{"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,2,4,4,4,4,2,2,2,2,2,2,1,2,1,2,4,2,4,1,2,2,4,2,4,4,2,2,4,3,2,4,4,2,4,4,4,2,2,2,2,2,2,1(...TRUNCATED)	354	D	2,500	0	[ "data structures", "greedy", "sortings" ]	false	{ "nanos": 0, "seconds": 6 }	0