Uva 401 - Palindromes Solution

Problem Link
Uva 401 - Palindromes Solution

#include<bits/stdc++.h>
using namespace std;
int main()
{
    string s="ABCDEFGHIJKLMNOPQRSTUVWXYZ123456789";
    string c="A   3  HIL JM O   2TUVWXY51SE Z  8 ";
    map<char,char>m;
    for(int i=0;i<s.size();i++)
        m[s[i]]=c[i];
    string input;
    while(cin>>input)
    {
        string rs,b="";
        rs=input;
        reverse(rs.begin(),rs.end());
        for(int i=0;i<rs.size();i++)
            b+=m[rs[i]];
        if(b==input && rs==input)
             cout<<input<<" -- is a mirrored palindrome."<<endl<<endl;
        else if(b==input)
            cout<<input<<" -- is a mirrored string."<<endl<<endl;
        else if(rs==input)
            cout<<input<<" -- is a regular palindrome."<<endl<<endl;
        else
            cout<<input<<" -- is not a palindrome."<<endl<<endl;
    }
    return 0;
}