素数筛法+素数数组的保存

#include<iostream>
using namespace std;
const int MAXN =10000;
int prime_[MAXN];
bool vis[MAXN];
int get_prime_list(int n){
	int c=0;
	int m = sqrt(n+0.5);
	memset(vis,0,sizeof(vis));
	for(int i=2;i<=m;i++)if(!vis[i]){
		prime_[c++] = i;
		for(int j=i*i;j<=n;j+=i)vis[j] = 1;
	} 
    return c;
}