#include<iostream>
using namespace std;
int main()
{
int n,m,sum;
while (cin >> n)
{
sum = n;
while (n--&&cin >> m)
for (int i = 2; i <= sqrt(m);++i)
//这里用<=根号来节省时间,不然容易超时
if (m%i == 0)
{
--sum;
break;
//节省时间
}
cout << sum << endl;
}
return 0;
}
2138 How many prime numbers
最新推荐文章于 2017-11-27 16:44:17 发布