QOJ.ac

QOJ

実行時間制限: 1 s メモリ制限: 2048 MB 満点: 100

#1948. 最长公共子串

統計

给定一个字符串列表,找出所有字符串共有的最长子串。

输入格式

第一行包含一个整数 $n$ ($1 \le n \le 1,000$),表示后续字符串的数量。

接下来的 $n$ 行,每行包含一个仅由小写字母组成的字符串 $s$ ($1 \le |s| \le 100$)。

输出格式

输出一个整数,表示所有输入字符串共有的最长子串的长度。

样例

样例输入 1

5
axabcrwmvd
abcn
tabchwqsl
bvrkabcayna
tyabc

样例输出 1

3

Editorials

IDTypeStatusTitlePosted ByLast UpdatedActions
EditorialOpen Official EditorialQingyu- Download

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.