#0005AD

Number of Palindrome

给你一个字符串,求这个串中不同回文子串的个数。



Input每组 case 给一个字符串 S。串长 < 100000。


Output输出一个整数,代表这个串中不同回文子串的个数。



Sample Input 1:
aaaa
Sample Output 1:
4



Sample Input 2:
abab
Sample Output 2:
4



Sample Input 3:
abcd
Sample Output 3:
4

Submit solution

Coming later

The grading service will be connected in a later migration step. You can inspect the task and your previous results now.