Problem 9 Special Pythagorean triplet （毕达哥拉斯三元数组...）

Special Pythagorean triplet

Problem 9

A Pythagorean triplet is a set of three natural numbers, a < b < c,
for which,

a2 + b2 = c2
For example, 32 + 42 = 9 + 16 = 25 = 52.

There exists exactly one Pythagorean triplet for which a + b + c =
1000.

Find the product abc.

暴力....

Answer:

31875000

代码：

#include <cstdio>
int main()
{
int a, b;
for (a = 1; a <= 333; a++)
{
for (b = a; b <= 666; b++)
{
int c = (1000 - a - b);
if (a*a + b*b == c*c)
{
printf("%d\n", a * b * c);
}
}
}
return 0;
}