欧拉计划Problem 9

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

a ² +  b ² =  c ²

For example, 3² + 4² = 9 + 16 = 25 = 5².

There exists exactly one Pythagorean triplet for which a + b + c = 1000.
Find the product abc.

int main()
{
 clock_t tb,te;
 tb=clock();
 for (int i = 1000,max=0; i > 0; i--)
 {
  for (int j = i-1; j > 0; j--)
  {
   for (int k = j-1; k > 0 ; k--)
   {
    if (1000 == i+j+k && i*i == j*j+k*k)
    {
     if (max < i*j*k)
     {
      max = i*j*k;
     }
    }
   }
  }
 }
 printf("\n最大值为：%d\n",max);
 te=clock();
 printf("\n时间差：%d\n",te-tb);
 exit(0);
 return 0;
}