#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#define M 105
using namespace std;
char graph[M][M];
int pocket,hv,m,n;
int next[8][2]={{-1,0},{-1,-1},{0,-1},{1,1},{1,0},{1,-1},{0,1},{-1,1}};
queue<int>Q;
void BFS(int,int);
int main()
{
int i,j;
//freopen("in.txt","r",stdin);
while(scanf("%d%d\n",&m,&n)&&m)
{
for(i=0;i<m;i++)
gets(graph[i]);
pocket=0;
for(i=0;i<m;i++)
for(j=0;j<n;j++)
if(graph[i][j]=='@')
{
BFS(i,j);
pocket++;
}
printf("%d\n",pocket);
}
return 0;
}
void BFS(int x,int y)
{
int i,tx,ty;
Q.push(x);Q.push(y);
graph[x][y]='*';
while(!Q.empty())
{
x=Q.front();Q.pop();
y=Q.front();Q.pop();
for(i=0;i<8;i++)
{
tx=x+next[i][0],ty=y+next[i][1];
if(tx>=0&&tx<m&&ty>=0&&ty<n&&graph[tx][ty]=='@')
{
graph[tx][ty]='*';
Q.push(tx);
Q.push(ty);
}
}
}
}
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.