Written by  on October 7, 2015

POJ1961 Period Time Limit: 3000MS Memory Limit: 30000K Total Submissions: 15006 Accepted: 7158 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 AK ,that is A concatenated K times, for some string A. Of course, we also want to know the period K.

[Read more...]