#include <cstdio>
#include <iostream>
#include <cmath>
#include <vector>
using namespace std;
const int MAXN = 1e5;
vector<int> prime;
bool isPrime[MAXN];
void Initial(){
for (int i = 0; i < MAXN; ++i){ //fill(isPirme, isPrime + MAXN, true);
isPrime[i] = true;
}
isPrime[0] = false;
isPrime[1] = false;
for (int i = 2; i < MAXN; ++i){
if (!isPrime[i]){
continue;
}
prime.push_back(i);
for (int j = i * i; j < MAXN; j += i){
isPrime[j] = false;
}
}
return ;
}
int main(){
Initial();
return 0;
}
素数筛法
最新推荐文章于 2023-12-09 19:46:22 发布