//a ber
#include <bits/stdc++.h>
using namespace std;
const int N = 1e7 + 5;
int p[N];
int vis[N];
//vis[i]=0 素数
void ola(int n){
int cnt = 0;
for (int i = 2; i <= n; i++){
if (vis[i] == 0) p[cnt++] = i;
for (int j = 0; p[j] <= n / i; j++){
vis[p[j] * i] = 1;
if (i % p[j] == 0) break;
}
}
}
signed main()
{
return 0;
}
素数筛模板
最新推荐文章于 2024-06-15 23:36:03 发布