Pagini recente » Cod sursa (job #2696341) | Cod sursa (job #2385001) | Cod sursa (job #213179) | Cod sursa (job #2308824) | Cod sursa (job #2228788)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("evaluare.in");
ofstream fout ("evaluare.out");
stack <int> val;
stack <char> op;
char init[100005],c;
int n,i,a,b;
int priority (char c)
{
if(c=='*') return 2;
if(c=='/') return 2;
if(c=='+') return 1;
if(c=='-') return 1;
}
int numere(int i)
{
int nr=0;
while(init[i]>='0' && init[i]<='9' && i<n)
{
nr=nr*10+ (init[i]-'0');
i++;
}
return nr;
}
int calc (int a, int b, char op)
{
switch (op)
{
case '*':
return a*b;
case '/':
return a/b;
case '+':
return a+b;
case '-':
return a-b;
}
}
int main()
{
fin.get(init,100005);
n=strlen(init);
i=0;
while(i<n)
{
if(init[i]>='0' && init[i]<='9')
val.push(numere(i));
else if (init[i]=='(') op.push(init[i]);
else if (init[i]==')')
{
while(op.top()!= '(')
{
a=val.top();
val.pop();
b=val.top();
val.pop();
c=op.top();
op.pop();
val.push(calc(a,b,c));
}
op.pop();
}
else
{
while(op.empty()==false && (priority(op.top())>=priority(init[i])))
{
a=val.top();
val.pop();
b=val.top();
val.pop();
c=op.top();
op.pop();
val.push(calc(a,b,c));
}
op.push(init[i]);
}
i++;
}
while(op.empty()==false)
{
a=val.top();
val.pop();
b=val.top();
val.pop();
c=op.top();
op.pop();
val.push(calc(a,b,c));
}
fout<<val.top();
return 0;
}