Cod sursa(job #3367009)
| Utilizator | Data | 5 octombrie 2026 17:38:36 | |
|---|---|---|---|
| Problema | PScPld | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.7 kb |
#include <fstream>
#include <string.h>
using namespace std;
ifstream cin ("pscpld.in");
ofstream cout ("pscpld.out");
char sir[1000005];
long long solve(int n)
{
long long nr = 0;
for (int i = 0; i < n; i++)
{
int st = i;
int dr = i;
while (st >= 0 && dr < n && sir[st] == sir[dr])
{
nr++;
st--;
dr++;
}
st = i - 1;
dr = i;
while (st >= 0 && dr < n && sir[st] == sir[dr])
{
nr++;
st--;
dr++;
}
}
return nr;
}
int main()
{
cin >> sir;
int n = strlen(sir);
cout << solve(n);
}
