Codeforces Round #343 (Div. 2) -A. Far Relative’s Birthday Cake（组合+模拟）

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

4CC..
C..C
.CC.
.CC.

Output

9

Note
If we number rows from top to bottom and columns from left to right, then, pieces that share the same row in the first sample are:

(1, 2) and (1, 3)

(3, 1) and (3, 3)

Pieces that share the same column are:
(2, 1) and (3, 1)

(1, 3) and (3, 3)

题意：

 找出上面数据C在相同行或相同列的最大对数。

AC代码：

#include<iostream>
#include<functional>
#include<algorithm>
#include<cstring>
#include<string>
#include<vector>
#include<cstdio>
#include<queue>
#include<cmath>
#include<map>
#include<set>
using namespace std;
#define CRL(a) memset(a,0,sizeof(a))
#define QWQ ios::sync_with_stdio(0)
#define inf 0x3f3f3f3f
typedef unsigned long long LL;
typedef  long long ll;

const int T = 500+50;
const int mod = 1000000007;

char s[T][T];
int col[T],row[T];

ll fun(int x)
{
ll sum = x;
if(x>3)
return sum*(sum-1)/2;
else if(x==3)
return 3;
else if(x==2)
return 1;
return 0;
}

int main()
{

#ifdef zsc
freopen("input.txt","r",stdin);
#endif

int n,i,j,u,v;
while(~scanf(" %d",&n))
{
fill(col,col+T,0);
fill(row,row+T,0);
for(i=0;i<n;++i){
for(j=0;j<n;++j){
scanf("\n%c",&s[i][j]);
if(s[i][j]=='C')col[j]++,row[i]++;
}
}
if(n==1){
printf("0\n");
continue;
}
ll ma=0;
for(i=0;i<n;++i){
ma += fun(col[i])+fun(row[i]);
}
printf("%I64d\n",ma);
}

return 0;
}