29 lines
646 B
Python
29 lines
646 B
Python
'''
|
|
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.)
|
|
'''
|
|
|
|
def isPalindrome(n):
|
|
return n == int(str(n)[::-1])
|
|
|
|
def makeBinary(n):
|
|
return int(bin(n)[2:])
|
|
|
|
def main():
|
|
print("Hello this is Patrick")
|
|
|
|
print(makeBinary(8))
|
|
|
|
summand = 0
|
|
|
|
for n in range(1000000):
|
|
if isPalindrome(n) and isPalindrome(makeBinary(n)):
|
|
summand += n
|
|
|
|
print(summand)
|
|
|
|
if __name__ == "__main__":
|
|
main() |