1、普通素数判断
bool check(int m)
{
for (int i = 2; i <= m / i; i++) {
if (m % i == 0)
return 0;
}
return 1;
}
2、求1 - n 中所有素数(n = 1e8),线性筛求解(筛子过滤)
#include<bits/stdc++.h>
using namespace std;
const int N = 1e8 + 1, M = 1e7 + 1;
bool st[N]; //筛子
int prime[M]; //存放所有素数的素组
int n, cnt;
int main()
{
cin >> n;
//线性筛模板
for (int i = 2; i <= n; i++) {
if (!st[i]) prime[cnt++] = i; //若i是素数,则把i放到prime数组中
for (int j = 0; prime[j] <= n / i; j++) {
st[i * prime[j]] = 1; //将所有是prime[j] i倍的合数全筛掉
if (i % prime[j] == 0) break; //非常重要的优化,保证每个数只被它的最小质数筛掉,避免重复筛
}
}
for (int i = 0; i < cnt; i++) {
cout << prime[i] << " ";
}
return 0;
}
【例题】
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 1e8 + 1;
bool st[N]; //筛子
int prime[N]; //存放所有素数的素组
int n, m, cnt = 0;
void check()
{
for (int i = 2; i <= m; i++) {
if (!st[i]) prime[cnt++] = i;
for (int j = 0; prime[j] <= m / i; j++) {
st[i * prime[j]] = 1;
if (i % prime[j] == 0) break;
}
}
}
int main()
{
cin >> n >> m;
check();
for (int i = n; i <= m; i++) {
if (st[i] == 0) {
cout << i << "=" << i << endl;
}
else
{
int t = i;
cout << i << "=";
for (int i = 0; i < cnt; i++) {
while (st[t] == 1 && t % prime[i] == 0) {
cout << prime[i] << "*";
t /= prime[i];
}
}
cout << t << endl;
}
}
return 0;
}