素数打表

const int N = 100001;
int mark[N],prime[N],cont=0;
void prime_table()
{
    memset(mark,0,sizeof(mark));
    mark[0] = mark[1] = 1;
    for(long long i=2;i<N;i++)
    {
        if(mark[i]) continue;
        prime[++cont] = i;
        for(long long j=i;j*i<N;j++) mark[i*j] = 1;
    }
}

 

转载于:https://www.cnblogs.com/Leozi/p/10835311.html