A palindrome number reads the same both ways.The largest palindrome made from the product of two 2-digit numbers is 9009 = 91x91. Find the largest palindrome made from the product of two 3-digit numbers.
def ispalin(x): i = 0 flag = True while i < len(x)/2: if(x[i] != x[-(i+1)]): flag = False break i += 1 return flag
i = 999 largestpalindrome = 0 while i > 100: if i%11 == 0: j = 999 de = 1 else: j = 990 #990是小于999的最大的11的倍数 de = 11 while j >= i: if i*j <= largestpalindrome: break if(ispalin(str(i*j))): largestpalindrome = i*j j -= de i -= 1
近期评论