两个容斥

求gcd(p,q) = 1,pq < n < = 1e9的对数
枚举p,p<=根号n
即求p~n/p中与p互素的 求和
反过来求
想要找到和2,3,5,7..不互素的他们
但是不行,他们之间会重复
就容斥一下
奇加偶减就好

#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <set>
using namespace std;
#ifdef noob
#define debug(x) std::cerr << #x << " = " << (x) << std::endl
#else
#define debug(...)
#endif
typedef long long LL;
const int MAXN = 1e5 + 17;
const int MOD = 1e9 + 7;
int prime[1100000],primesize=0;
bool isprime[11000000];
void sieve(int listsize){
    memset(isprime, 1, sizeof(isprime));
    isprime[1] = false;
    for(int i=2;i<=listsize;i++){
        if(isprime[i]) prime[++primesize]=i;
         for(int j = 1; j <= primesize && i*prime[j] <= listsize;j++){
            isprime[i*prime[j]] = false;
            if(i%prime[j] == 0) break;
         }
    }
}
LL f(int n,int k,int x)
{
    if(n<=0||x==0||x==1) return 0;
    return ((n/k)-k)/x;
}
int main()
{
#ifdef noob
    freopen("Input.txt","r", stdin);
    freopen("Output.txt", "w", stdout);
#endif
    sieve(100000);
    LL n;
    cin>>n;
    vector<int > fac[MAXN];
    for (int i = 1; i <= primesize; ++i)
    {
        for (int j = prime[i]; j <= 100000; j+=prime[i])
        {
            fac[j].push_back(prime[i]);
        }
    }
    LL ans = 0;
    int mx = sqrt(n);
    for (int k = 2; k <= mx; ++k)
    {
        int f_sz = fac[k].size();
        LL sum = n/k-k,tos = 0;
        for (int i = 0; i < 1<<f_sz; ++i)
        {
            int mul = 1,cnt = 0;
            for (int j = 0; j < f_sz; ++j)
            {
                if(i&(1<<j))
                    mul *= fac[k][j],cnt++;
            }
            if(cnt&1) tos += f(n,k,mul);
            else tos -= f(n,k,mul);
        }
        ans += sum - tos;
    }
    cout<<ans<<endl;
    return 0;
}

1~n和1~m中所有gcd出现的次数.
容斥做
f(d) 表示 gcd = d 的
g(d) 表示 gcd = n d|n 的
显然g(d)容易求的
那么就f(d) 就可以减掉d的倍数的f(xd)
反向做一下就好

反演也是这两个 复杂度仿佛是一模一样的

#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
#ifdef noob
#define debug(x) std::cerr << #x << " = " << (x) << std::endl
#else
#define debug(...)
#endif
typedef long long LL;
const int MAXN = 2e6 + 17;
const int MOD = 1e9 + 7;
int pr[MAXN / 5], p[MAXN], tot, phi[MAXN];
LL f[MAXN], g[MAXN];
void init(int n)
{
    phi[1] = 1;
    p[1] = 1;
    for (int i = 2; i <= n+1; ++i)
    {
        if (!p[i])
            p[i] = i, pr[++tot] = i, phi[i] = p[i] - 1;
        for (int j = 1; j <= tot && pr[j] * i <= n; j++)
        {
            p[i * pr[j]] = pr[j];
            if (p[i] == pr[j])
            {
                phi[i * pr[j]] = phi[i] * pr[j];
                break;
            }
            else
                phi[i * pr[j]] = phi[i] * (pr[j] - 1);
        }
    }
}
LL qm(LL a, LL b, int mod)
{
    LL ret = 1;
    while (b)
    {
        if (b & 1)
            ret = a * ret % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return ret;
}
LL inv[MAXN];
int main()
{
#ifdef noob
    freopen("Input.txt", "r", stdin);
    freopen("Output.txt", "w", stdout);
#endif
    init(1000100);
    int t;
    cin >> t;
    while (t--)
    {
        int n, m, mod;
        cin >> n >> m >> mod;
        LL ans = 0;
        int mn = min(m, n);
        inv[1] = 1;
        for (int i = 2; i <= mn; i++)
        {
            inv[i]=(mod-mod/i)*inv[mod%i]%mod;
        }
        for (int i = mn; i >= 1; --i)
        {
            f[i] = (1LL * (n / i) * (m / i))%mod;
            LL sum = 0;
            for (int j = i + i; j <= mn; j += i)
            {
                sum += g[j];
                sum %= mod;
            }
            g[i] = ((f[i] - sum)%mod+mod)%mod;
            ans = (ans + (i * g[i]) % mod * inv[phi[i]] % mod) % mod;
        }
        cout << (ans % mod + mod) % mod << endl;
    }
    return 0;
}