ProjectEuler-Problem10-Summation of primes

# @Time    : 2017/7/6 20:54# @Author  : wanyang# @Mail    ：[e-mail]# @Git     ：https://github.com/wanyang19880625# @Question：https://projecteuler.net/problem=10# @Answer  ：142913828922from math import *# 上限theUpNumber = 2000000# 判断是否是质数def is_prime(num):    for i in range(2, int(sqrt(num)) + 1):        if num % i == 0:            return False    return True# 初始化质数集合primelist = [num for num in range(2, theUpNumber) if is_prime(num) is True]print(sum(primelist))