HDU 6390 GuGuFishtion 莫比乌斯反演+欧拉函数性质

原题链接：http://acm.hdu.edu.cn/showproblem.php?pid=6390

题意

$$\sum _{a=1}^m\sum _{b=1}^{n}Gu(a,b)$$
$$Gu(a,b)=\frac{\varphi (ab)}{\varphi (a)\varphi (b)}$$

化简

$$首先考虑对Gu函数进行变换，利用到欧拉函数的性质\varphi (p^k)=(p-1)p^{k-1}(p为质数)$$

$$Gu(a,b)=\frac{\varphi (p{1}^{2k1}p{2}^{2k2}..p{n}^{2kn})}{\varphi (p{1}^{k1}p{2}^{k2}..p{n}^{kn})\varphi (p{1}^{k1}p{2}^{k2}..p{n}^{kn})}$$

$$=\frac{(p1-1)p{1}^{2k1-1}..(pn-1)p{n}^{2kn-1}}{(p1-1{)}^{2}p{1}^{2k1-2}..(pn-1{)}^{2}p{n}^{2kn-2}}$$

$$=\frac{p1p2..pn}{(p1-1)(p2-1)..(pn-1)}$$

$$=\frac{p1p2..pn}{\varphi (p1p2..pn)}$$

$$=\frac{gcd(a,b)}{\varphi (gcd(a,b))}$$

$$接下来就是熟悉的模型$$

$$\sum _{a=1}^m\sum _{b=1}^{n}Gu(a,b)$$

$$=\sum _{a=1}^m\sum _{b=1}^n\frac{gcd(a,b)}{\varphi (gcd(a,b))}$$

$$设gcd(a,b)=d$$

$$=\sum _{d=1}^{min(n,m)}\frac{d}{\varphi (d)}\sum _{a=1}^m\sum _{b=1}^n[gcd(a,b)=d]$$

$$=\sum _{d=1}^{min(n,m)}\frac{d}{\varphi (d)}\sum _{a=1}^{m/d}\sum _{b=1}^{n/d}\sum _{t|a,t|b}\mu (t)$$

$$=\sum _{d=1}^{min(n,m)}\frac{d}{\varphi (d)}\sum _{t=1}^{min(n,m)/d}\mu (t)\sum _{a=1}^{m/td}\sum _{b=1}^{n/td}$$

$$=\sum _{d=1}^{min(n,m)}\frac{d}{\varphi (d)}\sum _{t=1}^{min(n,m)/d}\mu (t)[\frac{m}{td}][\frac{n}{td}]$$

$$设f(n,m)=\sum _{i=1}^{min(n,m)}\mu (t)[\frac{m}{i}][\frac{n}{i}]$$

$$f(n,m)用整除分块可以在\sqrt{(}n)的时间复杂里完成$$

$$原式=\sum _{d=1}^{min(n,m)}\frac{d}{\varphi (d)}f(\frac{n}{d},\frac{m}{d})$$

$$因为\varphi (d)<d，因此用线性求一下逆元，那么总的时间复杂度就是O(nlogn)$$

Code

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <cmath>
#include <bitset>
#include <map>
#include <set>
#include <stack>
#include <queue>
//#include <unordered_map>
using namespace std;
#define fi first
#define se second
#define re register
typedef long long ll;
typedef pair<ll, ll> PII;
typedef unsigned long long ull;
const int N = 1e6 + 10, M = 1e6 + 5, INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
ll prime[N], mu[N], k, p;
ll phi[N], inv[N];
bool is_prime[N];
void get_inv(int n) {  //线性递推
    inv[1] = 1;
    for(int i = 2; i < n; i++)
        inv[i] = 1ll*(p - p / i) * inv[p % i] % p;
}
inline void init(int n) {
    memset(is_prime, true, sizeof is_prime);
    mu[1] = 1; phi[1] = 1;
    for (int i = 2; i < n; ++i) {
        if (is_prime[i]) prime[++k] = i, mu[i] = -1, phi[i] = i-1;
        for (int j = 1; j <= k && i * prime[j] < n; ++j) {
            is_prime[i * prime[j]] = false;
            if (i % prime[j] == 0) {
                phi[i * prime[j]] = phi[i] * prime[j];
                break;
            } else {
                mu[i * prime[j]] = -mu[i];
                phi[i * prime[j]] = phi[i] * (prime[j] - 1);
            }
        }
    }
    for (int i = 1; i < n; ++i) mu[i] += mu[i-1];
}
ll calc(ll n, ll m) {
    ll ans = 0;
    for (ll l = 1, r; l <= min(n, m); l = r + 1) {
        r = min(m / (m / l), n / (n / l));
        ans = (ans + (mu[r] - mu[l-1] + p) % p * (n / l) % p * (m / l) % p) % p;
    }
    return ans;
}
void solve() {
    init(N);
    int T; cin >> T; while (T--) {
        int m, n; cin >> m >> n >> p;
        get_inv(min(n, m));
        ll ans = 0;
        for (int i = 1; i <= min(n, m); i++) ans = (ans + i * inv[phi[i]] % p * calc(n/i, m/i) % p) % p;
        cout << ans << endl;
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
#ifdef ACM_LOCAL
    freopen("input", "r", stdin);
    freopen("output", "w", stdout);
#endif
    solve();
    return 0;
}