{"trustable":true,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003e\n div.illustration {\n float: right;\n padding-left: 20px;\n }\n div.illustration .illustration {\n width: 100%;\n border-radius: 4px;\n }\n pre {\n display: block;\n margin: 0 0 10px;\n font-size: 13px;\n line-height: 1.42857143;\n color: #333;\n word-break: break-all;\n word-wrap: break-word;\n }\n\u003c/style\u003e\n\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027\\\\[\u0027, right: \u0027\\\\]\u0027, display: true}\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\n \u003cp\u003eYou are given \u003cspan class\u003d\"tex2jax_process\"\u003e$n$\u003c/span\u003e\n strings, each a permutation of the first \u003cspan class\u003d\"tex2jax_process\"\u003e$k$\u003c/span\u003e upper-case letters of the\n alphabet.\u003c/p\u003e\n \u003cp\u003eString \u003cspan class\u003d\"tex2jax_process\"\u003e$s$\u003c/span\u003e is a\n \u003cem\u003esubsequence\u003c/em\u003e of string \u003cspan class\u003d\"tex2jax_process\"\u003e$t$\u003c/span\u003e if and only if it is possible to\n delete some (possibly zero) characters from the string\n \u003cspan class\u003d\"tex2jax_process\"\u003e$t$\u003c/span\u003e to get the string\n \u003cspan class\u003d\"tex2jax_process\"\u003e$s$\u003c/span\u003e.\u003c/p\u003e\n \u003cp\u003eCompute the length of the longest common\n \u003cem\u003esubsequence\u003c/em\u003e of all \u003cspan class\u003d\"tex2jax_process\"\u003e$n$\u003c/span\u003e strings.\u003c/p\u003e\n \u003ch2\u003eInput\u003c/h2\u003e\n \u003cp\u003eThe first line of input contains two integers \u003cspan class\u003d\"tex2jax_process\"\u003e$n$\u003c/span\u003e (\u003cspan class\u003d\"tex2jax_process\"\u003e$1\n \\le n \\le 10^5$\u003c/span\u003e) and \u003cspan class\u003d\"tex2jax_process\"\u003e$k$\u003c/span\u003e (\u003cspan class\u003d\"tex2jax_process\"\u003e$1\n \\le k \\le 26$\u003c/span\u003e), where \u003cspan class\u003d\"tex2jax_process\"\u003e$n$\u003c/span\u003e is the number of strings, and the\n strings are all permutations of the first \u003cspan class\u003d\"tex2jax_process\"\u003e$k$\u003c/span\u003e upper-case letters of the\n alphabet.\u003c/p\u003e\n \u003cp\u003eEach of the next \u003cspan class\u003d\"tex2jax_process\"\u003e$n$\u003c/span\u003e\n lines contains a single string \u003cspan class\u003d\"tex2jax_process\"\u003e$t$\u003c/span\u003e. It is guaranteed that every\n \u003cspan class\u003d\"tex2jax_process\"\u003e$t$\u003c/span\u003e contains each of the\n first \u003cspan class\u003d\"tex2jax_process\"\u003e$k$\u003c/span\u003e upper-case\n letters of the alphabet exactly once.\u003c/p\u003e\n \u003ch2\u003eOutput\u003c/h2\u003e\n \u003cp\u003eOutput a single integer, the length of the longest\n subsequence that appears in all \u003cspan class\u003d\"tex2jax_process\"\u003e$n$\u003c/span\u003e strings.\u003c/p\u003e\n \u003ch2\u003eSample 1\u003c/h2\u003e\u003cbody\u003e\u003ctable class\u003d\"vjudge_sample\"\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\u003e2 3\nBAC\nABC\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e2\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003c/body\u003e\n \u003ch2\u003eSample 2\u003c/h2\u003e\u003cbody\u003e\u003ctable class\u003d\"vjudge_sample\"\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\u003e3 8\nHGBDFCAE\nADBGHFCE\nHCFGBDAE\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e3\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003c/body\u003e\n \u003ch2\u003eSample 3\u003c/h2\u003e\u003cbody\u003e\u003ctable class\u003d\"vjudge_sample\"\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\u003e6 8\nAHFBGDCE\nFABGCEHD\nAHDGFBCE\nDABHGCFE\nABCHFEDG\nDGABHFCE\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e4\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003c/body\u003e\n "}}]}