@@ -0,0 +1,498 @@
+// Anthony Carpenetti%0A// When executed, Euler9 finds the Pythagorean triplet where a, b, and c sum to 1000%0A%0Apublic class Euler9%0A%7B%0A%09public static void main(String%5B%5D args)%0A%09%7B%0A%09%09boolean notFound = true;%0A%09%09for(int a = 1;notFound && a %3C 1001;a++)%0A%09%09%7B%0A%09%09%09for(int b = 1;notFound && b %3C 1001;b++)%0A%09%09%09%7B%0A%09%09%09%09for(int c = 1;notFound && c %3C 1001;c++)%0A%09%09%09%09%7B%0A%09%09%09%09%09if(a + b + c == 1000 && (a * a) + (b * b) == (c * c))%0A%09%09%09%09%09%7B%0A%09%09%09%09%09%09System.out.println(a * b * c);%0A%09%09%09%09%09%09notFound = false;%0A%09%09%09%09%09%7D%0A%09%09%09%09%7D%0A%09%09%09%7D%0A%09%09%7D%0A%09%7D%0A%7D%0A

update from default