![]() |
||||||||||
|
||||||||||
PalindromesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2061 Accepted Submission(s): 985 Problem Description 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. Input 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. Output A single line with the number of palindrome substrings for each case. Sample Input
Sample Output
Author LIU, Yaoting Source | ||||||||||
|