problem 39 // project euler

Integer right triangles

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

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

整数边长直角三角形

若三边长{a,b,c}均为整数的直角三角形周长为p，当p = 120时，恰好存在三个不同的解：

在所有的p ≤ 1000中，p取何值时有解的数目最多？