Pagini recente » Cod sursa (job #326218) | Cod sursa (job #1703404) | Cod sursa (job #940365) | Cod sursa (job #3291299) | Cod sursa (job #3003900)
#include <cstdio>
const long long MAX = 100010;
char S[MAX], *p=S;
long long termen();
long long factor();
long long eval() {
long r = termen();
while ( *p=='+' || *p=='-' ) {
switch ( *p ) {
case '+':
++p; // trecem peste semnul "+"
r += termen();
break;
case '-':
++p; // trecem peste semnul "-"
r -= termen();
break;
}
}
return r;
}
long long termen() {
long r = factor();
while ( *p=='*' || *p=='/' ) {
switch ( *p ) {
case '*' :
++p;
r *= factor();
break;
case '/':
++p;
r /= factor();
break;
}
}
return r;
}
long long factor() {
long r=0;
if ( *p == '(' ) { // avem o subexpresie
++p; // trecem peste '('
r = eval();
++p; // trecem peste ')'
} else {
while ( *p>='0' && *p<='9' ) { // avem un numar
r = r*10 + *p - '0';
++p;
}
}
return r;
}
int main()
{
freopen("evaluare.in","r",stdin);
freopen("evaluare.out","w",stdout);
scanf("%s",&S);
printf("%lld\n", eval());
return 0;
}