素数筛的两种模板

第一种线性筛法

#include <iostream>

using namespace std;
const int N = 1e06 + 10;

int q[N], cnt;
bool prime[N];

void shai(int n) {
    for (int i = 2; i <= n; i++) {
        if (!prime[i]) q[cnt ++] = i;
        for (int j = 0 ; q[j] <= n / i; j++) {
            prime[i * q[j]] = true;
            if (i % q[j] == 0) break;
        }
    }
}
int main() {
    int n;
    cin >> n;
    shai(n);
    cout << cnt;
    return 0;
}

第二种埃筛：

#include <iostream>

using namespace std;
const int N = 1e06 + 10;

bool prime[N];
int q[N], cnt;
void shai(int n) {
    for (int i = 2; i <= n; i++) {
        if (!prime[i]) q[cnt ++] = i;
        for (int j = i * 2; j <= n; j+= i) {
            prime[j] = true;
        }
    }
}
int main() {
    int n;
    cin >> n;
    shai(n);
    cout << cnt;
    return 0;
}