mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 13:31:07 +00:00
18 lines
480 B
Python
18 lines
480 B
Python
|
'''
|
||
|
|
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.
|
||
|
|
Find the largest palindrome made from the product of two 3-digit numbers which is less than N.
|
||
|
|
'''
|
||
|
|
arr = []
|
||
|
|
for i in range(999,100,-1):
|
||
|
|
for j in range(999,100,-1):
|
||
|
|
t = str(i*j)
|
||
|
|
if t == t[::-1]:
|
||
|
|
arr.append(i*j)
|
||
|
|
arr.sort()
|
||
|
|
|
||
|
|
n=int(input())
|
||
|
|
for i in arr[::-1]:
|
||
|
|
if(i<n):
|
||
|
|
print i
|
||
|
|
exit(0)
|