Datasets:

TheFactoryX
/

edition_0496_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
868_A. Bark to Unlock	"Bosky is a very curious child who turned 13 yesterday. His parents gifted him a digital watch which(...TRUNCATED)	{ "input": [ "2\n5\n5", "3\n1\n4\n3" ], "output": [ "5\n5", "4\n3\n4" ] }	{ "input": [], "output": [] }	{"input":["10 4\n0 1 4 2 3 0 10 0 5 8\n","6 3\n0 0 1 0 4 5\n","6 1\n0 0 4 0 6 0\n","4 1\n0 1 0 0\n",(...TRUNCATED)	2	8	{"language":[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,4,4,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[4,3,2,4,4,3,4,2,2,4,3,2,4,2,2,2,2,4,4,4,2,4,2,4,3,3,4,4,2,4,4,2,2,4,2,2,4,4,2,2,3,3,4,2(...TRUNCATED)	0	D	2,500	0	[]	false		{ "nanos": 0, "seconds": 3 }	0
366_D. Dima and Trap Graph	"You can't possibly imagine how cold our friends are this winter in Nvodsk! Two of them play the fol(...TRUNCATED)	{ "input": [ "7 4\n4 2 3 1 2 4 3\n", "4 3\n2 1 3 1\n" ], "output": [ "18\n", "5\n" ] }	{"input":["5 3\n","1500 2000\n","500 1000\n","1000 1000\n","5 5\n","2000 2\n","1000 500\n","3 1000\n(...TRUNCATED)	{"input":["1\n1 3311995\n","1\n1000001000 1\n","10\n588 12\n560 10\n593 14\n438 15\n761 11\n984 6\n5(...TRUNCATED)	2	9	{"language":[4,3,1,3,2,2,4,2,4,2,4,2,3,2,3,2,2,3,3,2,3,3,2,3,4,2,2,4,3,2,4,2,3,2,3,2,2,4,4,3,2,3,2,3(...TRUNCATED)	{ "language": [], "solution": [] }	0	C	0	1,500	[]	true		{ "nanos": 0, "seconds": 2 }	256,000,000
442_C. Artem and Array	"BigData Inc. is a corporation that has n data centers indexed from 1 to n that are located all over(...TRUNCATED)	{ "input": [ "3 2\n2 1 2\n1 3\n", "7 3\n3 1 3 7\n2 2 5\n2 4 6\n" ], "output": [ "1\n", "10\n" ] }	{"input":["50 5000\n2 35 46\n2 43 92\n2 16 88\n2 67 99\n2 36 93\n2 12 20\n2 33 96\n2 55 82\n2 18 32\(...TRUNCATED)	{"input":["100\n95 54 23 27 51 58 94 34 29 95 53 53 8 5 64 32 17 62 14 37 26 95 27 85 94 37 85 72 88(...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,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"sol(...TRUNCATED)	{"language":[2,2,2,2],"solution":["#include <bits/stdc++.h>\nint main() {\n std::priority_queue<std(...TRUNCATED)	643	A	500	2,200	[ "" ]	false		{ "nanos": 0, "seconds": 1 }	268,435,456
p00206 Next Trip	"George is getting tired of the decimal number system. He intends to switch and use the septenary ((...TRUNCATED)	{"input":["3\n3 3 4\n3 3 5\n3 3 3\n"],"output":["**\n.\n\n\n\n.\n...\n\n*\n.\n*.\n\n(...TRUNCATED)	{ "input": [ "1 1 2 1 1\n2 1\n" ], "output": [ "0\n" ] }	{"input":["1\n3 3\n1 2\n3 3\n1 3","1\n2 3\n0 0\n2 -1\n0 1\n\nSANPLE","1\n3 3\n1 2\n2 3\n1 3\n\nELPMA(...TRUNCATED)	1	0	{"language":[2,2,4,4,2,2,2,2,2,2,4,4,4,4,2,2,2,2,2,2,2,4,2,2,2,4,4,4,4,4,4,2,4,2,2,2,2,4,4,4,4,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	0	K	2,500	0	[ "" ]	false	"あなたは友人と旅行に行きたいと考えています。ところが、浪費癖のある(...TRUNCATED)	{ "nanos": 0, "seconds": 1 }	256,000,000
p00035 Is it Convex?	"Professor Sharma gives the following problem to his students: given two integers X( ≥ 2) and Y( (...TRUNCATED)	{ "input": [ "2\nxa\nay\n", "2\nab\ncd\n", "3\naab\nbcb\nbac\n" ], "output": [ "FIRST\n", "DRAW\n", "DRAW\n" ] }	{"input":["20 10000000\n8861863 2169292 3484361 511558 5975675 1413584 774309 5847326 6668965 253146(...TRUNCATED)	{"input":["3\nnxx","3\nnwx","3\nxxo","3\nxwn","3\nowx","3\npxx","3\npyx","3\npzx","3\npzw","3\npwz",(...TRUNCATED)	2	12	{"language":[4,1,4,3,3,3,3,4,3,2,3,2,3,3,3,3,4,3,2,3,3,2,2,2,2,2,3,4,3,4,2,1,4,3,2,2,2,3,2,4,3,2,3,3(...TRUNCATED)	{"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)	0	B	0	0	[ "dp", "games" ]	false		{ "nanos": 0, "seconds": 2 }	1,073,741,824
248_A. Cupboards	"Today Peter has got an additional homework for tomorrow. The teacher has given three integers to hi(...TRUNCATED)	{ "input": [ "5\n2\n3\n4\n5\n6", "11\n7\n8\n9\n10\n11\n12\n13\n14\n15\n16\n17" ], "output": [ "3", "4" ] }	{ "input": [], "output": [] }	{"input":["10\n-405 -230 252 -393 -271 -259 97 163 81 -129\n","10\n1 10 2 9 6 8 4 7 5 6\n","4\n1 2 5(...TRUNCATED)	2	7	{"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,4,2,2,1,4,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	E2	0	2,200	[ "dfs and similar", "graphs", "hashing", "shortest paths" ]	false		{ "nanos": 0, "seconds": 3 }	0
p01123 Let's Move Tiles!	"Tavas is a cheerleader in the new sports competition named \"Pashmaks\".\n\n<image>\n\nThis competi(...TRUNCATED)	{"input":["1\n7\n.......\n.*.....\n.......\n.......\n.......\n.......\n.......\n\nSAMPLE"],"output":(...TRUNCATED)	{"input":["1000\n999001\n999002\n999003\n999004\n999005\n999006\n999007\n999008\n999009\n999010\n999(...TRUNCATED)	{"input":["3\n6 5 15","3\n4 4 2","3\n4 3 1","3\n4 4 5","3\n4 8 2","3\n8 8 2","3\n4 4 1","3\n4 4 4","(...TRUNCATED)	1	0	{"language":[4,2,2,2,2,4,2,4,2,2,2,2,4,4,4,2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,4,4,4,4,2,2,2,2,2,4,2,2(...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	F	0	1,300	[]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
560_D. Equivalent Strings	"In the rush of modern life, people often forget how beautiful the world is. The time to enjoy those(...TRUNCATED)	{ "input": [ "56 25 31", "10 30 20", "30 30 100" ], "output": [ "Yes", "Yes", "No" ] }	{"input":["20\n9 4 8\n10 6 7\n4 6 0\n7 7 6\n3 3 10\n4 2 1\n4 4 0\n2 0 0\n8 8 7\n3 1 7\n3 10 7\n1 7 3(...TRUNCATED)	{"input":["1\n1\n3\n2\n","3\n1 1 2\n1 0 3\n1 1 4\n","3\n1 1 101\n1 2 1\n1 2 1\n","8\n148933105 19040(...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,1,1,1,1,1,1,1,1,1,1,1,1],"solution":["for(...TRUNCATED)	{"language":[4,2,2,4,2,2,2,2,2,2,2,4,2,4,4,4,4,2,2,2,2,2,4,2,2,2,2,4,2,4,2,2,2,2,2,2,2,2,2,2,4,2,2,4(...TRUNCATED)	0	A	0	2,200	[ "dp" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
699_F. Limak and Shooting Points	"You are given a tree (a graph with n vertices and n - 1 edges in which it's possible to reach any v(...TRUNCATED)	{"input":["47\nS 10\nS 11\nS 12\nS 13\nH 1\nH 2\nS 6\nS 7\nS 8\nS 9\nH 6\nH 8\nH 9\nH 10\nH 11\nH 4\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1\n5 3\n200 12 9","1\n9 3\n200 12 9","1\n7 3\n200 12 9","1\n7 3\n141 12 9","1\n9 0\n141 1(...TRUNCATED)	5	0	{"language":[2,4,4,4,4,4,4,2,4,4,2,2,4,4,3,3,1,4,4,3,2,2,3,4,4,2,2,4,4,4,4,2,2,4,2,2,2,2,2,2,2,4,2,4(...TRUNCATED)	{"language":[2,2,3,2,2,2,2,2,4,4,4,2,4,2,4,2,2,3,2,2,2,2,2,2,4,4,2,3,2,2,4,2,2,2,2,2,2,3,2,4,4,2,2,4(...TRUNCATED)	0		1,000	1,100	[ "brute force", "combinatorics", "dp", "string suffix structures" ]	false		{ "nanos": 0, "seconds": 1 }	0
188_G. Array Sorting	"PowerShell had N natural numbers. He wanted to test Xenny's speed in finding the sum and difference(...TRUNCATED)	{ "input": [ "2008 2 29\n2015 3 1", "1999 9 9\n2001 11 3" ], "output": [ "8", "3" ] }	{"input":["9\n53 80 94 41 58 49 88 24 42\n85 11 32 64 40 56 63 95 73\n17 85 60 41 13 71 54 67 87\n38(...TRUNCATED)	{"input":["2\n1 222168095\n1000000000 1000000000\n","35\n1 7\n3 11\n6 12\n7 6\n8 5\n9 11\n15 3\n16 1(...TRUNCATED)	5	10	{"language":[3,4,4,2,2,4,2,4,4,2,4,2,4,2,4,3,2,1,3,2,3,3,2,4,3,3,3,3,2,3,3,2,3,4,2,2,3,2,4,4,4,3,3,2(...TRUNCATED)	{ "language": [], "solution": [] }	0	E1	0	0	[ "brute force", "sortings" ]	true		null	256,000,000