F - 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

当初在做这个题的时候 ，并不是一道多难的题，但是总是一直过不去，然后从网上搜看别人，对比着改自己的，差点改成一模一样的，最后还是发现了问题。

简单题，输入n,m两个数代表列行，读入字符串，四个方向寻找“.”遇到“#”表示这是墙走不通，求出能到达的点的个数。

首先我们定义表示4个方向的2个一维数组，我们在主函数里要遍历找到起始点“@”的位置，将坐标传给自己写的函数sousuo()

我们在这个函数里面定义一个sum调用一次函数就++，这个sum就是我们最终的结果，同时，很重要的一点是走过的点我们要把他做个标记，不能让他重复再走这个点，在这里我们直接标记为墙“#”，接下来就是用for循环不断的刷新坐标值并且不断的调用函数。

在这里有个非常重要的一点，也是我卡在这里的主要原因就是if的判断条件  。

因为我们是从0开始的，所以边界的最大值不会是n,m。而是n-1,和m-1了

所以判断越界的条件是
if(nx>=0&&nx<m&&ny>=0&&ny<……）

最后输出，sum，完事！