HDU 2952 Counting Sheep

Problem Description

A while ago I had trouble sleeping. I used to lie awake, staring at the ceiling, for hours and hours. Then one day my grandmother suggested I tried counting sheep after I'd gone to bed. As always when my grandmother suggests things, I decided to try it out. The only problem was, there were no sheep around to be counted when I went to bed.


Creative as I am, that wasn't going to stop me. I sat down and wrote a computer program that made a grid of characters, where # represents a sheep, while . is grass (or whatever you like, just not sheep). To make the counting a little more interesting, I also decided I wanted to count flocks of sheep instead of single sheep. Two sheep are in the same flock if they share a common side (up, down, right or left). Also, if sheep A is in the same flock as sheep B, and sheep B is in the same flock as sheep C, then sheeps A and C are in the same flock.


Now, I've got a new problem. Though counting these sheep actually helps me fall asleep, I find that it is extremely boring. To solve this, I've decided I need another computer program that does the counting for me. Then I'll be able to just start both these programs before I go to bed, and I'll sleep tight until the morning without any disturbances. I need you to write this program for me.

 

Input

The first line of input contains a single number T, the number of test cases to follow.

Each test case begins with a line containing two numbers, H and W, the height and width of the sheep grid. Then follows H lines, each containing W characters (either # or .), describing that part of the grid.

 

Output

For each test case, output a line containing a single number, the amount of sheep flock son that grid according to the rules stated in the problem description.

Notes and Constraints
0 < T <= 100
0 < H,W <= 100

 

Sample Input

  
  

   
   2
4 4
#.#.
.#.#
#.##
.#.#
3 5
###.#
..#..
#.###
  
  

 

Sample Output

  
  

   
   6
3
  
  
  
  

   
   几道较为相似的题，只改S++的位置
  
  
  
  

   
   
#include<iostream>
#include<cstdio>
#include<string>
using namespace std;
int h,w,s;
char map[105][105];
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
void dfs(int x,int y)
{
	int i,nx,ny;
	for(i=0;i<4;i++)
	{
		nx=x+dx[i],ny=y+dy[i];
		if(nx>0&&nx<=h&&ny>0&&ny<=w&&map[nx][ny]=='#')
		{
			map[nx][ny]='.';
			dfs(nx,ny);
		}
	}
}
int main()
{
	int i,j,t;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&h,&w);
		for(i=1;i<=h;i++)
			for(j=1;j<=w;j++)
				cin>>map[i][j];
			s=0;
		for(i=1;i<=h;i++)
			for(j=1;j<=w;j++)
			{
				if(map[i][j]=='#')
				{
					map[i][j]='.';
					dfs(i,j);
					s++;
				}
			}
			printf("%d\n",s);
	}
	return 0;
}