I have this small code here, that is meant to check all the Pythagorean matches, with sides not exceeding 500.

Now the code i have here seems very very very clumsy. I believe there is a better way out of this clumsy solution. Kindly suggest better ways of doing this.


public class CheckHypotenuse
{
public static void main (String[] args)
{
int check =0;
System.out.printf("%20s%20s%20s", "Base", "Height", "Hypotenuse";
for (int i=500; i > 0; i--)
{
for (int j=500; j > 0; j--)
{
for (int k=500; k > 0; k--)
{
double x = Math.sqrt (Math.pow(j,2) + Math.pow(k,2));
double cast = (double) i;
if ( x == cast)
{
System.out.printf("%20d%20d%20d\n", k, j, i);
check = 1;
break;
}
}
if (check == 1)
break;
}
check =0;
}
}
}

suggestions plssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssss