import my_module palindromesum = 0 for i in xrange(1, 1000000): if my_module.is_palindrome(i): if my_module.is_palindrome(int(bin(i)[2:])): palindromesum += i print(palindromesum)
def test_is_palindrome(self): self.assertTrue(my_module.is_palindrome(5)) self.assertTrue(my_module.is_palindrome(57975)) self.assertTrue(my_module.is_palindrome(5445)) self.assertFalse(my_module.is_palindrome(57585))
import my_module palindromes = [] for a in range(100, 1000): for b in range(100, 1000): number = a * b if my_module.is_palindrome(number): palindromes.append(number) print max(palindromes)
import my_module count = 0 for n in range(1, 10000): for i in range(50): n += int(str(n)[::-1]) if my_module.is_palindrome(n): count += 1 break print(9999 - count)