hdu5901Count primes+Lehmer求1-n的质数个数

Problem Description
Easy question! Calculate how many primes between [1…n]!

Input
Each line contain one integer n(1 <= n <= 1e11).Process to end of file.

Output
For each case, output the number of primes in interval [1…n]

Sample Input

2
3
10

Sample Output

1
2
4

Source
2016 ACM/ICPC Asia Regional Shenyang Online
直接套用模板。。1e11以内跑出结果只要大概几十毫秒的样子。。
来源：https://en.wikipedia.org/wiki/Prime-counting_function
参考：http://codeforces.com/contest/665/problem/F

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int PRIME_LIMIT = int(1e6) * 5;
bool prime[PRIME_LIMIT + 1];
int prime_count_table[PRIME_LIMIT + 1];
vector<int> prs;

void init_prime() {
    memset(prime, 1, sizeof(prime));
    prime[0] = prime[1] = false;
    for (int i = 2; i < (int)sizeof(prime); i++) if (prime[i])
        for (int j = i * 2; j < (int)sizeof(prime); j += i) prime[j] = false;
    for (int i = 2; i <(int) sizeof(prime); i++) if (prime[i]) prs.push_back(i);
    for (int i = 2; i < (int)sizeof(prime); i++) prime_count_table[i] += prime_count_table[i - 1] + prime[i];
}

const int SMALL_PRIME_PHI_TABLE_MAX = 7;
vector<int> small_prime_phi_table[SMALL_PRIME_PHI_TABLE_MAX];

void init_small_prime_phi_table() {
    int n = 2;
    small_prime_phi_table[0] = { 0, 1 };
    for (int i = 1; i < SMALL_PRIME_PHI_TABLE_MAX; i++) {
        n *= prs[i];
        for (int _ = 0; _ < prs[i]; _++) {
            small_prime_phi_table[i].insert(small_prime_phi_table[i].end(),
                small_prime_phi_table[i - 1].begin(), small_prime_phi_table[i - 1].end());
        }
        for (int j = prs[i]; j < n; j += prs[i]) {
            small_prime_phi_table[i][j] = 0;
        }
    }
    for (int i = 0; i < SMALL_PRIME_PHI_TABLE_MAX; i++) {
        for (int j = 0; j < (int)small_prime_phi_table[i].size() - 1; j++) {
            small_prime_phi_table[i][j + 1] += small_prime_phi_table[i][j];
        }
    }
}

void init() {
    init_prime();
    init_small_prime_phi_table();
}

ll prime_phi(ll x, int a) {
    a--;
    if (a == 0) return (x + 1) / 2;
    if (a < SMALL_PRIME_PHI_TABLE_MAX) {
        const int n = (int)small_prime_phi_table[a].size();
        ll ret = x / n * small_prime_phi_table[a][n - 1] + small_prime_phi_table[a][x % n];
        return ret;
    }
    if (prs[a] >= x) return 1;
    ll t = prime_phi(x, a) - prime_phi(x / prs[a], a);
    return t;
}

ll int_sqrt(ll n) {
    ll ret = (ll)sqrt(n);
    while (ret * ret <= n) ret++;
    return ret - 1;
}

ll int_cbrt(ll n) {
    ll ret = (ll)cbrt(n);
    while (ret * ret <= n) ret++;
    return ret - 1;
}

ll int_fourth_rt(ll n) {
    return int_sqrt(int_sqrt(n));
}

ll lehmer_pi(ll x) {
    if (x <= PRIME_LIMIT) return prime_count_table[x];
    int a = (int)lehmer_pi(int_fourth_rt(x));
    int b = (int)lehmer_pi(int_sqrt(x));
    int c = (int)lehmer_pi(int_cbrt(x));
    ll sum = prime_phi(x, a) + ll(b + a - 2) * (b - a + 1) / 2;
    for (int i = a + 1; i <= b; i++) {
        ll w = x / prs[i - 1];
        sum -= lehmer_pi(w);
        if (i > c) continue;
        ll lim = lehmer_pi(int_sqrt(w));
        for (int j = i; j <= lim; j++) {
            sum -= lehmer_pi(w / prs[j - 1]) - (j - 1);
        }
    }
    return sum;
}

int main() {
    init();
    long long n;
    while(cin >> n){
        cout << lehmer_pi(n) << endl;
    }
    return 0;
}

顺带附带另一位菊苣的代码

#include <bits/stdc++.h>
using namespace std;  
#define ll long long  
ll f[340000],g[340000],n;  
void init()  
{  
    ll i,j,m;  
    for(m=1; m*m<=n; ++m)f[m]=n/m-1;  
    for(i=1; i<=m; ++i)g[i]=i-1;  
    for(i=2; i<=m; ++i)  
    {  
        if(g[i]==g[i-1])continue;  
        ll x=min(m-1,n/i/i);  
        for(j=1; j<=x; ++j)  
        {  
            if(i*j<m)f[j]-=f[i*j]-g[i-1];  
            else f[j]-=g[n/i/j]-g[i-1];  
        }  
        x=i*i;  
        for(j=m; j>=x; --j)g[j]-=g[j/i]-g[i-1];  
    }  
}  
int main()  
{  
    while(scanf("%I64d",&n)!=EOF)  
    {  
        init();  
        printf("%I64d\n",f[1]);  
    }  
    return 0;  
}