Every Palindrome, Counted
Count all palindromic substrings of S (each occurrence counted separately).
Input: one line with the string S.
Output: the number of palindromic substrings.
Constraints:
- 1 ≤ |S| ≤ 106
- lowercase letters
Sample Tests
Input 1
aaa
Output 1
6
Input 2
abc
Output 2
3
Discussion (opens after you solve — no spoilers before)
No comments yet.