[题解] GCD SUM

[题解] GCD SUM 莫比乌斯反演

题意： 求$$\sum _{i=1}^n\sum _{j=1}^{n}gcd\left(i,j\right)$$

方法一：莫比乌斯反演

我们直接枚举$gcd$。
$$\begin{gathered} \sum _{i=1}^n\sum _{j=1}^{n}gcd\left(i,j\right) \\ =\sum _{d=1}^n\sum _{i=1}^n\sum _{j=1}^n\left[gcd\left(i,j\right)==d\right]\cdot d \\ =\sum _{d=1}^n\sum _{i=1}^{\frac{n}{d}}\sum _{j=1}^{\frac{n}{d}}\left[gcd\left(i,j\right)==1\right]\cdot d \\ =\sum _{d=1}^{n}d\sum _{i=1}^{\frac{n}{d}}\sum _{j=1}^{\frac{n}{d}}\sum _{k|gcd(i,j)}\mu \left(k\right) \\ =\sum _{d=1}^{n}d\sum _{k=1}^{\frac{n}{d}}\sum _{k|i}^{i\le \frac{n}{d}}\sum _{k|j}^{j\le \frac{n}{d}}\mu \left(k\right) \\ =\sum _{d=1}^{n}d\sum _{k=1}^{\frac{n}{d}}\mu (k)\cdot {\left(\frac{n}{kd}\right)}^2 \end{gathered}$$
这里我们由套路设$T=kd$ ，那么原式可以继续化简:
$$\begin{gathered} \sum _{d=1}^{n}d\sum _{k=1}^{\frac{n}{d}}\mu (k)\cdot {\left(\frac{n}{kd}\right)}^2 \\ =\sum _{d=1}^n\sum _{d|T}^{T\le n}\mu \left(\frac{T}{d}\right)\cdot {\left(\frac{n}{T}\right)}^2 \\ =\sum _{T=1}^n{\left(\frac{n}{T}\right)}^2\left(\sum _{d|T}d\mu \left(\frac{T}{d}\right)\right) \end{gathered}$$
而$$\sum _{d|T}d\mu \left(\frac{T}{d}\right)=d\ast \mu =\phi$$
其中，$\ast$表示卷积，$f\ast g={\sum }_{d|n}f\left(d\right)g\left(\frac{n}{d}\right)$。
所以原式简化为$$\sum _{T=1}^n{\left(\frac{n}{T}\right)}^2\phi (T)$$
前面的可以用数论分块做，然后预处理一波$\phi$的前缀和，总的时间复杂度$O(n)$。

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#define ll long long
#define pii pair<int,int>
using namespace std;

const double eps = 1e-10;
const double pi = acos(-1.0);
const int maxn = 1e5 + 10;

bool isp[maxn];
int cnt,p[maxn];
int phi[maxn];

void getp(){//线性筛求欧拉函数
	isp[1] = phi[1] = 1;
	for(int i = 2; i <= 1e5; i++){
		if(!isp[i]){
			p[++cnt] = i;
			phi[i] = i - 1;
		}
		for(int j = 1; j <= cnt && i * p[j] <= 1e5; j++){
			isp[i*p[j]] = 1;
			if(i % p[j] != 0){
				phi[i * p[j]] = (p[j] - 1) * phi[i];
			}
			else{
				phi[i * p[j]] = p[j] * phi[i];
				break;
			}
		}
	}
	for(int i = 1; i <= 1e5; i++) phi[i] = phi[i-1] + phi[i];
}

void solve(){
	getp();
	ll n;
	scanf("%lld",&n);
	ll ans = 0, l = 1, r = 0;
	while(r < n){//数论分块
		r = n/(n/l);
		ans += (phi[r] - phi[l-1])*1ll*(n/l)*(n/l);
		l = r + 1;
	}
	printf("%lld\n",ans);
}

int main()
{
	solve();
	return 0;
}

方法二:直接枚举$gcd$

对于$gcd=k$，如果$gcd(i,j)=1$，那么$gcd(ki,kj)=k$，即$k$的个数和$(i,j)$一一对应。所以产生的总贡献为$$2\sum _{d=1}^{\frac{n}{k}}\phi (d)-1$$
预处理出$\phi$的前缀和，然后遍历一波k即可。时间复杂度$O(n)$。
代码懒得写了QAQ，直接抄题解了

#include<cstdio>
#define LL long long
const int N=100050;
int prime[N],cnt=0,phi[N];
LL n,sum[N],ans=0;
void init()
{
    phi[1]=1;
    for(int i=2;i<=n;i++)
    {
        if (!phi[i]) prime[++cnt]=i,phi[i]=i-1;
        for(int j=1;j<=cnt;j++)
        {
            if (prime[j]*i>n) break;
            if (i%prime[j]==0)
            {
                phi[i*prime[j]]=phi[i]*prime[j];
                break;
            }
            else phi[i*prime[j]]=phi[i]*(prime[j]-1);
        }		
    }
    for(int i=1;i<=n;i++) sum[i]=sum[i-1]+phi[i];
}
int main()
{
    scanf("%lld",&n);
    init();
    for(LL i=1;i<=n;i++) 
        ans+=(sum[n/i]*2-1)*i;
    printf("%lld",ans);
    return 0;
}