题解 | #筛选法求素数#

知识点：

复合类型：

一维数组

#include <iostream>
using namespace std;

int main() {
    int n;
    int count = 0;
    int arr[100] = {0};

    cin >> n;

    for (int i = 2; i < n; i++) {
        arr[i] = i;
    }

    for (int i = 2; i < n; i++) {
        for (int j = 2; j < i; j++) {
            if (arr[i] % j == 0) {
                arr[i] = 0;
            }
        }
    }

    for (int i = 2; i < n; i++) {
        if (arr[i] != 0) {
            cout << arr[i] << " ";
            count++;
        }
    }
    cout << endl;

    cout << n - 1 - count;

    return 0;
}