Pagini recente » Cod sursa (job #1197766) | Cod sursa (job #2217607) | Cod sursa (job #574317) | Cod sursa (job #473254) | Cod sursa (job #2101038)
#include <cstring>
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("pscpld.in");
ofstream fout("pscpld.out");
const int NMax=1000005;
char A[NMax];
long long Sol;
int N;
void Read()
{
fin>>A;
N=strlen(A)-1;
}
void Solve()
{
for(int i=0;i<=N;++i)
{
int k=0;
while(A[i+k]==A[i-k] && i+k<=N && i-k>=0)
{
Sol++; ++k;
}
k=1;
while(A[i+k-1]==A[i-k] && i+k-1<=N && i-k>=0)
{
Sol++; ++k;
}
}
fout<<Sol<<"\n";
}
int main()
{
Read();
Solve();
return 0;
}