A. Far Relative’s Birthday Cake【排列组合】

最新推荐文章于 2020-03-08 21:40:52 发布

Joefery

最新推荐文章于 2020-03-08 21:40:52 发布

阅读量696

点赞数

分类专栏：排列组合 CodeForces 文章标签： acm 算法

本文链接：https://blog.csdn.net/Bcwan_/article/details/50858239

版权

CodeForces 同时被 2 个专栏收录

57 篇文章 0 订阅

订阅专栏

排列组合

6 篇文章 0 订阅

订阅专栏

本文探讨了一种独特的蛋糕巧克力布局问题，旨在计算由巧克力块组成的蛋糕上，FamilDoor的幸福感值。通过计算同一行或同一列中巧克力块的数量，得出FamilDoor的总幸福感值。采用行和列双重计算策略，有效解决了这一问题。

摘要由CSDN通过智能技术生成

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

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排列组合，在求解每一列的排列组合。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int Max = 105;
char a[Max][Max];
int main()
{
    int n;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    int ans=0,sum=0;
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(a[i][j]=='C')sum++;
        }
        ans+=(sum-1)*sum/2;
        sum=0;
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(a[j][i]=='C')sum++;
        }
        ans+=(sum-1)*sum/2;
        sum=0;
    }
    cout<<ans<<endl;

    return 0;
}