1881D - Divide and Equalize - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;

int main() {
    cin.tie(0);
    iostream::sync_with_stdio(0);
    int t; cin >> t;
    while (t--) {
        int n; cin >> n;
        map<int, int> factors;
        for (int i = 0; i < n; i++) {
            int num; cin >> num;
            for (int d = 2; 1ll * d * d <= num; d++) {
                while (num % d == 0) {
                    factors[d]++;
                    num /= d;
                }
            }
            if (num > 1) factors[num]++;
        }
        bool pos = true;
        for (auto& u : factors) pos &= u.second % n == 0;
        cout << (pos ? "YES" : "NO") << '\n';
    }
}