【知识点】 ---寻找第n个素数

如何快速找到第n个素数呢？
看到这个问题后我的第一思路就是用筛法筛出素数数组。
Mycode:

#include <bits/stdc++.h>
using namespace std;
const int MAX = 5000005;
int pri[MAX];

int main()
{
    memset(pri, 0, sizeof(pri));
    for(int i = 2; i <= MAX; ++i)
    {
        if(!pri[i]) pri[++pri[0]] = i;
        for(int j = 1; j <= pri[0] && pri[j] <= MAX / i; ++j)
        {
            pri[pri[j]*i] = 1;
            if(i % pri[j] == 0) break;
        }
    }

    int n;
    int cas = 0;
    while(scanf("%d",&n) && n)
    {
        printf("Case %d: %d\n",++cas,pri[n]);
    }
    return 0;
}

这种方法在n比较小的时候还是快的，但是当n变得很大，比如当n达到3000000时，1s是跑不完的。在此基础上稍微优化一下，多交几遍说不定就卡过去了。经过优化，速度确实快了点：

Code：

#include <cstdio>
using namespace std;
typedef long long LL;
const int MAX = 50000000;

bool vis[MAX];
int prim[3100005];
int main()
{
    int d = sqrt(1.0*MAX);
    int s = 0;
    for(int i = 3; i <= d; i += 2)
        if(!vis[i])
            for(int j = 3*i; j <= MAX; j += 2*i)
                vis[j] = true;

    int len = 0;
    prim[++len] = 2;
    for(int i = 3; i <= MAX; i += 2)
        if(!vis[i])
            prim[++len]  = i;

    int cas = 0;
    int n;
    while(scanf("%d",&n) && n)
        printf("Case %d: %d\n",++cas, prim[n]);

    return 0;
}

但是还是达不到更快的要求。怎么办？原来有专门的一种算法，可以很快的解决此问题。原文链接。
源代码链接：http://paste.ubuntu.com/24702943/

Code：

#include <bits/stdtr1c++.h>

#define MAXN 100
#define MAXM 10001
#define MAXP 40000
#define MAX 400000
#define clr(ar) memset(ar, 0, sizeof(ar))
#define read() freopen("lol.txt", "r", stdin)
#define dbg(x) cout << #x << " = " << x << endl
#define chkbit(ar, i) (((ar[(i) >> 6]) & (1 << (((i) >> 1) & 31))))
#define setbit(ar, i) (((ar[(i) >> 6]) |= (1 << (((i) >> 1) & 31))))
#define isprime(x) (( (x) && ((x)&1) && (!chkbit(ar, (x)))) || ((x) == 2))

using namespace std;

namespace pcf
{
long long dp[MAXN][MAXM];
unsigned int ar[(MAX >> 6) + 5] = {
  0};
int len = 0, primes[MAXP], counter[MAX];

void Sieve()
{
    setbit(ar, 0), setbit(ar, 1);
    for (int i = 3; (i * i) < MAX; i++, i++)
    {
        if (!chkbit(ar, i))
        {
            int k = i << 1;
            for (int j = (i * i); j < MAX; j += k) setbit(ar, j);
        }
    }

    for (int i = 1; i < MAX; i++)
    {
        counter[i] = counter[i - 1];
        if (isprime(i)) primes[len++] = i, counter[i]++;
    }
}

void init()
{
    Sieve();
    for (int n = 0; n < MAXN; n++)
    {
        for (int m = 0; m < MAXM; m++)
        {
            if (!n) dp[n][m] = m;
            else dp[n][m] = dp[n - 1][m] - dp[n - 1][m / primes[n - 1]];
        }
    }
}

long long phi(long long m, int n)
{
    if (n == 0) return m;
    if (primes[n - 1] >= m) return 1;
    if (m < MAXM && n < MAXN) return dp[n][m];
    return phi(m, n - 1) - phi(m / primes[n - 1], n - 1);
}

long long Lehmer(long long m)
{
    if (m < MAX) return counter[m];

    long long w, res = 0;
    int i, a, s, c, x, y;
    s = sqrt(0.9 + m), y = c = cbrt(0.9 + m);
    a = counter[y], res = phi(m, a) + a - 1;
    for (i = a; primes[i] <= s; i++) res = res - Lehmer(m / primes[i]) + Lehmer(primes[i]) - 1;
    return res;
}
}

long long solve(long long n)
{
    int i, j, k, l;
    long long x, y, res = 0;

    for (i = 0; i < pcf::len; i++)
    {
        x = pcf::primes[i], y = n / x;
        if ((x * x) > n) break;
        res += (pcf::Lehmer(y) - pcf::Lehmer(x));
    }

    for (i = 0; i < pcf::len; i++)
    {
        x = pcf::primes[i];
        if ((x * x * x) > n) break;
        res++;
    }

    return res;
}

int main()
{
    pcf::init();
    long long n, res,L,R,M,ca=1;
    while (scanf("%lld", &n) != EOF)
    {
        if(n=