def problem4c(): maximum = 0 for i in range(110,1000,11): for j in range(0,999*i,i): if isPalindrome(j): maximum = max(maximum,j) if j == 995599: print(i) return maximum
def problem4b(): return max([prod for j in range(40*11,990,11) for prod in range(600*j,999*j,j) if isPalindrome(prod)])
def problem4b(): return max(prod for j in range(990,121,-11) for prod in range(3*j,999*j,j) if isPalindrome(prod))
def problem4a(): #return max([max([i*j for j in range(100,1000) if isPalindrome(i*j)]+[0]) for i in range(110,1000,11)]) return max(max( i*j for j in range(0,1000) if isPalindrome(i*j) ) for i in range(110,1000,11))
def problem4(): return max([max([i*j for j in range(100,1000) if isPalindrome(i*j)]+[0]) for i in range(990,100,-11)])
def problem4d(): return max([max([prod for prod in range(0,999*i,i) if isPalindrome(prod)]) for i in range(121,1000,11)])