Special Pythagorean triplet

Problem 9

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

a 2 + b 2 = c 2

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

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

勾股定理

问题 9

一组勾股数a,b,c( a<b<c), 满足如下关系,

a 2 + b 2 = c 2

例如, 32 + 42 = 9 + 16 = 25 = 52.

存在一组勾股数 a,b,c 满足 a + b + c = 1000.
求abc.

public class Euler9
{
    public static void main(String[] args)
    {
        for(int a=1;a<1000;a++)
            for(int b=a+1;b<1000;b++)
                for(int c=1000-a-b;a*a+b*b==c*c;)
                {
                    System.out.println("a="+a+" b="+b+" c="+c+" abc="+a*b*c);
                    //获得一组a,b,c后另a=1000,使不满足外层循环，结束程序
                    a=1000;
                }
    }
}