7645: [CSES Problem Set] Distinct Substrings
[Creator : ]
Description
Count the number of distinct substrings that appear in a string.
Input
The only input line has a string of length $n$ that consists of characters a–z.
Output
Print one integer: the number of substrings.
Constraints
$1≤n≤10^5$
Sample 1 Input
abaa
Sample 1 Output
8
The substrings are a, b, aa, ab, ba, aba, baa and abaa.