Pagini recente » Cod sursa (job #1277076) | Solutii preONI 2006 - Runda a 2-a | Cod sursa (job #1837669) | Cod sursa (job #208712) | Cod sursa (job #1865948)
#include <fstream>
using namespace std;
const int N=100003;
ifstream f("evaluare.in");
ofstream g("evaluare.out");
char v[N],*p=v;
int termen();
int factor();
int getnr()
{
int nr=0;
while(*p>='0'&&*p<='9')
{
nr=nr*10+(*p-'0');
p++;
}
return nr;
}
int eval()
{
int r=termen();
while(*p=='+' || *p=='-'){
if(*p=='+')
{
p++;
r+=termen();
}
else
{
p++;
r-=termen();
}
}
return r;
}
int termen()
{
int r=factor();
while(*p=='*' || *p=='/')
{
if(*p=='*')
{
p++;
r*=factor();
}
else
{
p++;
r/=factor();
}
}
return r;
}
int factor()
{
int r=0;
if(*p=='(')
{
p++;
r=eval();
p++;
}
else
r=getnr();
return r;
}
int main()
{
f>>v;
g<<eval();
f.close();
g.close();
return 0;
}