Pagini recente » Cod sursa (job #2160132) | Cod sursa (job #3022917) | Cod sursa (job #1835559) | Cod sursa (job #2476042) | Cod sursa (job #1097731)
/* Evaluarea unei expresii folosind recursia indirecta */
#include <cstdio>
#define MAX 100001
char s[MAX], *p;
int exp();
int factor()
{
int r = 0;
if (*p == '(')
{
p++;
r = exp();
p++;
}
else
{
while ('0' <= *p && *p <= '9')
{
r = r * 10 + *p - '0';
p++;
}
}
return r;
}
int termen()
{
int r = factor();
while (*p == '*' || *p == '/')
{
if (*p == '*')
{
p++;
r *= factor();
}
else
{
p++;
r /= factor();
}
}
return r;
}
int exp()
{
int r = termen();
while (*p == '+' || *p == '-')
{
if (*p == '+')
{
p++;
r += termen();
}
else
{
p++;
r -= termen();
}
}
return r;
}
int main()
{
freopen("evaluare.in","r",stdin);
freopen("evaluare.out","w",stdout);
scanf("%s", s);
p = s;
printf("%d\n", exp());
}