Tag Archives: 回文

ZJU 2744 解题报告


Time Limit: 1 Seconds Memory Limit: 32768 KB

A regular palindrome is a string of numbers or letters that is the same forward as backward. For example, the string "ABCDEDCBA" is a palindrome because it is the same when the string is read from left to right as when the string is read from right to left.

Now give you a string S, you should count how many palindromes in any consecutive substring of S.


There are several test cases in the input. Each case contains a non-empty string which has no more than 5000 characters.
Proceed to the end of file.


A single line with the number of palindrome substrings for each case.


Read more »