EularProject 36:2进制和10进制回文数

来源:互联网 发布:最优化理论 课程 推荐 编辑:程序博客网 时间:2024/06/03 21:53

华电北风吹
天津大学认知计算与应用重点实验室
完成日期:2015/7/29

Double-base palindromes
Problem 36
The decimal number, 585 = 10010010012 (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.)

Answer:
872187
Completed on Wed, 29 Jul 2015, 16:04

result=0for i in range(1,1000000):    a=bin(i)[2::]    b=a[::-1]    if a==b:        a=str(i)        b=a[::-1]        if a==b:            result+=iprint(result)
0 0
原创粉丝点击