大区间素数筛选

POJ2689

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<string>
#include<cmath>
#define ll long long
using namespace std;
const int maxn=1000006;
bool ha[maxn]={
   false};
int prime[maxn];
int cnt=0;
void Prime(void)
{
   
    ha[1]=true;
    for(int i=2;i<maxn;i++)
    {
   
        if(!ha[i]) prime[cnt++]=i