Project Euler Problem 39 Solution

euler-39.java

public static void main(String[] args) {
	int max = 0;
	int bestP = 0;
	for (int p = 1; p <= 1000; p++) {
		int found = 0;
		for (int a = 1; a <= p / 4; a++) {
			for (int b = 1; b <= (p - a) / 2; b++) {
				double c = Math.sqrt(a * a + b * b);
				if (a + b + c == p)
					found++;
			}
		}
		if (found > max) {
			max = found;
			bestP = p;
		}
	}
	
	System.out.println(bestP);
}