{"trustable":true,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003e我们大家经常用google检索信息,但是检索信息的程序是很困难编写的;现在请你编写一个简单的全文检索程序。\u003cbr\u003e问题的描述是这样的:给定一个信息流文件,信息完全有数字组成,数字个数不超过60000个,但也不少于60个;再给定一个关键字集合,其中关键字个数不超过10000个,每个关键字的信息数字不超过60个,但也不少于5个;两个不同的关键字的前4个数字是不相同的;由于流文件太长,已经把它分成多行;请你编写一个程序检索出有那些关键字在文件中出现过。\u003cbr\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"第一行是两个整数M,N;M表示数字信息的行数,N表示关键字的个数;接着是M行信息数字,然后是一个空行;再接着是N行关键字;每个关键字的形式是:[Key No. 1] 84336606737854833158。\u003cbr\u003e"}},{"title":"Output","value":{"format":"HTML","content":"输出只有一行,如果检索到有关键字出现,则依次输出,但不能重复,中间有空格,形式如:Found key: [Key No. 9] [Key No. 5];如果没找到,则输出形如:No key can be found !。\u003cbr\u003e"}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e20 10\r\n646371829920732613433350295911348731863560763634906583816269\r\n637943246892596447991938395877747771811648872332524287543417\r\n420073458038799863383943942530626367011418831418830378814827\r\n679789991249141417051280978492595526784382732523080941390128\r\n848936060512743730770176538411912533308591624872304820548423\r\n057714962038959390276719431970894771269272915078424294911604\r\n285668850536322870175463184619212279227080486085232196545993\r\n274120348544992476883699966392847818898765000210113407285843\r\n826588950728649155284642040381621412034311030525211673826615\r\n398392584951483398200573382259746978916038978673319211750951\r\n759887080899375947416778162964542298155439321112519055818097\r\n642777682095251801728347934613082147096788006630252328830397\r\n651057159088107635467760822355648170303701893489665828841446\r\n069075452303785944262412169703756833446978261465128188378490\r\n310770144518810438159567647733036073099159346768788307780542\r\n503526691711872185060586699672220882332373316019934540754940\r\n773329948050821544112511169610221737386427076709247489217919\r\n035158663949436676762790541915664544880091332011868983231199\r\n331629190771638894322709719381139120258155869538381417179544\r\n000361739177065479939154438487026200359760114591903421347697\r\n\r\n[Key No. 1] 934134543994403697353070375063\r\n[Key No. 2] 261985859328131064098820791211\r\n[Key No. 3] 306654944587896551585198958148\r\n[Key No. 4] 338705582224622197932744664740\r\n[Key No. 5] 619212279227080486085232196545\r\n[Key No. 6] 333721611669515948347341113196\r\n[Key No. 7] 558413268297940936497001402385\r\n[Key No. 8] 212078302886403292548019629313\r\n[Key No. 9] 877747771811648872332524287543\r\n[Key No. 10] 488616113330539801137218227609\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eFound key: [Key No. 9] [Key No. 5]\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}