{"trustable":false,"sections":[{"title":"","value":{"format":"MD","content":"\u003chtml\u003e\n \u003chead\u003e\u003c/head\u003e\n \u003cbody\u003e\n \u003cdiv id\u003d\"problem-body\"\u003e \n \u003cp\u003eA string is finite sequence of characters over a non-empty finite set Σ.\u003c/p\u003e \n \u003cp\u003eIn this problem, Σ is the set of lowercase letters.\u003c/p\u003e \n \u003cp\u003eSubstring, also called factor, is a consecutive sequence of characters occurrences at least once in a string.\u003c/p\u003e \n \u003cp\u003eNow your task is a bit harder, for some given strings, find the length of the longest common substring of them.\u003c/p\u003e \n \u003cp\u003eHere common substring means a substring of all the considered strings.\u003c/p\u003e \n \u003cp\u003e求多串的最长公共子串。\u003c/p\u003e\n \u003ch3\u003eInput\u003c/h3\u003e \n \u003cp\u003eThe input contains at most 10 lines, each line consists of no more than 100000 lowercase letters, representing a string.\u003c/p\u003e \n \u003ch3\u003eOutput\u003c/h3\u003e \n \u003cp\u003eThe length of the longest common substring. If such string doesn\u0027t exist, print \"0\" instead.\u003c/p\u003e \n \u003ch3\u003eExample\u003c/h3\u003e \n \u003cpre\u003e\u003cstrong\u003eInput:\u003c/strong\u003e\nalsdfkjfjkdsal\nfdjskalajfkdsla\naaaajfaaaa\n\n\u003cstrong\u003eOutput:\u003c/strong\u003e\n2\n\u003c/pre\u003e \n \u003cp\u003e\u003cstrong\u003eNotice: new testcases added\u003c/strong\u003e\u003c/p\u003e \n \u003c/div\u003e\n \u003c/body\u003e\n\u003c/html\u003e"}}]}