# [HDU1358/UVA1328/SPOJ PERIDO/POJ1961/ZOJ2177]Period（KMP）

### Description

For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. That is, for each i (2 <= i <= N) we want to know the largest K > 1 (if there is one) such that the prefix of S with length i can be written as A K , that is A concatenated K times, for some string A. Of course, we also want to know the period K.

KMP

HNCJ OIer 一枚