{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003chtml\u003e\n \u003chead\u003e\u003c/head\u003e\n \u003cbody\u003e\n \u003cp\u003e\u003c/p\u003e \n \u003cp\u003e\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp; Do you remember the \"Nearest Numbers\"? Now here comes its brother:\"Nearest Sequence\".Given three sequences of char,tell me the length of the longest common subsequence of the three sequences.\u003c/p\u003e\n \u003c/body\u003e\n\u003c/html\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003chtml\u003e\n \u003chead\u003e\u003c/head\u003e\n \u003cbody\u003e\n \u003cp class\u003d\"p0\" style\u003d\"margin-top: 0pt; margin-bottom: 0pt\"\u003e\u003cspan style\u003d\"font-family: \u0027Times New Roman\u0027; font-size: 10.5pt; mso-spacerun: \u0027yes\u0027\"\u003e\n \u003co:p\u003e\n \u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp; There are several test cases.For each test case,the first line gives you the first sequence,the second line gives you the second one and the third line gives you the third one.(the max length of each sequence is 100)\n \u003c/o:p\u003e\u003c/span\u003e\u003c/p\u003e \n \u003c!--EndFragment--\u003e\n \u003c/body\u003e\n\u003c/html\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003chtml\u003e\n \u003chead\u003e\u003c/head\u003e\n \u003cbody\u003e\n \u003cp class\u003d\"p0\" style\u003d\"margin-top: 0pt; margin-bottom: 0pt\"\u003e\u003c/p\u003e \n \u003cp class\u003d\"p0\" style\u003d\"margin-top: 0pt; margin-bottom: 0pt\"\u003e\u003cspan style\u003d\"font-family: \u0027Times New Roman\u0027; font-size: 10.5pt; mso-spacerun: \u0027yes\u0027\"\u003e\n \u003co:p\u003e\u003c/o:p\u003e\u003c/span\u003e\u003c/p\u003e \n \u003cp class\u003d\"p0\" style\u003d\"margin-top: 0pt; margin-bottom: 0pt\"\u003e\u003cspan style\u003d\"font-family: \u0027Times New Roman\u0027; font-size: 10.5pt; mso-spacerun: \u0027yes\u0027\"\u003e\n \u003co:p\u003e\n \u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp; \u0026nbsp;For each test case,print only one integer :the length of the longest common subsequence of the three sequences.\n \u003c/o:p\u003e\u003c/span\u003e\u003c/p\u003e \n \u003c!--EndFragment--\u003e\n \u003c/body\u003e\n\u003c/html\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003eabcd\r\nabdc\r\ndbca\r\nabcd\r\ncabd\r\ntsc\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003e2\r\n1\u003c/pre\u003e"}},{"title":"Hint","value":{"format":"HTML","content":"\u003chtml\u003e\n \u003chead\u003e\u003c/head\u003e\n \u003cbody\u003e\u003c/body\u003e\n\u003c/html\u003e"}}]}