lauchmelder/ProjectEuler
1
0
Fork 0
Code Issues Pull requests Actions Packages Projects Releases Wiki Activity

Added Problem 4

Browse source
This commit is contained in:
Lauchmelder23 2018-10-09 20:42:21 +02:00
parent 205f4bd4ad
commit 4d1d08a51a
1 changed files with 20 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

20
Problem_4.py Normal file
View file

@ -0,0 +1,20 @@
######################################################################
# A palindromic number reads the same both ways. The largest palindrome
# made from the product of two 2-digit numbers is 9009 = 91 × 99.
#
# Find the largest palindrome made from the product of two 3-digit numbers.
#
######################################################################
maxProduct = 0
for i in range(999, 99, -1):
for j in range(999, 99, -1):
product = str(i*j)
if product == product[::-1]:
if int(product) > maxProduct:
maxProduct = int(product)
print(maxProduct)
# Solution: 906609