LCS2  Longest Common Substring II
A string is finite sequence of characters over a nonempty finite set Σ.
In this problem, Σ is the set of lowercase letters.
Substring, also called factor, is a consecutive sequence of characters occurrences at least once in a string.
Now your task is a bit harder, for some given strings, find the length of the longest common substring of them.
Here common substring means a substring of all the considered strings.
Input
The input contains at most 10 lines, each line consists of no more than 100000 lowercase letters, representing a string.
Output
The length of the longest common substring. If such string doesn't exist, print "0" instead.
Example
Input: alsdfkjfjkdsal fdjskalajfkdsla aaaajfaaaa Output: 2
Notice: new testcases added
hide comments
zahisho:
20171103 20:04:16
why in the test case the answer is 2?


mit_ak:
20171005 11:06:44
I don't know why am I getting WA on TEST 15??? 

luffbee:
20170919 16:00:31
I found a wrong way to pass the current testcases, and I have found a new testcase can make it WA. Could I submit the new testcase or do something? 

darkghostnj:
20170912 10:53:08
i submited the same solution that has got AC when i used it in the easier version of this problem but now


debugmyhair:
20170816 15:55:47
Last edit: 20170816 15:56:19 

bestwzh:
20170427 10:23:14
Last edit: 20170427 10:25:40 

reskip:
20170423 16:13:42
WA 10 cause of not understand SAM well 

miaomiao_ymxl:
20170316 16:31:28
WHY I ALWAYS GET WA ON TEST10??? :( Last edit: 20170316 16:55:22 

xjr:
20170313 10:49:34
Why always get WA on #10??? 

dacin21:
20170117 14:52:13
AC with O(N) suffix array :) 
Added by:  Bin Jin 
Date:  20070924 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 CPP 