Find the number of palindrome subsequences of a string of no longer than 15 (subsequence length >=1). Input description Enter a string of no more than 15, and the string is represented by lowercase letters Output description Output the number of palindrome subsequences Sample input:abaa Sample output:10

Filename	Size	Update
Lab-HM6（2）
Lab-HM6（2）\6-2.cpp	755	2017-11-13
Lab-HM6（2）\Debug
Lab-HM6（2）\Debug\Lab-HM6（2）.tlog
Lab-HM6（2）\Lab-HM6（2）.vcxproj	5701	2017-11-13
Lab-HM6（2）\Lab-HM6（2）.vcxproj.filters	944	2017-11-13

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．