Pagini recente » Istoria paginii runda/lot2006z3/clasament | Istoria paginii runda/preoji_bv_1_bis | Cod sursa (job #2943680) | Cod sursa (job #1368014) | Cod sursa (job #2612295)
#include <fstream>
#include <string>
using namespace std;
string s;
int p;
ifstream in("emm.in");
ofstream out("emm.out");
int expresie();
int factor();
int expresie()
{
int rez = factor();
while (s[p] == 'm' || s[p] == 'M')
{
if (s[p] == 'm')
{
p++;
rez = min(rez, factor());
}
else
{
p++;
rez = max(rez, factor());
}
}
return rez;
}
int factor()
{
int val = 0, semn = 1;
while (s[p] == '-')
{
p++;
semn = -semn;
}
if (s[p] == '(')
{
p++;///pentru (
val = expresie();
p++;///pentru )
return semn * val;
}
while (s[p] >= '0' && s[p] <= '9')
{
val = val * 10 + (s[p] - '0');
p++;
}
return semn * val;
}
int main()
{
in >> s;
in.close();
out << expresie();
out.close();
return 0;
}