[C++] 백준 1978번 : 소수 찾기

https://www.acmicpc.net/problem/1978

#include <iostream>

using namespace std;

int main() {

int N; cin >> N;

int *num = new int[N];

int prime = 0;

for (int i=0; i < N;i++){

cin >> num[i];

int cnt = 0;

for (int div = 2; div <= num[i]; div++) {

if (num[i] % div == 0) cnt++;

if (cnt > 1) break;

}

if (cnt == 1) prime++;

}

cout << prime ;

delete[] num;

}