[模板]洛谷T3383 线性筛素数 欧拉筛法

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cstdlib>

#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<map>
#include<set>

using namespace std;

inline void read(int &x){
    x=0;
    char t=getchar();
    bool f=0;
    
    while(t<'0' || t>'9'){
        if(t=='-')f=1;
        t=getchar();
    }
    
    while(t>='0' && t<='9'){
        x=(x<<3)+(x<<1)+t-'0';
        t=getchar();
    }
    
    if(f)x=-x;
}

void Euler();

bool pd[10000001];
int prime[700001],p=0;

int n,m,i,j,x;

int main(){
    memset(pd,1,sizeof(pd));
    
    pd[1]=0;
    
    read(n);read(m);
    
    Euler();
    
    for(i=1;i<=m;i++){
        read(x);
        
        if(pd[x])printf("Yes
");
        else printf("No
");
    }
    
    return 0;
}

void Euler(){
    int i,j;
    
    for(i=2;i<=n;i++){
        if(pd[i]){
            p++;
            prime[p]=i;
        }
        
        for(j=1;j<=p;j++){
            if(i*prime[j]>n)break;
            
            pd[i*prime[j]]=0;
            
            if(i%prime[j]==0)break;
        }
    }
}