bzoj4916 神犇和蒟蒻

题面：bzoj4916

题意：求${\sum }_{i=1}^n\mu (i^2)$和${\sum }_{i=1}^n\phi (i^2)$，膜$10^9+7$。$n\le 10^9$

题解：

第一个式子${\sum }_{i=1}^n\mu (i^2)$，明显只有当$i=1$时，$\mu (i^2)=1$；$i̸=1$，$\mu (i^2)=0$

输出1即可。

---

第二个式子考虑线性筛$\phi (i)$的过程：$\phi (i^2)=i\cdot \phi (i)$

即求${\sum }_{i=1}^{n}i\cdot \phi (i)$

设$f(i)=i\cdot \phi (i)$，$S(n)={\sum }_{i=1}^{n}f(i)$

$\begin{array}{rl}g(1)S(n)& =\sum _{i=1}^n(f\ast g)(i)-\sum _{i=2}^{n}g(i)S(\frac{n}{i})\\ & =\sum _{i=1}^n\sum _{d\mid i}f(d)\cdot g(\frac{i}{d})-\sum _{i=2}^{n}g(i)S(\frac{n}{i})\\ & =\sum _{i=1}^n\sum _{d\mid i}d\cdot \phi (d)\cdot g(\frac{i}{d})-\sum _{i=2}^{n}g(i)S(\frac{n}{i})\end{array}$

令$g(i)=i$

$\begin{array}{rl}S(n)& =\sum _{i=1}^n\sum _{d\mid i}d\cdot \phi (d)\cdot \frac{i}{d}-\sum _{i=2}^{n}iS(\frac{n}{i})\\ & =\sum _{i=1}^{n}i\sum _{d\mid i}\phi (d)-\sum _{i=2}^{n}i\cdot S(\frac{n}{i})\\ & =\sum _{i=1}^n{i}^2-\sum _{i=2}^{n}i\cdot S(\frac{n}{i})\end{array}$

记忆化计算即可。

#include <bits/stdc++.h>
using namespace std;
typedef long long ll ;
const int maxn = 1e6 + 10, mod = 1e9 + 7;
int prime[maxn], tot ;
ll phi[maxn], inv6 ;
bool vis[maxn] ;
map<int, ll> val ;
void init () {
    phi[1] = 1 ;
    for (int i = 2; i < maxn; i ++) {
        if (!vis[i]) prime[++ tot] = i, phi[i] = i - 1 ;
        for (int j = 1; j <= tot && i * prime[j] < maxn; j ++) {
            vis[i * prime[j]] = 1;
            if (i % prime[j] == 0) {
                phi[i * prime[j]] = phi[i] * prime[j] ;
                break ;
            }
            phi[i * prime[j]] = phi[i] * phi[prime[j]] ;
        }
    }
    for (int i = 1; i < maxn; i ++) phi[i] = (phi[i - 1] + 1ll * i * phi[i] % mod) % mod ;
}
ll power (ll x, int y) {
    ll res = 1 ;
    while (y) {
        if (y & 1) res = res * x % mod ;
        x = x * x % mod; y >>= 1 ;
    }
    return res ;
}
ll cal (int n) {
    if (n < maxn) return phi[n] ;
    if (val[n]) return val[n] ;
    ll res = 1ll * n * (n + 1) % mod * (n + n + 1) % mod * inv6 % mod ;
    for (int i = 2, j; i <= n; i = j + 1) {
        j = n / (n / i) ;
        res = (res - 1ll * (i + j) * (j - i + 1) / 2 % mod * cal (n / i) % mod) % mod ;
    }
    return val[n] = (res + mod) % mod ;
}
int main() {
    init () ;
    inv6 = power (6, mod - 2) ;
    int n ;
    scanf("%d", &n) ;
    printf("1 %lld\n", cal (n)) ;
}