Codeforces Round #343 (Div. 2) Far Relative’s Birthday Cake

大致题意：

给出一个n*n的矩阵，求有多少对C在同一行或同一列

方法：

遍历每一行，求出每一行中C的数量，然后利用组合数学的排列组合求出方案数

遍历每一列，同上

。。。。。

A. Far Relative’s Birthday Cake

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 <bits/stdc++.h>

using namespace std;

char str[110][110];
int c[110][110];


int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        int ant = 0;
        for(int i=0; i<n; i++)
        {
            int num = 0;
            scanf("%s",str[i]);
            for(int j=0; j<n; j++)
            {
                if(str[i][j] == 'C')
                    num++;
            }
            ant += (num)*(num-1)/2;
        }
        for(int j=0; j<n; j++)
        {
            int num = 0;
            for(int i=0; i<n; i++)
            {
                if(str[i][j] == 'C')
                    num++;
            }
            ant += (num)*(num-1)/2;
        }
        printf("%d\n",ant);
    }
    return 0;
}