Codeforces Round #596 (Div. 2, based on Technocup 2020 Elimination Round 2) D. Power Products

j主要就是%k进行查找，然后用map去映射就很方便，反正我是想不到map还能这样用

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pii pair<int, int>
#define debug(x, y) cout << x << " " << y << endl
#define nl cout << endl
const int N = 1e5 + 10;
int n, k;
int a[N], prime[N], cnt;
bool vis[N];
void getprime()
{
    vis[1] = 1;
    for (int i = 2; i < N; ++i)
    {
        if (vis[i])
            continue;
        prime[cnt++] = i;
        for (int j = 1; j * i < N; ++j)
        {
            vis[i * j] = 1;
        }
    }
}
map<vector<int>, int> s;
int main()
{
    getprime();
    ll ans = 0;
    scanf("%d%d", &n, &k);
    for (int i = 1; i <= n; ++i)
    {
        scanf("%d", &a[i]);
        vector<pii> factor;
        for (int j = 0; j < cnt && (ll)prime[j] * prime[j] <= a[i]; ++j)
        {
            int x = prime[j];
            if (a[i] % x)
                continue;
            factor.push_back(make_pair(x, 0));
            while (a[i] % x == 0)
                factor.back().second++, a[i] /= x;
        }
        if (a[i] > 1)
            factor.push_back(make_pair(a[i], 1));
        vector<int> h1, h2;
        for (int i = 0; i < (int)factor.size(); ++i)
        {
            if (factor[i].second % k)
                h1.push_back(factor[i].first * k + factor[i].second % k);
            if (factor[i].second % k)
                h2.push_back(factor[i].first * k + (k - factor[i].second % k) % k);
        }
        ans += s[h1], s[h2]++;
    }
    printf("%lld\n", ans);
    return 0;
}