1013 数素数 (20)--筛选代码

筛选代码

#include<stdio.h>
const int maxn = 1000001;
int Prime[maxn], pNum = 0;
bool p[maxn] = { 0 };
void Find_Prime(int n) {
    for (int i = 2; i < maxn; i++) {
        if (p[i] == false) {
            Prime[pNum++] = i;
            for (int j = i + i; j < maxn; j += i) {
                p[j] = true;
            }
        }
        if (pNum > n) break;
    }
}
int main() {
    int m, n, count = 0;
    scanf("%d%d", &m, &n);
    Find_Prime(n);
    for (int i = m - 1; i < n; i++) {
        printf("%d", Prime[i]);
        count++;
        if (count % 10 != 0 && i < n - 1) printf(" ");
        else printf("\n");
    }
    return 0;
}

 

转载于:https://www.cnblogs.com/Yaxadu/p/9147748.html