Pagini recente » Cod sursa (job #963399) | Cod sursa (job #2420043) | Cod sursa (job #1005419) | Cod sursa (job #2364668) | Cod sursa (job #2453606)
#include <iostream>
#include <fstream>
#include <string.h>
using namespace std;
ifstream f("pscpld.in");
ofstream g("pscpld.out");
char a[1000005];
int n,i,j,k,lg;
long long sol;
int main()
{
f>>(a+1);
n=strlen(a+1);
for(i=1;i<=n;i++)
{
j=i;
k=i;
lg=0;
while(j>=1 && k<=n && a[j]==a[k])
{
lg++;
j--;
k++;
}
sol+=lg;
j=i-1;
k=i;
lg=0;
while(j>=1 && k<=n && a[j]==a[k])
{
lg++;
j--;
k++;
}
sol+=lg;
}
g<<sol;
return 0;
}