diff options
Diffstat (limited to 'julia/004-largest_palindrome_product.jl')
| -rw-r--r-- | julia/004-largest_palindrome_product.jl | 26 |
1 files changed, 26 insertions, 0 deletions
diff --git a/julia/004-largest_palindrome_product.jl b/julia/004-largest_palindrome_product.jl new file mode 100644 index 0000000..32be760 --- /dev/null +++ b/julia/004-largest_palindrome_product.jl @@ -0,0 +1,26 @@ +### +# Largest palindrome product +# Problem 4 +# +# 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. +### + +function is_palindrom(n) + s = string(n) + s == reverse(s) +end + + +top = -1 + +for x in 100:999 + for y in 100:999 + if is_palindrom(x * y) + global top = max(top, x * y) + end + end +end + +println(top) |
