Lake Counting （题目地址链接：https://acs.jxnu.edu.cn/problem/NOIOPJCH02051388）

  描述：

Due to recent rains, water has pooled in various places in Farmer John's field, which is represented by a rectangle of N x M (1 <= N <= 100; 1 <= M <= 100) squares. Each square contains either water ('W') or dry land ('.'). Farmer John would like to figure out how many ponds have formed in his field. A pond is a connected set of squares with water in them, where a square is considered adjacent to all eight of its neighbors.

Given a diagram of Farmer John's field, determine how many ponds he has.

输入：
* Line 1: Two space-separated integers: N and M

* Lines 2..N+1: M characters per line representing one row of Farmer John's field. Each character is either 'W' or '.'. The characters do not have spaces between them.

输出：
* Line 1: The number of ponds in Farmer John's field.

样例输入：

10 12
W........WW.
.WWW.....WWW
....WW...WW.
.........WW.
.........W..
..W......W..
.W.W.....WW.
W.W.W.....W.
.W.W......W.
..W.......W.

样例输出：

3

翻译：

                                                                   计数湖

由于最近下雨，农夫约翰的田地里很多地方都积水了，它由一个长方形表示，长方形为 N × M （ 1 <= N <= 100 ； 1 <= 每一方都有水（“ W ”）或旱地。农夫约翰想知道在他的地里形成了多少个池塘，池塘是一组相互连接的正方形，里面有水，其中一个正方形被认为与它的八个邻居相邻.
给出一张农民约翰的田地图，算出他有多少个池塘。

输入：
*第一行:两个用空格分隔的整数: N 和 M
* 第 2 行.. N + 1 ：每行 M 个字符代表农夫约翰的一行田地，每一个字符要么是“ W ”或“.”字符之间没有空格。

输出：
*第 1 行:农民约翰地里的池塘数量。

样例输入：

10 12
W........WW.
.WWW.....WWW
....WW...WW.
.........WW.
.........W..
..W......W..
.W.W.....WW.
W.W.W.....W.
.W.W......W.
..W.......W.

样例输出：

3