Project Euler Problem 36

原创于 2018-05-25 20:53:53 发布 · 145 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Project Euler

Project Euler 专栏收录该内容

56 篇文章

订阅专栏

本文介绍了一段Python代码，该代码用于找出所有小于一百万的整数中，哪些数在十进制和二进制下都是回文数，并计算这些数的总和。通过迭代检查每个数的二进制和十进制形式是否为回文，从而得到最终结果。

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

Problem 36

The decimal number, 585 = 1001001001₂ (binary), is palindromic in both bases.

Find the sum of all numbers, less than one million, which are palindromic in base 10 and base 2.

(Please note that the palindromic number, in either base, may not include leading zeros.)

# 寻找所有既是2进制回文数又是10进制回文数的整数之和

i = 1
lst = []
sum1 = 0
while i < 1000000:
    string1 = str(i)
    string2 = bin(i)[2:]
    if string1 == string1[::-1] and string2 == string2[::-1]:
        lst.append(i)
        sum1 += i
    i += 1
print(sum1)
print(lst)