Meissel_Lehmer模板

合集 - 模板(41)

1.并查集模板2023-10-312.求质因数模板2023-10-313.二分图最大匹配模板(匈牙利算法)2023-12-024.欧拉函数模板2023-11-305.ST表模板2023-11-266.快速幂模板2023-10-317.字典树模板2023-12-048.矩阵模板2023-12-059.Dijkstra单源最短路模板2023-12-0910.最近公共祖先模板(LCA)2023-12-1211.拓扑排序模板2023-12-1212.区间素数筛模板2023-12-1613.Kruskal和Prim模板2023-12-2414.树状数组模板2023-12-2615.二维坐标离散化模板2024-03-0716.单点修改区间查最值-树状数组模板2024-03-1117.KMP模板2024-03-1118.二叉搜索树模板2024-03-3019.DIjkstra进阶模板 路径记录 按权重(结点数最小等)记录2024-03-3120.判断负环模板2024-04-2821.Exgcd 模板2024-05-0322.压位高精度模板2024-05-0623.线段树模板2024-05-1224.扫描线模板2024-05-1825.莫队模板2024-07-1726.带修莫队模板2024-07-1727.SCC缩点模板2024-07-1828.取模+组合数2024-07-2429.FFT 高精度乘法模板2024-07-2430.字符串自然溢出哈希/单哈希/双哈希模板2024-07-2531.树模板2024-07-2732.dsu on tree 模板2024-07-2833.线段树模板重制2024-08-0334.主席树模板2024-08-0735.大数质因数分解模板2024-08-0836.线段树合并模板2024-08-0937.int128输入输出流2024-08-09

38.Meissel_Lehmer模板2024-08-09

39.浮点高精度2024-08-1340.自适应辛普森法2024-10-0241.unordered_map随机底数种子2024-10-07

收起

复杂度 \(O(n^\frac 23)\)，计算 \(1\sim n\) 的素数个数

#define div(a, b) (1.0 * (a) / (b))
#define half(x) (((x) - 1) / 2)
i64 Meissel_Lehmer(i64 n) {
    if (n <= 3) {
        return max(n - 1, 0LL);
    }
    long long v = sqrtl(n);
    int s = (v + 1) / 2;
    vector<int> smalls(s), roughs(s);
    vector<i64> larges(s);
    for (int i = 0 ; i < s ; i++) {
        smalls[i] = i;
    }
    for (int i = 0 ; i < s ; i++) {
        roughs[i] = i * 2 + 1;
    }
    for (int i = 0 ; i < s ; i++) {
        larges[i] = half(n / roughs[i]);
    }
    vector<bool> skip(v + 1);
    int pc = 0;
    for (int p = 3 ; p <= v ; p += 2) {
        if (skip[p] == false) {
            i64 q = p * p;
            if (q * q > n) {
                break;
            }
            skip[p] = true;
            for (int i = q ; i <= v ; i += 2 * p) {
                skip[i] = true;
            }
            int ns = 0;
            for (int k = 0 ; k < s ; k++) {
                int i = roughs[k];
                if (skip[i]) {
                    continue;
                }
                long long d = 1LL * i * p;
                larges[ns] = larges[k] - (d <= v ? larges[smalls[d >> 1] - pc] : smalls[half(div(n, d))]) + pc;
                roughs[ns++] = i;
            }
            s = ns;
            for (int i = half(v), j = (((v / p) - 1) | 1) ; j >= p ; j -= 2) {
                int c = smalls[j / 2] - pc;
                for (int e = j * p / 2 ; i >= e ; i--) {
                    smalls[i] -= c;
                }
            }
            pc++;
        }
    }
    larges[0] += 1LL * (s + 2 * (pc - 1)) * (s - 1) >> 1;
    for (int k = 1 ; k < s ; k++) {
        larges[0] -= larges[k];
    }
    for (int L = 1 ; L < s ; L++) {
        int q = roughs[L];
        long long m = n / q;
        int e = smalls[half(m / q)] - pc;
        if (e < L + 1) {
            break;
        }
        long long t = 0;
        for (int k = L + 1 ; k <= e ; k++) {
            t += smalls[half(div(m, roughs[k]))];
        }
        larges[0] += t - 1LL * (e - L) * (pc + L - 1);
    }
    return larges[0] + 1;
}
#undef div
#undef half