Datasets:

TheFactoryX
/

edition_1514_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
p03407 AtCoder Beginner Contest 091 - Two Coins	"You are given q queries in the following form:\n\nGiven three integers l_i, r_i and d_i, find minim(...TRUNCATED)	{"input":["1\n1 1 1 1\n10000 10000 10000 10000","2\n10 3 1 2\n2 4 1 3\n2 2 1 1"],"output":["-1","4"](...TRUNCATED)	{ "input": [], "output": [] }	{"input":["pH\n2\n","nifzlTLTeWxaD\n0\n","ysBKLtQXvmnCrldEceqXKkaZOrvjRbwlW\n5\n","LiqWMLEVLRhW\n1\n(...TRUNCATED)	2	0	{"language":[3,2,3,3,4,2,3,3,3,3,3,3,3,4,2,3,2,2,3,3,3,3,3,3,2,3,3,3,1,2,3,4,3,3,2,3,2,4,2,4,4,3,3,4(...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)	1,366	D	1,000	2,800	[]	false		{ "nanos": 0, "seconds": 3 }	1,073,741,824
1413_F. Roads and Ramen	"You have two friends. You want to present each of them several positive integers. You want to prese(...TRUNCATED)	{ "input": [ "7\nabacaba\n", "6\naabcfg\n" ], "output": [ "YES\n2 3\n", "NO\n" ] }	{"input":["205078485761\n","873109054817\n","518649879439\n","401021537803\n","821985629174\n","6146(...TRUNCATED)	{"input":["81\n9 4\n6 8\n6 4\n4 6\n4 8\n9 10\n0 2\n5 4\n8 9\n7 7\n10 5\n4 4\n7 8\n3 7\n2 1\n5 5\n2 7(...TRUNCATED)	2	7	{"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": [], "solution": [] }	609		2,000	0	[ "dfs and similar", "interactive", "trees" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
1470_E. Strange Permutation	"There are n cities in Berland and some pairs of them are connected by two-way roads. It is guarante(...TRUNCATED)	{ "input": [ "4 1\n1 2 3 4\n1 3\n\nSAMPLE" ], "output": [ "6 0\n" ] }	{ "input": [ "1 1\n1\n1\n1\n" ], "output": [ "0\n" ] }	{ "input": [], "output": [] }	2	10	{"language":[1,1,1,1],"solution":["for t in xrange(input()):\n n, m = map(int, raw_input().strip((...TRUNCATED)	{"language":[2,2,2,0,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)	1,374		0	0	[]	false		{ "nanos": 0, "seconds": 6 }	256,000,000
1269_B. Modulo Equality	"Bearland is a dangerous place. Limak can’t travel on foot. Instead, he has k magic teleportation (...TRUNCATED)	{"input":["3 2 998244353\n","9 3 998244353\n","3 1 998244353\n","9 4 998244353\n"],"output":["665496(...TRUNCATED)	{ "input": [], "output": [] }	{"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)	2	0	{"language":[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,2,2,2,2(...TRUNCATED)	{"language":[2,4,4,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,4,2,2,4,2,2,4,2,4,2,2,2,2,2,2,2,2,2,4,2,4,2(...TRUNCATED)	478		0	2,400	[ "brute force", "implementation" ]	false		{ "nanos": 0, "seconds": 8 }	0
p01222 Walk under a Scorching Sun	"Given is a positive integer N. How many tuples (A,B,C) of positive integers satisfy A \\times B + C(...TRUNCATED)	{ "input": [ "2\n5\n6 5 4 3 2\n5\n3 4 3 1 1" ], "output": [ "6\n5\n" ] }	{"input":["30 35 4 30\n14 2 7\n22 23 2\n5 26 3\n28 4 3\n7 5 29\n19 15 2\n11 20 12\n1 22 9\n30 21 24\(...TRUNCATED)	{"input":["4 20\n4 2 3 1\n2 2\n1 4\n2 2\n1 1\n3 3\n3 3\n1 4\n3 3\n2 2\n3 3\n4 1\n2 2\n1 4\n3 3\n3 1\(...TRUNCATED)	6	7	{"language":[4,4,4,4,4,4,4,3,3,2,4,4,4,3,3,4,2,2,4,3,3,3,4,3,1,2,2,3,1,2,4,1,1,4,2,2,4,1,3,3,4,4,4,3(...TRUNCATED)	{"language":[2,2,2,2,2,2,1,2,2,2,4,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2(...TRUNCATED)	1,304		0	3,500	[ "implementation", "math" ]	false		{ "nanos": 0, "seconds": 3 }	134,217,728
class-homework	"Valeric and Valerko missed the last Euro football game, so they decided to watch the game's key mom(...TRUNCATED)	{ "input": [ "2 2 1 0 0 1\n", "2 2 10 11 0 1\n", "2 4 3 -1 3 7\n" ], "output": [ "1", "5", "2" ] }	{"input":["1000\nspnogbxcrp\nbaukbqnmyu\nogxdxhtcwz\nbsjufplykz\nkhicdrdixl\nzookiqggel\nfczygjfhfa\(...TRUNCATED)	{"input":["100\n303\n5","100\n256\n5","100\n407\n5","100\n407\n2","100\n407\n3","100\n407\n6","100\n(...TRUNCATED)	2	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,1,1,1,1,1,1,1,1,1,1,1,1,1],"solut(...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	B	0	1,600	[ "" ]	false	"E - Disappear Drive / 消えるドライヴ\n\nStory\n\nDのひとはバスケットボールが好(...TRUNCATED)	{ "nanos": 0, "seconds": 8 }	134,217,728
464_D. World of Darkraft - 2	"Monk's birthday is coming this weekend! He wants to plan a Birthday party and is preparing an invit(...TRUNCATED)	{ "input": [ "2\n999999\n1000000", "3\n9\n99\n123" ], "output": [ "12\n1", "0\n2\n3" ] }	{"input":["85 30 123\n","100000 100000 1320777\n","94728 36278 300352\n","70386 4182 113682\n","6518(...TRUNCATED)	{"input":["4 0 1\n1 -1\n1 3\n3 3\n3 -1\n","3 0 0\n-10 1\n1 2\n1 1\n","20 -999719 -377746\n-999718 -3(...TRUNCATED)	2	10	{"language":[2,4,3,2,2,3,2,2,4,4,4,2,2,2,2,2,2,4,2,2,3,2,2,4,2,1,2,4,2,2,2,2,2,2,2,2,4,2,2,2,2,3,2,2(...TRUNCATED)	{"language":[2,4,2,2,2,3,4,2,2,2,4,1,4,2,4,1,4,2,2,2,2,2,2,4,2,2,2,2,2,2,2,4,4,2,2,4,2,2,1,2,2,2,2,2(...TRUNCATED)	1,334	E	1,000	0	[ "dp", "matrices", "sortings" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
83_C. Track	"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":["228\n1 3 1 7 1 3 1 15 1 3 1 7 1 3 1 31 1 3 1 7 1 3 1 15 1 3 1 7 1 3 1 63 1 3 1 7 1 3 1 15(...TRUNCATED)	{"input":["2 0\n","3 1\n1 2 0\n","3 3\n1 2 2 3 2\n1 1 2 3 3\n2 3 2 2 3\n","11 17\n1 2 5 3 4 1 2 10\n(...TRUNCATED)	2	0	{"language":[2,2,2,2,4,2,2,4,2,4,2,2,2,2,2,2,4,2,2,2,4,2,2,2,4,2,2,2,2,3,2,4,4,2,4,2,2,2,4,4,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	545		1,000	1,900	[ "bitmasks", "brute force", "divide and conquer", "dp", "fft", "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
colarr	"Polycarpus is sure that his life fits the description: \"first there is a white stripe, then a blac(...TRUNCATED)	{ "input": [ "4 1 2 3 4\n", "5 5 46 372 81 9\n" ], "output": [ "5 3 5 7 ", "14 51 418 453 90 " ] }	{"input":["2 3\n1 1 1\n0 1 0","2 2\n1 0\n0 1","3 3\n0 1 0\n1 0 1\n0 1 0","2 2\n0 0\n1 0","2 2\n0 1\n(...TRUNCATED)	{"input":["3\n6 5 15","3\n4 4 2","3\n4 3 1","3\n4 4 5","3\n4 8 2","3\n8 8 2","3\n4 4 1","3\n4 4 4","(...TRUNCATED)	2	0	{"language":[2,2,2,4,4,2,2,2,2,2,4,2,2,2,4,2,4,2,4,4,2,4,2,4,2,2,4,2,2,2,4,2,2,4,4,4,2,4,2,4,4,1,4,4(...TRUNCATED)	{"language":[4,4,3,3,1,1,1,3,2,4,2,3,2,4,1,3,1,4,4,2,4,4,2,1,3,2,2,4,1,2,4,2,3,4,4,3,3,4,3,3,4,2,3,4(...TRUNCATED)	593	A	0	1,400	[ "constructive algorithms", "dp" ]	false	"あなたは友人と旅行に行きたいと考えています。ところが、浪費癖のある(...TRUNCATED)	{ "nanos": 0, "seconds": 1 }	134,217,728
687_A. NP-Hard Problem	"You are given an integer sequence A of length N and an integer K. You will perform the following op(...TRUNCATED)	{ "input": [ "ppqb", "pdbq" ], "output": [ "No", "Yes" ] }	{"input":["3\n2 2 3\n","5\n1 4 5 4 5\n","4\n2 2 4 4\n","3\n1 1 2\n","4\n1 2 1 2\n","4\n4 2 2 4\n","6(...TRUNCATED)	{"input":["4 6 0\n0 1 3\n0 2 2\n2 0 1\n2 3 2\n3 0 1\n3 1 5","6 10 0\n0 2 7\n0 1 1\n0 3 5\n1 4 9\n2 1(...TRUNCATED)	2	6	{"language":[2,2,2,2,2,4,2,2,4,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,1,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0	B	2,500	1,500	[ "" ]	false		{ "nanos": 500000000, "seconds": 2 }	256,000,000