A - Red and Black(3.2.1)

Description

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 <string>
#include <cstring>
using namespace std;

#define M 25
#define N 25

int n , m , ans ;
string _map[M] ;
bool visited[M][N] ;

void _search(int row , int col )   //递归计算男子由[row，col]出发经过的瓷砖数
{
    if( row < 0 || row >= m || col < 0 || col >= n || _map[row][col] == '#' || visited[row][col] )  //row 表示行， col表示列
        return ;
    visited[row][col] = true ;
    ++ans;
    _search( row - 1 , col ) ;
    _search( row + 1 , col ) ;
    _search( row , col - 1 ) ;
    _search( row , col + 1 ) ;
}

int main()
{
    while( cin >> n >> m && ( m || n ) )
    {
        int row , col ;
        for(int i = 0 ; i < m ; i++ )
        {
            cin >> _map[i] ;
            for( int j = 0 ; j < n ;j++ )
            {
                if( _map[i][j] == '@' )
                {
                    row = i ;
                    col = j ;
                }
            }
        }
        memset( visited , false , sizeof(visited) ) ;
        ans = 0 ;
        _search( row , col ) ;
        cout << ans << endl ;
    }
}