memset(mindiv,0,sizeof(mindiv)); for(int i=2;i<=n;i++){ if(!mindiv[i]) prime[++tot]=mindiv[i]=i; for(int j=1;j<=tot&&prime[j]<=mindiv[i]&&(k=prime[j]*i)<=n;j++) mindiv[k]=prime[j]; }
时间: 2024-08-25 18:19:15
memset(mindiv,0,sizeof(mindiv)); for(int i=2;i<=n;i++){ if(!mindiv[i]) prime[++tot]=mindiv[i]=i; for(int j=1;j<=tot&&prime[j]<=mindiv[i]&&(k=prime[j]*i)<=n;j++) mindiv[k]=prime[j]; }