简单求解100以内的素数

#include<stdio.h>
#include<cmath>

bool isPrime(int n) {
    if (n <= 1) return false;
    int sqr = (int)sqrt(1.0 * n);
    for (int i = 2; i <= sqr; i++) {   //i要从2开始取啊啊啊啊啊啊啊啊 //sqr前要取等号啊啊啊啊啊啊啊
        if (n % i == 0) return false;
    }
    return true;
}
int Prime[101], Pnum = 0;
void Find_Prime() {
    for (int i = 1; i <= 100; i++) {
        if (isPrime(i) == true) {
            Prime[Pnum++] = i;
        }
    }
}
int main() {
    Find_Prime();
    for (int i = 0; i < Pnum; i++) {
        printf("%d ", Prime[i]);
    }
    return 0;
}

 

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