Lake Counting

找水洼，scanf傻傻的不会用、、

#include <cstdio>
#include <iostream>
using namespace std;
int N, M;
char Lu[1001][1001];
void dfs(int x, int y)
{
	Lu[x][y] = '.';
	for (int i = -1; i <= 1; i++){
		for (int j = -1; j <= 1; j++){
			int nx = x + i, ny = y + j;
			if (nx >= 1 && nx <= N && ny >= 1 && ny <= M && Lu[nx][ny] == 'W')
				dfs(nx, ny);
		}
	}
	return ;
}
int main()
{
	scanf("%d %d", &N, &M);
	for (int i = 1; i <= N; i++)
		for (int j = 1; j <= M; j++)
			cin >> Lu[i][j];
	int sum = 0;
	for (int i = 1; i <= N; i++){
		for (int j = 1; j <= M; j++){
			if (Lu[i][j] == 'W'){
				dfs(i, j);
				sum++;
			}
		}
	}
	printf("%d\n", sum);
	return 0;
}

scanf会用了

#include <cstdio>
using namespace std;
int N, M;
char Lu[1000][1000];
void dfs(int a, int b)
{
	Lu[a][b] = '.';
	for (int i = -1; i <= 1; i++)
		for (int j = -1; j <= 1; j++){
			int dx = a + i, dy = b + j;
			if (Lu[dx][dy] == 'W' && dx >= 1 && dx <= N && dy >= 1 && dy <= M)
				dfs(dx, dy);
		}
	return ;
}
int main()
{
	scanf("%d %d", &N, &M);
	scanf("%*c");
	for (int i = 1; i <= N; i++){
		for (int j = 1; j <= M; j++)
			scanf("%c", &Lu[i][j]);
		scanf("%*c");
	}
	int sum = 0;
	for (int i = 1; i <= N; i++)
		for (int j = 1; j <= M; j++){
			if (Lu[i][j] == 'W'){
				dfs(i, j);
				sum++;
			}
		}
	printf("%d\n", sum);
	return 0;
}