CF 615D Multipliers

题目：http://codeforces.com/contest/615/problem/D

求n的约数乘积。

设d(x)为x的约数个数，x=p1^a1+p2^a2+……+pn^an，f(x)为x的约数乘积。

若a,b互质，有f(ab)=f(a)^d(b)*f(b)^d(a)，d(ab)=d(a)*d(b)

然后f(p^k)=p^(k*(k+1)/2)

（其实就是拆出来算贡献。。

#include<cstring>
#include<iostream>
#include<cstdio>
#include<queue>
#include<cmath>
#include<algorithm>
#define rep(i,l,r) for (ll i=l;i<=r;i++)
#define down(i,l,r) for (int i=l;i>=r;i--)
#define clr(x,y) memset(x,y,sizeof(x))
#define low(x) (x&(-x))
#define maxn 200500
#define inf int(1e9)
#define mm 1000000007
#define ll long long
using namespace std;
ll x;
ll a[maxn],n,d[maxn],now;
ll read(){
    ll x=,f=; char ch=getchar();
    while (!isdigit(ch)) {if (ch=='-') f=-; ch=getchar();}
    while (isdigit(ch)) {x=x*+ch-''; ch=getchar();}
    return x*f;
}
ll Pow(ll x,ll y){
    ll ans=;
    while (y){
        if (y&) ans=ans*x%mm;
        x=x*x%mm;
        y>>=;
    }
    return ans;
}
int main(){
    n=read();
    rep(i,,n){
        x=read(); d[x]++;
    }
    ll ans=,D=;
    rep(i,,) if (d[i]){
        ll fb=Pow(i,d[i]*(d[i]+)/)%mm;
        ans=Pow(ans,d[i]+)*Pow(fb,D)%mm;
        D=D*(d[i]+)%(mm-);
    }
    printf("%lld\n",ans);
    return ;
}