#include <iostream>
#include <cmath>
using namespace std;
int cheakprime(int x)
{
int i, k = sqrt(x);
for(i = 2; i <= k; i++)
{
if(x % i == 0)
return 0;
}
return 1;
}
int main()
{
int n, ans, a;
while(cin >> n)
{
ans = 0;
while(n--)
{
cin >> a;
if(cheakprime(a))
ans++;
}
cout << ans << endl;
}
return 0;
}
杭电ACM2138——How Many Prime Numbers
最新推荐文章于 2020-03-06 17:06:41 发布