백준 - 1978 c++

www.acmicpc.net/problem/1978

1978번: 소수 찾기

 

#include <iostream>
#include <algorithm>
using namespace std;
int main() {
    int t;
    int n, cnt = 0;
    int ok = 1;
    cin >> t;
    for (int i = 0; i < t; i++) {
        cin >> n;
        ok = 1;
        if (n != 1) {
            ok = 0;
            for (int j = 2; j < n; j++) {
                for (int k = 2; k <= j; k++) {
                    if (j * k == n) {
                        ok = 1;
                        break;
                    }
                }
                if (ok == 1) break;
            }
        }
        if (ok == 0) cnt++;
    }
    cout << cnt;
    return 0;
}