Min25算法：求N极大时的素数个数 || 素数和

模板记录：
因为N极大（1e10以上），很可能爆long long，所以加了一个__int128模板

复杂度：反正比O(N)快

#include<bits/stdc++.h>
#define ll __int128
using namespace std;
typedef long long LL;

const int N = 1000010;

void scan(__int128 &x)//输入
{
    x = 0;
    int f = 1;
    char ch;
    if((ch = getchar()) == '-') f = -f;
    else x = x*10 + ch-'0';
    while((ch = getchar()) >= '0' && ch <= '9')
        x = x*10 + ch-'0';
    x *= f;
}
void _print(__int128 x)
{
    if(x > 9) _print(x/10);
    putchar(x%10 + '0');
}
void print(__int128 x)//输出
{
    if(x < 0)
    {
        x = -x;
        putchar('-');
    }
    _print(x);
}

namespace Min25 {

    int prime[N], id1[N], id2[N], flag[N], ncnt, m, tot=0;

    LL g[N], sum[N], a[N], T, n;

    inline int ID(LL x) {
        return x <= T ? id1[x] : id2[n / x];
    }

    inline LL calc(LL x) {
        return x * (x + 1) / 2 - 1;
    }

    inline LL f(LL x) {
        return x;
    }

    inline void init() {
        T = sqrt(n + 0.5);
        for (int i = 2; i <= T; i++) {
            if (!flag[i]) prime[++ncnt] = i, sum[ncnt] = sum[ncnt - 1] + i;
            for (int j = 1; j <= ncnt && i * prime[j] <= T; j++) {
                flag[i * prime[j]] = 1;
                if (i % prime[j] == 0) break;
            }
        }
        for (LL l = 1; l <= n; l = n / (n / l) + 1) {
            a[++m] = n / l;
            if (a[m] <= T) id1[a[m]] = m; else id2[n / a[m]] = m;
            g[m] = calc(a[m]);
        }
        for (int i = 1; i <= ncnt; i++)
            for (int j = 1; j <= m && (LL)prime[i] * prime[i] <= a[j]; j++)
                g[j] = g[j] - (LL)prime[i] * (g[ID(a[j] / prime[i])] - sum[i - 1]);
    }

    inline LL SumOfPrim(LL x) {//求素数和
        if (x <= 1) return x;
        ncnt=m=0;
        return n = x, init(), g[ID(n)];
    }


    inline LL CountOfPrim(LL x){//求素数个数
        n=x;T = sqrt(n);
        for(ll l = 1; l <= n; l = n / (n / l) + 1){
            a[++m] = n / l, g[m] = a[m] - 1;
            if(a[m]<=T){
                id1[a[m]<=T?a[m]:n/a[m]] = m;
            }
            else {
                id2[a[m]<=T?a[m]:n/a[m]] = m;
            }
        }
        for(int i = 2; i <= T; i++){
            if(!flag[i]) prime[++tot] = i;
            for(int j = 1; j <= tot && i * prime[j] <= T; j++){
                flag[i*prime[j]] = 1;
                if(i % prime[j] == 0) break;
            }
        }
        for(int i = 1; i <= tot; i++)	
            for(int j = 1; j <= m && prime[i] * prime[i] <= a[j]; j++)
                g[j] -= g[ID(a[j]/prime[i])] - (i - 1);
        return g[ID(n)];
    }
}

ll t,n,K,x,y;

int main()
{
    scan(x);
    ll tmp=Min25::SumOfPrim(x);
    ll ans=tmp;
    print(ans);
    printf("\n");
}