Dzidzio and his song
Limits: 2 sec., 256 MiB
This statement was translated automatically from Ukrainian.
The mega-popular Dzidzio really loves to compose mega-popular songs. The recording of his songs is specific: he records all the words of his song without spaces or punctuation marks into a single string.
Once, while reviewing the lyrics of a song, Dzidzio deleted a single character from it and noticed that the song became completely different. Inquisitive Dzidzio became curious about how many different songs can be formed from a given one if only one character is deleted from it. But Dzidzio does not have time to calculate this. Help him by writing a program for this.
Input
The first and only line contains the string \(s\). It consists only of lowercase English
letters (a — z).
Output
In a single line, output a single integer — the answer to the problem.
Constraints
\(2 \le |s| \le 100\), where \(|s|\) is the length of the string \(s\).
Samples
| Input (stdin) | Output (stdout) |
|---|---|
| abc | 3 |
| Input (stdin) | Output (stdout) |
|---|---|
| aabbbc | 3 |
Notes
In the first example, 3 different strings can be formed from the
string abc if one character is deleted from it:
bc, ac, ab.
Submit a solution
| Element Type | Created | Who | Problem | Compiler | Result | Time (sec.) | Memory (MiB) | # | Actions |
|---|
| Element Type | Created | Who | Problem | Compiler | Result | Time (sec.) | Memory (MiB) | # | Actions |
|---|