A10191 | Far Relative’s Birthday Cake
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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.
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'.
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.
输入输出样例
输入 #1
3 .CC C.. C.C
输出 #1
4
输入 #2
4 CC.. C..C .CC. .CC.
输出 #2
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. $(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)$
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)$
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted