Vomume 1.Elementary Problem Solving->volume 1 string 401-Palindromes

#include<iostream>
#include<string>
using namespace std;
int main()
{
string s,s1,s2;
char c;
int len,i,f1,f2,f3;
while(cin>>s)
{
s1=s2=s;
len=s.size();
for(i=0;i<len/2;i++)
{
c=s[i];
s[i]=s[len-1-i];
s[len-1-i]=c;
}
if(s1==s)
f1=1;
else
f1=0;
f3=0;
s1=s;
for(i=0;i<len;i++)
{
switch(s[i])
{
case 'B':f3=1;break;
case 'C':f3=1;break;
case 'D':f3=1;break;
case 'F':f3=1;break;
case 'G':f3=1;break;
case 'K':f3=1;break;
case 'N':f3=1;break;
case 'P':f3=1;break;
case 'Q':f3=1;break;
case 'R':f3=1;break;
case '4':f3=1;break;
case '6':f3=1;break;
case '7':f3=1;break;
case '9':f3=1;break;
}
if(f3)
{
f2=0;
break;
}
else
{
f2=1;
if(s[i]=='E')      s[i]='3';
else if(s[i]=='J') s[i]='L';
else if(s[i]=='L') s[i]='J';
else if(s[i]=='S') s[i]='2';
else if(s[i]=='Z') s[i]='5';
else if(s[i]=='2') s[i]='S';
else if(s[i]=='3') s[i]='E';
else if(s[i]=='5') s[i]='Z';
}
}
if(f2==1)
{
for(i=0;i<len/2;i++)
{
c=s[i];
s[i]=s[len-1-i];
s[len-1-i]=c;
}
if(s1==s)
f2=1;
else
f2=0;
}
if(f1==0&&f2==0)
{
cout<<s2<<" -- is not a palindrome.";
cout<<endl;
}
else if(f1==1&&f2==0)
{
cout<<s2<<" -- is a regular palindrome.";
cout<<endl;
}
else if(f1==0&&f2==1)
{
cout<<s2<<" -- is a mirrored string.";
cout<<endl;
}
else
{
cout<<s2<<" -- is a mirrored palindrome.";
cout<<endl;
}
cout<<endl;
}
return 0;
}