Problem 1901 Period II Accept: 107 Submit: 297 Time Limit: 1000 mSec Memory Limit : 32768 KB Problem Description For each prefix with length P of a given string S,if S[i]=S[i+P] for i
Problem 1901 Period II Accept: 518 Submit: 1270 Time Limit: 1000 mSec Memory Limit : 32768 KB Problem Description For each prefix with length P of a given string S,if S[i]=S[i+P] for
Problem Description For each prefix with length P of a given string S,if S[i]=S[i+P] for i in [0..SIZE(S)-p-1], then the prefix is a “period” of S. We want to all the periodic prefixs. Input Inpu