Pagini recente » Cod sursa (job #2267568) | Cod sursa (job #1271424) | Cod sursa (job #2960428) | Cod sursa (job #2035932) | Cod sursa (job #2956503)
#include <bits/stdc++.h>
#define pb push_back
#define pii pair<int, int>
using ll = long long;
using namespace std;
/*******************************/
// INPUT / OUTPUT
ifstream f("evaluare.in");
ofstream g("evaluare.out");
/*******************************/
/// GLOBAL DECLARATIONS
string s;
int ans, p;
int expresie();
int termen();
int factor();
int numar();
/*******************************/
/// FUNCTIONS
void ReadInput();
void Solution();
void Output();
/*******************************/
///-------------------------------------
inline void ReadInput()
{
f >> s;
}
///-------------------------------------
int expresie()
{
int sum = termen();
while (s[p] == '+' || s[p] == '-')
{
if (s[p] == '+')
++ p, sum += termen();
else
++ p, sum -= termen();
}
return sum;
}
///-------------------------------------
int termen()
{
int sum = factor();
while (s[p] == '*' || s[p] == '/')
{
if (s[p] == '*')
++ p, sum *= factor();
else
++ p, sum /= factor();
}
return sum;
}
///-------------------------------------
int factor()
{
int sum;
if (s[p] == '(')
++ p, sum = expresie(), ++ p;
else
sum = numar();
return sum;
}
///-------------------------------------
int numar()
{
int val = 0, sign = 1;
while (s[p] == '-')
++ p, sign *= -1;
while (isdigit(s[p]))
{
val = val * 10 + (s[p] - '0');
++ p;
}
return val;
}
///-------------------------------------
inline void Solution()
{
ans = expresie();
}
///-------------------------------------
inline void Output()
{
g << ans;
}
///-------------------------------------
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ReadInput();
Solution();
Output();
return 0;
}