Codeforces Round #343 (Div. 2) 解题报告

---

629A- Far Relative’s Birthday Cake

---

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.

input
3
.CC
C..
C.C
output
4

input
4
CC..
C..C
.CC.
.CC.
output
9

题目链接：cf-629A

题目思路：统计相邻两个C的对数

以下是代码：

#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <string>
#include <cstring>
using namespace std;
string s[105];
int main(){
    int n,ans = 0;
    cin >> n;
    for(int i = 0; i < n; i++) cin >> s[i];
    for (int i = 0; i < n; i++)
    {
        int cnt = 0;
        for (int j = 0; j < n; j++)
        {
            if (s[i][j] == 'C') cnt++;
        }
        ans += cnt * (cnt - 1) / 2;
    }

    for (int j = 0; j < n; j++)
    {
        int cnt = 0;
        for (int i = 0; i < n; i++)
        {