【BZOJ 3560】DZY loves Math V

$$\sum_{i_1|a_1}\sum_{i_2|a_2}...\sum_{i_n|a_n} \phi(i_1i_2..i_n)$$
设共有质因子 $tot$个，第 $i$个质因子在第$j$个数中指数为 $k_ij$则
$$ans=\Pi_{i=1}^{tot}\sum_{j_{i1}=0}^{k_{i1}}\sum_{j_{i2}=0}^{k_{i2}}...\sum_{j_{in}=0}^{k_{in}}\phi(prime_i^{\sum_{p=1}^{n} j_{ip}})$$
$$=\Pi_{i=1}^{tot} ((\Pi_{j=1}^{n}\sum_{p_{ij}=0}^{k_{ij}} prime_i^{p_{ij}})-1)*{prime_i-1 \over prime_i}+1$$
前缀和维护一下 $prime_i^j$即可

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#define p 1000000007
using namespace std;
struct hp{
    long long pi,ki;
    bool operator < (const hp &x) const
      {return (pi<x.pi)||(pi==x.pi&&ki>x.ki);}
}prime[1001001];
int a[100001];
long long mi[35];
int tot,n;
long long ans;
long long power(long long a,long long b)
{
    long long t;
    if (b==0) return 1;
    if (b==1) return a;
    t=power(a,b/2);
    if (b%2==0) return t*t%p;
    else return a*t%p*t%p;
}
int main()
{
    int i,x,j,m; long long t,tp;
    scanf("%d",&n);
    for (i=1;i<=n;++i)
      scanf("%d",&a[i]); 
    for (i=1;i<=n;++i)
      {
        x=a[i]; m=sqrt(x+0.5);
        for (j=2;j<=m;++j)
          if (x%j==0)
            {
              prime[++tot].pi=(long long)j;
              while (x%j==0)
                {prime[tot].ki++; x/=j;}
            }
        if (x!=1)
          {prime[++tot].pi=(long long)x; prime[tot].ki=(long long)1;}
      }
    sort(prime+1,prime+tot+1); 
    ans=(long long)1; t=1;
    for (i=1;i<=tot;++i)
      {
        if (prime[i].pi!=prime[i-1].pi)
          {
            if (i!=1) ans=ans*(((t-1)*((prime[i-1].pi-1+p)%p)%p*power(prime[i-1].pi,p-2)%p+1)%p)%p;
            t=1;
            mi[0]=1; tp=(long long)1;
            for (j=1;j<=prime[i].ki;++j)
              {
                tp=(tp*prime[i].pi)%p;
                mi[j]=(mi[j-1]+tp)%p;
              }
          }
        t=(t*mi[prime[i].ki])%p;
      }
    ans=ans*((((t+p-1)%p)*((prime[tot].pi-1+p)%p)%p*power(prime[tot].pi,p-2)%p+1)%p)%p;
    printf("%lld\n",ans);
}