Datasets:

TheFactoryX
/

edition_0715_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
433_A. Kitahara Haruki's Gift	"Polycarp has an array a consisting of n integers.\n\nHe wants to play a game with this array. The g(...TRUNCATED)	{"input":["2\n4 INDIAN\nCONTEST_WON 1\nTOP_CONTRIBUTOR\nBUG_FOUND 100\nCONTEST_HOSTED\n4 NON_INDIAN\(...TRUNCATED)	{"input":["#(#(#((##((()))(((#)(#()#(((()()(()#(##(((()(((()))#(((((()(((((((()#((#((()(#(((()(()##((...TRUNCATED)	{"input":["3\n60615\n1268501\n1268499\n","7\n1\n2\n3\n4\n5\n110\n2000000\n","3\n89610\n1268501\n1268(...TRUNCATED)	2	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": [], "solution": [] }	0		750	0	[ "binary search", "geometry", "ternary search" ]	false		{ "nanos": 0, "seconds": 6 }	1,073,741,824
754_E. Dasha and cyclic table	"Frank explained its friend Felman the algorithm of Euclides to calculate the GCD \nof two numbers. (...TRUNCATED)	{"input":["5 5 13 0 4\n0 1 5\n2 1 2\n3 2 3\n1 4 0\n4 3 4\n","2 1 123456789 0 1\n0 1 0\n","2 1 999999(...TRUNCATED)	{"input":["100\n04\n9\n02163\n003000\n08041479\n80750340926070052\n90056\n11680\n90\n090208090090209(...TRUNCATED)	{"input":["1\n0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0\n7\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n1 0 0 0 0 0 1 0 0(...TRUNCATED)	3	10	{"language":[1,1],"solution":["from collections import defaultdict\n\ndef solve(S):\n # Reverse S(...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)	0	C	0	1,600	[ "bitmasks", "constructive algorithms", "implementation", "interactive" ]	false		null	134,217,728
p00819 Unreliable Message	"You are given an integer n. You have to apply m operations to it.\n\nIn a single operation, you mus(...TRUNCATED)	{"input":["5 8\n1 2 6 7 10\n1 1 1 1 2\n1 1\n1 5\n1 3\n3 5\n-3 5\n-1 10\n1 4\n2 5\n"],"output":["0\n1(...TRUNCATED)	{"input":["3 1\n1 2 5\n","1 1\n100000\n","5 1\n2 2 4 6 1\n","3 10\n5 5 10\n","1 1\n1\n","3 4\n1 2 5\(...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)	3	7	{"language":[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,4,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0		0	0	[ "brute force", "data structures", "dp", "greedy", "implementation", "math", "strings" ]	false		{ "nanos": 0, "seconds": 1 }	268,435,456
1334_D. Minimum Euler Cycle	"For skilled programmers, it is very easy to implement a sorting function. Moreover, they often avoi(...TRUNCATED)	{"input":["1\n-1\n0"],"output":["? 0 0\n? 536870912 0\n? 0 536870912\n? 805306368 536870912\n? 53687(...TRUNCATED)	{"input":["5 4\n1 2 1 -1\n2 3 1 -1\n3 1 1 -1\n4 5 2 -1\n","3 3\n1 2 -10 30\n1 3 1 1\n2 3 -10 -1\n","(...TRUNCATED)	{ "input": [], "output": [] }	2	6	{"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":[0,0,0,0,2,0,2,0,2,2,2,1,2,4,2,2,1,4,2,2,0,2,0,4,2,0,0,0,2,0,2,0,3,0,0,2,2,0,2,3,0,2,4,2(...TRUNCATED)	0		0	0	[ "dp", "implementation", "strings" ]	false		{ "nanos": 0, "seconds": 1 }	0
professor-sharma	"Every day Ruslan tried to count sheep to fall asleep, but this didn't help. Now he has found a more(...TRUNCATED)	{ "input": [ "4 4\n1 2 -10 3\n1 3 1 -10\n2 4 -10 -1\n3 4 0 -3\n" ], "output": [ "4\n" ] }	{"input":["8\n1 2\n1 3\n1 4\n1 5\n2 6\n2 7\n2 8\n","9\n9 2\n9 3\n9 4\n9 5\n2 6\n5 7\n7 8\n7 1\n","9\(...TRUNCATED)	{"input":["20 20\n00010110100100010111\n11110000001100101110\n01110101110001111000\n1011110100011111(...TRUNCATED)	6	11	{"language":[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,4,2,2,2,2,2,2,2,2,2,2,4(...TRUNCATED)	{"language":[4,2,4,2,2,2,2,2,2,1,4,2,2,2,2,1,4,2,2,3,2,2,2,2,2,2,4,2,2,2,1,2,1,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED)	1,311	C2	0	800	[ "dsu", "graphs", "shortest paths", "sortings" ]	true		{ "nanos": 0, "seconds": 2 }	268,435,456
195_A. Let's Watch Football	"Programmer Vasya is studying a new programming language &K. The &K language resembles the languag(...TRUNCATED)	{"input":["4 3\nabc\naba\nadc\nada\n10 10 10\n10 1 10\n10 10 10\n10 1 10\n","4 5\nabcde\nabcde\nabcd(...TRUNCATED)	{"input":["100\n591 417 888 251 792 847 685 3 182 461 102 348 555 956 771 901 712 878 580 631 342 33(...TRUNCATED)	{"input":["1\n3 3\n1 2\n3 3\n1 3","1\n2 3\n0 0\n2 -1\n0 1\n\nSANPLE","1\n3 3\n1 2\n2 3\n1 3\n\nELPMA(...TRUNCATED)	2	8	{"language":[3,2,2,3,1,2,2,2,2,2,4,3,4,3,3,2,4,4,2,1,4,3,4,4,1,3,2,4,2,3,2,3,3,4,4,3,2,4,4,2,4,2,2,3(...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)	290	D	500	0	[]	false	"うさぎがある電車のチケットをn 枚持っている. チケットにはそれぞれ0 か(...TRUNCATED)	{ "nanos": 0, "seconds": 1 }	134,217,728
donuts	"Note that this is the first problem of the two similar problems. You can hack this problem only if (...TRUNCATED)	{"input":["4\n2 1 2 3 4 3 2 6 1 1 2 2 1 2 3 2\n","1\n42\n","2\n1 1 1 1\n"],"output":["6 4 3 2 ","42 (...TRUNCATED)	{ "input": [], "output": [] }	{"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)	1	7	{"language":[4,3,3,3,3,3,3,3,3,2,3,3,4,3,3,3,4,4,3,3,4,3,3,3,3,3,3,3,4,2,3,1,3,3,3,3,3,3,3,3,3,3,4,3(...TRUNCATED)	{"language":[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,2(...TRUNCATED)	1,253		2,000	2,300	[ "bitmasks", "brute force", "data structures", "string suffix structures", "strings" ]	false		{ "nanos": 0, "seconds": 2 }	1,073,741,824
anuwta	"The bustling town of Siruseri has just one sports stadium. There\nare a number of schools, colleges(...TRUNCATED)	{ "input": [ "5\nZZZAA\n", "7\nABACABA\n" ], "output": [ "ZZ\n", "AB\n" ] }	{"input":["3\n121339 121339 121339 55451923 531222142 121339 121339 435485671 121339\n","3\n1 7 9232(...TRUNCATED)	{"input":["777 20\n","110 4\n","12 4\n","500 2\n","11 4\n","1 8\n","26 11\n","91 4\n","20 4\n","123 (...TRUNCATED)	6	8	{"language":[4,3,2,2,2,2,2,4,2,2,2,2,2,4,4,2,4,2,2,2,2,2,2,2,2,1,4,4,4,2,4,2,3,4,2,2,4,4,4,2,3,4,4,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,4,2,1,4,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,4,2,3,2,2,1,2,4,2,2,2,2,2,4,2,2,1(...TRUNCATED)	494	A	0	800	[ "constructive algorithms", "math" ]	false		{ "nanos": 0, "seconds": 2 }	512,000,000
magic-gcd	"you are given an array of size N. You need to select K elements from the array such that the differ(...TRUNCATED)	{"input":["3 3\n1 3\n2 3\n3 3\n","3 1\n1 1\n2 2\n3 3\n","7 3\n1 7\n3 8\n4 5\n6 7\n1 3\n5 10\n8 9\n",(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["10\n4643665 282618243 791521863 214307200 976959598 590907019 166397456 708291256 8537738(...TRUNCATED)	1	9	{"language":[3,3,3,3,4,4,2,3,3,3,4,3,3,2,1,3,3,3,2,1,3,4,4,4,2,3,4,4,3,4,3,4,2,3,3,3,4,1,2,2,3,3,3,1(...TRUNCATED)	{"language":[2,2,2,2,4,2,2,2,1,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)	1,354	B	0	2,000	[ "*special" ]	false		{ "nanos": 0, "seconds": 1 }	134,217,728
p03407 AtCoder Beginner Contest 091 - Two Coins	"Manao works on a sports TV. He's spent much time watching the football games of some country. After(...TRUNCATED)	{"input":["o.x.\no...\n.x..\nooxx\n","x.ox\nox..\nx.o.\noo.x\n","xx..\n.oo.\nx...\noox.\n","x..x\n..(...TRUNCATED)	{"input":["10 16\n9 8\n1 2\n9 5\n5 4\n9 2\n3 2\n1 6\n5 10\n7 2\n8 2\n3 7\n4 9\n5 7\n10 3\n10 9\n7 8\(...TRUNCATED)	{"input":["10\n3 1 278114804\n3 7 453886464\n8 7 830020662\n8 2 759298564\n9 2 147615930\n2 4 617310(...TRUNCATED)	1	11	{"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": [] }	203		2,500	2,400	[ "combinatorics", "math", "number theory" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000