2386 -- Lake Counting

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

[kiyo_hiko]

気が向いたら // (defun readline (line &aux preline acc) ...)みたいにしてprelineと接していないWの連なりをカウントしてaccに順次足すというのを一瞬考えたがやってみないとわからない

[agw]

深さ優先検索を用いグラフの接続性を求める。難易度は高くない。