- Time limit: 1.00 s
- Memory limit: 512 MB
The only input line has a string of length $n$ that consists of characters a–z.
For each integer between $1 \ldots n$ print the number of distinct substrings of that length.
- $1 \le n \le 10^5$
2 2 2 1