Pagini recente » Cod sursa (job #752120) | Cod sursa (job #901174) | Cod sursa (job #2793512) | Cod sursa (job #3281782) | Cod sursa (job #3298126)
#include <fstream>
#include <string>
#include <vector>
#include <unordered_map>
#include <stack>
#include <cctype>
#include <climits>
using namespace std;
ifstream fin("evaluare.in");
ofstream fout("evaluare.out");
vector<string> polo;
unordered_map<char, int> um = {
{'+', 1},
{'-', 1},
{'*', 10},
{'/', 10}
};
struct nod {
string vf;
nod *fs = nullptr;
nod *fd = nullptr;
};
nod* arb(const vector<int>& p, const vector<string>& e) {
if (p.empty())
return nullptr;
int mini = INT_MAX;
int pos = -1;
for (int i = 0; i < p.size(); ++i) {
if (p[i] <= mini) {
mini = p[i];
pos = i;
}
}
nod* n = new nod;
n->vf = e[pos];
if (p.size() == 1)
return n;
n->fs = arb(vector<int>(p.begin(), p.begin() + pos), vector<string>(e.begin(), e.begin() + pos));
n->fd = arb(vector<int>(p.begin() + pos + 1, p.end()), vector<string>(e.begin() + pos + 1, e.end()));
return n;
}
void SDR(nod* root) {
if (!root)
return;
SDR(root->fs);
SDR(root->fd);
polo.push_back(root->vf);
}
int main() {
string expresie;
fin >> expresie;
vector<string> e;
vector<int> p;
int c = 0;
for (size_t i = 0; i < expresie.size(); ++i) {
if (expresie[i] == '(') {
c += 100;
} else if (expresie[i] == ')') {
c -= 100;
} else if (isdigit(expresie[i])) {
string numar;
while (i < expresie.size() && isdigit(expresie[i])) {
numar += expresie[i];
++i;
}
--i;
e.push_back(numar);
p.push_back(100000);
} else {
e.push_back(string(1, expresie[i]));
p.push_back(um[expresie[i]] + c);
}
}
nod* root = arb(p, e);
SDR(root);
stack<int> rez;
for (const auto& it : polo) {
if (it != "+" && it != "-" && it != "*" && it != "/") {
rez.push(stoi(it));
} else {
int b = rez.top(); rez.pop();
int a = rez.top(); rez.pop();
if (it == "+") rez.push(a + b);
else if (it == "-") rez.push(a - b);
else if (it == "*") rez.push(a * b);
else if (it == "/") rez.push(a / b);
}
}
fout << rez.top() << '\n';
return 0;
}