欧拉筛法_求素数O(n)

欧拉筛法_求素数O(n)

• Theoretical basis:任何合数（combined number）都能表示成一系列素数（pirme number）的积。

• Because every combined number has its own maximal prime factor(let's call it maxp),it's better to screen prime numbers by maxp.

---

#code by c++

#include<iostream>
#include<cstring>
using namespace std;
bool isprime[100005];
int prime[100005];
int cal; //统计运行次数
int getprime(int n)
{
   
    int i,j,num=0;
    memset(isprime,1,sizeof isprime);
    for(i=2;i<=n;i++){
   
        if