计算器

#include<iostream>
#include<string>
#include<stack>
#include<algorithm>
using namespace std;
const int INF=0x7fffffff;
int pre(char a){    //set priority level
    if(a=='='||a=='(')  return 0;
    if(a=='+'||a=='-')  return 1;
    if(a=='*'||a=='/')  return 2;
    return -1;
}
string getSuffixExpression(string a){
    stack<char> ope;
    ope.push('=');
    string ans;
    for(int i=0;i!=a.size();++i){
        if(a[i]>='0'&&a[i]<='9'){
            ans.push_back(a[i]);
        }else if(a[i]=='('){
            ope.push('(');
        }else if(a[i]==')'){
            while(!ope.empty()&&ope.top()!='('){
                ans.push_back(ope.top());
                ope.pop();
            }
            ope.pop();// push left bracket
        }else if(a[i]!='+'&&a[i]!='-'&&a[i]!='*'&&a[i]!='/'){
            cout<<"error"<<endl;
            return "";
        }else if(pre(a[i])>pre(ope.top())){
            ope.push(a[i]);
            ans.push_back(' ');
        }else{
            while(pre(a[i])<=pre(ope.top())){
                ans.push_back(ope.top());
                ope.pop();
            }
            ope.push(a[i]);
        }
    }
    while(ope.top()!='='){
        ans.push_back(ope.top());
        ope.pop();
    }
    return ans;
}
int get_ans(string a){
    string b=getSuffixExpression(a);
    if(b.empty())   return INF;
    stack<int> s;
    for(int i=0;i!=b.size();++i){
        if(b[i]==' ')   continue;
        if(b[i]>='0'&&b[i]<='9'){
            int t=0;
            while(i!=b.size()&&b[i]>='0'&&b[i]<='9'){
                t=t*10+b[i++]-'0';
            }
            --i;
            s.push(t);
        }else{
            int x,y;
            if(!s.empty()){
                y=s.top();
                s.pop();
            }
            if(!s.empty()){
                x=s.top();
                s.pop();
            }else{
                cout<<"error"<<endl;
                return INF;
            }
            switch(b[i]){
            case '+':
                s.push(x+y);
                break;
            case '-':
                s.push(x-y);
                break;
            case '*':
                s.push(x*y);
                break;
            case '/':
                s.push(x/y);
                break;
            }
        }
    }
    int ans=s.top();
    s.pop();
    if(s.empty()) return ans;
    cout<<"error"<<endl;
    return INF;
}
int main(){
    string a;
    while(cin>>a){
        if(get_ans(a)!=INF){
            cout<<get_ans(a)<<endl;
        }
    }
    return 0;
}