UC知道一个C语言难题 高手来~red and black
来源：百度知道 编辑：UC知道 时间：2024/07/05 02:16:56
成绩: 10 / 折扣: 0.8
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
//以下代码在我的机器上调试通过 vs2005 我估计在vc6.0也行
//因为我是用纯C来写的
//请注意放一个input.txt里面写上数据
//这个算法采用DFS递归方式来寻找的.
//算法在一秒内就运行完成了
//
/*
18. Red and Black
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.
'.'