[ TEMPLATE ] 欧拉筛

欧拉筛模板


1
2
3
4
5
6
7
8
9
10
11
12
const int maxn=100005;
int vis[maxn];
int prime[maxn],sz;
void eulor(){
for(int i=2;i<=maxn;i++){
if(!vis[maxn]) prime[sz++]=i;
for(int j=0;j<sz&&i*prime[j]<=maxn;j++){
vis[i*prime[j]]=1;
if(i%prime[j]==0) break;
}
}
}
Author: universal42
Link: https://universal4s.github.io/2019/03/19/eulor/
Copyright Notice: All articles in this blog are licensed under CC BY-NC-SA 4.0 unless stating additionally.