Nth prime & numbers of primes （模板）

都是取的模板，这几天做的素数题挺多的，所以整理了放在这里，感觉有一天回用到的！

SPOJ:Nth Prime：     求第N个素数，N<1e9。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=,P=,Q=;
struct getnthprime
{
    int prime[N+],pi[N+],e[P];
    void init(){
       for(int i=;i<=N;i++) {
          if(!prime[i]) prime[++prime[]]=i,pi[i]=pi[i-]+;
          else pi[i]=pi[i-];
          for(int j=;j<=prime[]&&i<=N/prime[j];j++) {
              prime[i*prime[j]]=;
              if(i%prime[j]==) break;
          }
       }
       for(int i=;i<P;i++) e[i]=i;
       for(int i=;i<=;i++) {
          for(int j=P-;j>=;j--)
            e[j]-=e[j/prime[i]];
       }
    }
    ll get_phi(ll m,int n) {
       if (n==) return m/P*Q+e[m%P];
       if (m<prime[n]) return ;
       if (m<=N&&m<=(ll)prime[n]*prime[n]*prime[n]) {
          ll ans=pi[m]-n+;
          for(int i=n+,l=pi[(int)sqrt(m+0.1)];i<=l;i++)
             ans+=pi[m/prime[i]]-i+;
          return ans;
       }
       return get_phi(m,n-)-get_phi(m/prime[n],n-);
    }

    ll get_pi(ll m){
       if(m<=N) return pi[m];
       int n=pi[(int)cbrt(m-0.1)+];
       ll ans=get_phi(m,n)+n-;
       for(int i=n+,l=pi[(int)sqrt(m+0.1)];i<=l;i++)
          ans-=get_pi(m/prime[i])-i+;
       return ans;
   }

   bool f[];
   ll get_pn(ll n) {
      if (n<=prime[]) return prime[n];
      ll x=n*(log(n)+log(log(n))-)+n*(log(log(n))-)/log(n)-*n/;
      ll y=n*(log(log(n)))*(log(log(n)))/log(n)/log(n);
      y=min(y,ll());
      ll l=x,r=x+y,flag = ;
      for (int i=;i<;i++) {
         ll m=(l+r)>> ;
         ll pm=get_pi(m);
         if(pm>=n) r=m,flag=;
         else l=m+,flag=pm;
      }
      ll count=flag?flag:get_pi(l-);
      for(int i=,li=pi[(int)sqrt(r+0.1)];i<=li;i++) {
         for(int j=((l-)/prime[i]+)*prime[i]-l;j<=r-l+;
             j+=prime[i]){
             f[j]=true;
         }
      }
      for(int i=;i<=r-l+;i++) {
         if(!f[i]){
             count++;
             if(count==n) return i+l;
         }
      }
      return -;
   }
}NP;

int main() {
    NP.init();
    ll n; scanf("%lld",&n);
    cout<<NP.get_pn(n)<<endl;
    return ;
}

HDU5901:Count primes:    求1到N有多少个素数。N<1e11。

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=5e6+,M=,PM=******;
struct countprimes
{
    bool np[N],did[N];
    int prime[N],pi[N],phi[PM+][M+],sz[M+];
    vector<ll>v;
    int getprime()
    {
       int cnt=;
       np[]=np[]=true;
       pi[]=pi[]=;
       for(int i=;i<N;++i){
           if(!np[i]) prime[++cnt]=i; pi[i]=cnt;
           for(int j=;j<=cnt&&i*prime[j]<N;++j){
              np[i*prime[j]]=true;
              if(i%prime[j]==) break;
           }
       } return cnt;
    }
    void init()
    {
       getprime();
       sz[]=;
       for(int i=;i<=PM;++i) phi[i][]=i;
       for(int i=;i<=M;++i){
          sz[i]=prime[i]*sz[i-];
          for(int j=;j<=PM;++j) phi[j][i]=phi[j][i-]-phi[j/prime[i]][i-];
       }
    }
    int sqrt2(ll x)
    {
       ll r=(ll)sqrt(x-0.1);
       while(r*r<=x) ++r;
       return int(r-);
    }
    int sqrt3(ll x)
    {
       ll r=(ll)cbrt(x-0.1);//开三次方
       while(r*r*r<=x) ++r;
       return int(r-);
    }
    ll getphi(ll x,int s)
    {
       if(s==) return x;
       if(s<=M)  return phi[x%sz[s]][s]+(x/sz[s])*phi[sz[s]][s];
       if(x<=prime[s]*prime[s]) return pi[x]-s+;
       if(x<=prime[s]*prime[s]*prime[s]&&x<N)
       {
          int s2x=pi[sqrt2(x)];
          ll ans=pi[x]-(s2x+s-)*(s2x-s+)/;
          for(int i=s+;i<=s2x;++i) ans+=pi[x/prime[i]];
          return ans;
       }
       return getphi(x,s-)-getphi(x/prime[s],s-);
   }
   ll getpi(ll x)
   {
      if(x<N)  return pi[x];
      ll ans=getphi(x,pi[sqrt3(x)])+pi[sqrt3(x)]-;
      for(int i=pi[sqrt3(x)]+,ed=pi[sqrt2(x)];i<=ed;++i) ans-=getpi(x/prime[i])-i+;
      return ans;
   }
   ll lehmer_pi(ll x)
   {
      if(x<N)  return pi[x];
      int a=(int)lehmer_pi(sqrt2(sqrt2(x)));
      int b=(int)lehmer_pi(sqrt2(x));
      int c=(int)lehmer_pi(sqrt3(x));
      ll sum=getphi(x,a)+(ll)(b+a-)*(b-a+)/;
      for(int i=a+;i<=b;i++)
      {
          ll w=x/prime[i];
          sum-=lehmer_pi(w);
          if(i>c) continue;
          ll lim=lehmer_pi(sqrt2(w));
          for(int j=i;j<=lim;j++) sum-=lehmer_pi(w/prime[j])-(j-);
      }
      return sum;
   }
}CP;
int main()
{
    CP.init();
    ll n,ans=;
    while(~scanf("%lld",&n)){
        cout<<CP.lehmer_pi(n)<<endl;
    }
}