Pagini recente » Cod sursa (job #2923354) | Cod sursa (job #2617737) | Istoria paginii runda/oni2007/clasament | Cod sursa (job #1972205) | Cod sursa (job #2287908)
#include <iostream>
#include <cstdio>
using namespace std;
const int N=100000+5;
int n,p;
char s[N];
inline int expresie();
inline int factor();
inline int termen();
inline int expresie()
{
int ans=termen();
while(s[p]=='+' || s[p]=='-')
{
p++;
if(s[p-1]=='+')
{
ans+=termen();
}
else
{
ans-=termen();
}
}
return ans;
}
inline int termen()
{
int ans=factor();
while(s[p]=='*' || s[p]=='/')
{
p++;
if(s[p-1]=='*')
{
ans*=factor();
}
else
{
ans/=factor();
}
}
return ans;
}
inline int factor()
{
int semn=1;
int val=0;
while(s[p]=='-')
{
semn=-semn;
}
if(s[p]=='(')
{
p++;
val=expresie();
p++;
return semn*val;
}
else
{
while('0'<=s[p] && s[p]<='9')
{
val=10*val+s[p]-'0';
p++;
}
return semn*val;
}
}
int main()
{
freopen("evaluare.in","r",stdin);
freopen("evaluare.out","w",stdout);
cin.getline(s,N);
cout<<expresie()<<"\n";
return 0;
}
/**
**/