提出 #37326911

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y);
#define chmin(x,y) x = min(x,y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
const double PI = acos(-1);



int main() {
    int n, m;
    cin >> n >> m;
    vector<string> s(n);
    rep(i,n) cin >> s[i];
    int ans = 0;
    rep(i,n)rep(j,i) {
        int cnt = 0;
        rep(k,m) {
            if (s[i][k] == 'o' || s[j][k] == 'o') cnt++;
        }
        if (cnt == m) ans++;
    }
    cout << ans << endl;
    return 0;
}

提出情報

ジャッジ結果