Coderforces 629A Far Relative’s Birthday Cake 【水题】
来源:互联网 发布:少儿编程课程要会什么 编辑:程序博客网 时间:2024/05/29 14:25
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)
题意:问你有多少对'C'字符在同一行或者同一列。
AC代码:
#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>#include <map>#include <string>using namespace std;typedef long long LL;const int MAXN = 1005;const int INF = 0x3f3f3f3f;char str[110];int row[110], cul[110];int main(){ int n; cin >> n; memset(row, 0, sizeof(row)); memset(cul, 0, sizeof(cul)); for(int i = 0; i < n; i++) { cin >> str; for(int j = 0; j < n; j++) { if(str[j] == 'C') { row[i]++; cul[j]++; } } } int ans = 0; for(int i = 0; i < n; i++) ans += row[i] * (row[i]-1) / 2 + cul[i] * (cul[i]-1) / 2; cout << ans << endl; return 0;}
- Coderforces 629A Far Relative’s Birthday Cake 【水题】
- 629A.Far Relative’s Birthday Cake
- A. Far Relative’s Birthday Cake
- A. Far Relative’s Birthday Cake【排列组合】
- Codeforces 629A Far Relative’s Birthday Cake
- CodeForces 629 A. 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 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 Round #343 (Div. 2) -A. Far Relative’s Birthday Cake(组合+模拟)
- Codeforces Round #343 (Div. 2) Far Relative’s Birthday Cake
- Codeforces 629B Far Relative’s Problem 【水题】
- CodeForces 629B Far Relative’s Problem
- 【CodeForces】[629B]Far Relative’s Problem
- CodeForces-629B-Far Relative’s Problem
- 我的第一条程序"世界你好"
- Linux精讲——软链接和硬链接
- 1017. Queueing at Bank (25)
- 整理:统计学习-1
- POJ 3074 Sudoku(DLX+精确覆盖)
- Coderforces 629A Far Relative’s Birthday Cake 【水题】
- Unity3D 5 官方教程:SpeedTree/LOD Trees
- Asp.Net MVC 使用FileResult导出Excel数据文件
- POJ 2488 A Knight's Journey 搜索
- 数组(Array)那点事
- TCP协议的三次握手和四次挥手
- 多态(Polymorphism)那点事
- 005_Http之request获取客户端信息05-request域对象
- Codeforces 629B Far Relative’s Problem 【水题】