CodeForces - 665F Four Divisors（min_25筛）

传送门

---

题目大意

求出$n$以内只有四个因子的数，其实就是求出恰为两个素数相乘的数，这两个素数可以相同也可以不同

解题思路

首先考虑素数相同的数，那么我们可以枚举所有的素数，直到某个素数的三次方大于$n$结束。然后是素数不同的两个数，我们可以考虑固定某个素数，然后就是求出它的倍数在$n$的范围内有多少个，那么上界就是$\lfloor \frac{n}{p}\rfloor$，但是我们要知道它的素数倍数有多少个，实际上就是求$[p,\lfloor \frac{n}{p}\rfloor ]$以内的素数个数，考虑$min\_25$筛能正确求出$n$的每个因数前缀的素数个数，减去$p$前缀的素数个数即可

//
// Created by Happig on 2020/10/8
//
#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 = 1e6 + 10;

ll prime[maxn], sum[maxn];
ll w[maxn], id1[maxn], id2[maxn], g[maxn];
bitset<maxn> vis;
int m, cnt, tot;
ll n;

inline ll getID(ll x) {
    return x <= m ? id1[x] : id2[n / x];
}

void init() {
    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, sum[cnt] = sum[cnt - 1] + 1;
        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) {
        w[++tot] = n / l;
        r = n / w[tot];
        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(w[j] / prime[i]);
            g[j] -= g[k] - i + 1;
        }
    }
}

ll f(ll x) {
    return g[getID(x)];
}

int main() {
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin >> n;
    init();
    ll ans = 0;
    for (int i = 1; i <= cnt; i++) {
        ll x = prime[i];
        if (x * x * x > n) break;
        ans++;
    }
    for (int i = 1; i <= cnt; i++) {
        if (n / prime[i] <= prime[i]) break;
        ans += f(n / prime[i]) - sum[i];
    }
    cout << ans << ENDL;
    return 0;
}