Codeforces--629A--Far Relative’s Birthday Cake(暴力模拟)
2016-03-02 10:14
351 查看
Far Relative’s Birthday Cake
Submit
Status
Description
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.
Sample Input
Input
Output
Input
Output
Sample Output
Hint
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 '的对数
Time Limit: 1000MS | Memory Limit: 262144KB | 64bit IO Format: %I64d & %I64u |
Status
Description
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.
Sample Input
Input
3 .CC C.. C.C
Output
4
Input
4CC..
C..C
.CC.
.CC.
Output
9
Sample Output
Hint
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<cstdio> #include<cstring> #include<algorithm> using namespace std; struct node { int x,y; }p[100100]; char map[110][110]; int main() { int cnt,n; while(scanf("%d",&n)!=EOF) { cnt=0; memset(map,0,sizeof(map)); for(int i=0;i<n;i++) { scanf("%s",map[i]); for(int j=0;j<n;j++) { if(map[i][j]=='C') { p[cnt].x=i; p[cnt++].y=j; } } } int ans=0; for(int i=0;i<cnt;i++) { for(int j=0;j<cnt;j++) { if(i==j) continue; if(p[i].x==p[j].x||p[i].y==p[j].y) ans++; } } printf("%d\n",ans/2); } return 0; }
相关文章推荐
- (175)红黑树及其相关操作
- LeetCode 258 Add Digits java
- 性能优化,进无止境---CPU篇
- Unity3D -- 简单的UI管理结构
- Codeforces--629A--Far Relative’s Birthday Cake(暴力模拟)
- JavaWeb:后台判断是手机登陆还是Pc登陆
- 使用vector创建一个二维数组(二)
- .net处理freetextbox(文本编辑)基本操作
- 《从零开始学Swift》学习笔记(Day 33)——属性观察者
- socket的心跳包机制
- JavaScript的三种消息框alert,confirm,prompt
- git初始化新项目
- Base64工具类
- 自主输入数值求和及平均值(数组的应用)
- 调用AsyncTask的excute方法不能立即执行程序的原因分析及改善方案
- python implement queue
- 【技术】【使用】AFNetworking的介绍和应用
- iOS安全系列之二:HTTPS进阶
- java httpclient 上传文件 服务器 servlet 接收
- (七)适配器模式-代码实现