HDU 1241

#include<iostream>
#include<cmath>
#include<string>
using namespace std;
int go[8][2] = {
	1,0,
	1,-1,
	0,-1,
	-1,-1,
	-1,0,
	-1,1,
	0,1,
	1,1,
};
void dfs(char *a[], int y, int x, int l, int h)
{
	a[y][x] = '*';
	for (int i = 0;i < 8;i++)
	{
		int tx, ty;
		tx = x + go[i][0], ty = y + go[i][1];
		if (tx >= 0 && tx <= l && ty >= 0 && ty <= h)
			if (a[ty][tx] == '@')
				dfs(a, ty, tx, l, h);
	}
}
int main()
{
	int l, h;
	while (cin >> h >> l, h != 0)
	{
		int n = 0;
		char *a[100];
		for (int i = 0;i < h;i++)
			a[i]=new char[100],cin >> a[i];
		for (int y = 0;y < h;y++)
			for (int x = 0;x < l;x++)
				if (a[y][x] == '@')
				{
					dfs(a, y, x, l - 1, h - 1), n++;
				}
		cout << n << endl;
	}
}

dfs类的水题，没什么坑难点，就是不同在于标记了之后就不用取消而已（反正我是这样做的）