mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-18 16:27:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

Project Euler problem 4 sol 2 small fix (#632)

Browse Source
This commit is contained in:
Sanders Lin 2019-02-11 10:42:43 +08:00 committed by John Law
parent dbe3f062ad
commit 42d42c3136
1 changed files with 9 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
project_euler/problem_04/sol2.py
View File

@ -4,16 +4,14 @@ A palindromic number reads the same both ways. The largest palindrome made from
Find the largest palindrome made from the product of two 3-digit numbers which is less than N.
'''
from __future__ import print_function
arr = []
for i in range(999,100,-1):
for j in range(999,100,-1):
n = int(input().strip())
answer = 0
for i in range(999,99,-1): #3 digit nimbers range from 999 down to 100
for j in range(999,99,-1):
t = str(i*j)
if t == t[::-1]:
arr.append(i*j)
arr.sort()
if t == t[::-1] and i*j < n:
answer = max(answer,i*j)
print(answer)
exit(0)
n=int(input())
for i in arr[::-1]:
if(i<n):
print(i)
exit(0)