diff options
author | mjfernez <mjfernez@gmail.com> | 2020-02-09 15:16:26 -0500 |
---|---|---|
committer | mjfernez <mjfernez@gmail.com> | 2020-02-09 15:16:26 -0500 |
commit | 93ea7fe5957b62f18e8fbd17a21696bd7de6332d (patch) | |
tree | d90aed60d687bcf195f1150777f37cbe8a149814 /04-Largest-Palindrome-Product/palindrome.py | |
parent | 125ec5bc3d8bfc224b7d32bcfbbc37b9fb5d441f (diff) | |
download | Project_Euler_Solutions-93ea7fe5957b62f18e8fbd17a21696bd7de6332d.tar.gz |
Organized everything, update README
Diffstat (limited to '04-Largest-Palindrome-Product/palindrome.py')
-rw-r--r-- | 04-Largest-Palindrome-Product/palindrome.py | 36 |
1 files changed, 36 insertions, 0 deletions
diff --git a/04-Largest-Palindrome-Product/palindrome.py b/04-Largest-Palindrome-Product/palindrome.py new file mode 100644 index 0000000..ed2a779 --- /dev/null +++ b/04-Largest-Palindrome-Product/palindrome.py @@ -0,0 +1,36 @@ +# Problem 4 - Palindrome Products + + +def isPalindrome(number): + numchar = str(number) + middle = int(len(numchar)/2) + face = numchar[:middle] + ref = numchar[len(numchar):middle-1:-1] + if(face == ref): + return True + else: + return False + + +def findProduct(number): + for i in range(999, 100, -1): + for j in range(999, 100, -1): + if(i*j == number): + return [i, j] + + +def findMaxPalindrome(): + large = 0 + for i in range(999, 100, -1): + for j in range(999, 100, -1): + test = i*j + if(isPalindrome(test) and test > large): + large = test + return large + + +answer = findMaxPalindrome() +print(answer) +print("The factors are: " + str(findProduct(answer))) +#x = input("Type a palindromic number: ") + |