Pagini recente » Rezultatele filtrării | Cod sursa (job #975417) | Cod sursa (job #3227193) | Borderou de evaluare (job #2193670) | Cod sursa (job #1800367)
#include<bits/stdc++.h>
#define maxN 1000000
using namespace std;
char s[maxN];
int pali,sol;
int main()
{
freopen("pscpld.in","r",stdin);
freopen("pscpld.out","w",stdout);
scanf("%s",&s);
int l=strlen(s);
for(int i=0;i<l;i++)
{
int j=0;
while((i-j-1)>=0 && (i+j+1)<l && s[i-j-1]==s[i+j+1]) j++;
pali=pali+j+1;
j=0;
while((i-j-1)>=0 && (i+j)<l && s[i-j-1]==s[i+j])
{
sol=j;
j++;
}
pali=pali+j;
}
printf("%d\n",pali);
return 0;
}