diff options
author | mjf <mjf@localhost.localdomain> | 2020-02-04 12:11:30 -0500 |
---|---|---|
committer | mjf <mjf@localhost.localdomain> | 2020-02-04 12:11:30 -0500 |
commit | 6aa02212cd6dfbb492fa1f70b60a4fe3d48892e5 (patch) | |
tree | 1b655714c9709ee8fce333fcb6a6be3f5533b2d3 /palindrome.py.orig | |
parent | 8e431d287c0e89041506da4c4da57e3e3d657d72 (diff) | |
download | Project_Euler_Solutions-6aa02212cd6dfbb492fa1f70b60a4fe3d48892e5.tar.gz |
cleanup and added more c examples:
Diffstat (limited to 'palindrome.py.orig')
-rw-r--r-- | palindrome.py.orig | 40 |
1 files changed, 0 insertions, 40 deletions
diff --git a/palindrome.py.orig b/palindrome.py.orig deleted file mode 100644 index 9690553..0000000 --- a/palindrome.py.orig +++ /dev/null @@ -1,40 +0,0 @@ -import PIL, math - -#Problem 4 - Palindrome Products - -def isPalindrome(number): - numchar = str(number) - middle = 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: ") - -#if(isPalindrome(x)): - #print "The factors are: " + str(findProduct(x)) -#else: - #print "not a palindrome" - - |