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
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)
The end of the input is indicated by a line consisting of two zeros.
Output
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.
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 0Sample Output
45 59 6 13
题解:
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int m, n;
int max = 1;
char a[25][25];
int sx, sy;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
void dfs(int x, int y)
{
a[x][y] = '#';
for (int i = 0; i < 4; i++)
{
if (a[x + dx[i]][y + dy[i]] == '.' && 0 <= x + dx[i] && x + dx[i] < n && 0 <= y + dy[i] && y + dy[i] < m)
{
max++;
dfs(x + dx[i], y + dy[i]);
}
}
return;
}
int main()
{
while (scanf("%d %d", &m, &n) && (m != 0 && n !=0))
{
getchar();
for(int i = 0; i < n; i++)
{
for (int j = 0; j < m; j++)
{
a[i][j] = getchar();
if (a[i][j] == '@')
{
sx = i;
sy = j;
}
}
getchar();
}
dfs(sx, sy);
printf("%d\n", max);
max = 1;
}
return 0;
}