HDU 6428 Problem C. Calculate 莫反+积性函数+线性筛

传送门： http://acm.hdu.edu.cn/showproblem.php?pid=6428

题意

$$求解\sum _{i=1}^A\sum _{j=1}^B\sum _{k=1}^C\varphi (gcd(i,j^2,k^3))mod{2}^{30}$$

思路

$首先要把\varphi 和gcd分开，即\varphi (n)={\sum }_{d|n}(\varphi \ast \mu )(d)，证明如下：$
$$\varphi (n)=(\mu \ast id)(n)$$

$$\sum _{d|n}\mu (d)\frac{n}{d}$$

$$\sum _{d|n}\mu (d)\sum _{d^{\prime }|\frac{n}{d}}\varphi (d^{\prime })$$

$$\sum _{d{d}^{\prime }|n}\mu (d)\varphi (d^{\prime })$$

$$\sum _{d|n}\sum _{d^{\prime }|d}\mu (d^{\prime })\varphi (\frac{d}{d^{\prime }})$$

$$\sum _{d|n}(\varphi \ast \mu )(d)$$

$所以原式变为：$

$$\sum _{i=1}^A\sum _{j=1}^B\sum _{k=1}^C\sum _{d|id|j^{2}d|k^3}(\varphi \ast \mu )(d)$$

$$\sum _{d=1}^A(\varphi \ast \mu )(d)\sum _{i=1d|i}^A\sum _{j=1d|j^2}^B\sum _{k=1d|k^3}^{C}1$$
\left \lceil \right \rceil
$观察后面式子，对于一个x^k，若d|x^k，先把d分解为\prod p_i^{a_i}.$
$则\prod p_i^{a_i}|x^k，得\prod p_i^{\lceil \frac{a_i}{k}\rceil }|x，所以设$

$$f_k(n)=\prod p_i^{\lceil \frac{a_i}{k}\rceil }$$

$则：$

$$ans=\sum _{d=1}^A(\varphi \ast \mu )(d)\frac{A}{f_1(d)}\frac{B}{f_2(d)}\frac{C}{f_3(d)}$$

$对于f_k(n)，类似分解n的形式。$
$分解质因子的过程中，记录质因子的指数，每次质因子+1时，若\%k=1时，说明该向上取整了，于是f_k(n)\ast =该质因子.$

$由于\varphi 和\mu 都是积性函数，卷积之后还是积性函数，设g(d)=(\varphi \ast \mu )(d)，则$

$$\varphi (n)=\sum _{d|n}g(d)$$

$那么可以得：$

$$\varphi (p^k)=\varphi (p^{k-1})+g(p^k)$$

$$g(p^k)=\varphi (p^k)-\varphi (p^{k-1})$$

$$g(p^k)=(p-1)p^{k-1}-(p-1)p^{k-2}$$

$$g(p^k)=(p-1{)}^2{p}^{k-2}$$

$当我们欧拉筛的过程中：$

$$g(1)=1$$

$$g(p)=p-2$$

$$g(p^k)=(p-1{)}^2{p}^{k-2}$$

$$g(p_1^{k_1}{p}_2^{k_2})=g(p_1^{k_1})g(p_2^{k_2})$$

$$......$$

Code(2480MS)

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

typedef long long ll;

const ll mod = (1ll << 30);

const int N = 1e7 + 10;
bool is_prime[N];
int prime[N], cnt;
int g[N];
int f1[N], f2[N], f3[N];
int deg[N];

void init() {
    f1[1] = f2[1] = f3[1] = g[1] = 1;
    for(int i = 2;i < N; i++) {
        f1[i] = i;
        if(!is_prime[i]) prime[++cnt] = f2[i] = f3[i] = i, g[i] = i - 2, deg[i] = 1;
        for(int j = 1;j <= cnt && i * prime[j] < N; j++) {
            int now = i * prime[j];
            is_prime[now] = 1;
            if(i % prime[j] == 0) {
                deg[now] = deg[i] + 1;
                int num = 1, tmp = i;
                while(num <= 3 && tmp % prime[j] == 0) num++, tmp /= prime[j];
                if(num == 1) g[now] = g[i] * g[prime[j]];
                else if(num == 2) g[now] = g[i / prime[j]] * (prime[j] - 1) * (prime[j] - 1);
                else g[now] = g[i] * prime[j];
                f2[now] = f2[i] * (deg[now] % 2 == 1 ? prime[j] : 1);
                f3[now] = f3[i] * (deg[now] % 3 == 1 ? prime[j] : 1);
                break;
            }
            else {
                deg[now] = 1;
                f2[now] = f2[i] * f2[prime[j]];
                f3[now] = f3[i] * f3[prime[j]];
                g[now] = g[i] * g[prime[j]];
            }
        }
    }
}

void solve() {
    init();
    int _; scanf("%d",&_);
    while(_--) {
        int A, B, C; scanf("%d%d%d",&A,&B,&C);
        ll ans = 0;
        for(int d = 1;d <= A; d++) {
            ans = (ans + 1ll * g[d] * (A / f1[d]) % mod * (B / f2[d]) % mod * (C / f3[d]) % mod) % mod;
        }
        printf("%lld\n",(ans % mod + mod) % mod);
    }
}

signed main() {
    solve();
}