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<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int row,col,cnt;
char mp[25][25];
bool visited[25][25];
void dfs(int x,int y){
    int next[4][2] = {{1,0},{-1,0},{0,1},{0,-1}};
    for(int i = 0;i < 4;i++){
        int tx = x + next[i][0];
        int ty = y + next[i][1];
        if(tx < 0 || tx >= row || ty < 0 || ty >= col)
            continue;
        if(mp[tx][ty] == '.' && !visited[tx][ty]){
            cnt++;
            visited[tx][ty] = true;
            dfs(tx,ty);
        }
    }
    return;
}
int main(){
    int a,b;
    while(~scanf("%d%d",&col,&row) && row && col){
        cnt = 1;
        memset(mp,0,sizeof(mp));
        memset(visited,false,sizeof(visited));
        getchar();//输入字符前需要清除输入缓冲区中的字符
        for(int i = 0;i < row;i++){
            for(int j = 0;j < col;j++){
                scanf("%c",&mp[i][j]);
                if(mp[i][j] == '@'){//寻找@所在的位置下标
                    a = i;
                    b = j;
                }
            }
            getchar();//清除每一行后的回车字符！！
        }
        visited[a][b] = true;
        dfs(a,b);
        printf("%d\n",cnt);
    }
    return 0;
}