本文整理匯總了Python中Euler.sieve_erat方法的典型用法代碼示例。如果您正苦於以下問題：Python Euler.sieve_erat方法的具體用法？Python Euler.sieve_erat怎麽用？Python Euler.sieve_erat使用的例子？那麽, 這裏精選的方法代碼示例或許可以為您提供幫助。您也可以進一步了解該方法所在類Euler的用法示例。
在下文中一共展示了Euler.sieve_erat方法的1個代碼示例，這些例子默認根據受歡迎程度排序。您可以為喜歡或者感覺有用的代碼點讚，您的評價將有助於係統推薦出更棒的Python代碼示例。
示例1: len
# 需要導入模塊: import Euler [as 別名]
# 或者: from Euler import sieve_erat [as 別名]
#7 + 3
#5 + 5
#5 + 3 + 2
#3 + 3 + 2 + 2
#2 + 2 + 2 + 2 + 2
#
#What is the first value which can be written as the sum of primes in over five
#thousand different ways?
#
#Variation of problems 31, 76
import time
import Euler as E
N = 5000 #combinations
primes = E.sieve_erat(1000) #set of primes to be summed
m = len(primes)
sol = 1 #values to be generated as sum of primes
start = time.time()
#dynamic solution
while True:
ways = [1] + [0] * sol
for p in primes:
for j in range(p, sol + 1):
ways[j] += ways[j - p]
if ways[sol] > N:
print sol
break