＜基础函数调用＞P5736 【深基7.例2】质数筛

#include <stdio.h>
#include <math.h>
int isPrimeNum(int x) {
    if(x == 0 || x == 1) return 0; 
    for(int i = 2; i <= sqrt(x); ++i) {
        if(x % i == 0) return 0; 
    }
    return 1; 
}
int main() {
    int n; 
    scanf("%d", &n); 
    for(int i = 0; i < n; ++i) {
        int num; 
        scanf("%d", &num); 
        if(isPrimeNum(num)) printf("%d ", num); 
    }
    return 0; 
}