跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2942. Palindrome pairs

  • ID: 2948
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:进阶
  • 上传者:
  • 枚举
  • 动态规划
  • 字符串
  • 算法思想
  • 进阶
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Palindrome pairs

题目描述

D. Palindrome pairs
time limit per test
3 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

You are given a non-empty string s consisting of lowercase letters. Find the number of pairs of non-overlapping palindromic substrings of this string.

In a more formal way, you have to find the quantity of tuples (a,b,x,y) such that 1≤a≤b<x≤y≤|s| and substrings s[a... b], s[x... y] are palindromes.

A palindrome is a string that can be read the same way from left to right and from right to left. For example, "abacaba", "z", "abba" are palindromes.

A substring s[i... j] (1≤i≤j≤|s|) of string s = s1s2... s|s| is a string sisi+1... sj. For example, substring s[2...4] of string s = "abacaba" equals "bac".

Input

The first line of input contains a non-empty string s which consists of lowercase letters ('a'...'z'), s contains at most 2000 characters.

Output

Output a single number − the quantity of pairs of non-overlapping palindromic substrings of s.

Please do not use the %lld format specifier to read or write 64-bit integers in C++. It is preferred to use cin, cout streams or the %I64d format specifier.

Examples
Input
aa
Output
1
Input
aaa
Output
5
Input
abacaba
Output
36

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 2618 题。保留原作者与原赛事署名。