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 <iostream> using namespace std; int n,m; char field[105][105]; void solve(); void dfs(int x,int y); int main() { while(cin>>n>>m){ for(int i=0;i<n;i++){ for(int j=0;j<m;j++) cin>>field[i][j]; } solve(); } return 0; } void solve(){ int ans=0,i,j; for(i=0;i<n;i++){ for(j=0;j<m;j++){ if(field[i][j]=='W'){ dfs(i,j); ++ans; } } } cout<<ans<<endl; } void dfs(int x,int y){ field[x][y]='.'; for(int i=-1;i<=1;i++){ for(int j=-1;j<=1;j++){ int x1=x+i,y1=y+j; if(x1<n&&x1>=0&&y1<m&&y1>=0&&field[x1][y1]=='W'){ dfs(x1,y1); } } } }