根据定义,可以推出
f
(
x
∗
y
)
=
f
(
x
)
+
f
(
y
)
f(x * y) = f(x) + f(y)
f(x∗y)=f(x)+f(y)
∑
i
=
1
n
f
(
i
!
)
\sum_{i = 1} ^ n f(i!)
i=1∑nf(i!)
=
∑
i
=
1
n
∑
j
=
1
i
f
(
i
)
=\sum_{i = 1}^n\sum_{j = 1}^if(i)
=i=1∑nj=1∑if(i)
=
∑
i
=
1
n
(
n
−
i
+
1
)
∗
f
(
i
)
=\sum_{i = 1}^n(n - i + 1)*f(i)
=i=1∑n(n−i+1)∗f(i)
=
(
n
+
1
)
∑
i
=
1
n
f
(
i
)
−
∑
i
=
1
n
i
∗
f
(
i
)
=(n +1)\sum_{i = 1}^nf(i) - \sum_{i = 1}^n i * f(i)
=(n+1)i=1∑nf(i)−i=1∑ni∗f(i)
f
(
x
y
)
=
f
(
x
)
+
f
(
y
)
f(xy) = f(x) + f(y)
f(xy)=f(x)+f(y),考虑直接计算每个质数的贡献:将[1,n] 里每一个数都提取出一个
p
p
p:
g
(
p
)
=
(
n
+
1
)
⌊
n
p
⌋
−
p
∗
∑
i
=
1
⌊
n
p
⌋
i
g(p) = (n +1)\lfloor\frac{n}{p}\rfloor - p*\sum_{i = 1}^{\lfloor\frac{n}{p}\rfloor} i
g(p)=(n+1)⌊pn⌋−p∗i=1∑⌊pn⌋i
类似的,在
⌊
n
p
⌋
\lfloor\frac{n}{p}\rfloor
⌊pn⌋里继续提取一个
p
p
p,继续计算
g
(
p
)
g(p)
g(p)的贡献,这等价于
g
(
p
2
)
g(p^2)
g(p2)的贡献。
一个做法是:枚举
[
1
,
n
]
[1,n]
[1,n]所有素数
p
p
p,分别计算
g
(
p
)
,
g
(
p
2
)
,
g
(
p
3
)
,
.
.
.
g(p),g(p^2),g(p^3),...
g(p),g(p2),g(p3),...并求和
当
p
≤
n
p \leq \sqrt n
p≤n时,可以直接暴力计算
当
p
>
n
p > \sqrt n
p>n 时,答案为
g
(
p
)
g(p)
g(p),观察到
⌊
n
p
⌋
\lfloor\frac{n}{p}\rfloor
⌊pn⌋可以分块,对于
g
(
p
)
g(p)
g(p)式子,左半边分块需要知道两个块间有多少个素数,右半边部分需要知道两个块间的素数和,这两个东西可以用min_25筛筛出来,然后就做完了。
官方题解:
参考博客:https://blog.nowcoder.net/n/0f9f35598e6e45238d93695cd40e4411
代码:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 10;
const int mod = 998244353;
ll inv2 = (mod+1)/2;
ll w[maxn],g1[maxn],g2[maxn],id1[maxn],id2[maxn];
bool ispri[maxn];
ll pri[maxn],sum1[maxn],sum2[maxn];
ll sqr,n;
ll num,tot;
void sieve(int n) {
num = 0;ispri[1] = ispri[0] = true;
for(int i = 2; i <= n; i++) {
if(!ispri[i]) {
pri[++num] = i;
sum1[num] = (sum1[num - 1] + 1) % mod;
sum2[num] = (sum2[num - 1] + i) % mod;
}
for(int j = 1; j <= num && i * pri[j] <= n; j++) {
ispri[i * pri[j]] = true;
if(i % pri[j] == 0) break;
}
}
}
ll cal(ll x) {
x %= mod;
return x * (x + 1) % mod * inv2 % mod;
}
int main() {
sieve(maxn - 10);
scanf("%lld",&n);
sqr = sqrt(n);
tot = 0;
for(ll i = 1,j; i <= n; i = j + 1) {
j = n / (n / i);
w[++tot] = n / i;
ll p = n / i % mod;
g1[tot] = (w[tot] - 1) % mod;
g2[tot] = (p * (p + 1) % mod * inv2 % mod - 1 + mod) % mod;
if(n / i <= sqr) id1[n / i] = tot;
else id2[j] = tot;
}
for(int i = 1; i <= num; i++) {
for(int j = 1; j <= tot && 1ll * pri[i] * pri[i] <= w[j]; j++) {
ll t = w[j] / pri[i];
ll k = t <= sqr ? id1[t] : id2[n / t];
g1[j] -= (g1[k] - i + 1 + mod) % mod;
g2[j] -= (g2[k] - sum2[i - 1] + mod) % mod * pri[i] % mod;
if(g1[j] < 0) g1[j] += mod;
if(g2[j] < 0) g2[j] += mod;
}
}
ll ans = 0;
for(int i = 1; i <= num && 1ll * pri[i] * pri[i] <= n; i++) {
for(ll pe = pri[i]; pe <= n; pe = pe * pri[i]) {
ll k = n / pe;
ans = (ans + ((n + 1) % mod * k % mod - pe * k % mod * (k + 1) % mod * inv2 % mod + mod) % mod) % mod;
}
}
for(int i = 1; i < sqr; i++) {
ll p = g1[i] - g1[i + 1],q = g2[i] - g2[i + 1];
ans = (ans + (n + 1) % mod * i % mod * p % mod) % mod;
ans = (ans - 1ll * i * (i + 1) % mod * inv2 % mod * q % mod + mod) % mod;
}
printf("%lld\n",(ans % mod + mod) % mod);
return 0;
}