Pagini recente » Cod sursa (job #1368716) | Cod sursa (job #1106685) | Cod sursa (job #1615655) | Cod sursa (job #2153324) | Cod sursa (job #1767923)
#include<bits/stdc++.h>
using namespace std;
const int NMax = 100010;
char S[NMax], *p = S;
long termen();
long factor();
bool isNumber(int x)
{
if(x >= '0' && x <= '9') return true;
else return false;
}
long eval() {
long r = termen();
while ( *p=='+' || *p=='-' ) {
switch ( *p ) {
case '+':
++p;
r += termen();
break;
case '-':
++p;
r -= termen();
break;
}
}
return r;
}
long termen() {
long r = factor();
while ( *p=='*' || *p=='/' ) {
switch ( *p ) {
case '*' :
++p;
r *= factor();
break;
case '/':
++p;
r /= factor();
break;
}
}
return r;
}
long factor() {
long r=0;
if ( *p == '(' ) {
++p;
r = eval();
++p;
} else {
while ( isNumber(*p) ) {
r = r*10 + *p - '0';
++p;
}
}
return r;
}
int main()
{
ifstream in("evaluare.in");
in>>S;
in.close();
ofstream out("evaluare.out");
out<<eval();
return 0;
}