mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-28 07:21:07 +00:00
Code Issues Packages Projects Releases Wiki Activity

Refactoring solv1.py

Browse Source 
Little embellishment of the code.
I put some comments and put readable identifiers. 
I documented the code.
This commit is contained in:
Christian Bender 2017-12-03 15:39:13 +01:00 committed by GitHub
parent 31ebde6e17
commit a81084c586
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 22 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

31
Project Euler/Problem 04/sol1.py
View File

@ -3,13 +3,26 @@ Problem:
A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 x 99. A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 x 99.
Find the largest palindrome made from the product of two 3-digit numbers which is less than N. Find the largest palindrome made from the product of two 3-digit numbers which is less than N.
''' '''
n=int(input()) limit = int(input("limit? "))
for i in range(n-1,10000,-1):
temp=str(i) # fetchs the next number
if(temp==temp[::-1]): for number in range(limit-1,10000,-1):
j=999
while(j!=99): # converts number into string.
if((i%j==0) and (len(str(i/j))==3)): strNumber = str(number)
print i
# checks whether 'strNumber' is a palindrome.
if(strNumber == strNumber[::-1]):
divisor = 999
# if 'number' is a product of two 3-digit numbers
# then number is the answer otherwise fetch next number.
while(divisor != 99):
if((number % divisor == 0) and (len(str(number / divisor)) == 3)):
print number
exit(0) exit(0)
j-=1
divisor -=1