题面
解法
杜教筛的模板题
- 首先可以发现, ∑ i = 1 n μ ( i 2 ) \sum_{i=1}^n\mu(i^2) ∑i=1nμ(i2)一定等于1,因为除了 i = 1 i=1 i=1的时候 μ ( i 2 ) = 1 \mu(i^2)=1 μ(i2)=1,其他时候 μ ( i 2 ) = 0 \mu(i^2)=0 μ(i2)=0。
- 然后考虑怎么求 ∑ i = 1 n φ ( i 2 ) \sum_{i=1}^n\varphi(i^2) ∑i=1nφ(i2),显然可以变成 ∑ i = 1 n i φ ( i ) \sum_{i=1}^n i\varphi(i) ∑i=1niφ(i)
- 那么我们可以令 f ( i ) = i φ ( i ) f(i)=i\varphi(i) f(i)=iφ(i),那么我们只要找到满足 f ∗ g = h f*g=h f∗g=h且 g g g和 h h h的前缀和都比较好求的就可以了。
- 考虑到 φ ∗ 1 = i d \varphi*1=id φ∗1=id,那么我们令 g ( i ) = i d g(i)=id g(i)=id,所以 ( f ∗ g ) ( i ) = ∑ d ∣ i d φ ( d ) × i d = i ∑ d ∣ i φ ( i ) = i 2 (f*g)(i)=\sum_{d|i}d\varphi(d)×\frac{i}{d}=i\sum_{d|i}\varphi(i)=i^2 (f∗g)(i)=∑d∣idφ(d)×di=i∑d∣iφ(i)=i2
- 那么我们就得出了 g ( i ) = i , h ( i ) = i 2 g(i)=i,h(i)=i^2 g(i)=i,h(i)=i2,然后就可以杜教筛了
- 时间复杂度: O ( n 2 3 ) O(n^{\frac{2}{3}}) O(n32)
代码
#include <bits/stdc++.h>
#define Mod 1000000007
#define N 1000010
using namespace std;
template <typename T> void read(T &x) {
x = 0; int f = 1; char c = getchar();
while (!isdigit(c)) {if (c == '-') f = -1; c = getchar();}
while (isdigit(c)) x = x * 10 + c - '0', c = getchar(); x *= f;
}
const int inv = 166666668;
bool f[N]; int t, p[N], phi[N];
map <int, int> s;
void add(int &x, int y) {x += y; if (x >= Mod) x -= Mod;}
void sieve(int n) {
memset(f, true, sizeof(f)); int len = 0; phi[1] = 1;
for (int i = 2; i <= n; i++) {
if (f[i]) p[++len] = i, phi[i] = i - 1;
for (int j = 1; j <= len && i * p[j] <= n; j++) {
int k = i * p[j]; f[k] = false;
if (i % p[j] == 0) {phi[k] = phi[i] * p[j]; break;}
phi[k] = phi[i] * (p[j] - 1);
}
}
for (int i = 1; i <= n; i++) phi[i] = 1ll * phi[i] * i % Mod;
for (int i = 1; i <= n; i++) add(phi[i], phi[i - 1]);
}
int sum(int n) {
if (n <= t) return phi[n];
if (s.count(n)) return s[n];
int ret = 1ll * n * (n + 1) % Mod * (2ll * n % Mod + 1) % Mod * inv % Mod, x = 0;
for (int i = 2; i <= n; i = x + 1) {
x = n / (n / i); int tot = 1ll * (x + i) * (x - i + 1) / 2 % Mod;
add(ret, Mod - 1ll * tot * sum(n / i) % Mod);
}
return s[n] = ret;
}
int main() {
int n; read(n); cout << "1\n";
t = pow(n, 2.0 / 3); sieve(t);
cout << sum(n) << "\n";
return 0;
}