蓝桥杯算法提高VIP-素数求和-题解（Python代码）（素数筛选法）

解题思路:

注意事项:

参考代码:

def scre_prime(n):
        re=[]
        primes=[True for i in range(n+1)]
        p=2
        while p*p<=n:
                if primes[p]:
                        for i in range(p*2,n+1,p):
                                primes[i]=False
                p+=1
        for i in range(2,n+1):
                if primes[i]:
                        re.append(i)
        return re
        
        
n=int(input())
a=scre_prime(n)
print(sum(a))