int?isprime(int?n)
{for(int?I = 2;我*我& lt= n;i++)
if(n%i==0)返回?0;
回歸?n & gt1;
}
0.c:
# include & ltstdio.h & gt
# include & ltd:\ \ 00 . c & gt;
int?主()
{int?x=1,n,k = 0;
scanf("%d ",& ampn);
while(n -)
{scanf("%d ",& ampx);
k+= is prime(x);
}
printf("%d\n ",k);
回歸?0;
}