Pagini recente » Cod sursa (job #2280118) | Cod sursa (job #724935) | Cod sursa (job #1399870) | Cod sursa (job #169384) | Cod sursa (job #2847786)
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
const int bracket = 2e9, times = 2e9 + 1, divide = 2e9 + 2, Minus = 2e9 + 3;
int st[100001], top;
char sir[100001];
int main()
{
ifstream fin("evaluare.in");
ofstream fout("evaluare.out");
fin >> sir;
for (int i = 0; sir[i];)
{
if (sir[i] == '+')
i++;
else if (sir[i] == '(')
{
st[++top] = bracket;
i++;
}
else if (sir[i] == '-')
{
st[++top] = Minus;
i++;
}
else if (sir[i] == '*')
{
st[++top] = times;
i++;
}
else if (sir[i] == '/')
{
st[++top] = divide;
i++;
}
else if (isdigit(sir[i]))
{
int x = 0;
while (isdigit(sir[i]))
x = x * 10 + sir[i++] - '0';
if (!top)
st[++top] = x;
else if (st[top] == Minus)
st[top] = -x;
else if (st[top] == times)
st[--top] *= x;
else if (st[top] == divide)
st[--top] /= x;
else st[++top] = x;
}
else //sir[i] == ')'
{
int x = 0;
while (st[top] != bracket)
x += st[top--];
top--;
if (!top)
st[++top] = x;
else if (st[top] == Minus)
st[top] = -x;
else if (st[top] == times)
st[--top] *= x;
else if (st[top] == divide)
st[--top] /= x;
else st[++top] = x;
i++;
}
}
int s = 0;
for (int i = 1; i <= top; i++)
s += st[i];
fout << s << "\n";
fout.close();
return 0;
}
/*
66 + 10 * 5 * 5 / 10 + (-2 * (10 + 30 * 5))
(10 + 20 * 3 - 10 / 5) * 10
(10 60 -2)
*/