hdu 6428 Calculate(狄利克雷卷积 + 莫比乌斯反演)

开始推式子

$$\begin{array}{r}ans=\sum _{i=1}^A\sum _{j=1}^B\sum _{k=1}^C\varphi (\gcd (i,j^2,k^3))\end{array}$$
我们令$\gcd (i,j^2,k^3)=d$
$$\begin{array}{r}ans=\sum _{d=1}^{\min (A,B,C)}\varphi (d)\sum _{i=1}^A\sum _{j=1}^B\sum _{k=1}^C[\gcd (i,j^2,k^3)==d]\end{array}$$
我们设：
$f(d)={\sum }_{i=1}^A{\sum }_{j=1}^B{\sum }_{k=1}^C[\gcd (i,j^2,k^3)==d]$
$F(n)={\sum }_{n\mid d}f(d)$
莫比乌斯反演
$f(n)={\sum }_{n\mid d}\mu (\frac{d}{n})\ast F(d)$
带入上式:
$$\begin{array}{r}ans=\sum _{k=1}^{\min (A,B,C)}\varphi (k)\sum _{k\mid d}\mu (\frac{d}{k})F(d)=\sum _{d=1}^{\min (A,B,C)}F(d)\sum _{k\mid d}\varphi (k)\mu (\frac{d}{k})\end{array}$$
我们发现后面的${\sum }_{k\mid d}\varphi (k)\mu (\frac{d}{k})$满足狄利克雷卷积（积性函数的狄利克雷卷积还是积性函数）
$$\begin{array}{r}ans=\sum _{d=1}^{\min (A,B,C)}F(d)(\mu \ast \varphi )(d)\end{array}$$
首先我们解决这个卷积
$(\mu \ast \varphi )(d)={\sum }_{k\mid d}\varphi (k)\mu (\frac{d}{k})$
$当d=1,\mu (1)=1,\varphi (1)=1，所以(\mu \ast \varphi )(1)=1$
$当d\in prime$, $\mu (d)=-1$ , $\varphi (d)=d-1$ , $所以(\mu \ast \varphi )(d)=d-2$
$当d=p^n$, $(\mu \ast \varphi )(d)=(p-1{)}^2{p}^{n-2}$
证明一下:(以下*是卷积符号)
先给个式子$\varphi (n)={\sum }_{d\mid n}(\mu \ast \varphi )(d)$
$\varphi (p^n)=\varphi (p^{n-1})+(\mu \ast \varphi )(p^n)$
$(\mu \ast \varphi )(p^n)=\varphi (p^n)-\varphi (p^{n-1})$
$(\mu \ast \varphi )(p^n)=p^{n-1}(p-1)-p^{n-2}(p-1)$
$(\mu \ast \varphi )(p^n)=(p-1{)}^2{p}^{n-2}$

现在就剩下个F(d)没有解决了
F(d)意义是，$d\mid i$ , $d\mid j^2$, $d\mid k^3$满足条件的d的个数
我们发现满足条件的d,当且仅当$p^{\lceil \frac{q}{k}\rceil }\mid x$，p是d的质因子，q是质因子的最高次幂，
满足条件的$d=\prod p^{\lceil \frac{q}{k}\rceil }$ 在 $x^k$下

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll mod = (1ll << 30);
const int N = 1e7 + 6;
template <typename T>
void out(T x) { cout << x << endl; }
ll fast_pow(ll a, ll b, ll p) {ll c = 1; while(b) { if(b & 1) c = c * a % p; a = a * a % p; b >>= 1;} return c;}
//开long long 疯狂超时
int pu[N], prime[N], f1[N], f2[N], tot;//pu为莫比乌斯函数与欧拉函数的狄利克雷卷积
bool mark[N];
void get_pu()
{
    memset(mark, 0, sizeof(mark));
    tot = 0;
    mark[0] = mark[1] = true;
    pu[1] = f1[1] = f2[1] = 1;//f1, f2也是积性函数
    for(int i = 2; i < N; i ++)
    {
        if(!mark[i])
        {
            prime[tot ++] = i;
            pu[i] = i - 2;
            f1[i] = f2[i] = i;
        }
        for(int j = 0; j < tot && i * prime[j] < N; j ++)
        {
            mark[i * prime[j]] = true;
            if(i % prime[j] == 0)
            {
                int tmp = i * prime[j], cnt = 0;
                while(cnt <= 3 && tmp % prime[j] == 0)
                    cnt ++, tmp /= prime[j];
                f1[i * prime[j]] = f1[i / prime[j]] * prime[j];
                if(cnt == 2)
                {
                    f2[i * prime[j]] = f2[i / prime[j]] * prime[j];
                    pu[i * prime[j]] = pu[i / prime[j]] * (prime[j] - 1) * (prime[j] - 1);
                }
                else
                {
                    f2[i * prime[j]] = f2[i / prime[j] / prime[j]] * prime[j];
                    pu[i * prime[j]] = pu[i] * prime[j];
                }
                break;
            }
            f1[i * prime[j]] = f1[i] * prime[j];
            f2[i * prime[j]] = f2[i] * prime[j];
            pu[i * prime[j]] = pu[i] * (prime[j] - 2);
        }
    }
}
int main()
{
    ios::sync_with_stdio(false);
    get_pu();
    int t;
    cin >> t;
    while(t --)
    {
        int A, B, C;
        cin >> A >> B >> C;
        ll ans = 0;
        for(int i = 1; i <= A; i ++)
            ans = (ans + pu[i] * (A / i) % mod * (B / f1[i]) % mod * (C / f2[i]) % mod + mod) % mod;
        cout << ans << endl;
    }
}