Skip to content

Refactoring solv1.py #227

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
harshildarji merged 1 commit into from
Dec 13, 2017
Merged

Refactoring solv1.py #227

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
31 changes: 22 additions & 9 deletions Project Euler/Problem 04/sol1.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,13 +3,26 @@
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.
'''
n=int(input())
for i in range(n-1,10000,-1):
temp=str(i)
if(temp==temp[::-1]):
j=999
while(j!=99):
if((i%j==0) and (len(str(i/j))==3)):
print i
limit = int(input("limit? "))

# fetchs the next number
for number in range(limit-1,10000,-1):

# converts number into string.
strNumber = str(number)

# 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)
j-=1

divisor -=1