2.10题目翻译

https://acs.jxnu.edu.cn/problem/HDU1312

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. 

输入：

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) 

输出：

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). 

有一个长方形的房间，上面铺着正方形的瓷砖。每个瓷砖都是红色或黑色的。一个人正站在一块黑色的瓷砖上。从一个瓷砖上，他可以移动到四个相邻的瓷砖中的一个。但他不能在红色瓷砖上移动，他只能在黑色瓷砖上移动。设计一个程序通过他可以达到的重复上面描述的移动来计算黑色瓷砖的数量。

输入:

该输入由多个数据集组成。数据集以包含两个正整数W和H的线开始；W和H分别是x方向和y方向上的瓷砖数。W和H不超过20。数据集中还有H行，每一行都包含W个字符。每个字符代表如下所述的一个瓷砖的颜色。

'.'-一个黑色瓷砖

#-红色瓷砖

@-a 黑色瓷砖上的人（在数据集中恰好出现一次）

输出:

对于每个数据集，你的程序应该输出一行，其中包含他可以从初始瓷砖（包括其本身）到达的瓷砖数量。