提出 #36239513

---

ソースコード 拡げる

#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;

int main() {
    int n;
    cin >> n;
    vector<int> a(n);
    rep(i, n) cin >> a[i];

    vector<int> c2(n), c3(n);
    map<int, int> mp1;
    rep(i, n) {
        map<int, int> mp2;
        for (int j = 2; j * j <= a[i]; j++) {
            while (a[i] % j == 0) {
                if (j == 2) c2[i]++;
                else if (j == 3) c3[i]++;
                else mp2[j]++;
                a[i] /= j;
            }
        }
        if (a[i] > 1) {
            if (a[i] == 2) c2[i]++;
            else if (a[i] == 3) c3[i]++;
            else mp2[a[i]]++;
        }
        if (i == 0) mp1 = mp2;
        bool ok = true;
        for (auto m : mp1) if (mp2[m.first] != m.second) ok = false;
        for (auto m : mp2) if (mp1[m.first] != m.second) ok = false;
        if (!ok) {
            cout << -1 << endl;
            return 0;
        }
    }

    int mn2 = 100, mn3 = 100;
    rep(i, n) {
        mn2 = min(mn2, c2[i]);
        mn3 = min(mn3, c3[i]);
        //cout << c2[i] << " " << c3[i] << endl;
    }

    int ans = 0;
    rep(i, n) {
        ans += c2[i] - mn2;
        ans += c3[i] - mn3;
    }

    cout << ans << endl;
    return 0;
}

提出情報

ジャッジ結果