[Codefroces] D - Power Products (number theory)

题意给k，和n个数$a_i$，找$a_i\ast a_j=x^k$的个数

方法：$a_i,a_k$质因数分解后，每个因子p的指数t一定是k的倍数。
可以把>=k的指数t%k，不影响统计
如果$a_i$的因子为$P_1^{t}1\ast P_2^{t}2\ast ...$，那么$a_j$的因子一定是$P_1^{k-t1}\ast P_2^{k-t2}\ast ...$
用map维护

#include <iostream>
#include <queue>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <map>
 
using namespace std;
 
#define N 100000 
 
int a[N+10],v[N+10],p[N],tot;  
 
void init() {
	for (int i = 2; i <= N; i++) {
		if (!v[i]) p[++tot] = i;
		for (int j = 1; j <= tot; j++) {
			if (i*p[j]>N) break;
			v[i*p[j]] = 1;
			if (i%p[j]==0) break;
		}
	}
}
 
map<vector<pair<int,int> >,int> f;
 
int main() {
//	int T;
//	cin >> T;
	init();
//	while (T--) {
		int n,k,d;
		cin >> n >> k;
		long long ans = 0;
		for (int i = 1; i <= n; i++) {
			int t;
			scanf("%d",&t);
			vector<pair<int,int> > g,rg;
			for (int j = 1; j <= tot && t != 1; j++) 
			 if (t%p[j] == 0) {
			 	int cnt = 1;
			 	t /= p[j];
				while(t%p[j] == 0) {
					cnt++;
					t /= p[j];
				} 
				cnt %= k;
				if(cnt) {
				   g.push_back({p[j],cnt});
				   rg.push_back({p[j],k-cnt});
				}
			}
			ans += f[rg];
			f[g]++;
		}
		cout << ans << "\n";
//	}
    return 0;
}

You are given n positive integers a1,…,an, and an integer k≥2. Count the number of pairs i,j such that 1≤i<j≤n, and there exists an integer x such that ai⋅aj=xk.
Input
The first line contains two integers n and k (2≤n≤105, 2≤k≤100).
The second line contains n integers a1,…,an (1≤ai≤105).
Output
Print a single integer — the number of suitable pairs.