1 void getprime(
int siz){
2 memset(isprime,
1,
sizeof(isprime));
3 isprime[
1]=
0;
4 for(
int i=
2;i<=siz;i++
){
5 if(isprime[i])prime[++tot]=
i;
6 for(
int j=
1;j<=tot&&i*prime[j]<=siz;j++
){
7 isprime[i*prime[j]]=
0;
8 if(i%prime[j]==
0)
break;
9 }
10 }
11 }
View Code
转载于:https://www.cnblogs.com/MekakuCityActor/p/8664543.html
