Datasets:

TheFactoryX
/

edition_0740_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
p00206 Next Trip	"you are given an array of size N. You need to select K elements from the array such that the differ(...TRUNCATED)	{"input":["3\n7 7 3 5\n1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 5\n4 5 2 3\n1 2\n2 3\n3 4\n4 1\n4 2\n4 3 2 1\(...TRUNCATED)	{ "input": [ "abcdabcdab\n5\n2 2 8 ab\n2 1 10 ab\n1 3 a\n1 4 b\n2 1 4 ab\n" ], "output": [ "1\n3\n2\n" ] }	{"input":["48 1976\n30 97 84\n80 81 84\n41 70 45\n23 57 80\n17 60 85\n36 48 81\n51 87 81\n38 85 81\n(...TRUNCATED)	2	9	{"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],"solut(...TRUNCATED)	{"language":[2,2,2,2,4,2,2,1,2,1,2,2,4,1,4,2,2,2,1,2,2,2,2,4,4,2,2,2,4,1,4,2,2,2,2,2,2,4,2,3,1,1,3,2(...TRUNCATED)	893		0	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
comm3	"\"Pizza At\", a fast food chain, offers three kinds of pizza: \"A-pizza\", \"B-pizza\" and \"AB-piz(...TRUNCATED)	{"input":["3 2\n0 0 0\n1 1 1\n","4 3\n0 0 2 1\n2 0 1 1\n","5 10\n0 0 0 1 2\n2 1 0 0 0\n"],"output":[(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["5\n\n3 2 2\n2 0\n0 5\n\n4 3 2\n2 1 5\n0 6\n\n0 2 2\n1 0\n2 3\n\n5 4 4\n6 0 8 0\n0 7 0 9\n(...TRUNCATED)	2	9	{"language":[2,2,2],"solution":["#include<bits/stdc++.h>\nusing namespace std;\ndouble EPS=1e-9;\nst(...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	E	500	0	[ "binary search", "data structures", "sortings", "two pointers" ]	false		{ "nanos": 0, "seconds": 2 }	512,000,000
875_D. High Cry	"You are given a huge decimal number consisting of n digits. It is guaranteed that this number has n(...TRUNCATED)	{"input":["3\nTroll likes Dracul\nDracul likes Anka\nSnowy likes Hexadecimal\n210 200 180\n","2\nAnk(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["2\n999999\n1000100","3\n9\n99\n238","2\n999999\n1010100","3\n9\n99\n39","2\n999999\n10101(...TRUNCATED)	2	0	{"language":[2,2,2,2,2,2,2,4,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,4,2,2(...TRUNCATED)	{"language":[2,2,2,2,0,2,0,2,2,2,2,2,0,2,0,1,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,0,2,2(...TRUNCATED)	167	E	0	2,000	[ "combinatorics", "dfs and similar", "dsu", "graphs" ]	false		null	256,000,000
512_B. Fox And Jumping	"Takahashi has a string S of length N consisting of lowercase English letters. On this string, he wi(...TRUNCATED)	{ "input": [ "3 2 1\n", "3 2 2\n", "4 2 2\n" ], "output": [ "2\n", "4\n", "4\n" ] }	{ "input": [], "output": [] }	{"input":["2\n2\n2 1\n1\n6","2\n2\n2 2\n1\n8","2\n2\n4 2\n1\n6","2\n1\n2 1\n1\n1","2\n3\n3 2\n1\n8",(...TRUNCATED)	3	9	{"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,3,2,2,1,4,2,2,2,2,2,2,2,2,3,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,1,2,4,2,2,2(...TRUNCATED)	1,291		0	1,100	[ "constructive algorithms", "dp" ]	false	"Story\n\n天空都市AIZUのUZIA高校では、競技プログラミングの部活動がとても(...TRUNCATED)	{ "nanos": 0, "seconds": 3 }	256,000,000
p02211 Apple Adventure	"You're given an array a_1, …, a_n of n non-negative integers.\n\nLet's call it sharpened if and o(...TRUNCATED)	{ "input": [ "2\n2\n3\n\n\nSAMPLE" ], "output": [ "2\n4\n" ] }	{ "input": [], "output": [] }	{"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)	3	12	{"language":[1,1,1,1,1,1,1],"solution":["def power(x,m):\n\tglobal mod\n\tif m==0:\n\t\treturn 1\n\t(...TRUNCATED)	{"language":[4,4,4,2,2,2,2,2,4,2,4,2,4,2,4,1,2,2,2,2,4,2,2,2,4,4,4,2,2,2,2,2,2,4,4,2,2,2,2,2,2,4,4,1(...TRUNCATED)	488		1,000	2,600	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
962_F. Simple Cycles Edges	"We have a sandglass consisting of two bulbs, bulb A and bulb B. These bulbs contain some amount of (...TRUNCATED)	{"input":["3 2\n1 3\n1 1\n0\n2\n","2 2\n1 2\n1 1\n1\n","5 6\n2 2 3\n2 4 5\n1 4\n1 5\n0\n1\n"],"outpu(...TRUNCATED)	{"input":["100 3\n45 1 2 3 4 5 6 7 8 9 19 21 24 27 28 30 34 35 37 39 40 41 42 43 46 47 48 51 52 55 5(...TRUNCATED)	{"input":["4","6","3","7","5","8","4","3","5","6","8","7"],"output":["aaaa\naaab\naaba\naabb\naabc\n(...TRUNCATED)	2	10	{"language":[2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,1,2,2,2,2,2,4,2,2,2,2,2,2,1,4,2,2(...TRUNCATED)	{"language":[2,2,2,4,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,3,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	7		500	1,100	[]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1311_C. Perform the Combo	"A string is called a KEYENCE string when it can be changed to `keyence` by removing its contiguous (...TRUNCATED)	{"input":["4 2 3 1","7834164883628 15 2189823423122 5771212644938","4 2 1 1","4 1 1 4"],"output":["0(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["188\n99\n","352\n139\n","596\n845\n","285\n2\n","892\n319\n","138\n293\n","967\n102\n","9(...TRUNCATED)	1	12	{"language":[4,2,3,3,2,4,4,2,4,2,4,3,3,3,2,4,3,2,4,2,3,2,4,2,4,4,3,3,3,4,3,4,2,4,3,3,4,4,4,2,3,4,3,2(...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,397		250	900	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
464_D. World of Darkraft - 2	"Suppose you have a string S which has length N and is indexed from 0 to N−1. String R is the reve(...TRUNCATED)	{ "input": [ "4\n4 4 4\n", "5\n2 3 5 5\n" ], "output": [ "6\n", "17\n" ] }	{ "input": [], "output": [] }	{"input":["13\n1\n>\n1\n?\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n","3\n2(...TRUNCATED)	2	12	{"language":[3,1,3,2,3,3,3,1,2,2,2,1,4,4,1,4,2,2,4,2,4,2,3,2,2,4,3,3,3,3,1,3,2,1,1,3,2,3,4,4,4,4,3,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,3,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	A	1,750	1,000	[ "brute force", "data structures", "implementation" ]	false		{ "nanos": 0, "seconds": 2 }	0
p03150 KEYENCE Programming Contest 2019 - KEYENCE String	"There are some coins in the xy-plane. The positions of the coins are represented by a grid of chara(...TRUNCATED)	{ "input": [ "100\n200\n5" ], "output": [ "13" ] }	{"input":["1\n5\n1 3 4 5 2\n","1\n3\n1 1 274005660\n","4\n7\n6 6 8 8 6 6 6\n1\n2\n5\n4 5 9 8 7\n7\n1(...TRUNCATED)	{"input":["20\n76 86 70 7 16 24 10 62 26 29 40 65 87 49 34 55 92 47 43 100\n","100\n6591 1074 3466 3(...TRUNCATED)	2	13	{"language":[2,4,2,3,1,4,1,2,4,3,4,1,3,3,3,3,4,1,2,3,4,2,2,3,3,4,3,3,3,1,1,2,4,2,1,1,3,3,3,1,2,4,1,1(...TRUNCATED)	{"language":[2,2,0,2,2,3,2,2,2,2,3,2,2,2,2,2,3,2,2,2,3,2,2,3,2,0,2,3,2,3,2,2,3,2,3,0,0,2,2,2,2,3,2,4(...TRUNCATED)	0		0	0	[ "math" ]	false		{ "nanos": 500000000, "seconds": 0 }	64,000,000
662_C. Binary Table	"Problem Statement\n\nYou are given a list of $N$ intervals. The $i$-th interval is $[l_i, r_i)$, wh(...TRUNCATED)	{ "input": [ "2 3\n", "1 1\n", "49 1808\n" ], "output": [ "6\n", "0\n", "359087121\n" ] }	{"input":["51\n882889888888689888850888388887688788888888888858888\n","55\n7271714707719515303911625(...TRUNCATED)	{"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	11	{"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,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(...TRUNCATED)	830		1,000	2,900	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000