Codeforces Round 343 (Div. 2)
A
Far Relative’s Birthday Cake
Codeforces
800
原题
←B →
翻译中…

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.

翻译中…

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. $(1, 2)$ and $(1, 3)$
  2. $(3, 1)$ and $(3, 3)$
翻译中…

Pieces that share the same column are:

翻译中…
  1. $(2, 1)$ and $(3, 1)$
  2. $(1, 3)$ and $(3, 3)$
翻译中…

样例

Input #1
3
.CC
C..
C.C
Output #1
4
InputCopy OutputCopy
Input #2
4
CC..
C..C
.CC.
.CC.
Output #2
9
InputCopy OutputCopy
题目信息
题号
629A
时间限制
1 s
内存限制
256 MB
标签
暴力
组合数学
构造
模拟

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。