51nod1594 Gcd and Phi

最新推荐文章于 2021-01-29 22:55:03 发布

sdfzyhx

最新推荐文章于 2021-01-29 22:55:03 发布

阅读量401

点赞数

分类专栏：数学其他oj

本文链接：https://blog.csdn.net/sdfzyhx/article/details/73614062

版权

数学同时被 2 个专栏收录

229 篇文章 0 订阅

订阅专栏

其他oj

66 篇文章 0 订阅

订阅专栏

= = \sum i = 1 n \sum j = 1 n φ (gcd (φ (i), φ (j))) \sum d = 1 n φ (d) \sum i = 1 ⌊ n d ⌋ \sum j = 1 ⌊ n d ⌋ s (i d) s (j d) \sum x | i, x | j μ (x) \sum d = 1 n φ (d) \sum x = 1 ⌊ n d ⌋ μ (x) f (d x)

$\begin{align} & \sum_{i=1}^n\sum_{j=1}^n\varphi(\gcd(\varphi(i),\varphi(j))) \\ = & \sum_{d=1}^n\varphi(d)\sum_{i=1}^{\lfloor\frac n d\rfloor}\sum_{j=1}^{\lfloor\frac n d\rfloor}s(id)s(jd)\sum_{x|i,x|j}\mu(x) \\ = & \sum_{d=1}^n \varphi(d)\sum_{x=1}^{\lfloor\frac n d\rfloor}\mu(x) f(dx) \\ \end{align}$
其中

s (x) = \sum i = 1 n [φ (i) = x] f (x) = ⎛ ⎝ ⎜ ⎜ \sum i = 1 ⌊ n x ⌋ s (i x) ⎞ ⎠ ⎟ ⎟ 2

$s(x)=\sum_{i=1}^n[\varphi(i)=x] \\ f(x)=\left(\sum_{i=1}^{\lfloor\frac n x \rfloor} s(ix)\right )^2\\$
预处理

f $f$ 和求解原问题都可以

O(nlogn) $O(n\log n)$ 完成。

#include<cstdio>
#include<algorithm>
using namespace std;
#define LL long long
const int maxn=2000010;
int phi[maxn],mu[maxn],s[maxn],prm[maxn],
n,tot;
LL f[maxn];
void solve()
{
    int x;
    LL t,ans=0;
    scanf("%d",&n);
    phi[1]=mu[1]=s[1]=1;
    for (int i=2;i<=n;i++)
    {
        s[i]=0;
        if (!phi[i])
        {
            prm[++tot]=i;
            phi[i]=i-1;
            mu[i]=-1;
        }
        for (int j=1;j<=tot&&(x=i*prm[j])<=n;j++)
            if (i%prm[j])
            {
                phi[x]=phi[i]*(prm[j]-1);
                mu[x]=-mu[i];
            }
            else
            {
                phi[x]=phi[i]*prm[j];
                mu[x]=0;
                break;
            }
        s[phi[i]]++;
    }
    for (int i=1;i<=n;i++)
    {
        f[i]=0;
        for (int j=i;j<=n;j+=i) f[i]+=s[j];
        f[i]*=f[i];
    }
    for (int i=1;i<=n;i++)
    {
        t=0;
        for (int j=1;i*j<=n;j++) t+=mu[j]*f[i*j];
        ans+=t*phi[i];
    }
    printf("%lld\n",ans);
}
int main()
{
    int T;
    scanf("%d",&T);
    while (T--) solve();
}