Datasets:

TheFactoryX
/

edition_2474_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
188_D. Asterisks	"Problem\n\nTomorrow is finally the day of the excursion to Maizu Elementary School. Gatcho, who att(...TRUNCATED)	{ "input": [ "2\n5\n5", "3\n1\n4\n3" ], "output": [ "5\n5", "4\n3\n4" ] }	{"input":["30 2\n-999999924 -499999902 500000091 -999999998 500000030 -999999934 500000086 -49999991(...TRUNCATED)	{"input":["1\n2\n905303520 999999998\n999999999 1000000000\n","1\n10\n132182352 630066892\n323711215(...TRUNCATED)	2	0	{"language":[1,1],"solution":["t=input()\nwhile t>0:\n\tb=[]\n\ta=raw_input().split()\n\tfor i in ra(...TRUNCATED)	{"language":[2,2,4,4,4,3,2,4,4,4,3,2,2,2,4,4,3,3,3,2,2,4,4,4,2,3,3,2,2,2,4,2,3,3,3,2,4,4,3,3,4,4,2,2(...TRUNCATED)	0		500	0	[ "" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
776_A. A Serial Killer	"You are working for an amusement park as an operator of an obakeyashiki, or a haunted house, in whi(...TRUNCATED)	{"input":["4\n3 3\n1 2\n2 3\n3 1\n3 6\n1 2\n2 1\n2 3\n3 2\n1 3\n3 1\n7 10\n1 2\n2 3\n3 1\n1 4\n4 5\n(...TRUNCATED)	{"input":["21 6\n12 15 14 4 4 7 2 4 11 1 15 4 12 11 12 8 11 12 3 4 4\n","50 25\n19 1 17 6 4 21 9 16 (...TRUNCATED)	{"input":["ABM","BIB","1MI","MCA","MAC","M@C","C@M","@MC","?MC","M?C","C?M","CM?","DM?","?MD","@MD",(...TRUNCATED)	2	10	{"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],"solution":["#include <bits/stdc++.h>\n \n#define _overload(_1,_2,_3,name,...) nam(...TRUNCATED)	366		0	0	[ "*special", "binary search" ]	false		{ "nanos": 0, "seconds": 2 }	0
309_B. Context Advertising	"Sita loves chocolate and Ram being his boyfriend wants to give Sita as many chocolates as he can. S(...TRUNCATED)	{ "input": [ "19 29\n", "3 6\n" ], "output": [ "2\n", "2\n" ] }	{ "input": [], "output": [] }	{"input":["100\n92 53 86 41 77 68 80 54 17 96 89 53 64 55 2 80 28 58 77 43 70 91 71 71 78 3 25 2 15 (...TRUNCATED)	3	0	{"language":[3,4,1,3,4,2,4,2,2,2,3,3,4,3,2,2,3,3,2,2,2,2,1,3,2,3,4,3,3,1,4,3,3,2,2,3,2,3,4,3,3,3,4,4(...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	D	0	3,000	[]	false		{ "nanos": 0, "seconds": 2 }	0
p01316 Differential Pulse Code Modulation	"Mister B once received a gift: it was a book about aliens, which he started read immediately. This (...TRUNCATED)	{ "input": [ "3\n1\n0 1\n0 0\n1 0\n2\n0 1\n0 0\n1 0\n2\n0 0\n0 2\n2 1" ], "output": [ "yes\nyes\nno\n" ] }	{"input":["1 10\n700282491 332230980 954401907 59481241 188256336 995466811 463183048 725322957 8929(...TRUNCATED)	{ "input": [], "output": [] }	2	11	{"language":[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,4,2,2,2,2,2,2,2,2,2,2,2,4,2,4(...TRUNCATED)	{"language":[3,2,1,2,3,2,2,3,4,2,2,2,2,3,2,2,2,2,4,2,4,2,2,2,3,3,2,2,3,4,4,4,1,4,2,2,3,2,4,2,2,2,4,4(...TRUNCATED)	814	B	2,000	2,600	[]	false		{ "nanos": 0, "seconds": 1 }	256,000,000
272_B. Dima and Sequence	"Time Limit: 8 sec / Memory Limit: 64 MB\n\n\n\n\n\nExample\n\nInput\n\n5 3 2\naaaaa\naaa\naab\n\n\n(...TRUNCATED)	{"input":["5 8\n1 2 6 7 10\n1 1 1 1 2\n1 1\n1 5\n1 3\n3 5\n-3 5\n-1 10\n1 4\n2 5\n"],"output":["0\n1(...TRUNCATED)	{"input":["3 1\n-2 3\n-2 -2\n","-8916 9282\n2666 2344\n9109 -2730\n","0 45\n42 -47\n-51 -82\n","45 6(...TRUNCATED)	{"input":["5 7\nqcezchs\nhhedywq\nwikywqy\nqckrpzt\nbqexcxz\n3 2\n??\nyw\n?q\n","8 10\ncwcwcwcwcw\nc(...TRUNCATED)	2	11	{"language":[3,2,4,2,2,2,2,4,3,2,2,3,2,1,4,2,4,3,4,4,2,1,4,3,2,3,4,2,3,4,2,2,4,4,2,2,4,3,3,2,4,3,4,2(...TRUNCATED)	{"language":[2,2,2,2,2,2,4,2,1,4,2,2,2,2,2,2,2,4,2,4,2,2,2,2,2,2,2,4,2,3,2,2,1,2,4,2,2,2,2,2,4,2,2,1(...TRUNCATED)	151	D	0	1,800	[ "graphs" ]	false	"うさぎがとあるロールプレイングゲームで遊んでいる. 城に入る直前で, (...TRUNCATED)	{ "nanos": 0, "seconds": 1 }	512,000,000
1490_D. Permutation Transformation	"Hilbert's Hotel is a very unusual hotel since the number of rooms is infinite! In fact, there is ex(...TRUNCATED)	{ "input": [ "100 5\n1\n23\n45\n67\n89", "10 2\n4\n5", "6 1\n3" ], "output": [ "608200469", "0", "4" ] }	{"input":["15\ntxxtxttxxttxtxx\n","3\nmyw\n","127\nxixtxixnxixtxixlxixtxixnxixtxixoxixtxixnxixtxixlx(...TRUNCATED)	{"input":["3 1\n-1 3\n-2 -2\n","-8360 9282\n2666 2344\n9109 -2730\n","0 45\n42 -47\n-51 -42\n","45 6(...TRUNCATED)	2	0	{"language":[3,3,4,4,4,2,4,4,4,4,2,4,2,4,4,3,4,4,4,3,3,3,2,4,4,4,3,4,4,2,1,2,4,4,4,3,2,3,3,4,2,4,3,4(...TRUNCATED)	{"language":[2,2,2,2,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,2,2,2,2,2,2,2,2,2(...TRUNCATED)	1,424	E	0	2,400	[ "math" ]	false		{ "nanos": 0, "seconds": 2 }	256,000,000
560_D. Equivalent Strings	"This is a simple game you must have played around with during your school days, calculating FLAMES (...TRUNCATED)	{ "input": [ "5\n5\n3\n2\n1\n4\n6\n1\n2\n3\n4\n5\n6\n3\n3\n2\n1\n0" ], "output": [ "7\n0\n3" ] }	{"input":["3\nAZAMON APPLE\nAZAMON AAAAAAAAAAALIBABA\nAPPLE BANANA\n"],"output":["AAZMON\n---\nAEPLP(...TRUNCATED)	{ "input": [], "output": [] }	5	7	{"language":[2,2,2,2,2,2,4,4,2,2,4,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,4,3,2,2,2,1,4,3,2,2,1,2,2,2,2,2,2,2(...TRUNCATED)	{ "language": [], "solution": [] }	1,334	E	0	800	[ "math", "probabilities" ]	true		{ "nanos": 0, "seconds": 3 }	256,000,000
p03297 AtCoder Grand Contest 026 - rng_10s	"Princess Heidi decided to give orders to all her K Rebel ship commanders in person. Unfortunately, (...TRUNCATED)	{ "input": [ "4\n47\n74\n477\n4747477" ], "output": [ "2\n2\n3\n23\n" ] }	{"input":["2\n1 2\n","100\n61 96 25 10 50 71 38 77 76 75 59 100 89 66 6 99 2 13 3 23 91 93 22 92 4 8(...TRUNCATED)	{"input":["777 20\n","110 4\n","12 4\n","500 2\n","11 4\n","1 8\n","26 11\n","91 4\n","20 4\n","123 (...TRUNCATED)	3	14	{"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],"solution":["#include (...TRUNCATED)	{"language":[2,4,2,2,4,2,2,2,2,2,4,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,4,2,2,2,4,2,2(...TRUNCATED)	425		0	0	[]	false	Time Limit: 8 sec / Memory Limit: 64 MB	null	256,000,000
228_D. Zigzag	"Chandan gave his son a cube with side N. The N X N X N cube is made up of small 1 X 1 X 1 cubes.\n(...TRUNCATED)	{"input":["1\nindex.dml\n<dml><title>Markup language has Declined</title><br>Programmers world</dml>(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["5\n8 5\n6 4\n4 3\n7 10\n0 10\n10\n10 5\n2 7\n10 7\n8 10\n10 2\n1 2\n8 1\n6 7\n6 0\n0 9\n5(...TRUNCATED)	2	7	{"language":[3,3,3,3,4,1,3,3,1,4,4,2,4,3,3,3,3,3,2,2,2,1,4,1,2,1,3,3,1,3,1,3,3,2,1,1,3,4,1,3,1,2,2,4(...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)	741		0	2,100	[ "" ]	true		{ "nanos": 0, "seconds": 2 }	0
1211_I. Unusual Graph	"Malek has recently found a treasure map. While he was looking for a treasure he found a locked door(...TRUNCATED)	{"input":["5\n3\n1 6\n1 7\n1 5\n2\n1 4\n1 3\n3\n1 10\n3 5\n2 3\n3\n1 15\n2 4\n1 10\n1\n1 100\n"],"ou(...TRUNCATED)	{ "input": [], "output": [] }	{"input":["3 70\n20 30 5","3 10\n20 18 10","2 10\n29 20","4 1111\n1 5 100 1000","4 1111\n-1 2 110 10(...TRUNCATED)	2	0	{"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":[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)	0		0	0	[ "constructive algorithms", "greedy", "implementation", "math" ]	true		{ "nanos": 0, "seconds": 5 }	268,435,456