筛素数模板

#include<cstdio>#include<iostream>#include<cstring>#include<set>#include<map>#include<queue>#include<vector>#include<cstdlib>#include<algorithm>using namespace std;int ip[11000000],pr[11000000],tot,n,m,x;void prepare(){//素数线性筛+欧拉线性筛     ip[1]=1;ip[0]=1;    for(int i=2;i<=10000000;i++){        if(!ip[i])            pr[++tot]=i;        for(int j=1;j<=tot&&i*pr[j]<=10000000;j++){            ip[pr[j]*i]=1;            if(i%pr[i]==0) break;        }    }} //数论 int main(){    prepare();    scanf("%d%d",&n,&m);    while(m--){        scanf("%d",&x);        if(!ip[x])        printf("Yes\n");else printf("No\n");    }}