Project Euler
Problem 39: Integer Right Triangles

If p is the perimeter of a right angle triangle with integral lenght sides {a,b,c}, there are exactly three solutions for p = 120.

{20,48,52}, {24,45,51}, {30,40,50}

For which value of p ≤ 1000, is the number of solutions maximised?


Runtime: 0
Average: 0 Runs: 0
SD: 0 ms
Max: 0
Min: 1000

To find this solution I used a resource from problem 9 which gave a good indication to how to approach this problem. I started with a perimeter of 1000 and counted down to a perimeter of 12 {3,4,5} crunching possible values for a and b as I went down.

The trick was figuring out an upper limit for a and b to bring down my computation time.

72,902