Datasets:

TheFactoryX
/

edition_0975_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
20_B. Equation	"You are given three sequences: a_1, a_2, …, a_n; b_1, b_2, …, b_n; c_1, c_2, …, c_n.\n\nFor e(...TRUNCATED)	{ "input": [ "3\n1 2 3\n", "5\n5 4 3 2 1\n" ], "output": [ "0 0 0\n", "0 1 3 6 10\n" ] }	{ "input": [], "output": [] }	{"input":["1 100000 100000 110000 -100000\n","46456 -250 -23623 -98302 -99305\n","10 6 3 7 2\n","1 -(...TRUNCATED)	2	7	{"language":[2,2,2,2,2,2,4,4,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,2,4,2(...TRUNCATED)	{"language":[4,3,1,4,1,4,3,2,2,2,4,3,3,2,4,3,2,2,2,2,4,4,2,2,2,4,2,3,4,4,2,3,3,2,3,4,3,3,2,4,2,2,3,4(...TRUNCATED)	867		2,750	1,000	[ "" ]	false	"太郎君はかけざんを習いたての小学生です。なんとなく、彼はかけざんを(...TRUNCATED)	{ "nanos": 0, "seconds": 4 }	256,000,000
235_A. LCM Challenge	"Problem\n\nKND is a student programmer at the University of Aizu. There are N towns around his town(...TRUNCATED)	{"input":["5\nAJMP\naB23d\nE\n86AE\nAM\n6\nJPEM\nWaEaETC302Q\nCP\nrTurnAGundam1isdefferentf"],"outpu(...TRUNCATED)	{"input":["qH\n2\n","nifzlTLaeWxTD\n0\n","WlwbRjvrOZakKXqecEdlrCnmvXQtLKBsy\n5\n","LiqWMLEULRhW\n1\n(...TRUNCATED)	{"input":["2\n1 20\n","10\n450661 128600 993228 725823 293549 33490 843121 528432 556169 448234\n","(...TRUNCATED)	2	7	{"language":[3,4,4,3,3,1,2,3,2,2,3,2,3,2,3,1,4,3,4,3,4,3,3,4,4,2,2,3,2,2,3,2,2,4,3,2,4,3,4,4,2,2,3,3(...TRUNCATED)	{"language":[3,2,2,4,1,2,2,2,2,4,4,2,2,2,4,4,2,3,2,1,2,2,2,4,4,2,4,2,2,1,2,2,2,2,2,2,2,2,2,4,2,2,2,2(...TRUNCATED)	0	E	1,000	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	268,435,456
1402_A. Fancy Fence	"Frank explained its friend Felman the algorithm of Euclides to calculate the GCD \nof two numbers. (...TRUNCATED)	{ "input": [ "4 1\n1 2 3 4\n1 3\n\nSAMPLE" ], "output": [ "6 0\n" ] }	{ "input": [], "output": [] }	{"input":["10\n100000000 200000000 300000000 28 500000000 600000000 700000000 800000000 900000000 10(...TRUNCATED)	2	0	{"language":[2,2,4,2,4,3,4,4,2,2,3,1,4,3,3,2,3,3,2,4,2,4,2,2,2,3,3,3,3,3,3,2,4,3,2,2,3,2,2,4,3,4,4,4(...TRUNCATED)	{"language":[2,2,2,4,2,4,2,2,4,2,2,2,2,4,2,4,2,2,2,4,2,2,2,4,2,2,2,4,2,4,4,2,2,3,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	348		0	0	[ "constructive algorithms", "dp" ]	false		{ "nanos": 0, "seconds": 3 }	134,217,728
634_C. Factory Repairs	"Golu is given a task of clearing coins fallen down on floor. Naughty being his modus operandi, he (...TRUNCATED)	{ "input": [ "3 5 35\n", "3 35 5\n" ], "output": [ "2\n5 4\n10 1\n", "0\n" ] }	{"input":["26\n0.98 0.64 0.06 0.90 0.01 0.73 0.21 0.98 0.65 1.00 0.87 0.85 0.01 0.06 0.65 0.00 0.65 (...TRUNCATED)	{"input":["3\n2 3\n3 6\n1 2\n3\n2 3\n3 5\n2 2\n0","3\n2 3\n3 6\n2 2\n3\n3 3\n3 6\n2 2\n0","3\n2 1\n3(...TRUNCATED)	2	0	{"language":[1,3,4,3,4,4,3,1,3,2,1,2,3,4,3,2,1,1,4,4,3,3,3,3,4,2,3,3,4,3,1,2,3,3,4,3,3,3,2,2,4,3,4,4(...TRUNCATED)	{"language":[0,2,2,0,2,3,2,3,4,0,3,2,2,2,2,2,2,3,0,2,0,2,3,4,0,2,2,0,2,2,2,2,2,2,3,0,3,2,2,0,0,2,2,2(...TRUNCATED)	0		1,500	0	[]	false		{ "nanos": 0, "seconds": 4 }	256,000,000
851_B. Arpa and an exam about geometry	"Alice had a permutation p_1, p_2, …, p_n. Unfortunately, the permutation looked very boring, so s(...TRUNCATED)	{ "input": [ "3 2 0 2\n0 1 3\n2 5\n" ], "output": [ "1\n" ] }	{ "input": [], "output": [] }	{"input":["2 7\n4\n2\n1\n0\n-1\n-2\n-4\n131\n137\n2 7\n4\n2\n1\n0\n-1\n-2\n-4\n124\n123\n10 7\n-4\n-(...TRUNCATED)	2	0	{"language":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"solution":["def gcd(a,b):\n\tif b==0:\n(...TRUNCATED)	{ "language": [], "solution": [] }	0		3,000	1,900	[]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
once-upon-a-time-in-time-land	"PowerShell had N natural numbers. He wanted to test Xenny's speed in finding the sum and difference(...TRUNCATED)	{ "input": [ "5 3 \n1 2 3 4 5\n2 1 5\n1 2 5\n2 1 5" ], "output": [ "9 \n10" ] }	{"input":["51\n882889888888689888850888388887688788888888888858888\n","55\n7271714707719515303911625(...TRUNCATED)	{"input":["1\n656 281\n","1\n666 760\n","2\n10 4\n1 5\n","1\n33993 6\n","1\n1656 9\n","1\n1425 1777\(...TRUNCATED)	2	0	{"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)	{"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)	0		1,000	0	[ "*special" ]	false		{ "nanos": 0, "seconds": 5 }	256,000,000
1253_F. Cheap Robot	"Let's denote a function \n\n<image>\n\nYou are given an array a consisting of n integers. You have (...TRUNCATED)	{"input":["5 2 1\n0.1 0.2 0.3 0.4 0.5\n6 2 2\n0.1 0.2 0.3 0.4 0.5 0.6\n0 0 0"],"output":["0.01\n0.00(...TRUNCATED)	{"input":["777 2\n","2 2\n","99900 1\n","50000 1\n","2 5\n","100000 99\n","22222 22\n","100000 4\n",(...TRUNCATED)	{"input":["10 23\n6 9 8 10 4 3 7 1 5 2\n7 2\n3 2\n2 4\n2 6\n7 5\n6 4\n10 7\n7 1\n6 8\n6 2\n8 10\n3 5(...TRUNCATED)	6	10	{"language":[2,2,2,2,2,2],"solution":["#include <stdio.h>\n#include <stdlib.h>\n#include <assert.h>\(...TRUNCATED)	{ "language": [], "solution": [] }	519		0	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
687_A. NP-Hard Problem	"Little Petya likes arrays of integers a lot. Recently his mother has presented him one such array c(...TRUNCATED)	{ "input": [ "6\n2 3 1 3 2 4\n2\n1 0 4\n2 3 5\n\nSAMPLE" ], "output": [ "2\n-1" ] }	{ "input": [], "output": [] }	{"input":["1","0010","11011010001001","11001010001001","11001000001001","1010","01001000101000","110(...TRUNCATED)	2	0	{"language":[3,3,3,3,4,4,2,3,3,3,4,3,3,2,1,3,3,3,2,1,3,4,4,4,2,3,4,4,3,4,3,4,2,3,3,3,4,1,2,2,3,3,3,1(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,3,2,4,2,2,2,4,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	F	0	0	[ "combinatorics", "data structures", "sortings" ]	false		{ "nanos": 0, "seconds": 1 }	1,073,741,824
133_D. Piet	"Chef has a an array A consisting of N elements. He wants to add some elements into the array as per(...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":["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":["5 2 1\n0.1 0.2 0.3 0.5915213038191143 0.5\n6 2 2\n0.1 0.2 0.3 0.4 0.5 0.6\n0 0 0","5 2 1\(...TRUNCATED)	2	0	{"language":[2,4,2,2,2,1,2,2,4,2,2,2,4,2,2,2,4,2,4,2,2,2,4,2,2,3,3,4,2,1,2,2,4,4,4,4,2,2,1,2,2,2,2,2(...TRUNCATED)	{"language":[1,2,2,4,2,2,2,1,2,2,2,2,2,2,2,2,2,2,4,2,4,1,3,2,4,4,4,2,2,2,2,4,2,4,2,2,2,2,3,2,4,4,1,2(...TRUNCATED)	1,466	G	0	0	[ "*special", "binary search", "constructive algorithms", "interactive" ]	false		null	0
1397_C. Multiples of Length	"The blinds are known to consist of opaque horizontal stripes that can be rotated thus regulating th(...TRUNCATED)	{"input":["5 5 13 0 4\n0 1 5\n2 1 2\n3 2 3\n1 4 0\n4 3 4\n","2 1 123456789 0 1\n0 1 0\n","2 1 999999(...TRUNCATED)	{"input":["20 20\n00010110100100010111\n11110000001100101110\n01110101110001111000\n1011110100011111(...TRUNCATED)	{"input":["3\nbba\nabb\nabc\n\nSAMPLE","3\nbba\nabb\nabb\n\nSAMPLF","3\nbba\nbba\nabc\n\nSAMPLE","3\(...TRUNCATED)	2	0	{"language":[4,2,1,1,3,2,3,3,4,2,4,4,2,3,4,3,2,4,1,2,2,3,1,2,2,2,4,1,2,4,3,3,2,4,4,4,1,3,1,4,4,1,2,4(...TRUNCATED)	{"language":[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,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	B	0	3,500	[ "constructive algorithms", "graphs" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000