Red and Black （广搜 队列）

/*水题：
  思路：四个方向，找到就加一。*/
#include<stdio.h>
#include<queue>
using namespace std;
int n,m,sum,c[4][2]={1,0,0,1,-1,0,0,-1};
char map[101][101];


struct yun
{
    int x,y;
};


int bfs(int x,int y)
{
    yun st,en;
    queue<yun>Q;
    st.x=x;
    st.y=y;
    Q.push(st);
    while(!Q.empty())
    {
        st=Q.front();
        Q.pop();
        for(int i=0;i<4;i++)
        {
            int dx=st.x+c[i][0];
            int dy=st.y+c[i][1];
            if(dx<0||dy<0||dx>=m||dy>=n||map[dx][dy]=='#')continue;
            map[dx][dy]='#';
            en.x=dx;
            en.y=dy;
            sum++;//只要符合条件就加一。 
            Q.push(en);
        }
    }
    return sum;
}


int main()
{
    int i,j;
    while(~scanf("%d%d",&n,&m)&&(m||n))
    {
        sum=1;
        for(i=0;i<m;i++)
            scanf("%s",map[i]);
        for(i=0;i<m;i++)
            for(j=0;j<n;j++)
            {
                if(map[i][j]=='@')
                {
                    map[i][j]='#';
                    bfs(i,j);
                    break;
                }
            }
        printf("%d\n",bfs(i,j));
    }
}

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