[백준 - 1978번] 소수 찾기

#include <iostream>
#include <vector

using namespace std;

int main(void)
{
	int i;
	int A;
	int count = 0;
	
	vector<int> v;

	cin >> i;

	for (int j = 0; j < i; j++)
	{
		cin >> A;
		if (A > 0) v.push_back(A);
	}

	for (int i = 0; i < v.size(); i++)
	{
		if (v[i] == 1) continue;
		for (int j = 2; j <= v[i]; j++)
		{
			if (v[i] % j == 0 && v[i] > j)
			{
				break;
			}
			if (v[i] == j) {
				count += 1;
				break;
			}
		}
	}
	cout << count;

	return 0;
}