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) 

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

模板水题，只要套用模板就好了， 这个是DFS的。

#include<stdio.h>
#include<string.h>

const int maxn = 25;
int vis[maxn][maxn];
char str[maxn][maxn];
int n, m, ans = 0;

int d[4][2] = {1, 0, -1, 0, 0, 1, 0, -1};

void DFS(int x, int y){
	if (vis[x][y] || str[x][y] == '#' || x < 0|| x >= n || y < 0 || y >= m){
		return;
	}
	else{
		ans++;
		for (int i = 0; i < 4; i++){
			vis[x][y] = 1;
			int dx = x + d[i][0];
			int dy = y + d[i][1];
		//	printf ("(%d,%d)\n", dx, dy);
			DFS(dx, dy);
		}
	}
}

int main()
{
	while (scanf ("%d %d", &m, &n) != EOF && (n + m)){
		for (int i = 0; i < n; i++){
			scanf ("%s", str[i]);
		}
		int x, y;
		for (int i = 0; i < n; i++)
			for (int j = 0; j < m; j++)
				if (str[i][j] == '@')
					x = i, y = j;
		ans = 0;
		memset(vis, 0, sizeof(vis));
		DFS(x, y);
		printf ("%d\n", ans);
	}
	return 0;
}

这个是BFS。

#include<stdio.h>
#include<string.h>
#include<queue>

using namespace std;

const int maxn = 25;
int vis[maxn][maxn];
char str[maxn][maxn];
int n, m, ans = 0;

int d[4][2] = {1, 0, -1, 0, 0, 1, 0, -1};

//void DFS(int x, int y){
//	if (vis[x][y] || str[x][y] == '#' || x < 0|| x >= n || y < 0 || y >= m){
//		return;
//	}
//	else{
//		ans++;
//		for (int i = 0; i < 4; i++){
//			vis[x][y] = 1;
//			int dx = x + d[i][0];
//			int dy = y + d[i][1];
//		//	printf ("(%d,%d)\n", dx, dy);
//			DFS(dx, dy);
//		}
//	}
//}

struct node{
	int x, y, step;
};

void BFS(int x, int y){
	memset(vis, 0, sizeof(vis));
	queue<node>que;
	node e1, e2;
	e1.x = x, e1.y = y, e1.step = 0;
	que.push(e1);
	vis[x][y] = 1;
	ans = 0;
	while(!que.empty()){
		ans ++;
		e1 = que.front(); que.pop();
		for (int i = 0; i < 4; i++){
			e2.x = e1.x + d[i][0]; e2.y = e1.y + d[i][1];
			if (e2.x >= n || e2.y >= m || e2.x < 0 || e2.y < 0)
				continue;
			if (str[e2.x][e2.y] == '#') continue;
			if (vis[e2.x][e2.y]) continue;
			e2.step = e1.step + 1;
			que.push(e2);
			vis[e2.x][e2.y] = 1;
		}
	}
	printf ("%d\n", ans);
}

int main()
{
	while (scanf ("%d %d", &m, &n) != EOF && (n + m)){
		for (int i = 0; i < n; i++){
			scanf ("%s", str[i]);
		}
		int x, y;
		for (int i = 0; i < n; i++)
			for (int j = 0; j < m; j++)
				if (str[i][j] == '@')
					x = i, y = j;
		BFS(x, y);			
//		ans = 0;
//		memset(vis, 0, sizeof(vis));
//		DFS(x, y);
//		printf ("%d\n", ans);
	}
	return 0;
}