首页 > 代码库 > EularProject 36:2进制和10进制回文数
EularProject 36:2进制和10进制回文数
华电北风吹
天津大学认知计算与应用重点实验室
完毕日期: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=0
for 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+=i
print(result)
EularProject 36:2进制和10进制回文数
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。