首页 > 代码库 > 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)
<script type="text/javascript"> $(function () { $(‘pre.prettyprint code‘).each(function () { var lines = $(this).text().split(‘\n‘).length; var $numbering = $(‘
    ‘).addClass(‘pre-numbering‘).hide(); $(this).addClass(‘has-numbering‘).parent().append($numbering); for (i = 1; i <= lines; i++) { $numbering.append($(‘
  • ‘).text(i)); }; $numbering.fadeIn(1700); }); }); </script>

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