Datasets:

TheFactoryX
/

edition_0514_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
nopc10	"Little Petya likes arrays of integers a lot. Recently his mother has presented him one such array c(...TRUNCATED)	{ "input": [ "2\n2 1\n5 4\n3 2\n1 0 2\n\nSAMPLE" ], "output": [ "9\n1\n" ] }	{ "input": [], "output": [] }	{"input":["3\n6 13 24","3\n6 4 30","3\n12 11 12","3\n6 20 24","3\n6 7 30","3\n11 20 24","3\n10 7 30"(...TRUNCATED)	1	11	{"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":[4,3,3,1,2,4,2,2,3,3,4,3,4,3,2,2,4,3,3,3,4,2,2,2,4,3,2,2,3,3,4,4,4,1,1,4,1,1,1,3,2,4,2,1(...TRUNCATED)	1,216		0	1,900	[ "implementation" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1497_D. Genius	"Vasya is currently at a car rental service, and he wants to reach cinema. The film he has bought a (...TRUNCATED)	{ "input": [ "5\n1 2 0\n1 3 0\n3 5 0\n3 4 0\n5\n3\n4\n1\n3\n4\n" ], "output": [ "3\n2\n3\n3\n2\n" ] }	{"input":["0 1073741823\n","10 5\n","16384 36739846\n","727373493 346368330\n","62914844 1044381411\(...TRUNCATED)	{"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)	2	17	{"language":[2,3,4,2,4,2,4,2,2,3,1,2,3,4,4,4,4,4,3,4,3,4,1,4,1,1,4,3,3,4,3,4,3,3,1,2,3,4,4,2,3,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	392		0	0	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	512,000,000
925_E. May Holidays	"Two coordinates (a1, a2) and (b1, b2) on a two-dimensional grid of r × c are given. The cost of mo(...TRUNCATED)	{ "input": [ "3 2 1\n", "3 2 2\n", "4 2 2\n" ], "output": [ "2\n", "4\n", "4\n" ] }	{ "input": [], "output": [] }	{"input":["3\n1000000000 1000000000 11000000\n","3\n2 2 1\n","3\n2 10 11\n","5\n1000010000 5 5 4 4\n(...TRUNCATED)	2	8	{"language":[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,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,4,2,3,2,4,2,3,4,3,3,2,2,4,2,3,4,2,2,3,3,3,1,4,4,3,4,4,2,1,2,1,2,3,2,2,4,3,2,2,3,2,1,2(...TRUNCATED)	0	B	500	1,300	[ "*special" ]	false	{ "nanos": 0, "seconds": 5 }	256,000,000
1470_E. Strange Permutation	"Sherlock Holmes loves mind palaces! We all know that.\n\nA mind palace, according to Mr. Holmes is (...TRUNCATED)	{"input":["10 3 409693891\n","65 4 177545087\n","5 2 433416647\n"],"output":["2\n","910726\n","1\n"](...TRUNCATED)	{"input":["5\n10 50\n10 50\n10 50\n10 50\n10 50\n","2\n10000 10000\n10000 10000\n","3\n10000 10000\n(...TRUNCATED)	{"input":["605 297 -440074875 -366763764 -445828791 325081312\n","14 9 44 1 -50 -9\n","16 17 -260784(...TRUNCATED)	5	8	{"language":[2,3,2,3,2,4,3,2,3,2,3,4,3,2,3,3,3,4,2,4,2,2,2,3,4,4,2,2,1,3,2,3,1,4,3,2,4,2,4,2,2,4,3,3(...TRUNCATED)	{"language":[2,2,2,2,2,4,2,2,4,4,2,2,2,2,2,2,1,4,2,2,4,2,2,2,2,2,2,2,4,2,2,2,3,2,2,2,3,2,3,2,2,2,2,2(...TRUNCATED)	0	A	0	2,300	[ "brute force", "math" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
754_B. Ilya and tic-tac-toe game	"You are given a permutation of the numbers 1, 2, ..., n and m pairs of positions (aj, bj).\n\nAt ea(...TRUNCATED)	{ "input": [ "2\n1\n2" ], "output": [ "2\n5\n" ] }	{ "input": [ "1\n999838675\n" ], "output": [ "-1\n" ] }	{"input":["6 8\nabbaab\n+ 1 a\n+ 3 a\n+ 3 a\n+ 1 b\n+ 2 b\n+ 3 b\n- 1\n+ 2 z\n","6 8\nabdabc\n+ 2 a\(...TRUNCATED)	3	9	{"language":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,3,4,2,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,4,2(...TRUNCATED)	867	D1	500	2,400	[ "brute force", "implementation", "strings" ]	false	{ "nanos": 0, "seconds": 1 }	512,000,000
p03343 AtCoder Regular Contest 098 - Range Minimum Queries	"Everybody knows that Balázs has the fanciest fence in the whole town. It's built up from N fancy s(...TRUNCATED)	{ "input": [ "3", "100", "1000000" ], "output": [ "3", "473", "13969985" ] }	{ "input": [], "output": [] }	{"input":["3\n1 4\n-1 1\n2 -1","10\n3 2\n3 2\n-1 1\n2 -1\n-3 -6\n-8 12\n7 7\n8 1\n8 2\n8 4","3\n2 4\(...TRUNCATED)	6	8	{"language":[3,4,3,2,2,3,3,1,3,4,2,4,1,3,3,1,1,3,3,2,1,3,2,4,2,3,3,1,3,2,2,2,3,3,1,2,3,4,4,4,3,4,3,3(...TRUNCATED)	{"language":[2,2,2,2,2,2,1,2,2,2,4,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2(...TRUNCATED)	1,027		0	1,400	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	268,435,456
1451_D. Circle Game	"We have a string s consisting of lowercase English letters. Snuke is partitioning s into some numbe(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["36 102 73 101 19\n5 9 2 2 6\n4 13\n","119 0 0 0 0\n2 0 0 0 0\n5 5\n","0 0 119 0 0\n0 0 2 (...TRUNCATED)	{"input":["6\n0 1 3 2 2 2\n","4\n0 2 1 1\n","4\n3 1 1 0\n","4\n1 2 1 0\n","6\n0 0 0 2 1 1\n","4\n1 1(...TRUNCATED)	2	7	{"language":[2,2,2,4,4,3,4,2,2,4,3,2,2,2,2,2,1,4,2,2,2,2,2,2,2,4,4,4,4,4,4,4,4,4,2,2,2,4,2,2,2,4,4,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,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(...TRUNCATED)	914	D	0	2,500	[ "data structures" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
195_A. Let's Watch Football	"Don't put up with what you're sick of! The Smart Beaver decided to escape from the campus of Beaver(...TRUNCATED)	{ "input": [ "2\nSHILPA\nAAMIR\nMATT\nDENISE" ], "output": [ "ENEMIES\nLOVE" ] }	{ "input": [], "output": [] }	{"input":["13372 2590 2818\n","78 28 44\n","9178 2255 2041\n","6571 10325 8965\n","6151 6148 1348\n"(...TRUNCATED)	2	8	{"language":[2,2,3,2,4,4,2,2,1,4,2,2,4,2,4,4,3,3,3,3,4,3,1,4,4,1,3,2,4,4,4,3,3,2,3,2,3,2,3,3,3,3,4,4(...TRUNCATED)	{"language":[2,4,2,2,2,3,4,2,2,2,4,1,4,2,4,1,4,2,2,2,2,2,2,4,2,2,2,2,2,2,2,4,4,2,2,4,2,2,1,2,2,2,2,2(...TRUNCATED)	530	A	750	0	[ "data structures", "trees" ]	true	{ "nanos": 0, "seconds": 1 }	134,217,728
p03616 AtCoder Regular Contest 082 - Sandglass	"Dima and Inna love spending time together. The problem is, Seryozha isn't too enthusiastic to leave(...TRUNCATED)	{"input":["3 8\n10 20\n0 0\n20 40\n300 600\n30 60\n170 340\n50 100\n28 56\n90 180\n-4 -8\n-1 -2\n","(...TRUNCATED)	{"input":["5\n\n3 2 2\n2 0\n0 5\n\n4 3 2\n2 0 5\n0 6\n\n0 2 2\n1 0\n2 3\n\n5 4 4\n6 0 8 0\n0 7 0 9\n(...TRUNCATED)	{"input":["3\n1 0 6\n","10\n7 7 7 7 7 7 7 7 7 3\n","76\n13 13 5 6 20 20 6 1 18 18 13 15 20 3 9 11 3 (...TRUNCATED)	5	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,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)	0		1,000	0	[ "brute force", "data structures", "implementation" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
cdva1502	"There are five people playing a game called \"Generosity\". Each person gives some non-zero number (...TRUNCATED)	{ "input": [ "10 5 5 5\n", "3 0 0 2\n" ], "output": [ "9\n", "0\n" ] }	{"input":["xkbvkadjec gqjlhxpnsx 10\n2 7 1 0 0\n2 5 8 0 0\n4 7 8 0 4\n0 4 7 3 6\n5 5 9 3 7\n7 9 5 0 (...TRUNCATED)	{"input":["12 11\n11 12\n25 7\n","12 17\n6 19\n13 16\n","9 12\n3 17\n10 20\n","2 4\n1 3\n3 3\n","3 7(...TRUNCATED)	2	10	{"language":[1,1,1,1,1,1,1,1,1,1,1,1],"solution":["for _ in xrange(input()):\n\tn,c,m=map(int,raw_in(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,0,2,2,2,0,3,2,2,3,2,4,0,2,2,2,2,0,2,2,2,2,4,2,2,2,2,2,0,2,2,2,2,2,2,3,2,2(...TRUNCATED)	0	D	500	1,000	[ "" ]	false	{ "nanos": 0, "seconds": 2 }	1,073,741,824