시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
1 초 | 1024 MB | 147 | 72 | 56 | 54.902% |
Given a list of strings, what is the longest substring common to all of them?
The first line of input contains an integer $n$ ($1 \le n \le 1,000$), which is the number of strings that follow.
Each of the next $n$ lines contains a single string $s$ ($1 \le |s| \le 100$) consisting only of lower-case letters.
Output a single integer, which is the length of the longest substring common to all of the input strings.
5 axabcrwmvd abcn tabchwqsl bvrkabcayna tyabc
3