Pagini recente » Cod sursa (job #1686743) | Istoria paginii runda/oni15_z2 | Solutia problemei shoturi | Autentificare | Cod sursa (job #2247144)
#include <bits/stdc++.h>
using namespace std;
int main(){
ifstream f("pscpld.in");
ofstream g("pscpld.out");
char s[1000001];
int nrl,i=1,nr,k=0,sum=0,j,aux;
f>>s;
nrl=strlen(s),aux=strlen(s),j=strlen(s);//numarul de litere ale lui s
while(aux>0){
nr=0;
j=strlen(s)-k;
for(i=k;i<=(strlen(s)-k)/2;i++){
if(s[i]!=s[j])nr++;
j--;
}
if(nr==0)sum++;//sum este muamrul de subsiruri palindroame
aux--;
k++;
}
g<<sum+strlen(s);}