A - Red and Black

点击打开链接

There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent tiles. But he can't move on red tiles, he can move only on black tiles. 

Write a program to count the number of black tiles which he can reach by repeating the moves described above. 

Input

The input consists of multiple data sets. A data set starts with a line containing two positive integers W and H; W and H are the numbers of tiles in the x- and y- directions, respectively. W and H are not more than 20. 

There are H more lines in the data set, each of which includes W characters. Each character represents the color of a tile as follows. 

'.' - a black tile 
'#' - a red tile 
'@' - a man on a black tile(appears exactly once in a data set) 

Output

For each data set, your program should output a line which contains the number of tiles he can reach from the initial tile (including itself). 

Sample Input

6 9
....#.
.....#
......
......
......
......
......
#@...#
.#..#.
11 9
.#.........
.#.#######.
.#.#.....#.
.#.#.###.#.
.#.#..@#.#.
.#.#####.#.
.#.......#.
.#########.
...........
11 6
..#..#..#..
..#..#..#..
..#..#..###
..#..#..#@.
..#..#..#..
..#..#..#..
7 7
..#.#..
..#.#..
###.###
...@...
###.###
..#.#..
..#.#..
0 0

Sample Output

45
59
6
13

#include<stdio.h>
#include<cstring>
int n,m,k,ans,t;
int b[25][25];
int fx[4]={0,0,-1,1,},fy[4]={1,-1,0,0};
char a[25][25];
void dfs(int x,int y)
{
	b[x][y]=1;
	int xx,yy,i;
	for(i=0;i<4;i++)
	{
		xx=x+fx[i];
		yy=y+fy[i];
		if(xx>=0&&xx<n&&yy>=0&&yy<m&&!b[xx][yy]&&a[xx][yy]=='.')
		{
		  ans++;
	      dfs(xx,yy);
	    }
	}
}
int main()
{
	int i,j;
	while(~scanf("%d %d",&m,&n))
	{
	   if(m==0&&n==0)
		 break;
	   for(i=0;i<n;i++)
	     scanf("%s",a[i]);
	   memset(b,0,sizeof(b));
	   ans=1;
	   t=0;
	   for(i=0;i<n;i++)
	   {
	     for(j=0;j<m;j++)
		   if(!b[i][j]&&a[i][j]=='@')	
		   {
		   	 dfs(i,j);
		   	 t=1;
		   	 break;
		   }
		 if(t==1)
		   break;
	   }
	   printf("%d\n",ans);
	}
}