BZOJ 4916 神犇和蒟蒻(杜教筛)

Description

很久很久以前，有一只神犇叫yzy;
很久很久之后，有一只蒟蒻叫lty;

---

Input

请你读入一个整数N;1<=N<=1E9,A、B模1E9+7;

---

Output

请你输出一个整数$A=\sum_{i=1}^N{\mu (i^2)}$;
请你输出一个整数$B=\sum_{i=1}^N{\varphi (i^2)}$;

---

Sample Input

1

---

Sample Output

1
1

---

Solution

$A=\sum_{i=1}^N{\mu (i^2)}$是拿来搞笑的。
$B=\sum_{i=1}^N{\varphi (i^2)}$化简一下，用杜教筛即可。

因为

$$\varphi(n)=n·\Pi{{p_i-1}\over{p_i}}，\varphi(n^2)=n^2·\Pi{{p_i-1}\over{p_i}}$$
其中 $$n=p_1^{k1}p_2^{k2}..p_m^{km},n^2=p_1^{2k1}p_2^{2k2}..p_m^{2km}$$

所以

$$\varphi(n^2)=n·\varphi(n)$$
题目就是求
$$\sum_{i=1}^n\varphi(i^2)=\sum_{i=1}^ni·\varphi(i)$$

这个利用狄利克雷卷积知识就可以知道，$(id·\varphi)*id=id^2$，
即

$$\sum_{d|n}d·\varphi(d)·{n \over d}=n\sum_{d|n}\varphi(d)=n^2$$
我们设 $\phi'(n)=\sum_{i=1}^ni·\varphi(i)$，利用平方前缀和公式，我们得到

$${{n(n+1)(2n+1)}\over{6}}=\sum_{i=1}^ni^2=\sum_{i=1}^n\sum_{d|i}d·\varphi(d)·{i\over{d}}=\sum_{{i\over{d}}=1}{i\over d}·\sum_{d=1}^{\left \lfloor{n \over {i\over{d}}}\right\rfloor}d·\varphi(d)=\sum_{i=1}^ni·\phi'(\lfloor{n\over i}\rfloor)$$

因此$\phi'(n)={{n(n+1)(2n+1)}\over{6}}-\sum_{i=2}^ni·\phi'(\lfloor{n\over i}\rfloor)$，预处理一下，用hash记忆化递归，时间就可以保证在$O(n^{2\over 3})$了。

---

Code

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <cmath>
#include <algorithm>
#define N 1000010
#define M 2333333
#define Mod 1000000007
using namespace std;

typedef long long LL;
int n, cnt;
bool vis[N];
int prime[N];
LL phi[N], hash_v[M], hash_n[M];

void Da(){
    vis[1] = true;
    phi[1] = 1ll;
    for(int i = 2; i < N; i++){
      if(!vis[i]){
        prime[++cnt] = i;
        phi[i] = (LL)(i-1);
      }
      for(int j = 1; j <= cnt && i * prime[j] < N; j++){
        vis[i * prime[j]] = true;
        if(i % prime[j] == 0){
          phi[i * prime[j]] = phi[i] * (LL)prime[j];
          break;
        }
        else  phi[i * prime[j]] = phi[i] * (LL)(prime[j]-1);
      }
    }
    for(int i = 1; i < N; i++){  
      phi[i] = phi[i] % Mod * i % Mod;
      phi[i] = (phi[i] + phi[i-1]) % Mod;
    }
}

LL Find(LL x){
    int p = x % M;
    while(hash_n[p] && hash_n[p] != x)  p = (p+1) % M;
    if(!hash_n[p])  return -1;
    return hash_v[p];
}


void Push(LL v, LL x){
    int p = x % M;
    while(hash_n[p])  p = (p+1) % M;
    hash_v[p] = v;
    hash_n[p] = x;
}


LL Sum(LL x){
    if(x < N)  return phi[x];
    LL res = Find(x);
    if(~ res)  return res;
    else{
      LL temp1 = x * (x + 1), temp2 = 2 * x + 1;
      if(!(temp1 % 6))  temp1 /= 6;
      else if(!(temp2 % 6))  temp2 /= 6;
      else if(!(temp1 % 2) && !(temp2 % 3))  temp1 /= 2, temp2 /= 3;
      else if(!(temp2 % 2) && !(temp1 % 3))  temp1 /= 3, temp2 /= 2;
      res = ((temp1 % Mod) * (temp2 % Mod)) % Mod;
    }
    LL last;
    for(LL i = 2; i <= x; i = last+1){
      last = x/(x/i);
      res = (res - (((last+i) * (last-i+1) / 2) % Mod * Sum(x/i)) % Mod + Mod) % Mod;
    }
    Push(res, x);
    return res;
}


int main(){

    freopen("bzoj4916.in", "r", stdin);
    freopen("bzoj4916.out", "w", stdout);

    Da();

    scanf("%lld", &n);
    printf("1\n%lld\n", Sum(n));

    return 0;
}

---