|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|3 초||128 MB||7||1||1||50.000%|
A sequence of words over alphabet [‘a’,…,’z’] is given. The length of longest word occuring as a coherent fragment in every word given is to be found.
Write a program which:
In the first line of the standard input there is an integer n, where 1 ≤ n ≤ 5 is the number of words. In each of the next n lines there is one word formed from small letters of English alphabet [‘a’,…,’z’]. The length of each word is at least 1, but not greater than 2,000.
The text of standard output should consist of exactly one line containing a single integer equal to the length of the longest word occuring as the coherent fragment in every word given.
3 abcb bca acbc