35 lines
720 B
C++
35 lines
720 B
C++
#include <bits/stdc++.h>
|
|
|
|
using namespace std;
|
|
|
|
// 判断n是否为素数
|
|
bool is_prime(int n) {
|
|
if (n < 2)
|
|
return false;
|
|
for (int i = 2; i < n; ++i)
|
|
if (n % i == 0)
|
|
return false;
|
|
return true;
|
|
}
|
|
|
|
// 计算所有不大于n的素数
|
|
void get_prime(vector<int> &prime, int n) {
|
|
for (int i = 2; i <= n; ++i)
|
|
if (is_prime(i)) // 判断i是否是素数
|
|
prime.push_back(i);
|
|
}
|
|
|
|
int main() {
|
|
int n = 100000;
|
|
vector<int> prime;
|
|
get_prime(prime, n);
|
|
|
|
//输出
|
|
vector<int>::iterator ite = prime.begin();
|
|
for (; ite != prime.end(); ite++) {
|
|
cout << *ite << endl;
|
|
}
|
|
cout << endl;
|
|
|
|
return 0;
|
|
} |