#include #include #include #include #include using namespace std; const int opCount = 5; char operations[opCount] = {'+','-','*','/','^'}; unordered_map val; unordered_map defined; bool isOp(char c); //Returns true if the symbol is an opreation bool isNumber(string s); //Returns true if the string is a number int priority(char c); //Returns the priority of an operation string clean(string s); //Removes all spaces from the string int fact(int n); //Factorial double value(string s) { //Returns the value of a number or a variable if (isdigit(s[0])) return stod(s); else { if (!defined[s]) { cout<>val[s]; defined[s] = true; } return val[s]; } } void define(string s, double value) { val[s] = value; defined[s] = true; } void init() { define("e", M_E); define("pi", M_PI); } vector parse(string s) { //Divides an expression into {operand, operator, operand} s = clean(s); if (s[0] == '(' && s[s.size() - 1] == ')') s = s.substr(1,s.size()-2); int lvl = 0; int minPrior = 1e9; int imin = -1; for (int i = 0; i < s.size(); i++) { if (s[i] == '(') lvl++; if (s[i] == ')') lvl--; if (isOp(s[i])) { char curOp = s[i]; if (lvl == 0 && priority(curOp) <= minPrior) { minPrior = priority(curOp); imin = i; } } } vector ret; if (imin != -1) { ret.push_back(s.substr(0,imin)); ret.push_back(s.substr(imin,1)); ret.push_back(s.substr(imin+1,s.size() - 1 - imin)); return ret; } else { ret.push_back(s); } return ret; } double calc(string s) { //Calculation function if (s == "") return 0; init(); vector p = parse(s); if (p.size() == 1) { //Unary if (p[0][p[0].length() - 1] == '!') { int x = (int)(calc(p[0].substr(0,p[0].length()-1))); return fact(x); } return value(p[0]); } if (p.size() == 3) { //Binary // cout<

Math expression solver