N - 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)
The end of the input is indicated by a line consisting of two zeros.
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<cstdio>
#include<cstring>
#include<iostream>
#include<queue>
using namespace std;
typedef struct
{
	int x,y;
}N;
N s,e;
int d[4][2]={{0,1},{0,-1},{1,0},{-1,0}};
int vis[1000][1000];
int n,m;
char  mise[1000][1000];
void bfs(int x,int y)
{
	queue<N>q;
	s.x=x;
	s.y=y;
	q.push(s);
	vis[x][y]=1;
	while(q.size())
	{
      s=q.front();
	  q.pop();
      for(int i=0;i<4;i++)
	  {
		   e.x=s.x+d[i][0];
		   e.y=s.y+d[i][1];
		  if(e.x>=0&&e.x<m&&e.y>=0&&e.y<n&&!vis[e.x][e.y]&&mise[e.x][e.y]!='#')
		  {
			  q.push(e);
			   vis[e.x][e.y]=1;
		  }
	  }
	} 
}
int main()
{
	int i,j,xx,yy;
	while(cin>>n>>m,n,m)
	{
		memset(vis,0,sizeof(vis));
    	memset(mise,0,sizeof(mise));
		for( i=0;i<m;i++)
			for(j=0;j<n;j++)
				cin>>mise[i][j];
			for( i=0;i<m;i++)
			{
				for(j=0;j<n;j++)
				{
					if(mise[i][j]=='@')
					{
					   xx=i;
					   yy=j;
					   break;
					}
				}
			}
			bfs(xx,yy);
			int c=0;
			for(i=0;i<m;i++){
			for(j=0;j<n;j++)
			if(vis[i][j]==1) c++;}
			 cout<<c<<endl;
	}
	return 0;
}