Mirror, Mirror on the Wall

最新推荐文章于 2025-02-05 23:09:34 发布

原创最新推荐文章于 2025-02-05 23:09:34 发布 · 441 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#简单题

练习专栏收录该内容

160 篇文章

订阅专栏

本文介绍了一种基于字母镜像特性的文字编码方法，并提供了一个简单的实现案例。通过对特定字母进行镜像转换，可以将原始字符串编码为另一种形式，反之亦然。文章包括输入输出示例及代码实现。

Description

For most fonts, the lowercase letters b and d are mirror images of each other, as are the letters p and q. Furthermore, letters i, o, v, w, and x are naturally mirror images of themselves. Although other symmetries exists for certain fonts, we consider only those specifically mentioned thus far for the remainder of this problem.

Because of these symmetries, it is possible to encode certain words based upon how those words would appear in the mirror. For example the word boxwood would appear as boowxod, and the word ibid as bidi. Given a particular sequence of letters, you are to determine its mirror image or to note that it is invalid.

Input

The input contains a series of letter sequences, one per line, followed by a single line with the ‘#’ character. Each letter sequence consists entirely of lowercase letters.

Output

For each letter sequence in the input, if its mirror image is a legitimate letter sequence based upon the given symmetries, then output that mirror image. If the mirror image does not form a legitimate sequence of characters, then output the word ‘INVALID’.

Sample Input

boowxod

bidi

bed

bbb

Sample Output

boxwood

ibid

INVALID

ddd

解析

题中所说的镜像变换我们不妨拿样例1 boowxod 举例子，通过观察样例输出 boxwood 发现，boxwood 是由 boowxod 从末尾的字符开始镜象变换的，d的镜像字符是b,输出b。o的镜像字符是o，输出o......一直到首字符b变换输出d。

代码

#include<stdio.h>
#include<string.h>
#define MAX 100005
int main()
{
    char str[MAX],temp[MAX];
    while(~scanf("%s",str))
    {
        int len=strlen(str);
        if(len==1&&str[0]=='#')
             break;
        int i,j,flag=1;
        for(i=len-1,j=0;i>=0;i--,j++)
        {
            if(str[i]=='b')
                temp[j]='d';
            else if(str[i]=='d')
                temp[j]='b';
            else if(str[i]=='p')
                temp[j]='q';
            else if(str[i]=='q')
                temp[j]='p';
            else if(str[i]=='i')
                temp[j]=str[i];
            else if(str[i]=='o')
                temp[j]=str[i];
            else if(str[i]=='v')
                temp[j]=str[i];
            else if(str[i]=='w')
                temp[j]=str[i];
            else if(str[i]=='x')
                temp[j]=str[i];
            else
                flag=0;
        }
        if(!flag)
            printf("INVALID\n");
        else
        {
            for(i=0;i<len;i++)
            {
                printf("%c",temp[i]);
            }
            printf("\n");
        }
    }
    return 0;
}