Pagini recente » Cod sursa (job #222765) | Cod sursa (job #2441489) | Cod sursa (job #1707966) | Cod sursa (job #364551) | Cod sursa (job #1002031)
#include <iostream>
#include <fstream>
#include <cstring>
#include <string>
#include <climits>
#include <algorithm>
#include <cmath>
#include <queue>
#include <iomanip>
using namespace std;
ifstream fin("evaluare.in");
ofstream fout("evaluare.out");
#define baza 10
#define MAX 100000
typedef long long int lli;
char S[MAX+10],*p=S;
int termen();
int factor();
int eval()
{
int r=termen();
while(*p=='+' || *p=='-')
{
if(*p=='+')
{
p++;
r+=termen();
}
if(*p=='-')
{
p++;
r-=termen();
}
}
return r;
}
int termen()
{
int r=factor();
while(*p=='*' || *p=='/')
{
if(*p=='*')
{
p++;
r*=factor();
}
if(*p=='/')
{
p++;
r/=factor();
}
}
return r;
}
int factor()
{
int r=0;
if(*p=='(')
{
p++;
r=eval();
p++;
}
while(*p>='0' && *p<='9')
{
r=r*10+*p-'0';
p++;
}
return r;
}
int main()
{
int a, b, z, t, ki, c;
fin.getline(S,MAX);
fout<<eval();
return 0;
}