Updated various typoes and removed some unneeded code

Source/Problem31.cpp

@@ -1,7 +1,7 @@
 //ProjectEuler/ProjectEulerCPP/Source/Problem31.cpp
 //Matthew Ellison
 // Created: 06-19-20
-//Modified: 07-09-20
+//Modified: 07-11-20
 //How many different ways can £2 be made using any number of coins?
 //Unless otherwise listed all non-standard includes are my own creation and available from https://bibucket.org/Mattrixwv/myClasses
 /*
@@ -92,5 +92,9 @@ std::string Problem31::getString() const{
 
 //Returns the number of correct permutations of the coins
 int Problem31::getPermutations() const{
+	//If the problem hasn't been solved throw an exception
+	if(!solved){
+		throw unsolved();
+	}
 	return permutations;
 }