Datasets:

TheFactoryX
/

edition_2810_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
1227_D1. Optimal Subsequences (Easy Version)	"Artem has an array of n positive integers. Artem decided to play with it. The game consists of n mo(...TRUNCATED)	{"input":["1\n-1\n0"],"output":["? 0 0\n? 536870912 0\n? 0 536870912\n? 805306368 536870912\n? 53687(...TRUNCATED)	{"input":["2\n1 10\n3\n2 2\n2 1\n1 1\n","2\n3922 3922\n3\n2 2\n2 1\n1 1\n","1\n1000000000\n1\n1 1\n"(...TRUNCATED)	{"input":["80\n72 66 82 46 44 22 63 92 71 65 5 30 45 84 29 73 9 90 25 19 26 15 12 40 33 19 85 92 91 (...TRUNCATED)	5	2	{"language":[2,3,3,2,4,1,3,2,4,2,2,3,2,3,4,4,3,3,3,4,2,3,3,2,2,3,4,2,3,2,4,3,4,2,3,4,2,2,3,2,4,4,2,3(...TRUNCATED)	{"language":[3,2,2,2,3,2,3,3,2,2,2,4,2,2,2,2,2,3,2,2,2,4,2,2,4,2,4,2,4,2,2,3,2,2,4,2,3,2,2,2,4,4,2,2(...TRUNCATED)	0	C	1,500	0	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	268,435,456
cost-of-data-11	"All of us know that girls in Arpa’s land are... ok, you’ve got the idea :D\n\nAnyone knows that(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["2 0\n","100000 0\n","8 9\n1 2\n2 3\n3 4\n4 1\n5 6\n6 7\n7 8\n8 5\n6 8\n","2 1\n1 2\n","11(...TRUNCATED)	{"input":["9 1004498469 6\n","1 0 10\n","1944219055 33463955 1369298327\n","914835 4386500 9234739\n(...TRUNCATED)	2	0	{"language":[3,3,4,2,1,3,2,3,4,3,2,4,3,3,3,3,3,3,3,1,3,3,3,1,3,2,3,2,3,3,3,1,3,1,1,1,1,4,1,3,2,3,3,3(...TRUNCATED)	{"language":[2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	331		1,250	1,700	[ "dp", "math" ]	false	{ "nanos": 0, "seconds": 5 }	1,073,741,824
p03986 AtCoder Grand Contest 005 - STring	"Sherlock Holmes and Dr. Watson played some game on a checkered board n × n in size. During the gam(...TRUNCATED)	{"input":["1.1 3.4 2.5\n","1.9 1.8 1.7\n","2.0 2.0 2.0\n"],"output":["z^y^x\n","(x^y)^z\n","x^y^z\n"(...TRUNCATED)	{"input":["46\n63 1\n63 63\n123 1\n123 123\n63 2\n63 62\n123 2\n123 122\n63 3\n63 61\n123 3\n123 121(...TRUNCATED)	{"input":["1\n474 314 18260\n","1\n315 315 553688\n","1\n316 314 52289\n","1\n516 5 6571\n","1\n402 (...TRUNCATED)	2	7	{"language":[4,2,2,2,2,2,3,4,2,4,4,2,3,4,4,2,4,2,1,2,4,2,4,2,2,4,4,2,2,2,4,4,2,4,3,4,2,4,4,3,2,1,4,2(...TRUNCATED)	{"language":[2,2,2,2,2,3,2,2,3,2,2,2,2,4,3,3,2,4,2,2,2,2,4,2,3,4,2,2,2,2,2,2,4,2,2,2,2,2,3,2,2,2,2,2(...TRUNCATED)	938	E	0	0	[ "" ]	false	{ "nanos": 0, "seconds": 8 }	1,073,741,824
70_C. Lucky Tickets	"You are given q queries in the following form:\n\nGiven three integers l_i, r_i and d_i, find minim(...TRUNCATED)	{"input":["5\n1 2\n2 3\n3 4\n4 5\n5\n1 3 1 2 2\n1 4 1 3 2\n1 4 1 3 3\n4 2 3 3 9\n5 2 3 3 9\n"],"outp(...TRUNCATED)	{"input":["48 1976\n30 97 84\n80 81 84\n41 70 86\n23 57 80\n17 60 85\n36 48 81\n51 87 81\n38 85 81\n(...TRUNCATED)	{"input":["1\n2 3 Chandu\n\nSBMPLE","1\n2 4 Chandu\n\nELPMBT","51\n8 10 Chandu\n2 2959 Daspal\n2903 (...TRUNCATED)	2	0	{"language":[1,1,1,1],"solution":["t=int(raw_input())\ndef z(x):\n i=5\n c=0\n while x/i>=1(...TRUNCATED)	{"language":[2,2,2,4,2,4,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,4,2,2,2,2,4,2,2,4,2,2,4(...TRUNCATED)	1,195		0	0	[ "data structures", "dp", "greedy", "implementation" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1129_A2. Toy Train	"You are given an array of n positive integers a_1, a_2, ..., a_n. You can perform the following ope(...TRUNCATED)	{"input":["7 13 5\n2 3 10 7\n3 5 10 10\n1 2 10 6\n4 5 10 9\n3 4 10 8\n","4 100 3\n3 3 2 5\n1 1 3 2\n(...TRUNCATED)	{"input":["919536000 993098880\n","691200 583200\n","5 1000000000\n","100 10\n","537814642 537814642(...TRUNCATED)	{"input":["aaaa b","dcba cb","aa`a a","dcac dc","a``a a","b abab","aaaa c","dcba bc","b baba","aaa` (...TRUNCATED)	5	9	{"language":[1,1],"solution":["import sys\ndef numberToBase(n, b):\n temp=''\n while n:\n (...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	C	2,500	2,500	[ "implementation", "math" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
bogosort	"You have a Petri dish with bacteria and you are preparing to dive into the harsh micro-world. But, (...TRUNCATED)	{ "input": [ "4\n6 6 5 5\n", "5\n1 2 3 1 3\n", "4\n6 6 4 4\n" ], "output": [ "0", "4", "-8" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	3	8	{"language":[2,4,4,2,2,2,2,4,2,4,2,4,2,2,2,4,4,2,4,4,2,2,2,2,2,2,2,2,2,4,2,4,2,4,4,2,2,2,2,4,2,2,2,4(...TRUNCATED)	{"language":[1,2,2,2,2,3,2,4,2,1,2,4,2,3,4,2,2,3,3,3,4,2,4,2,2,2,2,3,2,1,4,2,2,2,2,4,2,1,2,2,2,4,4,2(...TRUNCATED)	188		0	2,100	[]	true	{ "nanos": 0, "seconds": 2 }	0
76_B. Mice	"You are given the array a consisting of n elements and the integer k ≤ n.\n\nYou want to obtain a(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["2\n1 1 3 1\n3\n0 1 2\n"],"output":[" (...TRUNCATED)	{"input":["1 3 0\n6 1 4\n","21 6 635\n3 4 2 1 7 7\n","3 7 20012\n1 1 1 1 1 2 10000\n","1 5 44\n2 19 (...TRUNCATED)	6	8	{"language":[2,2,2,2,2,2,4,4,4,2,4,2,1,4,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2,4,2,4,2,4,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,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,0,2,2,2,0,0,2,4,2,2,3,2(...TRUNCATED)	621	G	2,500	0	[ "greedy", "implementation" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1382_A. Common Subsequence	"This is an interactive task.\n\nDasha and NN like playing chess. While playing a match they decided(...TRUNCATED)	{"input":["3 3\n1 2 1\n2 3 1\n1 3 5","100 0","10 3\n8 7 100\n7 9 100\n9 8 100","3 3\n1 2 1\n2 3 1\n1(...TRUNCATED)	{"input":["3\n1 2 3\n3 2\n2\n","3\n84 30 9\n9 84\n9\n","4\n1 5 7 8\n1 5 7\n1 5\n","3\n796067435 9646(...TRUNCATED)	{"input":["3 313 856 964 421\n","3 3 1 11 9\n","2 2 9 8 1\n","61 538 623 89 548\n","7 202 512 995 37(...TRUNCATED)	6	0	{"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,4,4,3,2,4,4,4,3,2,2,2,4,4,3,3,3,2,2,4,4,4,2,3,3,2,2,2,4,2,3,3,3,2,4,4,3,3,4,4,2,2(...TRUNCATED)	1,081	F	2,000	2,000	[ "games", "math" ]	false	{ "nanos": 0, "seconds": 1 }	268,435,456
p00447 Searching Constellation	"Yesterday Oz heard a story about insect colony. The specialty of insects is that they splits someti(...TRUNCATED)	{"input":["4 5\n1 2 3 1\n2 1 2 8\n2 3 4 7\n1 1 3 3\n2 3 4 8\n","4 5\n1 2 3 1\n2 1 2 8\n2 3 4 7\n1 1 (...TRUNCATED)	{ "input": [], "output": [] }	{"input":["42 28\n7 19\n15 24\n3 42\n18 5\n32 27\n26 20\n40 30\n35 2\n14 8\n22 8\n36 4\n16 14\n21 29(...TRUNCATED)	2	0	{"language":[3,2,2,4,3,4,4,3,3,3,2,1,1,2,3,2,4,4,3,4,3,4,3,2,3,4,1,3,1,3,3,3,1,2,3,1,2,4,3,4,1,3,3,3(...TRUNCATED)	{"language":[2,0,2,2,2,2,0,2,4,2,2,2,0,0,2,2,2,2,2,2,2,0,2,2,2,2,2,2,0,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0		1,250	0	[ "greedy", "implementation", "sortings" ]	false	{ "nanos": 0, "seconds": 2 }	268,435,456
p03725 AtCoder Grand Contest 014 - Closed Rooms	"Everybody knows that we have been living in the Matrix for a long time. And in the new seventh Matr(...TRUNCATED)	{ "input": [ "3\n4\n", "5\n10\n", "101\n99\n" ], "output": [ "1", "9", "2" ] }	{"input":["9\n72 49 39 50 68 35 75 94 56\n","4\n2 3 1 2\n","8\n3 4 3 1 1 3 4 1\n","1\n4\n","7\n2 1 2(...TRUNCATED)	{"input":["202763616\n","1778707511\n","181182141\n","1438\n","55068349\n","324423196\n","339071627\(...TRUNCATED)	2	0	{"language":[1,1,1,1],"solution":["def func(s,val):\n\tcfc=0\n\tx=0\n\tlength=len(s)\n\tfor i in ran(...TRUNCATED)	{"language":[4,2,4,3,4,3,2,2,3,3,2,4,4,3,3,4,4,4,2,2,2,4,3,3,2,3,2,4,3,3,1,2,4,4,3,3,3,2,3,2,2,4,4,4(...TRUNCATED)	1,149	D	2,000	2,500	[ "" ]	false	{ "nanos": 500000000, "seconds": 1 }	64,000,000