搜索

In order to understand early civilizations, archaeologists often study texts written in ancient languages.One such language, used in Egypt more than 3000 years ago, is based on characters called hieroglyphs.Figure C.1 shows six hieroglyphs and their names. In this problem, you will write a program to recognizethese six characters.

Input

The input consists of several test cases, each of which describes an image containing one or morehieroglyphs chosen from among those shown in Figure C.1. The image is given in the form of a seriesof horizontal scan lines consisting of black pixels (represented by 1) and white pixels (represented by0). In the input data, each scan line is encoded in hexadecimal notation. For example, the sequence ofeight pixels 10011100 (one black pixel, followed by two white pixels, and so on) would be represented inhexadecimal notation as 9c. Only digits and lowercase letters a through f are used in the hexadecimalencoding. The first line of each test case contains two integers, H and W. H (0 < H ≤ 200) is thenumber of scan lines in the image. W (0 < W ≤ 50) is the number of hexadecimal characters in eachline. The next H lines contain the hexadecimal characters of the image, working from top to bottom.Input images conform to the following rules:

• The image contains only hieroglyphs shown in Figure C.1

• Each image contains at least one valid hieroglyph.• Each black pixel in the image is part of a valid hieroglyph.

• Each hieroglyph consists of a connected set of black pixels and each black pixel has at least oneother black pixel on its top, bottom, left, or right side.

• The hieroglyphs do not touch and no hieroglyph is inside another hieroglyph.

• Two black pixels that touch diagonally will always have a common touching black pixel.

• The hieroglyphs may be distorted but each has a shape that is topologically equivalent to one ofthe symbols in Figure C.1. (Two figures are topologically equivalent if each can be transformedinto the other by stretching without tearing.)

The last test case is followed by a line containing two zeros.

Output

For each test case, display its case number followed by a string containing one character for eachhieroglyph recognized in the image, using the following code:

Ankh: A

Wedjat: J

Djed: D

Scarab: S

Was: W

Akhet: K

In each output string, print the codes in alphabetic order. Follow the format of the sample output.

The sample input contains descriptions of test cases shown in Figures C.2 and C.3. Due to spaceconstraints not all of the sample input can be shown on this page.

为了了解早期文明，考古学家经常研究用古代语言写成的文本。

3000多年前在埃及使用的一种这样的语言是基于称为象形文字的字符。
图 1 显示了六个象形文字及其名称。在这个问题中，你将编写一个程序来识别这六个字。

图1：六个象形文字

该题是让你判断给你的数据中有几个象形文字，以及它的名称

给你的是16进制的需要转换成2进制以后再进行判断

图中的象形文字

没有圈的是：W

一个圈的是：A

二个圈的是：K

三个圈的是：J

四个圈的是：S

五个圈的是：D

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int n,m,q;
int map[1010][1010];
char sum[1010];
char s[1010];
char a[6]= {'W','A','K','J','S','D'};

void dfs(int x,int y)
{
    if(x<0||y<0||x>n+1||y>4*n+1)return;
    if(map[x][y])return;
    map[x][y]=-1;
    dfs(x+1,y);
    dfs(x-1,y);
    dfs(x,y+1);
    dfs(x,y-1);
}

void dfs2(int x,int y)
{
    if(x<0||y<0||x>n||y>4*m)return;
    if(map[x][y]==-1)return;
    if(map[x][y]==0)
    {
        q++;
        dfs(x,y);

        return;
    }
    map[x][y]=-1;
    dfs2(x+1,y);
    dfs2(x-1,y);
    dfs2(x,y+1);
    dfs2(x,y-1);
}

int cmp(char a,char b)
{
    return a<b;
}

int main()
{
    int num,Case=1;
    while(~scanf("%d %d",&n,&m))
    {
        if(n==0||m==0)break;
        memset(map,0,sizeof(map));
        memset(sum,0,sizeof(sum));
        for(int i=1; i<=n; i++)
        {
            scanf("%s",s);
            num=1;
            int l=strlen(s);
            for(int j=0; j<m; j++)
            {
                if(s[j]=='0')
                {
                    map[i][num++]=0;
                    map[i][num++]=0;
                    map[i][num++]=0;
                    map[i][num++]=0;
                }
                else if(s[j]=='1')
                {
                    map[i][num++]=0;
                    map[i][num++]=0;
                    map[i][num++]=0;
                    map[i][num++]=1;
                }
                else if(s[j]=='2')
                {
                    map[i][num++]=0;
                    map[i][num++]=0;
                    map[i][num++]=1;
                    map[i][num++]=0;
                }
                else if(s[j]=='3')
                {
                    map[i][num++]=0;
                    map[i][num++]=0;
                    map[i][num++]=1;
                    map[i][num++]=1;
                }
                else if(s[j]=='4')
                {
                    map[i][num++]=0;
                    map[i][num++]=1;
                    map[i][num++]=0;
                    map[i][num++]=0;
                }
                else if(s[j]=='5')
                {
                    map[i][num++]=0;
                    map[i][num++]=1;
                    map[i][num++]=0;
                    map[i][num++]=1;
                }
                else if(s[j]=='6')
                {
                    map[i][num++]=0;
                    map[i][num++]=1;
                    map[i][num++]=1;
                    map[i][num++]=0;
                }
                else if(s[j]=='7')
                {
                    map[i][num++]=0;
                    map[i][num++]=1;
                    map[i][num++]=1;
                    map[i][num++]=1;
                }
                else if(s[j]=='8')
                {
                    map[i][num++]=1;
                    map[i][num++]=0;
                    map[i][num++]=0;
                    map[i][num++]=0;
                }
                else if(s[j]=='9')
                {
                    map[i][num++]=1;
                    map[i][num++]=0;
                    map[i][num++]=0;
                    map[i][num++]=1;
                }
                else if(s[j]=='a')
                {
                    map[i][num++]=1;
                    map[i][num++]=0;
                    map[i][num++]=1;
                    map[i][num++]=0;
                }
                else if(s[j]=='b')
                {
                    map[i][num++]=1;
                    map[i][num++]=0;
                    map[i][num++]=1;
                    map[i][num++]=1;
                }
                else if(s[j]=='c')
                {
                    map[i][num++]=1;
                    map[i][num++]=1;
                    map[i][num++]=0;
                    map[i][num++]=0;
                }
                else if(s[j]=='d')
                {
                    map[i][num++]=1;
                    map[i][num++]=1;
                    map[i][num++]=0;
                    map[i][num++]=1;
                }
                else if(s[j]=='e')
                {
                    map[i][num++]=1;
                    map[i][num++]=1;
                    map[i][num++]=1;
                    map[i][num++]=0;
                }
                else if(s[j]=='f')
                {
                    map[i][num++]=1;
                    map[i][num++]=1;
                    map[i][num++]=1;
                    map[i][num++]=1;
                }
            }
        }
        /*for(int i=0; i<=n; i++)
        {
            for(int j=0; j<=4*m+1; j++)
            {
                printf("%d",map[i][j]);
            }
            printf("\n");
        }*/
        dfs(0,0);
        int k=0;
        for(int i=0; i<=n; i++)
            for(int j=0; j<4*m; j++)
            {
                if(map[i][j]==1)
                {
                    q=0;
                    dfs2(i,j);
                    //printf("%d\n",q);
                    sum[k++]=a[q];
                }
            }
        sort(sum,sum+k,cmp);
        printf("Case %d: ",Case++);
        for(int i=0; i<k; i++)
            printf("%c",sum[i]);
        printf("\n");
    }
    return 0;
}