16 lines
521 B
Python
16 lines
521 B
Python
|
def is_palindrome(maybePalindrome):
|
||
|
|
for i in (range(0, int(len(maybePalindrome)/2))):
|
||
|
|
if maybePalindrome[i] != maybePalindrome[len(maybePalindrome) - i - 1]:
|
||
|
|
return False
|
||
|
|
return True
|
||
|
|
|
||
|
|
largestPalindrome = 0
|
||
|
|
|
||
|
|
for i in range(100,999):
|
||
|
|
for j in range(100,999):
|
||
|
|
if is_palindrome(str(i * j)):
|
||
|
|
if (i * j) > largestPalindrome:
|
||
|
|
largestPalindrome = i * j
|
||
|
|
|
||
|
|
print("The largest palindrome made from the product of two 3-digit numbers is: " + str(largestPalindrome))
|