Datasets:

TheFactoryX
/

edition_0557_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
1466_C. Canine poetry	"In one well-known algorithm of finding the k-th order statistics we should divide all elements into(...TRUNCATED)	{ "input": [ "10 5 5 5\n", "3 0 0 2\n" ], "output": [ "9\n", "0\n" ] }	{ "input": [], "output": [] }	{"input":["4\n6\na b c d\nA\nThomas a\nd d\ned edgars\nal Adams\n1\nTurnipHeadJohnson\n3\na a a a a (...TRUNCATED)	5	9	{"language":[3,2,3,4,3,2,3,3,3,2,3,2,2,2,3,3,4,3,3,2,4,3,2,3,3,2,2,3,3,2,4,3,4,2,4,2,4,2,2,2,3,4,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,328		0	1,500	[ "binary search", "brute force", "dp", "greedy", "sortings" ]	true	{ "nanos": 0, "seconds": 2 }	268,435,456
class-homework	"We have N balance beams numbered 1 to N. The length of each beam is 1 meters. Snuke walks on Beam i(...TRUNCATED)	{ "input": [ "5 10\n2 1 2 1 2\n2\n2 4\n4 5\n" ], "output": [ "3\n3\n" ] }	{ "input": [], "output": [] }	{"input":["10\n1000 910\n94625 95469 92038 95916 93405 95533 97004 92469 99853 94992 90361 99819 932(...TRUNCATED)	2	7	{"language":[2,3,2,2,4,3,3,3,3,4,4,4,3,4,2,3,3,2,3,3,2,4,3,3,3,2,2,1,3,3,3,3,4,3,1,4,3,3,3,2,3,2,3,3(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,1,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,4,2,2,2,2,2(...TRUNCATED)	1,199	A1	500	0	[ "geometry", "math" ]	false	{ "nanos": 0, "seconds": 4 }	0
1088_D. Ehab and another another xor problem	"Problem\n\nTomorrow is finally the day of the excursion to Maizu Elementary School. Gatcho, who att(...TRUNCATED)	{"input":["6 4\n2 2 5 5 6 6\n1 3\n2 4\n3 5\n4 6\n","3 3\n314 159 265\n1 2\n1 3\n3 2\n","4 2\n2 1 1 5(...TRUNCATED)	{"input":["10 20 11\nisnr u eq qas gcj rnnf fpb c dz g\n","10 4 3\nuzu bl fl ou uist j lp e gkp fmo\(...TRUNCATED)	{"input":["1 16\n1\n","10 1\n-1 1 1 0 1 1 1 1 1 1\n","78 8\n-230 -757 673 -284 381 -324 -96 975 249 (...TRUNCATED)	2	10	{"language":[1,1,1,1],"solution":["for t in xrange(input()):\n n, m = map(int, raw_input().strip((...TRUNCATED)	{"language":[4,2,3,3,4,4,2,3,3,2,2,4,4,3,3,2,3,4,2,4,2,3,3,1,2,2,2,3,3,4,2,4,3,4,2,2,2,4,2,4,1,3,4,4(...TRUNCATED)	178	C	1,000	0	[ "implementation" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
1490_G. Old Floppy Drive	"You are given an integer sequence A of length N and an integer K. You will perform the following op(...TRUNCATED)	{"input":["2\n1 2\n1 2\n","4\n100 42\n42 100\n5 42\n100 5\n","3\n1 2\n2 4\n3 4\n"],"output":["0\n","(...TRUNCATED)	{"input":["20\n...............\n","97\n*..*.......**......................(...TRUNCATED)	{"input":["777 20\n","110 4\n","12 4\n","500 2\n","11 4\n","1 8\n","26 11\n","91 4\n","20 4\n","123 (...TRUNCATED)	5	10	{"language":[1,1],"solution":["'''\n# Read input from stdin and provide input before running code\n\(...TRUNCATED)	{ "language": [], "solution": [] }	5	D	3,000	0	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
691_D. Swaps in Permutation	"A smile house is created to raise the mood. It has n rooms. Some of the rooms are connected by door(...TRUNCATED)	{"input":["5\n4\n1 2 3 4\n5 10 15 20\n4\n1 2 1 2\n5 10 15 20\n4\n2 2 4 1\n2 8 19 1\n2\n1 1\n6 9\n1\n(...TRUNCATED)	{ "input": [ "5\n1 14\n1 50\n4 28\n5 700\n3 147" ], "output": [ "1\n10\n3\n32491\n739" ] }	{"input":["2\n2\n2 1\n1\n6","2\n2\n2 2\n1\n8","2\n2\n4 2\n1\n6","2\n1\n2 1\n1\n1","2\n3\n3 2\n1\n8",(...TRUNCATED)	3	11	{"language":[2,2,2,2,2,2,4,2,2,4,4,2,4,2,2,2,2,2,2,2,2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,4,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,4,2,2,2(...TRUNCATED)	0	A	2,000	0	[ "" ]	true	null	268,435,456
1216_D. Swords	"The King of a little Kingdom on a little island in the Pacific Ocean frequently has childish ideas.(...TRUNCATED)	{"input":["3\n3 3\n1 -3 4\n1 5 2\n2 2\n-2 0\n1 2\n2 2\n0 1\n1 2\n"],"output":["\n0 6 2 \n-1 -1 \n1 3(...TRUNCATED)	{"input":["+-+--+-+\n","+-+--+\n","+-+++-\n","+++-\n","-++-+--++--+-++-\n","-+++--\n","-+--+-\n","+-(...TRUNCATED)	{"input":["5\n42665793 93310343 856080769 176604645 248258165\n10\n1 5 141156007\n2 5 5 3\n2 4 4 2\n(...TRUNCATED)	2	0	{ "language": [], "solution": [] }	{"language":[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,4,2,2,2,2,2,2,4,2,2,4,2,4,2,2,2,2,2(...TRUNCATED)	0	B	0	2,200	[ "constructive algorithms", "dfs and similar", "dp" ]	false	null	512,000,000
pcsc1	"There is new delicious item in Chef's menu - a doughnut chain. Doughnuts connected successively in (...TRUNCATED)	{"input":["21\n\n7\n\n17\n\n15\n\n17\n\n11\n\n-1\n\n15\n\n"],"output":["+ 12 16\n\n- 6 10\n\n* 8 15\(...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 29 33 19 85 92 91 (...TRUNCATED)	{"input":["48 1976\n30 97 84\n80 81 84\n41 70 45\n23 57 80\n17 60 85\n36 48 81\n51 87 81\n38 85 81\n(...TRUNCATED)	3	9	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include<bits/stdc++.h>\nusing namespace std;(...TRUNCATED)	{"language":[2,3,2,4,4,1,4,2,3,4,2,2,4,2,2,4,1,2,2,4,3,2,4,2,3,1,4,4,4,2,1,3,1,2,2,4,3,2,2,2,4,1,2,2(...TRUNCATED)	0		1,250	1,500	[ "dfs and similar", "graphs" ]	false	{ "nanos": 0, "seconds": 2 }	268,435,456
963_B. Destruction of a Tree	"Phoenix is trying to take a photo of his n friends with labels 1, 2, ..., n who are lined up in a r(...TRUNCATED)	{"input":["2 7 10\n3 12 10\n5 16 8\n","4 8 10\n0 12 3\n1 1 0\n0 3 11\n1 6 9\n","3 10 10\n0 12 10\n1 (...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":["30 1\n19 20 10 21 9 1 20 21 30 12 25 25 2 1 10 3 19 12 18 12 30 18 22 1 18 18 30 30 12\n"(...TRUNCATED)	2	9	{"language":[2,4,4,2,3,4,4,4,4,2,2,3,4,3,3,3,3,3,4,2,2,4,3,3,4,3,2,3,4,2,3,3,2,3,3,4,3,3,2,2,3,4,3,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,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,2,2,2,2,2,2,2,4(...TRUNCATED)	1,208	B	0	0	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
909_D. Colorful Points	"Imagine a game played on a line. Initially, the player is located at position 0 with N candies in h(...TRUNCATED)	{ "input": [ "3\nAFI\n", "6\nAFFAAA\n" ], "output": [ "1", "4" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	3	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,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	478		500	0	[ "constructive algorithms", "math" ]	false	{ "nanos": 0, "seconds": 5 }	256,000,000
digital-numbers	"Sita loves chocolate and Ram being his boyfriend wants to give Sita as many chocolates as he can. S(...TRUNCATED)	{"input":["3 1 4\n","2 2 10\n","5 5 16808\n","1 4 10\n"],"output":["Stas\n\n","Masha\n\n","Masha\n\n(...TRUNCATED)	{"input":["3\nAZAMON APPLE\nAZAMON AAAAAAAAAAALIBABA\nAPPLE BANANA\n"],"output":["AAZMON\n---\nAEPLP(...TRUNCATED)	{"input":["50 100\n3 24 49\n2 10 12\n1 87 92\n2 19 60\n2 53 79\n3 65 82\n3 10 46\n1 46 86\n2 55 84\n(...TRUNCATED)	3	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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0	E	0	2,000	[ "constructive algorithms", "graphs", "greedy", "sortings" ]	false	{ "nanos": 0, "seconds": 2 }	0