Pagini recente » Cod sursa (job #1292537) | Cod sursa (job #1087117) | Rating Kayed Amar (Amer) | Cod sursa (job #738367) | Cod sursa (job #1974868)
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream in("evaluare.in");
ofstream out("evaluare.out");
typedef long long ll;
const int NMax = 1e5 + 5;
const int lvlMax = 2;
const char lvlOp[2][3] = {'+','-','\0','*','/','\n'};
int N;
char str[NMax],*p;
int eval(int);
int compute(int,int,char);
int main() {
in>>str;
str[strlen(str)] = 'f';
//cout<<str<<'\n';
p = str;
out<<eval(0)<<'\n';
return 0;
}
int eval(int lvl) {
int ans = 0;
if (lvl == lvlMax) {
if (*p == '(') {
++p;
ans = eval(0);
++p;
}
else {
while ('0' <= *p && *p <= '9') {
ans = ans * 10 + (*p++ - '0');
}
}
}
else {
for (ans = eval(lvl+1); strchr(lvlOp[lvl],*p); ) {
char op = *p++;
ans = compute(ans,eval(lvl+1),op);
}
}
return ans;
}
int compute(int x,int y,char op) {
switch (op) {
case '+': return x + y;
case '-': return x - y;
case '*': return x * y;
case '/': return x / y;
}
}