描述
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.
OpenJudge - 1388:Lake Counting
翻译
描述
由于最近的降雨,雨水在农夫约翰的田地的各个地方聚集起来,用一个NxM的矩形表示(1 <= N <= 100;1 <= M <= 100)平方。每个方块中要么有水('W'),要么有陆地('.')。农夫约翰想算出他的田地里形成了多少个池塘。池塘是一组相互连接的正方形,其中一个正方形被认为与所有八个相邻的正方形相邻。
给出农夫约翰田地的图,算出他有多少池塘。
输入
*第1行:两个用空格分隔的整数:N和M
*第2行:N+1:每一行M个字符代表农民约翰的田地。每个字符可以是'W'或'.'。字符之间没有空格。
输出
农夫约翰的田里池塘的数量