Updated for performance

Source/Problem9.cpp

@@ -45,12 +45,12 @@ void Problem9::solve(){
 	//Loop through all possible a's
 	while((a < 1000) && !found){
 		b = a + 1;	//b bust be greater than a
-		c = sqrt(pow(a, 2) + pow(b, 2));
+		c = sqrt((a * a) + (b * b));
 
 		//Loop through all possible b's
 		while((a + b + c) < 1000){
 			++b;
-			c = sqrt(pow(a, 2) + pow(b, 2));
+			c = sqrt((a * a) + (b * b));
 		}
 
 		//If the sum == 1000 you found the number, otherwise go to the next possible a