Pagini recente » Cod sursa (job #2698866) | Cod sursa (job #219708) | Cod sursa (job #1723622) | Cod sursa (job #1997172) | Cod sursa (job #2782859)
#include <bits/stdc++.h>
using namespace std;
#define dim 2000001
ifstream fin("evaluare.in");
ofstream fout("evaluare.out");
bool del(char c)
{
return c==' ';
}
bool is_op(char c)
{
return c == '+' || c == '-' || c == '*' || c == '/';
}
int priority(char op)
{
if(op == '+' || op == '-')
return 1;
if(op == '*' || op == '/')
return 2;
return -1;
}
void process_op(stack<int>& st, char op)
{
int r = st.top();
st.pop();
int l = st.top();
st.pop();
switch(op)
{
case '+': st.push(l+r); break;
case '-': st.push(l-r); break;
case '*': st.push(l*r); break;
case '/': st.push(l/r); break;
}
}
int evaluate(string &s)
{
stack<int>st;
stack<char>op;
for(int i=0;i<s.size();++i)
{
if(del(s[i]))
continue;
if(s[i] == '(')
op.push('(');
else if(s[i] == ')')
{
while(op.top()!= '(')
{
process_op(st, op.top());
op.pop();
}
op.pop();
} else if(is_op(s[i]))
{
char cur_op = s[i];
while(!op.empty() && priority(op.top()) >= priority(cur_op))
{
process_op(st, op.top());
op.pop();
}
op.push(cur_op);
}else{
int number = 0;
while(i<(int) s.size() && isalnum(s[i]))
{
number = number *10 + s[i++]-'0';
}
i--;
st.push(number);
}
}
while(!op.empty())
{
process_op(st, op.top());
op.pop();
}
return st.top();
}
int main()
{
ios_base::sync_with_stdio(0), fin.tie(0), fout.tie(0);
string a;
fin>>a;
fout<<evaluate(a);
fin.close();
fout.close();
return 0;
}