6782: 「一本通 2.1 练习 2」Seek the Name, Seek the Fame
[Creator : ]
Description
The little cat is so famous, that many couples tramp over hill and dale to Byteland, and asked the little cat to give names to their newly-born babies. They seek the name, and at the same time seek the fame. In order to escape from such boring job, the innovative little cat works out an easy but fantastic algorithm:
Step1. Connect the father's name and the mother's name, to a new string S.
Step2. Find a proper prefix-suffix string of S (which is not only the prefix, but also the suffix of S).
Example: Father='ala', Mother='la', we have S = 'ala'+'la' = 'alala'. Potential prefix-suffix strings of S are {'a', 'ala', 'alala'}. Given the string S, could you help the little cat to write a program to calculate the length of possible prefix-suffix strings of S? (He might thank you by giving your baby a name:)
给定若干字符串（这些字符串总长 $\le 4\times 10^5$），在每个字符串中求出所有既是前缀又是后缀的子串长度。
例如：ababcababababcabab，既是前缀又是后缀的：ab，abab，ababcabab，ababcababababcabab。
Step1. Connect the father's name and the mother's name, to a new string S.
Step2. Find a proper prefix-suffix string of S (which is not only the prefix, but also the suffix of S).
Example: Father='ala', Mother='la', we have S = 'ala'+'la' = 'alala'. Potential prefix-suffix strings of S are {'a', 'ala', 'alala'}. Given the string S, could you help the little cat to write a program to calculate the length of possible prefix-suffix strings of S? (He might thank you by giving your baby a name:)
给定若干字符串（这些字符串总长 $\le 4\times 10^5$），在每个字符串中求出所有既是前缀又是后缀的子串长度。
例如：ababcababababcabab，既是前缀又是后缀的：ab，abab，ababcabab，ababcababababcabab。
Input
The input contains a number of test cases. Each test case occupies a single line that contains the string $S$ described above.
Restrictions: Only lowercase letters may appear in the input. $1 \leq |S| \leq 400,000$.
Restrictions: Only lowercase letters may appear in the input. $1 \leq |S| \leq 400,000$.
Output
For each test case, output a single line with integer numbers in increasing order, denoting the possible length of the new baby's name.
Sample 1 Input
ababcababababcabab
aaaaa
Sample 1 Output
2 4 9 18
1 2 3 4 5