A. Far Relative’s Birthday Cake【排列组合】
来源:互联网 发布:php微信支付视频教程 编辑:程序博客网 时间:2024/05/29 14:31
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.
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'.
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.
3.CCC..C.C
4
4CC..C..C.CC..CC.
9
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)
- (2, 1) and (3, 1)
- (1, 3) and (3, 3)
#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;}
- A. Far Relative’s Birthday Cake【排列组合】
- A. Far Relative’s Birthday Cake
- 629A.Far Relative’s Birthday Cake
- Codeforces 629A Far Relative’s Birthday Cake
- CodeForces 629 A. Far Relative’s Birthday Cake(水~)
- Coderforces 629A Far Relative’s Birthday Cake 【水题】
- CodeForces 629A Far Relative’s Birthday Cake
- CodeForces 629A Far Relative’s Birthday Cake
- CodeForces-629A-Far Relative’s Birthday Cake
- Codeforces Round #343 (Div. 2) A. Far Relative’s Birthday Cake
- Codeforces--629A--Far Relative’s Birthday Cake(暴力模拟)
- Codeforces Round #343 (Div. 2) -A. Far Relative’s Birthday Cake(组合+模拟)
- CodeForces 629A Far Relative’s Birthday Cake(组合数,水题)
- Codeforces Round #343 (Div. 2) Far Relative’s Birthday Cake
- Far Relative’s Problem
- Far Relative’s Problem
- Far Relative’s Problem
- B. Far Relative’s Problem
- 几种排序算法总结:
- 设计模式之单例模式
- NYOJ660逃离地球——只为最大存活率~
- Activity活动(上)
- 并查集-poj-1988-Cube Stacking
- A. Far Relative’s Birthday Cake【排列组合】
- Fully Convolutional Networks for Semantic Segmentation
- apache2.2与2.4中的访问控制语句比较
- SDUSTOJ Problem B: 平面上的点——Point类 (II)
- Activity活动(中)
- android中px,dp,sp
- poj2594(二分图,最小路径覆盖变形)
- POJ3070--Fibonacci--矩阵快速幂
- DOM小结