#include
int prime(int n)
{int i;
for(i=2;i*i<=n;i++)
if(n%i==0)return 0;
return n>1;
}
int main( )
{int i,n=0,a[20]={2,1,5,65,78,98,93,45,34,37,59,93,90,48,93,97,37,39,48,47};
for(i=0;i<20;i++)
if(prime(a[i]))
{printf("%d ",a[i]);
n++;
}
printf("\n共有%d个素数\n",n);
return 0;
}