Palindromes

题：
A regular palindrome is a string of numbers or letters that is the same forward as backward. For
example, the string “ABCDEDCBA” is a palindrome because it is the same when the string is read from
left to right as when the string is read from right to left.
A mirrored string is a string for which when each of the elements of the string is changed to its
reverse (if it has a reverse) and the string is read backwards the result is the same as the original string.
For example, the string “3AIAE” is a mirrored string because ‘A’ and ‘I’ are their own reverses, and ‘3’
and ‘E’ are each others’ reverses.
A mirrored palindrome is a string that meets the criteria of a regular palindrome and the criteria
of a mirrored string. The string “ATOYOTA” is a mirrored palindrome because if the string is read
backwards, the string is the same as the original and because if each of the characters is replaced by
its reverse and the result is read backwards, the result is the same as the original string. Of course, ‘A’,
‘T’, ‘O’, and ‘Y’ are all their own reverses.
A list of all valid characters and their reverses is as follows.

Note that ‘0’ (zero) and ‘O’ (the letter) are considered the same character and therefore ONLY the
letter ‘O’ is a valid character.

Input
Input consists of strings (one per line) each of which will consist of one to twenty valid characters.
There will be no invalid characters in any of the strings. Your program should read to the end of file.

Output
For each input string, you should print the string starting in column 1 immediately followed by exactly
one of the following strings.


题意：
多组输入。
判断给的字符串是否是回文串or镜像串or即是回文又镜像or两者都不是。

思路：
如题中给出的表格所示。
如果给出的字符串里面有reverse无效的，则该字符串肯定不是镜像。
如果给出的字符串里面有reverse前后都一样的，则在对称位置也应有一样的字符。
如果给出的字符串里面有reverse后相反的，则在对称位置应有该字符reverse后的字符。

#include<iostream>
#include<string>
using namespace std;

int main()
{
	string a,b1,b2,b,b3;
	b1="AEHIJLMSTUVWXYZ12358O";
	b2="A3HILJM2TUVWXY51SEZ8O";
	b3="BCDFGKNPQR4679";
	while(getline(cin,a))
	{
		b=a;
		int n,i,j,k,p=0,q=0,h=0;
		n=a.length();
		for(i=0,j=n-1;i<j;++i,--j)
		{
			if(a[i]!=a[j])
				break;
		}
		if(i>=j)
			p=1;
		int fff=0;
		for( i=0;i<n;++i)
		{
			for(j=0;j<14;++j)
			{
				if(a[i]==b3[j])
				{
					fff=1;
					break;
				}
					
			}
			if(fff==1)
				break;
		}
		if(i<n&&p==1)
		{
			cout<<a<<" -- is a regular palindrome."<<endl<<endl;
			continue;
		}
		if(i<n&&p==0)
		{
			cout<<a<<" -- is not a palindrome."<<endl<<endl;
			continue;
		}
		
		
		for(i=0,k=n-1;i<n;++i,--k)
		{
			
			for(j=0;j<21;++j)
			{
				if(b[i]==b1[j])
				{
					b[i]=b2[j];
						break;
				}
					
			}
			if(b[i]!=a[k])
				break;
		}
		if(i>=n)
			h=1;
		if(p==1&&h==0)
			cout<<a<<" -- is a regular palindrome."<<endl<<endl;
		if(p==0&&h==0)
			cout<<a<<" -- is not a palindrome."<<endl<<endl;
		if(p==1&&h==1)
			cout<<a<<" -- is a mirrored palindrome."<<endl<<endl;
		if(p==0&&h==1)
			cout<<a<<" -- is a mirrored string."<<endl<<endl;
	}
	
	return 0;
}