UVA_401_Palindromes

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <sstream>
#include <stdlib.h>
#include <cmath>
#define FOR(i,A) for(typeof (A).begin() i = (A).begin() ; i != (A).end() ; i++)
#define mp make_pair
#define debug( x ) cout << #x << " = " << x << endl
#define clr(v,x) memset( v, x , sizeof v )
#define all(x) (x).begin() , (x).end()
#define rall(x) (x).rbegin() , (x).rend()
#define TAM 110

using namespace std;

typedef pair<int,int> ii ;
typedef long long ll ;
typedef long double ld ;
typedef pair<int,ii> pii ;
char cad[1000];
bool ispalindrome(){
  string str=string(cad);
  string tmp = str;
  reverse(tmp.begin(),tmp.end());
  if(str == tmp)
   return true;
   return false;
}
char reversa(char car){
   char car1;
   if(car=='A' || car=='H' || car=='I' || car== 'O' || car=='M' || car=='T'
   || car=='U'|| car=='V' || car=='W'|| car=='X' || car=='Y' || car=='1' || car=='8') return car;
   else if(car=='E') {
    car1='3'; return car1;
   }else if(car=='3'){
    car1='E'; return car1;
   }else if(car=='J'){
    car1='L'; return car1;
   }else if(car=='L'){
    car1='J';return car1;
   }else if(car=='Z'){
    car1='5';return car1;
   }else if(car=='2'){
    car1='S' ;return car1;
   }else if(car=='5'){
    car1='Z';return car1;
   }else if(car=='S'){
    car1='2'; return car1;
   }else{
    car1='0';return car1;
   }
}
bool ismirror(){
    int n=strlen(cad);char cad1[1000];char aux;
    for(int i=0;i<n;i++){
        aux=reversa(cad[i]);
        if(aux!='0') cad1[i]=aux;
        else return false;
    }
    cad1[n]='\0';
    string str=string(cad1);
    string str1=str;
    reverse(str1.begin(),str1.end());string str2=string(cad);
    if(str1==str2) return true;
    else return false;
}
int main() {
    int cont=1;bool ispali,ismirrored;
    while(gets(cad)){

        ispali=ispalindrome();
        ismirrored=ismirror();
        if(ispali && ismirrored){
            printf("%s -- is a mirrored palindrome.\n",cad);
        }else if(ispali && !ismirrored){
            printf("%s -- is a regular palindrome.\n",cad);
        }else if(!ispali && ismirrored){
            printf("%s -- is a mirrored string.\n",cad);
        }else{
            printf("%s -- is not a palindrome.\n",cad);
        }
        cont++;
        cad[0]='\0';
        printf("\n");
    }
    return 0;
}