Datasets:

TheFactoryX
/

edition_0652_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
p03771 AtCoder Grand Contest 012 - Camel and Oases	"Employees of JebTrains are on their way to celebrate the 256-th day of the year! There are n employ(...TRUNCATED)	{ "input": [ "777-444---21-12-2013-12-2013-12-2013---444-777\n" ], "output": [ "13-12-2013\n" ] }	{ "input": [], "output": [] }	{ "input": [], "output": [] }	2	9	{"language":[4,3,3,4,4,3,3,3,3,2,3,3,4,2,2,3,2,4,2,3,2,3,2,1,4,4,4,3,2,3,3,2,2,3,4,2,3,4,3,4,4,3,3,4(...TRUNCATED)	{"language":[2,4,4,3,4,2,3,4,1,2,4,2,4,4,4,4,2,3,4,3,3,2,3,4,3,3,3,2,4,2,2,4,4,2,4,4,2,3,2,2,4,2,2,3(...TRUNCATED)	0		0	2,000	[ "" ]	false		{ "nanos": 0, "seconds": 6 }	256,000,000
1219_H. Function Composition	"Berland Government decided to improve relations with neighboring countries. First of all, it was de(...TRUNCATED)	{ "input": [ "3 6\n2 3 5\n", "6 7\n1 2 3 4 5 6\n" ], "output": [ "2\n", "7\n" ] }	{ "input": [], "output": [] }	{"input":["5\n3\n1 1 1\n2 2 2\n3 3 3\n4\n1 2 1 2\n2 1 2 1\n3 4 3 4\n7\n1 3 3 1 1 1 1\n2 4 4 3 2 2 4\(...TRUNCATED)	2	8	{"language":[2,2,2,4,2,2,2,4,2,2,2,1,2,2,2,2,3,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,1,2,2,2,2,1,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,0,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,081	E	0	1,600	[]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
820_A. Mister B and Book Reading	"There are n points on a coordinate axis OX. The i-th point is located at the integer point x_i and (...TRUNCATED)	{ "input": [ "5\n3\n1\n2\n3\n4\n5\n\nSAMPLE" ], "output": [ "2\n" ] }	{ "input": [], "output": [] }	{"input":["11\n1 2 3 4 5 6 7 8 9 10 11\n2\n1 4 7","11\n1 2 3 4 5 6 2 8 9 10 11\n2\n1 4 1","11\n1 2 3(...TRUNCATED)	2	11	{"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,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)	615		2,500	1,900	[ "" ]	true	"標準録画で 120 分のビデオテープがあります。テープを完全に巻き戻した(...TRUNCATED)	{ "nanos": 0, "seconds": 3 }	256,000,000
p03294 AtCoder Beginner Contest 103 - Modulo Summation	"We have N camels numbered 1,2,\\ldots,N. Snuke has decided to make them line up in a row.\n\nThe ha(...TRUNCATED)	{"input":["15\nyamatonadeshiko\n10\n1 a\n2 a\n3 a\n4 a\n5 a\n1 b\n2 b\n3 b\n4 b\n5 b\n","6\nkoyomi\n(...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":["5\neu\neq\nbd\nbe\nbdp\n\nSAMPLE","5\neu\neq\nbd\nbe\ndbp\n\nSAMQLE","5\neu\neq\nbd\nbd\n(...TRUNCATED)	6	10	{"language":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"solution":["n=int(raw_input())\nin_array=[]\nfo(...TRUNCATED)	{ "language": [], "solution": [] }	1,506		0	2,600	[ "binary search", "brute force", "dp", "greedy", "sortings" ]	false		null	256,000,000
p01086 Short Phrase	"Every day Kotlin heroes analyze the statistics of their website. For n days, they wrote out n numbe(...TRUNCATED)	{"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\n131\n123\n10 7\n-4\n-(...TRUNCATED)	{ "input": [ "1\n3 3\n1 2\n2 3\n1 3" ], "output": [ "2\n" ] }	{"input":["13372 2590 2818\n","78 28 44\n","9178 2255 2041\n","6571 10325 8965\n","6151 6148 1348\n"(...TRUNCATED)	2	9	{"language":[1,1,1],"solution":["for _ in range(input()):\n try:\n eval(raw_input())\n (...TRUNCATED)	{"language":[3,2,2,3,2,2,2,2,2,2,2],"solution":["from heapq import heappush, heappop\nINF = 10 **20\(...TRUNCATED)	846	D	1,250	1,600	[ "binary search", "brute force", "dp", "two pointers" ]	false		{ "nanos": 0, "seconds": 2 }	0
find-the-nth-prime	"There are some coins in the xy-plane. The positions of the coins are represented by a grid of chara(...TRUNCATED)	{ "input": [ "3\n0 1 1\n1 0 4\n1 4 0\n", "4\n0 1 2 3\n1 0 4 5\n2 4 0 6\n3 5 6 0\n" ], "output": [ "2", "5" ] }	{"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":["3 9 1\n2 3 8","2 1000000000 1000000000\n1 199586132","3 9 3\n1 3 7","3 9 3\n1 0 7","2 100(...TRUNCATED)	2	11	{"language":[1,4,2,3,2,2,2,4,1,2,1,3,1,2,3,3,2,4,3,3,2,2,3,4,4,4,2,1,3,3,2,2,4,1,3,2,3,3,2,4,4,3,2,2(...TRUNCATED)	{"language":[2,0,3,2,3,2,2,3,3,3,2,2,2,2,3,2,2,0,2,2,2,2,2,4,3,2,2,2,2,2,0,2,3,2,2,2,2,2,2,2,4,2,2,3(...TRUNCATED)	737	B	0	0	[ "bitmasks", "combinatorics", "dp" ]	false		null	0
p03570 CODE FESTIVAL 2017 qual C - Yet Another Palindrome Partitioning	"Sarah is a girl who likes reading books.\n\nOne day, she wondered about the relationship of a famil(...TRUNCATED)	{ "input": [ "3\n1 2 3\n", "3\n2 2 2\n", "2\n2 1\n" ], "output": [ "3\n1 2 3 \n1 2 3 ", "1\n1 1 1 \n2 ", "-1" ] }	{"input":["100\n591 417 888 251 792 847 685 3 182 461 102 348 555 956 771 901 712 878 580 631 342 33(...TRUNCATED)	{"input":["25\n91 57\n2 73\n54 57\n2 57\n23 57\n2 6\n57 54\n57 23\n91 54\n91 23\n57 23\n91 57\n54 2\(...TRUNCATED)	1	11	{"language":[3,4,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,4,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[0,0,0,0,2,0,0,2,2,1,1,0,2,4,0,2,0,0,0,0,0,0,2,2,0,0,0,2,2,2,3,2,2,2,1,3,4,2,0,2,2,0,2,2(...TRUNCATED)	331		0	1,800	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	0
5_A. Chat Server's Outgoing Traffic	"Joisino is planning to open a shop in a shopping street.\n\nEach of the five weekdays is divided in(...TRUNCATED)	{"input":["3 4\n5 6\n3 3\n2 2\n1 1\n0 0"],"output":["#.#.\n.#.#\n#.#.\n\n#.#.#.\n.#.#.#\n#.#.#.\n.#.(...TRUNCATED)	{"input":["10 7\n1 10\n2 10\n3 10\n4 10\n5 10\n1 2\n1 3\n1 4\n1 5\n1 6\n","2 2\n1 1\n1 1\n","20 12\n(...TRUNCATED)	{"input":["10803140200\n","14\n","11\n","174813966899\n","13753962\n","601828654335\n","114141413978(...TRUNCATED)	2	7	{"language":[2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,1,2,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	614		500	2,100	[ "binary search", "data structures", "divide and conquer", "greedy", "implementation" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
1110_E. Magic Stones	"Given a string s. Can you make it a palindrome by deleting exactly one character? Note that size of(...TRUNCATED)	{ "input": [ "5 3 2\naaaaa\naaa\naab" ], "output": [ "1 6" ] }	{"input":["+-+--+-+\n","+-+--+\n","+-+++-\n","+++-\n","-++-+--++--+-++-\n","-+++--\n","-+--+-\n","+-(...TRUNCATED)	{"input":["5 4","7 4","6 1","9 4","6 3","14 4","8 1","28 4","15 2","28 3","19 2","32 2","29 5","26 3(...TRUNCATED)	2	7	{"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],"solution":["#include <bits/stdc(...TRUNCATED)	{"language":[3,2,3,3,2,2,1,2,4,4,4,3,4,4,3,3,4,2,2,2,4,3,2,2,3,2,2,3,3,3,2,2,4,3,2,4,3,3,4,2,4,1,3,2(...TRUNCATED)	1,003		0	0	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
palin-pairs	"Print the circumference of a circle of radius R.\n\nConstraints\n\n* 1 \\leq R \\leq 100\n* All val(...TRUNCATED)	{ "input": [ "4 4\nDRLD\nU.UL\n.UUR\nRDDL\n", "3 5\n.D...\nRRRLL\n.U...\n" ], "output": [ "10 1\n", "6 2\n" ] }	{"input":["brtakoktrosttttttttttosafasfkalsfkodfdasiofhadfhasdsajfdsafoasodsafahaihfdisoadspapsapios(...TRUNCATED)	{"input":["9 1004498469 6\n","1 0 10\n","1944219055 33463955 1369298327\n","914835 4386500 9234739\n(...TRUNCATED)	5	9	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2],"solution":["#include <bits/stdc++.h>\nu(...TRUNCATED)	{"language":[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,3,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0		1,500	0	[]	false		{ "nanos": 0, "seconds": 2 }	256,000,000