Pagini recente » Cod sursa (job #1087206) | Cod sursa (job #2971414) | Cod sursa (job #21467) | Cod sursa (job #2719344) | Cod sursa (job #3277128)
#include <bits/stdc++.h>
#define oo 2000000000
#define mod 666013
using namespace std;
ifstream fin("numarare.in");
ofstream fout("numarare.out");
int n,m,l,nr;
char a[100005];
int d[100005];
void Citire()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>a[i];
for(int i=1;i<n;i++)
d[i]=a[i+1]-a[i];
}
void Rez()
{
for(int i=1;i<n;i++)
{
l=1;
while(i+l<=n && i-l>=1 && d[l+i-1]==d[i-l])
{
l++;
nr++;
}
if(i+l<=n && d[i+l-1]==d[i-l+1])nr++;
}
}
void Afis()
{
fout<<nr;
}
int main()
{
Citire();
Rez();
Afis();
return 0;
}