素数筛法四种（包含时间比较）

法一

#include<iostream>
#include<queue>
#include<cstring>
#include<string>
#include<sstream>
#include<map>
#include<vector>
#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<stack>
#include<ctime>
using namespace std; 
#define rep(i,aa,bb) for(register int i=aa;i<=bb;i++)
#define rrep(i,aa,bb) for(register int i=aa;i>=bb;i--)
#define LL long long 
#define eps 0.000001
#define inf 0x3f3f3f3f
#define exp 0.000001
#define pai 3.141592654
#define random(x)   rand()%(x)
#define lowbit(x)   x&(-x)
inline int read()
{
	int x=0,y=1;char a=getchar();while ( a>'9' || a<'0'){if ( a=='-')y=-1;a=getchar();}
	while ( a>='0' && a<='9' ){	x=10*x+a-'0'; a=getchar();}return x*y;
}
#define N 10000005
bool ispri[N];
int euler(int n){
	int a = n,res = n; 
	for (int i = 2; i*i <= a; i++){
		if ( a%i == 0 ){
			res = res/i*(i-1);
			while ( a%i == 0 )	a/=i;
		}
	}
	if ( a > 1 )	res = res/a*(a-1);
	return res; 
}
void getpri(int n){
	rep(i,2,n){
		if ( euler(i)==i-1 )
			ispri[i] = 1; 
	}
}
int main()
{
//	freopen("1.txt","r",stdin);
	srand((int)time(0));
	std::ios::sync_with_stdio(false);
	int n = 10000000;
	memset(ispri,0,sizeof(ispri));
	clock_t a = clock();
	getpri(n);
//	rep(i,1,n){
//		if ( ispri[i] ){
//			printf("%d\n",i);
//		}
//	}
	clock_t b = clock() ; 
	printf("%d",b-a);
	return 0;
	return 0;
}

法二

#include<iostream>
#include<queue>
#include<cstring>
#include<string>
#include<sstream>
#include<map>
#include<vector>
#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<stack>
#include<ctime>
using namespace std; 
#define rep(i,aa,bb) for(register int i=aa;i<=bb;i++)
#define rrep(i,aa,bb) for(register int i=aa;i>=bb;i--)
#define LL long long 
#define eps 0.000001
#define inf 0x3f3f3f3f
#define exp 0.000001
#define pai 3.141592654
#define random(x)   rand()%(x)
#define lowbit(x)   x&(-x)
inline int read()
{
	int x=0,y=1;char a=getchar();while ( a>'9' || a<'0'){if ( a=='-')y=-1;a=getchar();}
	while ( a>='0' && a<='9' ){	x=10*x+a-'0'; a=getchar();}return x*y;
}
#define N 10000005
bool ispri[N];
bool is(int n){
	for (int i = 2; i*i <= n; i++){
		if ( n%i == 0 )	
			return 0; 
	}
	return 1; 
}
void getpri(int n){
	rep(i,2,n){
		if ( is(i) )
			ispri[i] = 1; 
	}
}
int main()
{
//	freopen("1.txt","r",stdin);
	srand((int)time(0));
	std::ios::sync_with_stdio(false);
	int n = 10000000;
	memset(ispri,0,sizeof(ispri));
	clock_t a = clock();
	getpri(n);
//	rep(i,1,n){
//		if ( ispri[i] ){
//			printf("%d\n",i);
//		}
//	}
	clock_t b = clock() ; 
	printf("%d",b-a);
	return 0;
}

法三

#include<iostream>
#include<queue>
#include<cstring>
#include<string>
#include<sstream>
#include<map>
#include<vector>
#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<stack>
#include<ctime>
using namespace std; 
#define rep(i,aa,bb) for(register int i=aa;i<=bb;i++)
#define rrep(i,aa,bb) for(register int i=aa;i>=bb;i--)
#define LL long long 
#define eps 0.000001
#define inf 0x3f3f3f3f
#define exp 0.000001
#define pai 3.141592654
#define random(x)   rand()%(x)
#define lowbit(x)   x&(-x)
inline int read()
{
	int x=0,y=1;char a=getchar();while ( a>'9' || a<'0'){if ( a=='-')y=-1;a=getchar();}
	while ( a>='0' && a<='9' ){	x=10*x+a-'0'; a=getchar();}return x*y;
}
#define N 10000005
bool ispri[N];
void getpri(int n){
	int t = sqrt(n);
	memset(ispri,1,sizeof(ispri));
	rep(i,2,t){
		if ( ispri[i] ){
			for(int j = i*2; j <= n ; j+=i)	
				ispri[j] = 0; 		
		}
	}
}
int main()
{
//	freopen("1.txt","r",stdin);
	srand((int)time(0));
	std::ios::sync_with_stdio(false);
	int n = 10000000;
	memset(ispri,0,sizeof(ispri));
	clock_t a = clock();
	getpri(n);
//	rep(i,1,n){
//		if ( ispri[i] ){
//			printf("%d\n",i);
//		}
//	}
	clock_t b = clock() ; 
	printf("%d",b-a);
	return 0;
	return 0;
}

法四

#include<iostream>
#include<queue>
#include<cstring>
#include<string>
#include<sstream>
#include<map>
#include<vector>
#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<stack>
#include<ctime>
using namespace std; 
#define rep(i,aa,bb) for(register int i=aa;i<=bb;i++)
#define rrep(i,aa,bb) for(register int i=aa;i>=bb;i--)
#define LL long long 
#define eps 0.000001
#define inf 0x3f3f3f3f
#define exp 0.000001
#define pai 3.141592654
#define random(x)   rand()%(x)
#define lowbit(x)   x&(-x)
inline int read()
{
	int x=0,y=1;char a=getchar();while ( a>'9' || a<'0'){if ( a=='-')y=-1;a=getchar();}
	while ( a>='0' && a<='9' ){	x=10*x+a-'0'; a=getchar();}return x*y;
}
#define N 10000005
bool ispri[N];
int pri[N];int tot = 0; 
void getpri(int n){
	ispri[1] = 1; 
	memset(ispri,1,sizeof(ispri));
	for ( int i = 2; i <= n; i++){
		if ( ispri[i] == 1 )	pri[++tot] = i; 
		for (int j = 1; j <= tot && i*pri[j] <= n ; j++){
			ispri[ i*pri[j] ] = 0 ;
			if ( i % pri[j] == 0 )	break;  
		}
	}
}
int main()
{
//	freopen("1.txt","r",stdin);
	srand((int)time(0));
	std::ios::sync_with_stdio(false);
	int n = 10000000;
	memset(ispri,0,sizeof(ispri));
	clock_t a = clock();
	getpri(n);
//	rep(i,1,n){
//		if ( ispri[i] ){
//			printf("%d\n",i);
//		}
//	}
	clock_t b = clock() ; 
	printf("%d",b-a);
	return 0;
	return 0;
}

法一最慢

法二其次

法三和法四几乎无时间差异。

法四绝对接近线性。