#include <bits/stdc++.h>
using namespace std;

const int N = 1010,
		dx[5] = {0, 0, 0, -1, 1},
		dy[5] = {0, 1, -1 ,0, 0};
		
int n, i, j, maxx, ans;
char c;
bool rmb[N][N];

void dfs(int x, int y)
{
	for (int i = 1; i <= 4; i++)
	{
		int tx = x + dx[i];
		int ty = y + dy[i];
		if (tx < 1 || ty < 1 || tx > maxx || ty > maxx || rmb[tx][ty] == 0)
			continue;
		rmb[tx][ty] = 0;
		dfs(tx, ty);
	}
}

int main()
{	
	//freopen("family.in", "r", stdin);
	//freopen("family.out", "w", stdout);

	scanf("%d%c", &n, &c);
	i = j = 1;
	while (i <= n)
	{
		scanf("%c", &c);
		if (c >= 'a' && c <= 'z')
			rmb[i][j] = 1;
		if (c == '\n')
		{
			i++;
			maxx = max(maxx, j - 1);
			j = 1;	
			continue;
		}
		j++;
	}
	
	/*for (int i = 1; i <= 4; i++)
	{
		for (int j = 1; j <= maxx; j++)
		{
			printf("%d", rmb[i][j]);
		}
		printf("\n");
	}*/
	
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= maxx; j++)
		{
			if (rmb[i][j] == 1)
			{
				ans++;
				rmb[i][j] = 0;
				dfs(i, j);
			}
		}
	}
	
	printf("%d\n", ans);
	
	return 0;
}

输入：

1
             **rfzvefjlqdoggc**bs****fx************qqcag***tiuli**lsqrgtogfcz****loqliykhg***rz***ah

本地输出

9

洛谷输出

0

答案

9