Problem 003——palindromes

标签：style   io   color   ar   for   sp   strong   div   on   

Problem   Three

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 ONLYthe 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.





CODE

      

#include"stdio.h"

#include



char const jxhw[]="A   3  HIL JM O   2TUVWXY51SE Z  8 ";



char jh(char ch)

{

    char a;

    a=ch-‘A‘;

    if(a>=0)

        return jxhw[ch-‘A‘];

    return jxhw[ch-‘0‘+25];

}



int main()

{

    char inp[99];

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

    {

        int len=strlen(inp);

        int i,jingxiang=1,huiwen=1;

        for(i=0; i<(len+1)/2; i++)

        {

            if(inp[i]!=inp[len-i-1])

                huiwen=0;

            if(jh(inp[i])!=inp[len-i-1])

                jingxiang=0;

        }

        if(jingxiang==0&&huiwen==0)

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

        if(jingxiang==0&&huiwen==1)

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

        if(jingxiang==1&&huiwen==0)

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

        if(jingxiang==1&&huiwen==1)

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

    }

    return 0;

}







My Way

    这道题想了挺长时间的，在最初的时候，我没有头绪。后来经过一番思考，理清头绪后，开始完成这道题目。

    首先，用const强制定义了一个数组，将所用的镜像全部都列了出来（其实不用const也可以，保险起见）。程序开始，定义了一个足够长的数组，用来储存输入。用while与EOF搭配来循环输入。然后测定输入字符串的长度，通过长度来计算for循环中所需计算的次数。在循环之前，定义了jingxiang和huiwen两个变量都为一（是）。在循环中，两个if分别是用来判断是否是回文或者是镜像的。最后，通过判断jingxiang和huiwen的是非便可以分别出是否是镜像还是回文，亦或是两者都是。

    题目不难，但是由于不能熟练的应用知识，导致自己做了很长时间。看看那些秒AC的大神，自己要走的路还有很长，很长。

Problem 003——palindromes

标签：style   io   color   ar   for   sp   strong   div   on   

原文地址：http://www.cnblogs.com/acmer-zcy/p/4061086.html