H - H CodeForces - 629A(排列组合)

H - H CodeForces - 629A

Door’s family is going celebrate Famil Doors’s birthday party. They
love Famil Door so they are planning to make his birthday cake weird!

The cake is a n × n square consisting of equal squares with side
length 1. Each square is either empty or consists of a single
chocolate. They bought the cake and randomly started to put the
chocolates on the cake. The value of Famil Door’s happiness will be
equal to the number of pairs of cells with chocolates that are in the
same row or in the same column of the cake. Famil Doors’s family is
wondering what is the amount of happiness of Famil going to be?

Please, note that any pair can be counted no more than once, as two
different cells can’t share both the same row and the same column.

Input In the first line of the input, you are given a single integer n
(1 ≤ n ≤ 100) — the length of the side of the cake.

Then follow n lines, each containing n characters. Empty cells are
denoted with ‘.’, while cells that contain chocolates are denoted by
‘C’.

Output Print the value of Famil Door’s happiness, i.e. the number of
pairs of chocolate pieces that share the same row or the same column.

Examples

Input
3
.CC
C..
C.C
Output
4
Input
4
CC..
C..C
.CC.
.CC.
Output
9

代码

#include<iostream>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
void fre() { freopen("A.txt","r",stdin), freopen("Ans.txt","w",stdout); }
#define ll long long 
const int mxn = 205;
char ar[mxn][mxn];

ll x[mxn], y[mxn];

int main()
{
    /* fre(); */
    int n;
    scanf("%d ", &n);
    
    for(int i = 0; i < n; i ++)
        scanf("%s", ar[i]);
    for(int i = 0; i < n; i ++)
        for(int j = 0; j < n; j ++)
        {
            if(ar[i][j] == 'C')
                x[i] ++, y[j] ++;
        }
    ll sum = 0;
    for(int i = 0; i < n; i ++)
        if(x[i] > 1)
        {
            sum += x[i] * (x[i] - 1) / 2;
        }
    for(int i = 0; i < n; i ++)
        if(y[i] > 1)
        {
            sum += y[i] * (y[i] - 1) / 2;
        }
    printf("%lld\n", sum);

    return 0;
}