Project Euler その6
Problem 4
A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99. Find the largest palindrome made from the product of two 3-digit numbers.
コード
def isPalindrome(N): S = str(N) L = len(S) for i in xrange(L): if S[i] != S[L-1-i]: return False return True max = 0 for i in range(100,1000): for j in range(100,1000): if isPalindrome(i*j) and max < i*j: max = i*j print max
総当たりやるしか無い・・・よね?