Pagini recente » Cod sursa (job #2627044) | Cod sursa (job #42265) | Cod sursa (job #886472) | Cod sursa (job #2120048) | Cod sursa (job #1980198)
#include <iostream>
#include <fstream>
#include <cstring>
#include <stack>
using namespace std;
ifstream in("evaluare.in");
ofstream out("evaluare.out");
#define ll long long
const int strMax = 2e6 + 5;
#define mod 9973
int N;
char str[strMax],*p = str;
int eval();
int termen();
int factor();
int main() {
in>>str;
out<<eval()<<'\n';
in.close();out.close();
return 0;
}
int eval() {
int ans = termen();
while (*p == '+' || *p == '-') {
switch (*p++) {
case '+': ans += termen(); break;
case '-': ans -= termen(); break;
}
}
return ans;
}
int termen() {
int ans = factor();
while (*p == '*' || *p == '/') {
switch (*p++) {
case '*': ans *= factor(); break;
case '/': ans /= factor(); break;
}
}
return ans;
}
int factor() {
int ans = 0;
if ('0' <= *p && *p <= '9') {
while ('0' <= *p && *p <= '9') {
ans = ans * 10 + *p++ - '0';
}
}
else {
++p;
ans = eval();
++p;
}
return ans;
}