[kuangbin带你飞]专题一 简单搜索 - L - Oil Deposits

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
char g[105][105];
int x, y, ans;
int dx[3]={1,0,-1};
int dy[3]={1,0,-1};
bool sscanf()
{
    char tmp[105];
    scanf("%d%d",&x,&y);
    if(x==0 && y==0)    return false;
    for(int i = 1; i <= x; i++)
    {
        scanf("%s",tmp);
        for(int j = 1; j <= y; j++)
            g[i][j] = tmp[j-1];
    }
    ans = 0;
    return true;
}
void find(int xi, int yi)
{
    if(g[xi][yi]=='@')
    {
        g[xi][yi]='*';
        for(int i = 0; i < 3; i++)
            for(int j = 0; j < 3; j++)
                find(xi+dx[i],yi+dy[j]);
    }
    return;
}
int main()
{
//    freopen("in.in","r",stdin);
//    freopen("out.txt","w",stdout);
    while(sscanf())
    {
        for(int i = 1; i <= x; i++)
            for(int j = 1; j <= y; j++)
            {
                if(g[i][j]=='@')
                {
                    ans++;
                    find(i, j);
                }
            }
        printf("%d\n",ans);    
    }
    
    return 0;
}