Codeforces Round #343 (Div. 2) A. Far Relative’s Birthday Cake

水题

 #include<iostream>
 #include<string>
 #include<algorithm>
 #include<cstdlib>
 #include<cstdio>
 #include<set>
 #include<map>
 #include<vector>
 #include<cstring>
 #include<stack>
 #include<cmath>
 #include<queue>
 #define clc(a,b) memset(a,b,sizeof(a))
 #include <bits/stdc++.h>
 using namespace std;
 #define LL long long

 int main()
 {
     char s[][];
     int n;
     scanf("%d",&n);
     for(int i=;i<n;i++)
         scanf("%s",&s[i]);
     LL tot=;
     LL ans=;
     for(int i=;i<n;i++)
     {
         tot=;
         for(int j=;j<n;j++)
         {
             if(s[i][j]=='C')
                 tot++;
         }
         ans+=tot*(tot-)/;
         tot=;
         for(int j=;j<n;j++)
         {
             if(s[j][i]=='C')
                 tot++;
         }
         ans+=tot*(tot-)/;
     }
     cout<<ans<<endl;
     return ;
 }