Datasets:

TheFactoryX
/

edition_0577_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	time_limit dict	memory_limit_bytes int64 0 1.07B
174_E. Ancient Berland Hieroglyphs	"We have N integers. The i-th number is A_i.\n\n\\\\{A_i\\\\} is said to be pairwise coprime when GC(...TRUNCATED)	{"input":["2\n2 9\n","3\n3 12 6\n","7\n2 1000000000 4 6 8 4 2\n","6\n13 52 0 13 26 52\n"],"output":[(...TRUNCATED)	{"input":["99 100 100 100 100\n","57 83 11 4 93\n","99 99 99 99 99\n","100 0 0 0 0\n","0 1 2 3 4\n",(...TRUNCATED)	{"input":["2\nca\nbc\n","2\ndc\nce\n","2\nza\nzb\n","2\nab\nb\n","25\nsw\nwt\nc\nl\nyo\nag\nz\nof\np(...TRUNCATED)	3	10	{"language":[2,3,2,3,2,4,3,2,3,2,3,4,3,2,3,3,3,4,2,4,2,2,2,3,4,4,2,2,1,3,2,3,1,4,3,2,4,2,4,2,2,4,3,3(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,4,2,4,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	990		1,500	2,300	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	0
1219_H. Function Composition	"You are given a sequence of n integers a1, a2, ..., an. \n\nDetermine a real number x such that the(...TRUNCATED)	{ "input": [ "AprilFool\n14\n" ], "output": [ "AprILFooL" ] }	{"input":["1.0 200.0 200.0\n","0.2 0.1 0.6\n","1.9 3.0 4.1\n","51.8 51.8 7.1\n","113.9 125.2 88.8\n"(...TRUNCATED)	{"input":["1\n7\n.......\n.*.....\n.......\n.......\n.......\n.......\n.......\n\nSAMQLE","1\n5\n...(...TRUNCATED)	5	10	{"language":[2,1,3,4,1,4,1,4,2,3,4,2,4,1,2,3,2,2,4,3,2,4,2,2,2,4,4,3,2,4,4,4,4,1,1,3,2,2,2,4,1,4,1,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,043		0	0	[ "greedy", "implementation", "math", "ternary search" ]	false	null	268,435,456
p03943 AtCoder Beginner Contest 047 - Fighting over Candies	"Step up and down\n\nKazuki, commonly known as Kerr, who attends JAG University, was invited by your(...TRUNCATED)	{ "input": [ "3 2\n3\n1 2 1\n2 3 2\n3 3 1" ], "output": [ "1" ] }	{"input":["1 10\n1\n","10 1\n-1 1 1 1 1 1 1 1 1 1\n","78 8\n-230 -757 673 -284 381 -324 -96 975 249 (...TRUNCATED)	{"input":["3\n230967221047542071272908186525868331398921682471308664253988778356539397562182960087 3(...TRUNCATED)	2	0	{"language":[1],"solution":["# your code goes here\nfrom sys import stdin, stdout\nt = int(stdin.rea(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,4,3,2,2,3,2,2,2,2,2,2,2,2,4,3,2,2,2,2,1,2,4,2,2,2,2,2,4,2,2,3,1(...TRUNCATED)	309		1,000	0	[ "binary search", "bitmasks", "combinatorics", "data structures", "divide and conquer" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
512_B. Fox And Jumping	"Hilbert's Hotel is a very unusual hotel since the number of rooms is infinite! In fact, there is ex(...TRUNCATED)	{"input":["5 10\n-5 0 10 -11 0\n","5 10\n-1 5 0 -5 3\n","3 4\n-10 0 20\n"],"output":["2\n","0\n","-1(...TRUNCATED)	{"input":["1\n5 39\n1 2\n3 4\n5 6\n7 8\n1 9\n3 10\n3 11\n5 12\n5 13\n7 14\n7 15\n9 2\n10 2\n11 2\n12(...TRUNCATED)	{"input":["1 1\n-1\n","5 1\n-3 -2 -1 0 0\n","7 1\n-7 ? ? ? ? ? 2\n","3 2\n-5 ? 0\n","7 4\n-10 0 ? 1 (...TRUNCATED)	6	7	{"language":[1,1,1,1,1,1,1,1,1,1,1],"solution":["def gcd(x,y):\n if y==0: return x\n else: ret(...TRUNCATED)	{"language":[2,2,2,4,4,2,2,2,4,2,2,4,4,4,2,4,1,4,2,2,1,4,4,2,2,2,2,2,2,4,4,4,2,2,2,3,4,2,1,2,4,2,4,4(...TRUNCATED)	153		1,750	0	[ "data structures" ]	false	{ "nanos": 500000000, "seconds": 0 }	536,870,912
157_A. Game Outcome	"You are given an integer x represented as a product of n its prime divisors p_1 ⋅ p_2, ⋅ … (...TRUNCATED)	{"input":["9 3 23\n9 3 22\n10 3 28\n16 10 107\n20 8 102\n20 10 105\n20 10 155\n3 4 3\n4 2 11\n0 0 0"(...TRUNCATED)	{"input":["10 20 10 5\n","20 1 2 3\n","7 2 2 2\n","25 10 5 10\n","999 999 899 299\n","10000 5000 0 5(...TRUNCATED)	{ "input": [], "output": [] }	2	12	{"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,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)	0	B	2,500	0	[ "binary search", "greedy", "math" ]	false	{ "nanos": 0, "seconds": 3 }	256,000,000
650_B. Image Preview	"The black king is standing on a chess field consisting of 109 rows and 109 columns. We will conside(...TRUNCATED)	{ "input": [ "1\n2 3 Chandu\n\nSAMPLE" ], "output": [ "Daspal\n" ] }	{ "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)	5	0	{"language":[1,1,1,1,1,1,1,1,1,1,1,1],"solution":["for _ in xrange(input()):\n\tn,c,m=map(int,raw_in(...TRUNCATED)	{"language":[4,3,2,2,4,2,3,3,4,2,2,3,2,2,4,2,2,4,3,2,3,4,3,4,2,2,2,3,3,2,4,2,3,2,3,4,4,3,4,4,4,4,3,2(...TRUNCATED)	614		1,000	1,100	[ "brute force", "implementation", "strings" ]	false	{ "nanos": 0, "seconds": 8 }	256,000,000
737_A. Road to Cinema	"There are n cows playing poker at a table. For the current betting phase, each player's status is e(...TRUNCATED)	{"input":["4\n1000000000 1000000\n1000000000 1000000\n100000000 1000000\n1000000000 1000000\n","3\n9(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["100 1 7\n83\n174\n191\n145\n167\n55\n232\n157\n51\n209\n85\n73\n216\n39\n72\n76\n132\n70\(...TRUNCATED)	3	0	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,2],"solution":["#include<cmath>\n#include<queue>\(...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)	1,413		1,500	0	[ "combinatorics", "math", "number theory" ]	false	{ "nanos": 0, "seconds": 1 }	1,073,741,824
p02741 Panasonic Programming Contest 2020 - Kth Term	"Imagine that you are the CEO of a big old-fashioned company. Unlike any modern and progressive comp(...TRUNCATED)	{ "input": [ "CANDY", "SOLVING" ], "output": [ "AND", "LVI" ] }	{"input":["997 6 680633279\n","989 8 990767311\n","999 2 750160753\n","1 4 904448911\n","1000 3 7501(...TRUNCATED)	{"input":["202763616\n","1778707511\n","181182141\n","1438\n","55068349\n","324423196\n","339071627\(...TRUNCATED)	2	0	{"language":[3,3,2,2,4,3,1,1,4,3,2,3,1,2,2,4,2,2,4,2,4,2,2,4,1,2,2,1,1,4,4,2,2,2,1,4,3,1,1,4,4,3,4,1(...TRUNCATED)	{"language":[2,2,2,0,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,0,0,0,2,0,2,2,2,2,0,2,2,0,2,2,0,2,2,2,2,0,2,0,2,2(...TRUNCATED)	760	A1	0	0	[ "data structures", "dfs and similar", "dp", "trees" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
p02365 Minimum-Cost Arborescence	"You are given an equation A * X + B * Y = C, A, B, C are positive integer coefficients, X and Y are(...TRUNCATED)	{"input":["3 2\n? 1 2\n","5 1\n-10 -9 ? -7 -6\n","5 3\n4 6 7 2 9\n"],"output":["0 1 2\n","-10 -9 -8 (...TRUNCATED)	{"input":["1\n1\n","100\n98 52 63 2 18 96 31 58 84 40 41 45 66 100 46 71 26 48 81 20 73 91 68 76 13 (...TRUNCATED)	{"input":["5 6\n#.##\n.##.\n#...\n..##\n...#","13 27\n......#.........#.......#..\n...#.....###..\n.(...TRUNCATED)	6	7	{"language":[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,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,0,0,0,3,2,2,0,4,0,1,2,0,3,1,0,2,0,2,2,2,4,2,0,0,0,4,2,0,2,0,2,0,2,4,3,0,3,2,3,4,0,0(...TRUNCATED)	1,301	C1	1,000	2,600	[ "data structures", "string suffix structures" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
proposal	"Leonard has decided to quit living with Dr. Sheldon Cooper and has started to live with Penny. Yes,(...TRUNCATED)	{"input":["10 6\n10 10 10 6 6 5 5 5 3 1\n2 3 50\n2 4 10\n1 3 10\n2 2 36\n1 4 7\n2 2 17\n"],"output":(...TRUNCATED)	{"input":["919536000 993098880\n","691200 583200\n","5 1000000000\n","100 10\n","537814642 537814642(...TRUNCATED)	{"input":["21\n11 19 4 19 6 0 13 7 6 2 5 3 16 16 1 9 15 21 9 21 2\n","100\n57 85 27 81 41 27 73 10 7(...TRUNCATED)	6	0	{"language":[2,2,2,2,4,2,2,2,4,4,4,2,4,4,2,2,4,2,4,4,2,2,4,4,2,2,2,2,4,2,4,4,2,2,2,2,2,2,2,4,2,4,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	776		1,750	1,800	[]	true	null	512,000,000