- C24zhengfujia's blog
素数筛(埃式筛)
- @ 2024-10-10 19:42:02
#include<cstdio>
#include<cstring>
#include<cmath>
#define MAXN 100001
using namespace std;
int a[MAXN];
bool not_prime[MAXN]={};
int n;
int main()
{
not_prime[1]=not_prime[0]=true;
for(int i=2;i<=MAXN;++i)
{
if(!not_prime[i])
{
for(int j=i*2;j<=MAXN;j+=i)
{
not_prime[j]=true;
}
}
}
scanf("%d",&n);
for(int i=0;i<n;++i)
{
scanf("%d",&a[i]);
}
for(int i=0;i<n;++i)
{
if(!not_prime[a[i]])
{
printf("%d ",a[i]);
}
}
return 0;
}