Project Problem 37

wxinbeings

于 2018-05-28 22:35:33 发布

阅读量116

点赞数

CC 4.0 BY-SA版权

分类专栏： Project Euler 文章标签： Project Euler

本文链接：https://blog.csdn.net/wxinbeings/article/details/80489813

Project Euler 专栏收录该内容

56 篇文章

订阅专栏

本文探讨了一类特殊的素数——截尾素数，这类素数无论从左往右还是从右往左去除数字后仍保持素数特性。通过递归生成候选数，并结合素数验证算法，成功找出所有符合条件的素数并计算其总和。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem 37

The number 3797 has an interesting property. Being prime itself, it is possible to continuously remove digits from left to right, and remain prime at each stage: 3797, 797, 97, and 7. Similarly we can work from right to left: 3797, 379, 37, and 3.

Find the sum of the only eleven primes that are both truncatable from left to right and right to left.

NOTE: 2, 3, 5, and 7 are not considered to be truncatable primes.

# 一个素数如果从左右两边依次去掉一个数字后还是素数，就满足条件，求全部的这样的素数的和。

def struct(n):
    string = '1379'
    result = []
    if n == 0:
        return ' '
    for i in string:
        for j in struct(n-1):
            temp = i + j
            result.append(temp.strip())
    return result

def change(string):
    lst = [string]
    for i in range(1,len(string)):
        substr1 = string[i:]
        lst.append(substr1)
        substr2 = string[:i]
        lst.append(substr2)
    return lst

def isprime(n):
    if n <= 1:
        return False
    for i in range(2,int(n**0.5+1)):
        if n % i == 0:
            return False
    return True


lst2 = [23, 53]     
for i in range(2,7):   
    for j in struct(i):
        for s in change(j):
            if not isprime(int(s)):
                break
        else:
            lst2.append(int(j))
            if len(lst2) == 11:
                print(sum(lst2))
                break