原题链接
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
using namespace std;
string str, num;
stack<double> S;
stack<char> OP;
map<char, int> P;
int main()
{
P['+'] = P['-'] = 0;
P['*'] = P['/'] = 1;
P['#'] = -1;
while(getline(cin, str), str != "0")
{
for(string::iterator it = str.begin(); it != str.end(); it++)
{
if(*it == ' ') str.erase(it);
}
str += '#';
int num = 0;
for(int i=0; i<(int)str.size(); i++)
{
if(str[i] >= '0' && str[i] <= '9')
{
num = num*10 + str[i] - '0';
}
else
{
S.push(1.0*num);
num = 0;
while(!OP.empty() && P[str[i]] <= P[OP.top()])
{
double a = 0, b = 0, result = 0;
b = S.top(), S.pop();
a = S.top(), S.pop();
if(OP.top() == '+') result = 1.0*a+b;
if(OP.top() == '-') result = 1.0*a-b;
if(OP.top() == '*') result = 1.0*a*b;
if(OP.top() == '/') result = 1.0*a/b;
S.push(result);
OP.pop();
}
OP.push(str[i]);
}
}
printf("%.2f\n", S.top());
S.pop();
OP.pop();
str.clear();
}
return 0;
}