筛法求素数

#include<iostream>#include<string>using namespace std;const int MAX=1000000;bool prime[MAX];int main(){memset(prime,1,MAX);prime[0]=0;prime[1]=0;for(int i=2;i<MAX;i++){if(prime[i]){for(int j=2; j*i<MAX; ++j)prime[j*i]=0;}}for(int i=0; i<MAX; i++)if(prime[i])cout<<i<<" ";return 0;}