筛选法求素数
#include <iostream>
#include <cmath>
using namespace std;
const int MAXN = 1200;
int A[MAXN];
int L[MAXN];
//sieve prime list
void Sieve(int n)
{
int p;
for (p = 2; p < n; p++)
A[p] = p;
int j;
for (p = 2; p <= sqrt(n); p++) {
if (A[p] != 0) {
j = p * p;
while (j <= n) {
A[j] = 0;
j += p;
}
}
}
int i = 0;
for (p = 2; p <= n; p++) {
if (A[p] != 0) {
L[i] = A[p];
i++;
}
}
}
int main()
{
int n;
cin >> n;
Sieve(n);
for (int i = 0; i <= n; i++) {
if (L[i] != 0)
cout << L[i] << "\t";
}
cout << endl;
return 0;
}
将数组A中的数字经过筛选后存入数组L中,即L为素数表。