백준/백준-C++
1978번: 소수 찾기
Beabletoet
2017. 5. 26. 16:39
#include <iostream>
using namespace std;
int main()
{
int n, count = 0, num;
cin >> n;
for (int i = 0; i < n; ++i)
{
cin >> num;
if (num > 1)
{
for (int j = 2; j*j <= num; ++j)
if (num%j == 0)
{
--count;
break;
}
++count;
}
}
cout << count;
}