hdu 1312

点击打开链接
//dfs
#include <iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn=20+5;
const int dx[]={0,0,-1,1};
const int dy[]={-1,1,0,0};
char field[maxn][maxn];
int r,c;
bool done[maxn][maxn];
int k;
void dfs(int x,int y)
{
    done[x][y]=true;
    k++;
    for(int i=0;i<4;i++)
    {
        int nx=x+dx[i],ny=y+dy[i];
        if(nx>=0&&nx<c&&ny>=0&&ny<r&&!done[nx][ny]&&field[nx][ny]!='#') {
            dfs(nx,ny);
        }
    }
}
int main()
{
    while(scanf("%d%d",&r,&c)==2)
    {
        int sx,sy;
        k=0;
        if(!r&&!c) break;
        for(int i=0;i<c;i++)
            {
                scanf("%s",&field[i]);
                for(int j=0;j<r;j++)
                    if(field[i][j]=='@') {
                       sx=i;
                       sy=j;
                }
            }
        memset(done,false,sizeof(done));
        dfs(sx,sy);
        printf("%d\n",k);
    }
    return 0;
}