Pagini recente » Borderou de evaluare (job #2271651) | Diferente pentru blog/suma-in-triunghi-rezolvare intre reviziile 12 si 11 | Borderou de evaluare (job #1965794) | Cod sursa (job #1829118)
#include <cstdio>
#include<cstring>
#define nmax 1000000
using namespace std;
char s[nmax];
int n,nr;
int main()
{
freopen("PScPld.in","r",stdin);
freopen("PScPld.out","w",stdout);
scanf("%s",&s);
n=strlen(s);
nr=n;
for(int i=0;i<strlen(s);i++)
for(int j=i+1;j<strlen(s);j++)
{
int k=0;
bool ok=true;
while(ok&&k<=(j-i)/2)
{
if(s[i+k]!=s[j-k])
ok=false;
else k++;
}
if(ok)
nr++;
}
printf("%d\n",nr);
return 0;
}