#include <bits/stdc++.h>
using namespace std;
const int nx=105;
int n, m, vs[nx][nx], cnt;
char mp[nx][nx];
void dfs(int i, int j)
{
if (vs[i][j]||i>n||j>m||mp[i][j]=='.') return;
vs[i][j]=1;
dfs(i+1, j);
dfs(i, j+1);
}
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n>>m;
for (int i=1; i<=n; i++) for (int j=1; j<=m; j++) cin>>mp[i][j];
for (int i=1; i<=n; i++) for (int j=1; j<=m; j++) if (!vs[i][j]&&mp[i][j]=='*') cnt++, dfs(i, j);
cout<<cnt;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |