Codeforces Round #596 (Div. 2)D. Power Products

Codeforces Round #596 (Div. 2)D. Power Products

http://codeforces.com/contest/1247/problem/D

题意：给出一串序列和k，找到满足$1\le i<j\le n$的对$（i,j）$，满足：存在一个$x$，使得，$a_i{a}_j=x^k$

做法：两个数相乘能表示成$x^k$，说明$a_i{a}_j=p_1^{k_1}{p}_2^{k_2}\dots \dots p_m^{k_m}$中，$k_i$均为$k$的倍数，将每一个数分解质因数，得到质因子和对应的幂次（模m后），并找到对应的能和它结合，满足条件的$a_i$的个数

用map记录下vector的数量是真的骚……

AC代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<queue>
#include<map>
#define ll long long
#define pb push_back
#define rep(x,a,b) for (int x=a;x<=b;x++)
#define repp(x,a,b) for (int x=a;x<b;x++)
#define W(x) printf("%d\n",x)
#define WW(x) printf("%lld\n",x)
#define pi 3.14159265358979323846
#define mem(a,x) memset(a,x,sizeof a)
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
using namespace std;
const int maxn=2e6+7;
const int INF=1e9;
const ll INFF=1e18;
typedef pair<int,int > P;
map<vector<P > ,int > M;
int main()
{
    int n,k,x;
    ll ans=0;
    cin>>n>>k;
    rep(i,1,n)
    {
        vector<P> v1,v2;
        cin>>x;
        for (int j=2;j*j<=x;j++)
        {
            if (x%j==0)
            {
                int cnt=0;
                while(x%j==0)
                {
                    x/=j;
                    cnt++;
                }
                if (cnt%k!=0)v1.pb(make_pair(j,cnt%k));
            }
        }
        if (x>1) v1.pb(make_pair(x,1));
        for (int j=0;j<v1.size();j++)
            v2.pb(make_pair(v1[j].first,k-v1[j].second));
        ans+=M[v2];//v2状态为与v1状态互补，可以结合
        M[v1]++;//v1状态数量+1
    }
    cout<<ans<<endl;
    return 0;
}