N - Lake Counting

Description

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.

Input

* 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.

Output

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

Sample Input

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

Sample Output

3

#include<stdio.h>
int m,n,cnt;
int to[8][2]={{0,-1},{0,1},{1,1},{1,-1},{1,0},{-1,0},{-1,1},{-1,-1}};
char a[105][105];
void dfs(int i,int j)
{
	a[i][j]='.';
	for(int k=0;k<8;k++)
	{
	   int x=i+to[k][0];
	   int y=j+to[k][1];
	   if(x>=0 && x<n && y>=0 && y<m &&a[x][y]=='W')
	   {
	   	 a[x][y]='.';
	     dfs(x,y);
	   }
	}	
}
int main()
{
	scanf("%d%d",&n,&m);	
		cnt=0;
		getchar();
		for(int i=0;i<n;i++)
		  	 scanf("%s",&a[i]);
	   	for(int i=0;i<n;i++)
            for(int j=0;j<m;j++)
                if(a[i][j]=='W')
                {
                    ++cnt;
                    dfs(i,j);
                }
		printf("%d\n",cnt);    
}