-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1935.cpp
60 lines (53 loc) · 919 Bytes
/
1935.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
#include <iostream>
#include <algorithm>
#include <stack>
#include <string>
#include <cstdio>
using namespace std;
int main() {
stack <double> s;
string str;
int N;
cin >> N;
double* arr = new double[N];
cin.ignore();
cin >> str;
for(int i = 0; i < N; i++)
{
cin >> arr[i];
}
for (int i = 0; i < str.length(); i++)
{
if (str[i] >= 'A' && str[i] <= 'Z')
{
s.push(str[i]);
}
else if (str[i] == '+' || str[i] == '-' || str[i] == '*' || str[i] == '/')
{
double a, b;
char cur = str[i];
a = s.top();
s.pop();
b = s.top();
s.pop();
switch (cur)
{
case '+':
s.push(b + a);
break;
case '-':
s.push(b - a);
break;
case '*':
s.push(b * a);
break;
case '/':
s.push(b / a);
break;
}
}
else
s.push(arr[str[i] - 'A']);
}
printf("%.2lf\n", s.top());
}