CodeForces 629A Far Relative’s Birthday Cake

组合数

#include <iostream>
#include <cstdio>

const int MAX = 105;
char arr[MAX][MAX];
int r[MAX], c[MAX];

int C(int m, int n)
{
	if (m < n)
		return 0;
	int res = 1;
	for (int i = 1; i <= n; ++i)
	{
		res *= (m + 1 - i);
		res /= i;
	}

	return res;
}

int main()
{
	int n;
	std::cin >> n;
	for (int i = 0; i != n; ++i)
	{
		for (int j = 0; j != n; ++j)
		{
			std::cin >> arr[i][j];
			if (arr[i][j] == 'C')
			{
				r[i]++, c[j]++;
			}
		}
	}
/*	for (int i = 0; i != n; ++i)
	{
		std::cout << r[i] << ' ' << c[i] << std::endl;
	}*/
	//std::cout << C(2, 2);
	int res = 0;
	for (int i = 0; i != n; ++i)
	{
		res += C(r[i], 2) + C(c[i], 2);
	//	std::cout << res << std::endl;
	}
	std::cout << res << std::endl;

	return 0;
}