Pagini recente » Cod sursa (job #775475) | Cod sursa (job #994641) | Cod sursa (job #3252804) | Cod sursa (job #1652577) | Cod sursa (job #2916226)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define EFC cin.tie(nullptr)->ios_base::sync_with_stdio(false)
int d1[5] = { 0, -1, 0, 1, 0 };
int d2[5] = { 0, 0, 1, 0, -1 };
const int mod = 666013;
const int INF = 100000000;
int d11[9] = { 0 , -1, -1, 0, 1, 1, 1, 0, -1 };
int d22[9] = { 0, 0, 1, 1, 1, 0, -1, -1, -1 };
int est[3] = { 0, -1, 0 };
int est1[3] = { 0, 0, 1 };
ifstream fin("evaluare.in");
ofstream fout("evaluare.out");
//----------------------------------
char s[100001], *p = s;
long t();
long f();
long e() {
long r = t();
while (*p == '+' || *p == '-') {
if (*p == '+') {
++p;
r += t();
}
else if (*p == '-') {
++p;
r -= t();
}
}
return r;
}
long t() {
long r = f();
while (*p == '*' || *p == '/') {
if (*p == '*') {
++p;
r *= f();
}
else if (*p == '/') {
++p;
r /= f();
}
}
return r;
}
long f() {
long r = 0;
if (*p == '(') {
++p;
r = e();
++p;
}
else {
while (*p >= '0' && *p <= '9') {
r = r * 10 + *p - '0';
++p;
}
}
return r;
}
int main() {
fin >> s;
fout << e();
}