[数论][莫比乌斯反演] 51Nod 1222 最小公倍数计数

$Description$

$$f(n)=\sum_{i}\sum_{j}[lcm(i,j)=n]$$ 求 $$\sum_{n=a}^bf(n)$$

$Solution$

$$\begin{eqnarray} S(n)&=&\sum_{k=1}^{\sqrt{n}}\mu(k)\sum_{a}\sum_{b}\sum_{d}[abd\le{n\over k^2}] \end{eqnarray}$$
后面那个东西可以 $O(n^{2\over3})$求出来。

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

typedef long long ll;
const ll N = 1010101;

inline char get(void) {
  static char buf[100000], *S = buf, *T = buf;
  if (S == T) {
    T = (S = buf) + fread(buf, 1, 100000, stdin);
    if (S == T) return EOF;
  }
  return *S++;
}
template<typename T>
inline void read(T &x) {
  static char c; x = 0; ll sgn = 0;
  for (c = get(); c < '0' || c > '9'; c = get()) if (c == '-') sgn = 1;
  for (; c >= '0' && c <= '9'; c = get()) x = x * 10 + c - '0';
  if (sgn) x = -x;
}

int prime[N], vis[N];
int mu[N];
ll n, m, Pcnt, ans;

inline ll Calc(ll n) {
  ll res, s;
  res = s = (ll)(pow(n, 1.0 / 3) + 1e-7);
  for (ll i = 1; i <= n; i++) {
    if (i * i > n) break;
    res += 3 * (n / (i * i) - (n / (i * i) >= i ? 1 : 0));
  }
  for (ll a = 1; a <= s; a++)
    for (ll b = a + 1; b <= n; b++) {
      ll c = n / (a * b);
      if (c <= b) break;
      res += (c - b) * 6;
    }
  return res;
}
inline void Pre(ll n) {
  mu[1] = 1; ll x;
  for (ll i = 2; i <= n; i++) {
    if (!vis[i]) {
      prime[++Pcnt] = i; mu[i] = -1;
    }
    for (ll j = 1; j <= Pcnt && (x = prime[j] * i) <= n; j++) {
      vis[x] = 1;
      if (i % prime[j]) {
    mu[x] = -mu[i];
      } else {
    mu[x] = 0; break;
      }
    }
  }
}
inline ll Sum(ll n) {
  ll res = 0;
  for (ll i = 1; i * i <= n; i++)
    if (mu[i])
      res += Calc(n / i / i) * mu[i];
  return (res + n) / 2;
}

int main(void) {
  freopen("1.in", "r", stdin);
  freopen("1.out", "w", stdout);
  read(n); read(m); Pre(1000000);
  cout << Sum(m) - Sum(n - 1) << endl;
  return 0;
}