41 lines
896 B
Julia
41 lines
896 B
Julia
#=
|
|
Created on 01 Jul 2021
|
|
|
|
@author: David Doblas Jiménez
|
|
@email: daviddoji@pm.me
|
|
|
|
Solution for Problem 009 of Project Euler
|
|
https://projecteuler.net/problem=9
|
|
=#
|
|
|
|
using BenchmarkTools
|
|
|
|
function Problem009()
|
|
#=
|
|
A Pythagorean triplet is a set of three natural numbers, a < b < c,
|
|
for which a^2 + b^2 = c^2
|
|
|
|
For example, 3^2 + 4^2 = 9 + 16 = 25 = 5^2.
|
|
|
|
There exists exactly one Pythagorean triplet for which a + b + c = 1000.
|
|
Find the product abc.
|
|
=#
|
|
|
|
upper_limit = 1000
|
|
for a = 1:upper_limit+1
|
|
for b = a+1:upper_limit+1
|
|
c = upper_limit - a - b
|
|
if a * a + b * b == c * c
|
|
# It is now implied that b < c, because we have a > 0
|
|
return a * b * c
|
|
end
|
|
end
|
|
end
|
|
end
|
|
|
|
|
|
println("Took:")
|
|
@btime Problem009()
|
|
println("")
|
|
println("Result for Problem $(lpad(9, 3, "0")): ", Problem009())
|