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 O (zero) and 0 (the letter) are considered the same character and therefore ONLY the letter "0" 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.

Note that the output line is to include the -'s and spacing exactly as shown in the table above and demonstrated in the Sample Output below.

In addition, after each output line, you must print an empty line.

Sample Input 

NOTAPALINDROME 
ISAPALINILAPASI 
2A3MEAS 
ATOYOTA

Sample Output 

NOTAPALINDROME -- is not a palindrome.
 
ISAPALINILAPASI -- is a regular palindrome.
 
2A3MEAS -- is a mirrored string.
 
ATOYOTA -- is a mirrored palindrome.

题目大意：判断一个字符串是不是回文、镜像字符串。

解题思路：逐一判断。

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

#define N 100

int judge_pa(char str[])
{
	int n = strlen(str);

	for (int i = 0; i < n / 2; i++)
		if (str[i] != str[n - i - 1])
			return 0;
	return 1;
}

int judge_mi(char str[])
{
	int n = strlen(str);
	for (int i = 0; i <= n / 2; i++)
	{
		switch(str[i])
		{
			case 'E':
				if (str[n - i -1] != '3')
					return 0;
				break;
			case 'J':
				if (str[n - i - 1] != 'L')
					return 0;
				break;
			case 'L':
				if (str[n - i - 1] != 'J')
					return 0;
				break;
			case 'S':
				if (str[n - i - 1] != '2')
					return 0;
				break;
			case '2':
				if (str[n - i - 1] != 'S')
					return 0;
				break;
			case '3':
				if (str[n - i - 1] != 'E')
					return 0;
				break;
			case 'Z':
				if (str[n - i - 1] != '5')
					return 0;
				break;
			case '5':
				if (str[n - i - 1] != 'Z')
					return 0;
				break;
			case 'A':
			case 'H':
			case 'I':
			case 'M':
			case 'O':
			case 'T':
			case 'U':
			case 'V':
			case 'W':
			case 'X':
			case 'Y':
			case '1':
			case '8':
				if (str[i] != str[n - i - 1])
					return 0;
				break;
			default:
				return 0;
		}
	}
	return 1;
}

int main ()
{
	char str[N];
	int bool_pa;
	int bool_mi;

	while (cin >> str)
	{
		// Judge.
		bool_pa = judge_pa(str);
		bool_mi = judge_mi(str);

		// Print.
		if (bool_pa && bool_mi)
			cout << str << " -- is a mirrored palindrome." << endl;
		else if (bool_pa)
			cout << str << " -- is a regular palindrome." << endl;
		else if (bool_mi)
			cout << str << " -- is a mirrored string." << endl;
		else 
			cout << str << " -- is not a palindrome." << endl;
		cout << endl;

		// Init.
		memset(str, 0, sizeof(str));
	}
	return 0;
}