pe039.java

interface EulerSolution {
  public String run();
}

public final class Main implements EulerSolution { 
  public static void main(String[] args) {
    System.out.println(new Main().run());
  }

  public String run() {
    int maxPerimeter = 0;                     //Initial default values
    int maxTriangles = 0;                     // Set to 0 so that it get overwritten by any value grt 0
    
    for (int p = 1; p <= 1000; p++) {         //Bruteforce from 1 to 1000
      int triangles = countSolutions(p);
      if (triangles > maxTriangles) {          //If the number of solutions found are more than the current max than replacement occurs
        maxTriangles = triangles;
        maxPerimeter = p;
      }
    }
    return Integer.toString(maxPerimeter);
  }

  private static int countSolutions(int p) {
    int count = 0;
    for (int a = 1; a <= p; a++) {
      for (int b = a; b <= p; b++) {
        int c = p - a - b;
        if (b <= c && a * a + b * b == c * c)    //Condition to check if the triangle satisifies the pythagoras formula
          count++;
      }
    }
      return count;
    } 
}