Datasets:

TheFactoryX
/

edition_2492_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
1525_D. Armchairs	"Disclaimer: there are lots of untranslateable puns in the Russian version of the statement, so ther(...TRUNCATED)	{ "input": [ "56 25 31", "10 30 20", "30 30 100" ], "output": [ "Yes", "Yes", "No" ] }	{"input":["qH\n2\n","nifzlTLaeWxTD\n0\n","WlwbRjvrOZakKXqecEdlrCnmvXQtLKBsy\n5\n","LiqWMLEULRhW\n1\n(...TRUNCATED)	{"input":["9\ndo\nhte\nbest\nand\nenjoy\ntoday\nat\nacm\nicpc\n14\noh\nyes\nby\nfar\nit\nis\nwow\nso(...TRUNCATED)	2	8	{"language":[2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,4,4,2,2,2,2,2,2,2,4,4,4,2,2,4,2,4,2],"solut(...TRUNCATED)	{"language":[2,2,2,2,2,2,2,2,2,2,0,2,2,4,2,1,0,0,2,2,4,2,2,2,2,2,2,2,4,0,2,2,2,2,0,1,2,2,2,2,2,0,2,4(...TRUNCATED)	1,170	C	500	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	134,217,728
1012_B. Chemical table	"There are N oases on a number line. The coordinate of the i-th oases from the left is x_i.\n\nCamel(...TRUNCATED)	{ "input": [ "1\n2 3 Chandu\n\nSAMPLE" ], "output": [ "Daspal\n" ] }	{"input":["997 6 680633279\n","989 8 990767311\n","999 2 750160753\n","1 4 904448911\n","1000 3 7501(...TRUNCATED)	{"input":["5\n2 8 1 7 9\n","4\n6 2 4 5\n","3\n3 1 3\n","200\n2 1 1 1 2 1 2 1 1 1 2 1 2 2 2 1 1 2 1 2(...TRUNCATED)	2	0	{"language":[2,3,2,2,2,2,2,4,2,2,2,2,4,2,2,2,2,2,2,3,2,4,2,4,2,3,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,1,2(...TRUNCATED)	{"language":[3,4,3,3,2,3,3,3,3,2,3,3,4,2,2,2,2,4,3,3,2,4,2,3,4,2,4,4,2,3,2,3,4,2,4,2,2,4,3,2,3,2,2,4(...TRUNCATED)	0	B	2,000	0	[ "dfs and similar", "graphs" ]	false		{ "nanos": 0, "seconds": 6 }	256,000,000
765_D. Artsem and Saunders	"Julia is conducting an experiment in her lab. She placed several luminescent bacterial colonies in (...TRUNCATED)	{"input":["3\n3 0 2 5\n1 1 1 6\n3 2 1 10\n1 -2 3 6\n2\n1 2\n3 3\n1\n2\n3\n0\n3 0 2 5\n1 1 1 6\n3 2 1(...TRUNCATED)	{"input":["72\n909 34\n420 51\n621 76\n65 48\n82 41\n665 53\n43 33\n309 21\n942 51\n156 13\n997 11\n(...TRUNCATED)	{"input":["3\n12 2\n200\n50\n300\n110","3\n17 2\n200\n73\n300\n110","3\n12 2\n200\n50\n599\n100","3\(...TRUNCATED)	1	2	{"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":[1,2,2,2,2,2,2,2,4,4,2,4,2,2,4,2,4,2,2,2,2,4,4,2,3,2,4,2,2,2,4,2,2,2,3,4,4,2,2,2,4,4,4,3(...TRUNCATED)	604	D	0	2,200	[ "greedy" ]	false		{ "nanos": 0, "seconds": 1 }	0
playing-with-substrings	"Tree is a connected acyclic graph. Suppose you are given a tree consisting of n vertices. The verte(...TRUNCATED)	{"input":["1\n7\n.......\n.*.....\n.......\n.......\n.......\n.......\n.......\n\nSAMPLE"],"output":(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["xxoo\no.oo\nx...\nx..x\n","oo.x\nxo.o\nxx.o\n.oxx\n","xo..\nxo.x\no.xo\nxoox\n","..ox\n..(...TRUNCATED)	5	11	{"language":[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,2,2,2,2,2,4,2,2,2,2(...TRUNCATED)	{"language":[2,4,4,3,4,2,3,2,2,4,4,1,2,1,2,4,3,4,3,3,4,3,1,3,2,4,2,3,3,3,3,2,4,3,2,3,3,4,2,2,3,4,4,2(...TRUNCATED)	1,297		0	2,300	[ "" ]	false	"\n\n問題\n\nAORイカちゃんはテストに合格するため勉強しています。\n\nAORイ(...TRUNCATED)	{ "nanos": 0, "seconds": 3 }	256,000,000
battle-of-stalingrad-1	"Chouti was tired of the tedious homework, so he opened up an old programming problem he created yea(...TRUNCATED)	{"input":["5\n5 7\n5 3 2 1 4\n2 1 1 2 1\n1 3\n2\n1\n5 10\n2 3 2 3 2\n1 2 1 2 1\n4 10\n5 1 3 4\n1 2 1(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["50\n16 4\n17 9\n31 19\n3 10\n8 1\n40 30\n3 31\n20 29\n47 27\n22 25\n32 34\n12 15\n40 32\n(...TRUNCATED)	2	10	{"language":[4,4,2,1,2,2,2,2,4,2,2,4,2,4,2,2,2,4,4,4,4,4,3,2,4,2,2,4,4,2,2,2,2,2,2,4,2,2,4,2,2,4,2,2(...TRUNCATED)	{"language":[2,2,3,3,2,2,2,2,0,3,2,2,2,3,2,2,2,3,3,3,2,3,2,3,2,0,2,3,2,4,0,3,3,3,0,2,4,3,2,3,3,2,1,0(...TRUNCATED)	455	E	0	0	[ "binary search", "brute force", "dp", "two pointers" ]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
p00676 KND is So Sexy	"You have two friends. You want to present each of them several positive integers. You want to prese(...TRUNCATED)	{ "input": [ "3 2 0 2\n0 1 3\n2 5\n" ], "output": [ "1\n" ] }	{"input":["7\n576460752303423487 2\n82 9\n101 104\n10 21\n31 10\n0 1\n10 30\n","1\n12881797281728299(...TRUNCATED)	{"input":["2\n1 1 6 1\n3\n0 1 2\n","2\n2 0 4 3\n4\n1 2 0 2\n","2\n1 1 6 2\n3\n0 1 2\n","2\n2 0 4 6\n(...TRUNCATED)	2	10	{ "language": [], "solution": [] }	{ "language": [], "solution": [] }	643		500	0	[ "implementation" ]	false		{ "nanos": 0, "seconds": 1 }	536,870,912
p00206 Next Trip	"In this problem you will meet the simplified model of game King of Thieves.\n\nIn a new ZeptoLab ga(...TRUNCATED)	{ "input": [ "AprilFool\n14\n" ], "output": [ "AprILFooL" ] }	{"input":["7 2\n-10 0 ? 1 ? 2 10\n","1 1\n0\n","5 1\n-3 -2 -1 0 1\n","7 1\n-4 ? ? ? ? ? 2\n","17 1\n(...TRUNCATED)	{"input":["78 78\n-645462 -187679 693035 927066 431506 16023 -173045 698159 -995400 -687770 -747462 (...TRUNCATED)	2	10	{"language":[2],"solution":["#include <algorithm>\n#include <cassert>\n#include <climits>\n#include (...TRUNCATED)	{"language":[2,2,4,2,2,2,2,2,2,2,4,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(...TRUNCATED)	1,269	A	2,500	2,600	[ "greedy", "sortings" ]	false		{ "nanos": 0, "seconds": 1 }	512,000,000
1354_F. Summoning Minions	"Today Peter has got an additional homework for tomorrow. The teacher has given three integers to hi(...TRUNCATED)	{"input":["5 4\n#.##\n.##.\n#...\n..##\n...#","13 27\n......#.........#.......#..\n...#.....###..\n.(...TRUNCATED)	{ "input": [ "1\n3 3\n1 2\n2 3\n1 3" ], "output": [ "2\n" ] }	{"input":["1\n3\nS10\n111\n00F\n","1\n5\nS0000\n10000\n00000\n00000\n0000F\n","1\n3\nS10\n110\n11F\n(...TRUNCATED)	1	0	{"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": [], "solution": [] }	656	D	0	0	[ "brute force", "math", "number theory" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
anuwta	"Problem Description\n\nGiven a list of integers, find and display all even numbers from the end of (...TRUNCATED)	{"input":["1 8\n2 8 81\n","2 30\n20 30 80\n3 9 85\n","4 319\n63 79 89\n79 97 91\n75 87 88\n75 90 83\(...TRUNCATED)	{"input":["4\n1 4\n3 1\n3 4\n","5\n4 1\n4 3\n5 3\n2 4\n","21\n7 15\n13 1\n14 3\n4 10\n2 3\n16 18\n17(...TRUNCATED)	{"input":["5\n3\n1 1\n1 1\n1 1\n3\n1 1\n1 1\n1 1\n3\n1 1\n1 1\n1 1\n3\n1 2\n1 1\n1 1\n3\n1 100\n1 1\(...TRUNCATED)	2	0	{"language":[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,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	{"language":[2,2,2,3,3,4,2,3,3,3,2,3,3,2,3,3,0,2,3,2,2,2,0,2,3,2,0,2,2,0,2,2,2,3,3,2,3,2,2,2,3,3,0,2(...TRUNCATED)	309	A	0	0	[ "brute force", "implementation" ]	false		{ "nanos": 0, "seconds": 1 }	512,000,000
716_D. Complete The Graph	"Pink Floyd are pulling a prank on Roger Waters. They know he doesn't like [walls](https://www.youtu(...TRUNCATED)	{"input":["3 4 3 10\n3\n3 1 4\n4 5 9\n3 10 10\n","1 1 2 10\n2\n1 1 3\n2 6 10\n","5 7 6 11\n3\n5 3 8\(...TRUNCATED)	{"input":["384\n87 78 16 94 36 87 93 50 22 63 28 91 60 64 27 41 27 73 37 12 69 68 30 83 31 63 24 68 (...TRUNCATED)	{"input":["30\n16 3\n-334 -500 -169 -724 -478 -358 -962 -464 -705 -145 -281 -827 -961 -491 -995 -942(...TRUNCATED)	2	10	{ "language": [], "solution": [] }	{"language":[3,3,3,2,3,2,3,2,4,2,2,3,3,4,4,3,2,2,4,3,2,3,2,2,4,2,2,4,2,3,2,2,2,2,2,2,2,2,4,2,2,3,2,4(...TRUNCATED)	268	C	0	0	[ "math" ]	true	"うさぎがある電車のチケットをn 枚持っている. チケットにはそれぞれ0 か(...TRUNCATED)	{ "nanos": 0, "seconds": 3 }	64,000,000