Datasets:

TheFactoryX
/

edition_1325_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
p03943 AtCoder Beginner Contest 047 - Fighting over Candies	"You might have heard about our new goodie distribution program aka the \"Laddu Accrual System\". Th(...TRUNCATED)	{"input":["5 1 5\n0\n3 3 3 3 3\n","4 3 4\n1 2 3\n1 10 100 1000\n","7 4 3\n2 4 5 6\n3 14 15\n","6 2 3(...TRUNCATED)	{"input":["49 749442\n8888888\n8888888\n8888888\n5777777\n5777777\n5777777\n5777777\n5777777\n577777(...TRUNCATED)	{"input":["5\n0 968804136\n0 736567537\n2 343136264\n0 259899572\n1 103950505\n","5\n0 51690939\n0 6(...TRUNCATED)	6	11	{"language":[3,3,3,1,2,3,1,4,3,4,3,2,3,2,4,4,3,4,1,1,1,3,3,3,3,1,3,1,1,4,4,3,3,4,4,4,4,3,4,3,4,3,3,1(...TRUNCATED)	{"language":[2,4,0,2,2,2,2,2,2,3,2,2,4,3,3,2,2,3,3,3,2,2,2,2,2,2,2,3,3,0,3,2,3,3,2,2,0,2,3,2,2,3,2,2(...TRUNCATED)	1,227		0	1,000	[ "bitmasks", "brute force", "fft", "strings", "trees" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1096_E. The Top Scorer	"In a mystical TimeLand, a person's health and wealth is measured in terms of time(seconds) left. \n(...TRUNCATED)	{"input":["5\n4 5\n10 8 6 4\n1 2 3 4 5\n1 1\n3\n3\n1 1\n3\n2\n5 3\n1000 2 2 2 3\n3 1 5\n5 5\n1 2 3 4(...TRUNCATED)	{"input":["8587340257\n","9\n","81\n","27\n","1408514752349\n","25\n","49380563\n","266418\n","31975(...TRUNCATED)	{"input":["4 4","1 15","2 4","2 15","3 0","2 26","3 -1","2 32","0 -1","1 32","0 -2","1 17","-1 -2","(...TRUNCATED)	2	10	{"language":[2,2,2,2,4,4,2,2,2,2,3,2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,1,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)	283	E	2,000	900	[ "" ]	false	"20XX年に喜多方市熱塩加納町から南会津町までの6区間、総距離58kmの会津中(...TRUNCATED)	{ "nanos": 0, "seconds": 5 }	1,073,741,824
class-homework	"Chef has a an array A consisting of N elements. He wants to add some elements into the array as per(...TRUNCATED)	{ "input": [ "3\n1 2 10\n", "2\n1 2\n" ], "output": [ "0.0740740741", "0.0000000000" ] }	{"input":["100\n04\n9\n02163\n003000\n08041479\n80750340926070052\n90056\n11680\n90\n090208090090209(...TRUNCATED)	{"input":["5 2 4 15\nhhhwh\n","2 8 5 1000000000\nwh\n","1 3 3 3\nw\n","10 2 3 32\nhwwhwhwwhh\n","7 1(...TRUNCATED)	5	10	{"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,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,4,2,0,2,2,4,2,2,2,2,2,4,2,2,2,2,0,2,2,2],"solution":["#include <bits/(...TRUNCATED)	1,003	E	0	0	[ "*special", "implementation" ]	false		{ "nanos": 0, "seconds": 1 }	0
38_C. Blinds	"You are given two arrays of integers a_1,…,a_n and b_1,…,b_m.\n\nYour task is to find a non-emp(...TRUNCATED)	{"input":["2 10\n0 0\n10000 0","4 50\n0 10000\n1 10000\n2 0\n10000 0","5 10\n0 0\n10 10\n20 0\n30 10(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3\nnxx","3\nnwx","3\nxxo","3\nxwn","3\nowx","3\npxx","3\npyx","3\npzx","3\npzw","3\npwz",(...TRUNCATED)	2	10	{"language":[2,2,2,2,4,2,2,4,4,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,4,2,2,2,4,2,2(...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)	0	F	500	0	[ "bitmasks", "dp" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
331_E2. Deja Vu	"A permutation — is a sequence of length n integers from 1 to n, in which all the numbers occur ex(...TRUNCATED)	{"input":["5\n10 20 30 40 50\n1 1 1 1 1\n","8\n4264 4921 6321 6984 2316 8432 6120 1026\n4264 4921 63(...TRUNCATED)	{"input":["3\n230967221047542071272908186525868331398921682471308664253988778356539397562182960087 1(...TRUNCATED)	{"input":["36\n2 2 2 8 9 4 8 5\n9 1 7 6 10 6 9 3\n10 2 4 6 6 2 1 1\n9 6 2 3 5 7 7 3\n6 6 3 9 10 9 1 (...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": [], "solution": [] }	626	D	0	0	[ "" ]	true		{ "nanos": 0, "seconds": 8 }	256,000,000
188_G. Array Sorting	"In the town of Aalam-Aara (meaning the Light of the Earth), previously there was no crime, no crimi(...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":["264193194 -448876521 736684426 -633906160 -328597212 -47935734\n","-357531221 381512519 -(...TRUNCATED)	{"input":["4 3\n1 3 2 7","4 4\n1 3 2 4","4 4\n1 0 2 4","4 3\n1 3 2 8","2 4\n1 3 2 4","4 4\n1 -1 2 4"(...TRUNCATED)	2	9	{"language":[2,3,2,4,3,4,3,4,4,3,3,2,2,4,3,4,4,4,2,4,2,2,4,3,3,3,3,2,3,1,4,3,3,2,4,2,4,2,4,2,3,3,3,2(...TRUNCATED)	{"language":[3,2,3,2,2,2,2,2,4,2,4,2,2,2,4,2,2,4,2,2,4,2,3,3,2,3,4,2,2,4,4,2,2,2,2,2,1,4,4,2,4,2,2,2(...TRUNCATED)	272		1,750	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	512,000,000
1421_B. Putting Bricks in the Wall	"ZS the Coder has drawn an undirected graph of n vertices numbered from 0 to n - 1 and m edges betwe(...TRUNCATED)	{"input":["5 18 1000\n","132 10 35\n","48 132 235\n","2 2 1\n"],"output":["-1","5 7\n","22 111","1 1(...TRUNCATED)	{"input":["12-12-201312-12-201312-12-201313--12-201313--12-201313--12-201313--12-201313--12-201313--(...TRUNCATED)	{"input":["2\n1\n3\n\n\nSAMPLE","2\n2\n3\n\n\nSBMPLE","2\n2\n2\n\n\nELPMBS","2\n4\n2\n\n\nELPMBS","2(...TRUNCATED)	2	9	{"language":[3,3,3,3,3,3,3,3,3,3,2,3,3,3,1,3,3,3,3,3,3,3,3,3,3,3,4,3,3,3,3,3,3,1,3,3,1,3,3,3,4,3,3,3(...TRUNCATED)	{"language":[2,2,2,2],"solution":["#include <bits/stdc++.h>\nint main() {\n std::priority_queue<std(...TRUNCATED)	990		2,000	1,600	[ "" ]	false		{ "nanos": 0, "seconds": 8 }	256,000,000
friendless-dr-sheldon-cooper-14	"Yesterday Oz heard a story about insect colony. The specialty of insects is that they splits someti(...TRUNCATED)	{"input":["5\n7\n1\n9\n7\n3\n","10\n100\n1\n100\n1\n100\n1\n100\n1\n100\n1\n"],"output":["1 3 7 7 9 (...TRUNCATED)	{"input":["188\n762\n","352\n445\n","596\n777\n","1000\n999\n","1000\n2\n","773\n70\n","1\n1000\n","(...TRUNCATED)	{"input":["14 2 2012","14 4 2012","14 4 1177","20 4 1177","20 4 1433","20 3 1433","14 3 1433","14 3 (...TRUNCATED)	2	10	{"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":[4,2,1,4,3,3,4,3,3,2,2,4,3,4,1,4,1,2,2,4,4,4,2,2,3,1,3,4,3,3,2,2,4,3,4,4,2,2,1,3,4,4,4,3(...TRUNCATED)	0	A	1,500	2,100	[ "binary search", "math", "sortings" ]	false		{ "nanos": 0, "seconds": 3 }	256,000,000
151_C. Win or Freeze	"problem\n\nIf you write a positive integer in decimal notation (without leading 0) and look at the (...TRUNCATED)	{ "input": [ "3\n25\n46\n99" ], "output": [ "2\n1\n2\n" ] }	{"input":["15\n0 1\n1 2\n2 3\n3 4\n4 5\n5 6\n6 7\n7 8\n8 9\n9 10\n10 11\n11 12\n12 13\n13 14\n14 0\n(...TRUNCATED)	{"input":["4\n3 3\n1 2\n2 3\n3 1\n3 6\n1 2\n2 1\n2 3\n3 2\n1 3\n3 1\n7 10\n1 2\n2 3\n3 1\n1 4\n4 5\n(...TRUNCATED)	6	1	{ "language": [], "solution": [] }	{"language":[2,2,0,2,1,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,0,2,2,2,2,2,2,2,0,2,2,2(...TRUNCATED)	662	G	1,500	1,800	[]	false		{ "nanos": 0, "seconds": 2 }	134,217,728
give-me-my-test-monk	"Continuing from previous version of codeXplod series i.e. CodeXplod 1.0,Chandu and daspal are still(...TRUNCATED)	{"input":["4 4\n1 2\n3 2\n3 4\n1 3","15 28\n10 7\n5 9\n2 13\n2 14\n6 1\n5 12\n2 10\n3 9\n10 15\n11 1(...TRUNCATED)	{"input":["1\n9\n>>>>>>>><\n","13\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\n1\n>\(...TRUNCATED)	{"input":["4","6","3","7","5","8","4","3","5","6","8","7"],"output":["aaaa\naaab\naaba\naabb\naabc\n(...TRUNCATED)	5	0	{"language":[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,3,2,4,2,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED)	{"language":[3,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,2,2,2,2,2,2,2,2(...TRUNCATED)	0	E	250	1,000	[ "implementation", "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000