莫比乌斯反演——Crash的数字表格

题目链接

题解：
把lca拆分成gcd的形式，然后接下来都是套路利用分块来完成O(n)求和。

#include <bits/stdc++.h>
#define N 10000010
#define mod 20101009
using namespace std;
typedef long long ll;
const int n = 10000000;
int mu[N] , prime[N] , tot;
ll sum[N];
bool np[N];
ll s(int x)
{
    return (ll)x * (x + 1) / 2 % mod;
}
ll query(int a , int b)
{
    int i , last;
    ll ans = 0;
    for(i = 1 ; i <= a && i <= b ; i = last + 1) last = min(a / (a / i) , b / (b / i)) , ans = (ans + (sum[last] - sum[i - 1] + mod) % mod * s(a / i) % mod * s(b / i) % mod) % mod;
    return ans;
}
int main()
{
    int i , j , last , a , b;
    ll ans = 0 , t;
    mu[1] = sum[1] = 1;
    for(i = 2 ; i <= n ; i ++ )
    {
        if(!np[i]) mu[i] = -1 , prime[++tot] = i;
        for(j = 1 ; j <= tot && i * prime[j] <= n ; j ++ )
        {
            np[i * prime[j]] = 1;
            if(i % prime[j] == 0)
            {
                mu[i * prime[j]] = 0;
                break;
            }
            else mu[i * prime[j]] = -mu[i];
        }
        sum[i] = (sum[i - 1] + (ll)mu[i] * i * i + mod) % mod;
    }
    scanf("%d%d" , &a , &b);
    for(i = 1 ; i <= a && i <= b ; i = last + 1) last = min(a / (a / i) , b / (b / i)) , ans = (ans + (s(last) - s(i - 1) + mod) % mod * query(a / i , b / i)) % mod;
    printf("%lld\n" , ans);
    return 0;
}