UVa 401 Palindromes Solution

#include<iostream>
#include<string>
#include<cstring>
#include<sstream>
#include<cctype>
#include<string.h>
#include<algorithm>
#include<cmath>
#include<stack>
#include<fstream>
#include<cstdlib>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
using namespace std;
int main()
{
int i;
string s,b,d;
char c[10000];
memset(c,0,sizeof(c));
c['A']='A';
c['E']='3';
c['H']='H';
c['I']='I';
c['J']='L';
c['L']='J';
c['M']='M';
c['O']='O';
c['S']='2';
c['T']='T';
c['U']='U';
c['V']='V';
c['W']='W';
c['X']='X';
c['Y']='Y';
c['Z']='5';
c['1']='1';
c['2']='S';
c['3']='E';
c['5']='Z';
c['8']='8';
while(cin>>s)
    {
    b=d="";
    for(i=s.length()-1;i>=0;i--)
            {
            b+=s[i];
            //if(c[s[i]]!=0)
            d+=c[s[i]];
            //else d+=s[i];
            }
    //cout<<s<<" "<<b<<" "<<d<<endl;
    if(s!=b && s!=d) cout<<s<<" -- is not a palindrome."<<endl<<endl;
    else if(s==b && s!=d) cout<<s<<" -- is a regular palindrome."<<endl<<endl;
    else if(s!=b && s==d) cout<<s<<" -- is a mirrored string."<<endl<<endl;
    else cout<<s<<" -- is a mirrored palindrome."<<endl<<endl;
    }
return 0;
}