油田（DFS)

//DFS：油田问题
#include <iostream>
using namespace std;
char grid[][];
int n,m;

//一个网格的8个方向
int  dir[][] = {{-,-},{-,},{-,},{,-},{,},{,-},{,},{,}};

//从（x,y）进行深度优先遍历
void DFS(int x,int y)
{
    int xx,yy;
    grid [x][y] = '*';
    for (int i = ; i < ; i++)
    {
        xx = x + dir[i][];
        yy = y + dir[i][];
        if(xx< || xx>=n || yy< ||yy>=m)
            continue;
        if(grid[xx][yy] =='@')
            DFS(xx,yy);
    }
}

int main()
{
    int i,j;//定义循环变量
    int count;
    while(cin>>n>>m)
    {
        if(n== && m ==)
            break;
        count = ;

        memset(grid,,sizeof(grid));

        for(i = ; i<n; i++)
            cin>>grid[i];

        for(i = ; i<n; i++)
            for(j = ; j<m;j++)
                if(grid[i][j]=='@')
                {
                    //在（i,j）遍历，并且遍历了一个“油田”，计数器加1
                    DFS(i,j);
                    count++;
                }
        cout<<count<<endl;
    }
    return ;
}