UVA 784 - Maze Exploration

搜索*号能到的位置，置为#，然后输出整个输入的迷宫。

#include<cstdio>
#include<cstring>
#include<cstdlib>

char a[35][85];
char b[100];
const int dx[] = { 1, -1, 0, 0};
const int dy[] = { 0, 0, -1, 1};

void dfs( int x, int y)
{
    for( int d = 0; d < 4; d ++)
    {
        int nx = x + dx[d];
        int ny = y + dy[d];
        if( a[nx][ny] == 1) {
            a[nx][ny] = 2;
            dfs( nx, ny);
        }
    }
}

int main()
{
    int n;
    scanf( "%d", &n);
    getchar();
    while( n --)
    {
        int x, y;
        int t = 0;
        memset( a, -1, sizeof a);
        while( true)
        {
            gets(b);
            if( b[0] == '_') break;
            int len = strlen( b);
            for( int i = 0; i < len; i ++)
            {
                if( b[i] == 'X')
                    a[t][i] = 0;
                else if( b[i] == ' ')
                    a[t][i] = 1;
                else if( b[i] == '*') {
                    a[t][i] = 2;
                    x = t, y = i;
                }
            }
            t ++;
        }
        dfs( x, y);
        for( int i = 0; i < t; i ++)
        {
            for( int j = 0; a[i][j] != -1; j ++)
            {
                if( a[i][j] == 0)
                    printf( "X");
                else if( a[i][j] == 1)
                    printf( " ");
                else
                    printf( "#");
            }
            printf( "\n");
        }
        printf( "%s\n", b);
    }
    return 0;
}