筛选法打素数表

//像这样啊
#include <cstdio>
#include <cstring>
using namespace std;

typedef long long int64;
const int MAX_PRIME = 100000;

int PrimeTable[MAX_PRIME];
int IsPrime[MAX_PRIME+1];
int PrimeCnt = 0;

void get_prime()
{
	memset(IsPrime, 1, sizeof(IsPrime));
	IsPrime[0] = IsPrime[1] = 0;
	for (int i = 2 ; i < MAX_PRIME; i++)
	if (IsPrime[i])
	{
		for (long long j = (PrimeTable[PrimeCnt++] = i) * (long long)i; j < MAX_PRIME; j += i) 
		IsPrime[j] = 0;
	}
}