dfs-铺地砖

#include <bits/stdc++.h>
using namespace std;
const int N = 999;
int sx, sy;
int num;
int n, m;
char pd[N][N];

int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};

void dfs (int x, int y) 
{
	num++;
	for (int i = 0; i < 4; i++) 
	{
		int xx = x + dx[i], yy = y + dy[i];
		if (xx >= 0 && xx < n && yy >= 0 && yy < m && pd[xx][yy] == '.') 
		{
			pd[xx][yy] = '#';
			dfs(xx, yy);
		}
	}
}

int main () 
{
	while (cin >> m >> n, n, m) 
	{
		num = 0;
		for (int i = 0; i < m; i++) 
		{
			cin >> pd[i];
			for (int j = 0; j < m; j++) 
			{
				if (pd[i][j] == '@') 
				{
					sx = i;
					sy = j;
				}
			}
		}
		dfs(sx, sy);
		cout << num << endl;
	}
	return 0;
}