Datasets:

TheFactoryX
/

edition_0403_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
578_C. Weakness and Poorness	"You have a string s — a sequence of commands for your toy robot. The robot is placed in some cell(...TRUNCATED)	{ "input": [ "14 3 2012" ], "output": [ "Wednesday" ] }	{"input":["2 2 5\n","9 9 1000000000\n","3 17 999999997\n","3 3 64\n","5 1 64\n","29 2 1000000000\n",(...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 40 33 19 85 92 91 (...TRUNCATED)	2	0	{"language":[1,2,3,2,2,2,4,4,3,4,4,3,2,2,2,2,2,3,2,2,2,1,2,2,2,4,4,1,2,2,2,2,2,4,2,2,2,4,2,4,2,2,2,1(...TRUNCATED)	{"language":[4,2,2,2,2,2,2,2,2,2,2,2,3,2,4,2,2,4,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,2,2,3,2(...TRUNCATED)	1,451	C	3,000	2,000	[ "data structures", "implementation", "math" ]	false	{ "nanos": 0, "seconds": 8 }	256,000,000
500_C. New Year Book Reading	"problem\n\nChairman K is a regular customer of the JOI pizza shop in the center of JOI city. For so(...TRUNCATED)	{ "input": [ "5 3\n5 5 7 3 1\n", "4 2\n1 2 3 4\n", "2 3\n1 2\n" ], "output": [ "15\n", "8\n", "0\n" ] }	{"input":["8 10\ncwcwcwcwcw\ncrcrcrcrcr\ncwcwcwcwcw\ncrcrcrcrcr\ncwcwcwcwcw\ncrcrcrcrcr\ncwcwcwcwcw\(...TRUNCATED)	{ "input": [], "output": [] }	5	9	{"language":[4,4,2,4,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2(...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)	1,408	A2	0	1,800	[ "bitmasks", "dp", "shortest paths" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1184_B3. The Doctor Meets Vader (Hard)	"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 4\n1 2 3 4 5\n1 3 5 6\n","3 3\n1 2 3\n3 2 1\n","4 6\n1 3 5 2\n1 2 3 4 5 6\n"],"output":(...TRUNCATED)	{"input":["10 1\n1 1 1 1 1 1 1 1 1 1\n","3 57\n78 165 54\n","1 1\n10000\n","2 2\n2 2\n","9 13\n132 8(...TRUNCATED)	{"input":["+--+-+\n","+--+--+------+++++++-+-+++--++---+--+-+---+--+++-+++-------+++++-+-++++--+-+-+(...TRUNCATED)	2	11	{"language":[2,3,2,2,2,2,4,3,3,3,3,2,2,2,2,2,3,2,2,2,3,2,2,2,2,3,1,3,3,3,2,4,3,2,4,3,4,2,2,3,2,2,2,2(...TRUNCATED)	{"language":[2,3,4,4,3,2,2,2,3,3,2,3,4,4,1,3,2,4,2,4,1,3,2,3,2,3,3,4,3,3,4,2,3,2,2,4,4,4,4,3,3,2,4,3(...TRUNCATED)	789	D	0	1,500	[ "greedy", "two pointers" ]	false	{ "nanos": 0, "seconds": 2 }	1,073,741,824
260_B. Ancient Prophesy	"Two players play the following game. Initially, the players have a knife and a rectangular sheet of(...TRUNCATED)	{ "input": [ "3\n", "6\n" ], "output": [ "\n\n*\n", "\n\n\n*\n*\n****\n" ] }	{"input":["541\n54 98 68 63 83 94 55 35 12 63 30 17 97 62 96 26 63 76 91 19 52 42 55 95 8 97 6 18 96(...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	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": [], "solution": [] }	0	D	1,750	0	[ "dfs and similar", "graphs" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1475_D. Cleaning the Phone	"Tavas is a cheerleader in the new sports competition named \"Pashmaks\".\n\n<image>\n\nThis competi(...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":["5\n3\n1 1\n1 1\n1 1\n3\n1 1\n1 1\n1 1\n3\n1 1\n1 1\n1 1\n3\n1 1\n1 1\n1 1\n3\n1 100\n1 1\(...TRUNCATED)	{ "input": [], "output": [] }	2	8	{"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":[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],"solution":[(...TRUNCATED)	19	B	2,500	2,300	[ "bitmasks", "dp" ]	false	{ "nanos": 0, "seconds": 5 }	256,000,000
chandu-and-his-girlfriend-returns	"Greg has a pad. The pad's screen is an n × m rectangle, each cell can be either black or white. We(...TRUNCATED)	{"input":["4 2 3 1","7834164883628 15 2189823423122 5771212644938","4 2 1 1","4 1 1 4"],"output":["0(...TRUNCATED)	{"input":["11\n54 91 4 6 88 23 38 71 77 26 84\n","20\n11 37 81 56 61 2 26 27 59 69 24 7 71 76 45 54 (...TRUNCATED)	{"input":["3 4\n5 6\n3 3\n2 2\n1 0\n0 0","3 7\n5 6\n3 3\n2 2\n1 0\n0 0","3 7\n5 6\n3 0\n2 2\n1 0\n0 (...TRUNCATED)	2	0	{"language":[2,2,2],"solution":["#include<bits/stdc++.h>\nusing namespace std;\ndouble EPS=1e-9;\nst(...TRUNCATED)	{"language":[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,4,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2(...TRUNCATED)	0	C2	3,000	2,700	[ "data structures", "trees" ]	false	{ "nanos": 0, "seconds": 2 }	64,000,000
p03503 AtCoder Beginner Contest 080 - Shopping Street	"Jiro is a fun loving lad. His classmates are very competitive and are striving for getting a good r(...TRUNCATED)	{"input":["5 5\n3 2 3 1 1\n","4 3\n2 1 4 3\n","2 0\n2 2\n"],"output":["1\n5\n1 4 2 3 5 \n","-1\n","0(...TRUNCATED)	{"input":["5 5\n-993655555 -758584352 -725954642 -696391700 -649643547\n-591473088 -568010221 -43211(...TRUNCATED)	{"input":["1000 1001\n82 636 713 516\n","1000 1998\n316 681 19 233\n","4 8\n1 3 4 2\n","5 6\n4 3 2 1(...TRUNCATED)	5	0	{"language":[2,1,3,3,3,4,2,3,1,1,2,4,2,3,4,4,3,1,1,3,4,4,3,3,2,3,3,4,2,3,2,2,3,3,4,3,3,3,1,2,3,2,2,3(...TRUNCATED)	{"language":[2,2,4,2,2,2,2,2,2,2,2,2,2,2,4,2,4,2,4,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,2,2(...TRUNCATED)	180	F	0	0	[ "binary search", "data structures", "dfs and similar", "dsu", "shortest paths", "two pointers" ]	false	{ "nanos": 0, "seconds": 2 }	268,435,456
820_A. Mister B and Book Reading	"There are n psychos standing in a line. Each psycho is assigned a unique integer from 1 to n. At ea(...TRUNCATED)	{"input":["2\n2 9\n","3\n3 12 6\n","7\n2 1000000000 4 6 8 4 2\n","6\n13 52 0 13 26 52\n"],"output":[(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["1 10\n700282491 332230980 954401907 59481241 188256336 995466811 463183048 725322957 8929(...TRUNCATED)	1	0	{"language":[2,4,3,4,4,4,1,3,3,2,4,3,2,3,1,3,3,4,4,4,3,2,4,2,3,2,3,2,2,2,2,3,2,1,1,1,4,2,3,4,4,2,2,2(...TRUNCATED)	{"language":[2,0,2,2,2,2,2,1,2,2,2,2,2,2,2,1,2,2,2,2,0,2,0,0,2,0,0,0,4,1,2,2,0,2,0,0,2,2,2,0,2,2,2,2(...TRUNCATED)	0		0	2,200	[ "" ]	false	{ "nanos": 0, "seconds": 1 }	256,000,000
p01797 Kimagure Cleaner	"In the intergalactic empire Bubbledom there are N planets, of which some pairs are directly connect(...TRUNCATED)	{"input":["2\n4 INDIAN\nCONTEST_WON 1\nTOP_CONTRIBUTOR\nBUG_FOUND 100\nCONTEST_HOSTED\n4 NON_INDIAN\(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3 4\n3 2 1\n","5 97\n1 10 76 97 2\n","2 16\n12 4\n","2 100\n132 1\n","5 76\n1 10 50 100 2(...TRUNCATED)	6	0	{"language":[2,2,3,2,2,2,4,2,2,2,4,2,2,2,2,2,2,2,2,2,4,2,2,4,2,2,2,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,4(...TRUNCATED)	{"language":[2,2,2,4,4,2,2,2,4,4,2,2,2,2,2,2,2,2,2,2,2,3,2,2,2,2,2,4,2,2,2,4,2,2,2,2,4,4,2,2,2,3,2,2(...TRUNCATED)	1,291		0	2,500	[ "greedy", "two pointers" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000
1170_E. Sliding Doors	"Panda has a thing for palindromes. Hence he was a given a problem by his master. The master will g(...TRUNCATED)	{"input":["4\ncba\ncab\nb\na\n3\nbca\nab\na\n5\nabc\nacb\nb\nc\nc\n5\nabc\nacb\nc\nb\nb\n0"],"output(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["30\n10 1 8 10 2 6 37 7 3 7 1 3 1 1 14 2 5 19 4 1 13 3 5 6 1 5 1 1 23 1\n98 4 43 41 56 58 (...TRUNCATED)	2	0	{"language":[1,2,4,2,3,3,3,4,3,3,4,3,4,2,3,3,4,4,2,3,4,2,4,4,2,3,3,2,2,1,3,3,3,3,2,4,3,4,4,4,3,3,3,2(...TRUNCATED)	{"language":[3,1,2,2,1,2,4,3,3,2,2,4,2,4,4,4,2,2,2,1,2,4,2,1,1,4,3,3,3,2,4,2,2,2,2,3,2,4,4,2,2,4,2,2(...TRUNCATED)	0	D	500	2,400	[ "meet-in-the-middle" ]	false	{ "nanos": 0, "seconds": 2 }	256,000,000