Distinct Repeating Strings
Given a text
t, you are asked to find out the number of unique non-empty repeating strings present in
t. Repeating strings can be formed by concatenating the same string
sto itself →
s + s.
The first line of the input contains the text
t(1 ≤ |t| ≤ 1000).
The program should print the number of repeating strings present in
- yeeey → ee
- abcabcabc → abcabc, bcabca, cabcab
Time limit: 1 seconds
Memory limit: 512 MB
Output limit: 1 MB