【51nod 1244】莫比乌斯函数之和 （杜教筛）

Description

给出$a$,$b$,求$\sum_{i=a}^{b}\mu(i)$

Solution

杜教筛板子。。
莫比乌斯函数前缀和的推导过程：
令$M(n)$表示前缀和

$$1=\sum_{i=1}^{n}\sum_{d|i}\mu(d)=\sum_{t=1}^{n}\sum_{d=1}^{\lfloor \frac{n}{t}\rfloor}\mu(d)=\sum_{i=1}^{n}M(\lfloor \frac{n}{i}\rfloor)$$
$$M(n)=1-\sum_{i=2}^{n}M(\lfloor \frac{n}{i} \rfloor)$$

Code

/****************************
 * Au: Hany01
 * Prob: 51nod 1244 
 * Date: Jan 30th, 2018
 * Email: hany01@foxmail.com
****************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;
#define rep(i , j) for (int i = 0 , i##_end_ = j; i < i##_end_ ; ++ i)
#define For(i , j , k) for (int i = (j) , i##_end_ = (k) ; i <= i##_end_ ; ++ i)
#define Fordown(i , j , k) for (int i = (j) , i##_end_ = (k) ; i >= i##_end_ ; -- i)
#define Set(a , b) memset(a , b , sizeof(a))
#define SZ(a) ((int)(a.size()))
#define ALL(a) a.begin(), a.end()
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define Mod (1000000007)
#define y1 wozenmezhemecaia 
#ifdef hany01
#define debug(...) fprintf(stderr , __VA_ARGS__)
#else
#define debug(...)
#endif

inline void File() {
#ifdef hany01 
    freopen("51nod1244.in" , "r" , stdin);
    freopen("51nod1244.out" , "w" , stdout);
#endif
}

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

char c_; int _ , __;
inline int read() {
    for (_ = 0 , __ = 1 , c_ = getchar() ; !isdigit(c_) ; c_ = getchar()) if (c_ == '-')  __ = -1;
    for ( ; isdigit(c_) ; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

const int maxn = 1000005, Ha = 1000007;

int mu[maxn], Sum_mu[maxn], prime[maxn >> 1], cnt, np[maxn], beg[Ha], nex[Ha], n, e;
LL n1, n2, v[Ha], w[Ha];

inline void add(int uu, LL vv, LL ww) { v[++ e] = vv, w[e] = ww, nex[e] = beg[uu], beg[uu] = e; }

inline void Get_mu()
{
    mu[1] = 1;
    For(i, 2, n) {
        if (!np[i]) prime[++ cnt] = i, mu[i] = -1;
        for (register int j = 1; j <= cnt && prime[j] * i <= n; ++ j) {
            np[i * prime[j]] = 1;
            if (!(i % prime[j])) {
                mu[i * prime[j]] = 0;
                break;
            } else mu[i * prime[j]] = -mu[i];
        }
    }
    For(i, 1, n) Sum_mu[i] = Sum_mu[i - 1] + mu[i];
}

LL Calc(LL x)
{
    register int tmp = x % Ha;
    if (x <= n) return Sum_mu[x];
    for (register int i = beg[tmp]; i; i = nex[i]) if (v[i] == x) return w[i];
    LL Ans = 1;
    for (register LL l = 2, r; l <= x; l = r + 1)
        r = x / (x / l), Ans -= (r - l + 1) * 1ll * Calc(x / l);
    add(tmp, x, Ans);
    return Ans;
}

int main()
{
    File();
    scanf("%I64d%I64d", &n1, &n2), n = (int)ceil(sqrt(n2 * 1.0)) * 10;
    Get_mu();
    printf("%I64d\n", Calc(n2) - Calc(n1 - 1));
    return 0;
}