题目大意
求 ∑ i = 1 n f ( i ) \sum_{i=1}^nf(i) ∑i=1nf(i),其中 f ( i ) f(i) f(i)为:
- 若 i = 1 i=1 i=1或者 i ∈ p r i m e s i \in primes i∈primes,则 f ( i ) = 0 f(i)=0 f(i)=0
- 若 i i i的唯一分解式(升序)为 p 1 ∗ p 1 ∗ . . . ∗ p 2 ∗ p 2 ∗ . . . ∗ p n − 1 ∗ . . . ∗ p n p_1*p_1*...*p_2*p_2*...*p_{n-1}*...*p_n p1∗p1∗...∗p2∗p2∗...∗pn−1∗...∗pn,则 f ( i ) f(i) f(i)为倒数第二个质因子
不知道为什么很多地方说是次大质因子,但是看样例感觉不太对劲,应该就是上面理解的那样
解题思路
虽然不知道为什么这种非积性的奇怪函数也能筛, m i n _ 25 min\_25 min_25筛真的强大。
考虑在第二部分我们如何求出答案,设 S ( n , j ) S(n,j) S(n,j)表示最小质因子大于等于 P j P_j Pj的前缀和
- 对于质数部分,显然所有质数的前缀和为 0 0 0。
- 对于合数部分,枚举最小质因子 P k e P_k^e Pke时, P k e P_k^e Pke有贡献当且仅当除掉 P k e P_k^e Pke为质数或者为 1 1 1,若不是质数,那么可以对 ⌊ n P k e ⌋ \lfloor \frac{n}{P_k^e} \rfloor ⌊Pken⌋继续递归拆解,即 S ( ⌊ n P k e ⌋ , k + 1 ) S(\lfloor \frac{n}{P_k^e} \rfloor,k+1) S(⌊Pken⌋,k+1);而 P k P_k Pk的贡献为 P k ∗ ∑ i = P k ⌊ n P k e ⌋ P_k*\sum_{i=P_k}^{\lfloor \frac{n}{P_k^e} \rfloor} Pk∗∑i=Pk⌊Pken⌋,那么我们需要预处理素数个数的前缀和,即第一部分的 g ( j , n ) g(j,n) g(j,n)函数。
//
// Created by Happig on 2020/10/6
//
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define ins insert
#define Vector Point
#define ENDL "\n"
#define lowbit(x) (x&(-x))
#define mkp(x, y) make_pair(x,y)
#define mem(a, x) memset(a,x,sizeof a);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const double eps = 1e-8;
const double pi = acos(-1.0);
const int inf = 0x3f3f3f3f;
const double dinf = 1e300;
const ll INF = 1e18;
const int Mod = 1e9 + 7;
const int maxn = 5e6 + 10;
ll prime[maxn];
ll w[maxn], id1[maxn], id2[maxn], g[maxn];
bitset<maxn> vis;
int m, tot, cnt;
ll getID(ll n, ll x) {
return x <= m ? id1[x] : id2[n / x];
}
void init(ll n) {
vis.reset();
vis[1] = 1;
m = sqrt(n + 0.5), cnt = tot = 0;
for (int i = 2; i <= m; i++) {
if (!vis[i]) prime[++cnt] = i;
for (int j = 1; j <= cnt && i * prime[j] <= m; j++) {
vis[i * prime[j]] = 1;
if (i % prime[j] == 0) break;
}
}
for (ll l = 1, r; l <= n; l = r + 1) {
r = n / (n / l);
w[++tot] = n / l;
g[tot] = w[tot] - 1;
if (w[tot] <= m) id1[w[tot]] = tot;
else id2[r] = tot;
}
for (int i = 1; i <= cnt; i++) {
for (int j = 1; j <= tot && prime[i] * prime[i] <= w[j]; j++) {
ll k = getID(n, w[j] / prime[i]);
g[j] -= g[k] - i + 1;
}
}
}
ll S(ll n, ll x, int y) {
if (x <= 1 || prime[y] > x) return 0;
ll ans = 0;
for (int i = y; i <= cnt && prime[i] * prime[i] <= x; i++) {
ll pe = prime[i];
for (int e = 1; pe * prime[i] <= x; e++, pe *= prime[i]) {
ll k = getID(n, x / pe);
ans += S(n, x / pe, i + 1) + prime[i] * (g[k] - i + 1);
}
}
return ans;
}
int main() {
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
ll l, r;
cin >> l >> r;
init(r);
ll R = S(r, r, 1);
init(l - 1); //这里是似乎不需要了,但是上面的枚举的最大范围需要处理为\sqrt{l-1}
ll L = S(l - 1, l - 1, 1);
cout << R - L << ENDL;
return 0;
}