就是求"L型"的个数

🟥

︙

🟥...🟥

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 1145.14 + 1919.810;
map<int, int> l, c;
vector<string> v(N);
int main()
{
	int n; cin >> n;
	for (int i = 1; i <= n; i++)
	{
		cin >> v[i]; v[i] = " " + v[i];
		for (int j = 1; j <= n; j++) if (v[i][j] == 'o')
			l[i] ++, c[j] ++;
	}
	LL cnt = 0;
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
		{
			cnt += (v[i][j] == 'o') * (l[i] - 1) * (c[j] - 1);
		}
	}
	cout << cnt;
	return 0;
}