UVA1003(dfs+进制转换)

题意：输入很多字符的16进制数，现在需要你先转化为2进制，之后二进制中1和0组成的字符需要你求出来。

思路：字符每一个都有所不同可以靠圆圈的数目求出。

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>

using namespace std;

int gragh[][];
int n,m;
int ans;
int dir[][] = {{-,},{,},{,},{,-}};

void change(char c,int x,int y)
{
    if(c >= '' && c <= ''){
        int d = c - '';
        gragh[x][(y-)*+] = d%;d /= ;
        gragh[x][(y-)*+] = d%;d /= ;
        gragh[x][(y-)*+] = d%;d /= ;
        gragh[x][(y-)*+] = d%;
    }
    else {
        int d = c - 'a' + ;
        gragh[x][(y-)*+] = d%;d /= ;
        gragh[x][(y-)*+] = d%;d /= ;
        gragh[x][(y-)*+] = d%;d /= ;
        gragh[x][(y-)*+] = d%;
    }
}

void dfs1(int x,int y)      //作用是把1.没用的0清掉 2.没遇到一种情况就把0清掉
{
    gragh[x][y] = -;
    for(int i = ;i < ; i++){
        int xx = x + dir[i][];
        int yy = y + dir[i][];
        if(xx >=  && xx <= n && yy >=  && yy <= m && gragh[xx][yy] == ){
            dfs1(xx,yy);
        }
    }
}

void dfs2(int x,int y)
{
    gragh[x][y] = -;
    for(int i = ;i < ; i++){
        int xx = x + dir[i][];
        int yy = y + dir[i][];
        if(xx >=  && xx <= n && yy >=  && yy <= m && gragh[xx][yy] == ){
            ans++;          //记录每一种字符的圈数
            dfs1(xx,yy);
        }
        else if(xx >=  && xx <= n && yy >=  && yy <= m && gragh[xx][yy] == ){
            dfs2(xx,yy);
        }
    }
}

int main()
{
  //  freopen("in.txt","r",stdin);
    int ncase = ;
    while(scanf("%d%d",&n,&m) != EOF){
        if(n ==  && m == )
            break;

        memset(gragh,,sizeof(gragh));

        char a[];
        for(int i = ;i <= n; i++){
            scanf("%s",a+);
            for(int j = m;j >= ; j--){
                change(a[j],i,j);       //分别是十六进制的数，第几行，第几列
            }
        }

        m *= ;
        for(int i = ;i <= n; i++){
            if(gragh[i][] == ){
                dfs1(i,);
            }
            if(gragh[i][m] == ){
                dfs1(i,m);
            }
        }
        for(int j = ;j <= m; j++){
            if(gragh[][j] == ){
                dfs1(,j);
            }
            if(gragh[n][j] == ){
                dfs1(n,j);
            }
        }
        int pos = ;
        char s[];
        for(int i = ;i <= n; i++){
            for(int j = ;j <= m; j++){
                ans = ;
                if(gragh[i][j] == ){
                    dfs2(i,j);
                    if(ans == )
                        s[pos++] = 'A';
                    else if(ans == )
                        s[pos++] = 'J';
                    else if(ans == )
                        s[pos++] = 'D';
                    else if(ans == )
                        s[pos++] = 'S';
                    else if(ans == )
                        s[pos++] = 'W';
                    else if(ans == )
                        s[pos++] = 'K';
                }
            }
        }
        sort(s,s+pos);
        printf("Case %d: ",ncase++);
        for(int i = ;i < pos; i++)
            printf("%c",s[i]);
        printf("\n");
    }
    return ;
}