1 #include<iostream>
 2 #include<cstring>
 3 using namespace std;
 4 const int MAXN = 105;
 5 int Map[MAXN][MAXN] = {0};
 6 int vis[MAXN][MAXN] = {0};
 7 int dfs(int a,int b){
 8     if(Map[a][b] == 0 || vis[a][b] == 1) return 0;
 9     vis[a][b] = 1;
10     //环顾四周 
11     dfs(a - 1,b); //下
12     dfs(a + 1,b); //上
13     dfs(a,b - 1); //左
14     dfs(a,b + 1); //右 
15     return 0;
16 }
17 int main(){
18     int n;
19     cin >> n;
20     while(n--){
21         int a,b,i,j,sum = 0;
22         memset(Map,0,sizeof(Map));
23         memset(vis,0,sizeof(vis));
24         cin >> a >> b;
25         for(i = 0;i < a;i++){      
26             for(j = 0;j < b;j++){
27                 char ac;
28                 cin >> ac; 
29                 if(ac == ‘#‘)
30                     Map[i][j] = 1;
31                 else Map[i][j] = 0;                                    
32             }            
33         }                
34         for(i = 0;i < a;i++)
35         for(j = 0;j < b;j++){
36             if(Map[i][j] == 0 || vis[i][j] == 1)
37                 continue;
38             else{
39                 
40                 dfs(i,j);
41                 sum++;
42             }
43         }
44         cout << sum << endl; 
45     }
46     return 0;
47 }

 1  
 2 #include<iostream>
 3 #include<cstring>
 4 using namespace std;
 5 const int MAXN = 105;
 6 int Map[MAXN][MAXN] = {0};
 7 int vis[MAXN][MAXN] = {0};
 8 int dfs(int a,int b){
 9     if(Map[a][b] == 0 || vis[a][b] == 1) return 0;
10     vis[a][b] = 1;
11     //环顾四周 
12     dfs(a - 1,b); //下
13     dfs(a + 1,b); //上
14     dfs(a,b - 1); //左
15     dfs(a,b + 1); //右 
16     return 0;
17 }
18 int main(){
19     int n;
20     cin >> n;
21     while(n--){
22         int a,b,i,j,sum = 0;
23         memset(Map,0,sizeof(Map));
24         memset(vis,0,sizeof(vis));
25         cin >> a >> b;
26         for(i = 1;i <= a;i++)
27         for(j = 1;j <= b;j++){
28                 cin >> Map[i][j];
29         }
30         for(i = 1;i <= a;i++)
31         for(j = 1;j <= b;j++){
32             if(Map[i][j] == 0 || vis[i][j] == 1)
33                 continue;
34             else{
35                 sum++;
36                 dfs(i,j);
37             }
38         }
39         cout << sum << endl; 
40     }
41     return 0;
42 }