QOJ.ac

QOJ

Time Limit: 1 s Memory Limit: 2048 MB Total points: 100

#1948. Subcadena común más larga

The problem was used in the following contests:

This problem is prepared by xiaowuc1 .

Dada una lista de cadenas, ¿cuál es la subcadena más larga común a todas ellas?

Entrada

La primera línea de la entrada contiene un entero $n$ ($1 \le n \le 1\,000$), que es el número de cadenas que aparecen a continuación.

Cada una de las siguientes $n$ líneas contiene una sola cadena $s$ ($1 \le |s| \le 100$) formada únicamente por letras minúsculas.

Salida

Imprime un solo entero: la longitud de la subcadena más larga común a todas las cadenas de la entrada.

Ejemplos

Entrada 1

5
axabcrwmvd
abcn
tabchwqsl
bvrkabcayna
tyabc

Salida 1

Editorials

ID	Type	Status	Title	Posted By	Last Updated	Actions
	Editorial	Open	Official Editorial	Qingyu	-	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:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
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.