1 solutions

  • 0
    @ 2025-9-29 13:56:04
    #include<bits/stdc++.h>
    using namespace std;
    bool isPrime(int num) {
        if (num <= 1) {
            return false;
        }
        if (num == 2) {
            return true;
        }
        if (num % 2 == 0) {
            return false;
        }
        for (int j = 3; j <= sqrt(num); j += 2) {
            if (num % j == 0) {
                return false;
            }
        }
        return true;
    }
    int main(void) {
        int n, a[101];
        cin >> n;
        for (int i = 0; i < n; i++) {
            cin >> a[i];
        }
        for (int i = 0; i < n; i++) {
            if (isPrime(a[i])) {
                cout << a[i] << ' ';
            }
        }
        return 0;
    }
        ```
    • 1

    Information

    ID
    4713
    Time
    1000ms
    Memory
    125MiB
    Difficulty
    2
    Tags
    (None)
    # Submissions
    1
    Accepted
    1
    Uploaded By