{"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\"\u003eEveryone knows LCS problem: \u003cbr\u003e\u003cbr\u003eFor example:\u003cbr\u003estr1 \u003d \"GCTAT\"\u003cbr\u003estr2 \u003d \"CGATTA\"\u003cbr\u003e\u003cbr\u003ethe longest common subsequence is \"GTT\" of them.So you should print \"3\".\u003cbr\u003e\u003cbr\u003eI\u0027m sure you can easily sovle it.So the challenge is coming again.(^_^)\u003cbr\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"For each case,there are two lines.one is string A,the other is string B.\u003cbr\u003ethe string Process to end of file.Each string will have at most 30000 characters.\u003cbr\u003eAll the characters are in upper-case.\u003cbr\u003e"}},{"title":"Output","value":{"format":"HTML","content":"For each case, output the maximum-length common subsequence.\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\u003eGCTAT\r\nCGATTA \r\n\r\nABCFBC\r\nABFCAB\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e3\r\n4\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}