poj1979 Red and Black

//poj1979
#include<stdio.h> 
#include<iostream>
#include <string.h>
int chess[22][22];
int dir[4][2] = {{0,-1},{1,0},{0,1},{-1,0} };
int status;  //方案计数器  
int n, k, x, y;
void DFS(int x, int y)    
{
    chess[x][y] = 1;//走过的点就标记
    status++;
    for (int j = 0; j < 4; j++)
    {
        int xx = x + dir[j][1];
        int yy = y + dir[j][0];
        if (xx < k && xx >= 0 && yy >= 0 && yy < n && chess[xx][yy] == 0)
            DFS(xx, yy);
    }
    return ;
}
int main()
{
    while (scanf("%d%d", &n, &k) != EOF)
    {
        getchar();
        if (n == 0 && k == 0)
            break;
        memset(chess, 0, sizeof(chess));//对数组清零操作
        status = 0;
        for (int i = 0; i<k; i++)
        {
            for (int j = 0; j<n; j++)
            {
                char temp;
                scanf("%c", &temp);
                if (temp == ‘#‘)
                {
                    chess[i][j] = 1;
                }
                if (temp == ‘@‘)
                {
                    x = i;
                    y = j;
                }
            }
            getchar();
        }
        
        DFS(x, y);  //注意初始化的值别弄错了  
        printf("%d\n", status);
    }
    return 0;
}