Palindromes UVA

　 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.

STRING	CRITERIA
‘ -- is not a palindrome.’	if the string is not a palindrome and is not a mirrored string
‘ -- is a regular palindrome.’	if the string is a palindrome and is not a mirrored string
‘ -- is a mirrored string.’	if the string is not a palindrome and is a mirrored string
‘ -- is a mirrored palindrome.’	if the string is a palindrome and is a mirrored string

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.

HINT

regular palindrome 是指输入的字符串和倒序是一样的。

mirrored string 是指将输入的字符船的每一个元素按照要求转换之后的倒序和原来输入的相同。

mirrored palindrome 是指输入的字符串同时满足上面的两个要求。

not a palindrome 什么都不满足。

　这里采用的思路是将输入的字符串倒序获得一个字符串，然后转换之后再倒序获得一个字符串。然后将输入的字符串和获得的两个字符串比较，按照规则输出结果。

Accepted

#include<stdio.h>

#include<string.h>

char reverse[40] = "A   3  HIL JM O   2TUVWXY51SE Z  8 ";//转换规则

int main()

{

    char s[22];

    while (scanf("%s", s) != EOF)

    {

        int len = strlen(s);

        char backward[22];

        for (int i = len-1, k = 0;i >= 0;i--, k++)				//获得倒序字符串

        {

            backward[k] = s[i];

        }

        backward[len] = '\0';

        char revchanged[22];

        for (int i = 0;i < len;i++)								//获得转换的字符串

        {

            if (s[i] <= 'Z' && s[i] >= 'A')

                revchanged[i] = reverse[s[i] - 'A'];

            else

                revchanged[i] = reverse[s[i] - '1' + 26];

        }

        revchanged[len] = '\0';

        char revbackchanged[22];									//转换之后获得倒序字符串

        for (int i = len-1, k = 0;i >= 0;i--, k++)

            revbackchanged[k] = revchanged[i];

        revbackchanged[len] = '\0';

        if (strcmp(s, backward) == 0 && strcmp(s, revbackchanged) == 0)		//结果输出

            printf("%s -- is a mirrored palindrome.\n\n", s);

        else if (strcmp(s, backward) == 0)

            printf("%s -- is a regular palindrome.\n\n", s);

        else if (strcmp(s, revbackchanged) == 0)

            printf("%s -- is a mirrored string.\n\n", s);

        else printf("%s -- is not a palindrome.\n\n", s);

    }

}

巴特西

Palindromes UVA - 401