A Simple Math Problem （莫比乌斯函数反演）

A Simple Math Problem

分析：

• 莫比乌斯函数反演

  $$\begin{array}{rl}& \sum _{i=1}^n\sum _{j=1}^i[gcd(i,j)==1]f(j)\\ =& \sum _{j=1}^n\sum _{i=j}^{n}f(j)\sum _{d|(i,j)}u(d)\\ =& \sum _{d=1}^n\sum _{j=1}^{[\frac{n}{d}]}\sum _{i=j}^{[\frac{n}{d}]}f(j\ast d)\ast u[d]\\ =& \sum _{d=1}^{n}u(d)\sum _{j=1}^{[\frac{n}{d}]}f(j\ast d)\sum _{i=j}^{[\frac{n}{d}]}1\\ =& \sum _{d=1}^{n}u(d)\sum _{j=1}^{[\frac{n}{d}]}f(j\ast d)\ast ([\frac{n}{d}]-j+1)\end{array}$$

#include <bits/stdc++.h>
using namespace std;

const int N=1e5+5;
int mu[N], b[N], pri[N];
void mus(int n)
{
    int tot=0; 
    mu[1] = 1;
    for(int i=2;i<n;i++)
    {
        if(!b[i]) mu[i] = -1, pri[++tot] = i;
        for(int j=1;j<=tot && i*pri[j]<n;j++)
        {
            b[i*pri[j]] = 1;
            if(i%pri[j]==0) break ;
            mu[i*pri[j]] = -mu[i];
        }
    }
}
int f[N];
signed main()
{
    int n;
    cin>>n;
    mus(n+5);
    for(int i=1;i<=n;i++) f[i]=i%10+f[i/10];
    long long ans=0;
    for(int d=1;d<=n;d++)
    {
        for(int j=1;j*d<=n;j++)
        {
            ans+=mu[d]*f[j*d]*(n/d-j+1);
        }
    }
    cout<<ans<<endl;
    return 0;
}