Q77

pltc325

于 2012-07-10 17:28:30 发布

阅读量747

点赞数

CC 4.0 BY-SA版权

文章标签： list search

本文链接：https://blog.csdn.net/pltc325/article/details/7733673

PRIME_MAX = 100
SEARCH_MAX = 1000
list_primes = tools.gen_list_primes(PRIME_MAX)
dict_dict = {}
for i in range(2,SEARCH_MAX+1):
dict_dict[i] = {}

for i in range(2,SEARCH_MAX+1):
for j in list_primes:
dict_dict[i][j] = 0

for n in range(5,SEARCH_MAX+1):
    sum = 0
    num_ind = 0
    for i in list_primes:
        if i <= n/2:
            j = n - i
            list_num = []
            if tools.is_prime(j):
                list_num.append(dict_dict[j][i] + 1)
                #dict_dict[n][i] = dict_dict[j][i] + 1
            else:
                list_num.append(dict_dict[j][i])
                #dict_dict[n][i] = dict_dict[j][i]
            sum += dict_dict[n][i]
        else:
            break
    if sum > 5000:
        print n
    breaks = 0
    for key in dict_dict[n]:
        dict_dict[key] = sum
        sum -= list_num[breaks]
        breaks+=1
        if breaks == len(list_num):
            break