Pagini recente » Cod sursa (job #164933) | Cod sursa (job #157075) | Cod sursa (job #2057757) | Istoria paginii runda/antrenament-de-primavarav | Cod sursa (job #1010357)
#include<fstream>
#include<cstring>
#define NMax 20050
using namespace std;
char s[NMax];
int N, Sol;
void Read()
{
ifstream fin("pscpld.in");
fin.getline(s+1, NMax);
N=strlen(s+1);
}
void Solve()
{
int Left,Right,Mid;
for (Mid=1; Mid<=N; Mid++)
{
for (Left=Mid, Right=Mid+1;Left>=1 && Right<=N && s[Left]==s[Right]; Left--, Right++,Sol++);
//Sol+=(Right-Left-1)/2;
for (Left=Right=Mid;Left>=1 && Right<=N && s[Left]==s[Right]; Left--, Right++,Sol++);
//Sol+=(Right-Left+1)/2;
}
}
void Print()
{
ofstream fout("pscpld.out");
fout<<Sol<<endl;
}
int main()
{
Read();
Solve();
Print();
return 0;
}