[½»Á÷] Project Euler 50 Å·À­¹¤³Ì 50 Ìâ ÒÑÓÐ6È˲ÎÓë

The prime 41, can be written as the sum of six consecutive primes:

41 = 2 + 3 + 5 + 7 + 11 + 13
This is the longest sum of consecutive primes that adds to a prime below one-hundred.

The longest sum of consecutive primes below one-thousand that adds to a prime, contains 21 terms, and is equal to 953.

Which prime, below one-million, can be written as the sum of the most consecutive primes?

5Â¥: Originally posted by wangww2011 at 2012-02-20 21:02:01:
Õâλͬѧ¿´Ñù×ÓÊDZ»ÑÏÖØÎóµ¼ÁË£¬ÇÒ²»ËµÓÐjust-in-timeÕâÖÖ¼¼ÊõºÍºÜ¶à¸ßÐÂÄܵĺ¯Êý¿â£¬¾ÍÊÇÈ«ÓÃpythonҲûÓкÜÂý°¡£¬¿öÇҺܶàʱºòÊÇ¿ÉÒÔÓÃÓÅÐãËã·¨Ìá¸ßËٶȵģ¬Ä㵱Ȼ»á˵CÒ²¿ÉÒÔÓÃͬÑùµÄËã·¨°¡£¬Êǵģ¬µ«ÊÇpytho ...

997651

#!/usr/bin/env python

def generate_primes(n):
    isprimes=[True]*n
    for i in range(2,n):
        if isprimes[i]:
            for j in range(2*i,n,i):
                isprimes[j] = False
    primes=[i for i in range(3,n,2) if isprimes[i]]
    primes.insert(0,2)
    return primes


def euler50(num):
    p=generate_primes(num)
    max_n=1
    while sum(p[:max_n])         max_n+=1
   
    for i in range(max_n,2,-1):
        for j in range(len(p)-i):
            tmp=sum(p[j:j+i])
            if tmp>num:break
            if tmp in p:
                return tmp
        
if __name__ == "__main__":
    print euler50(1000000)