Pagini recente » Cod sursa (job #1558217) | Cod sursa (job #1785185) | Cod sursa (job #1987978) | Cod sursa (job #1320384) | Cod sursa (job #1267765)
/*
Look at me!
Look at me!
The monster inside me has grown this big!
*/
#include<fstream>
#include<iostream>
#include<cstdio>
#include<map>
#include<set>
#define FIT(a,b) for(vector<int >::iterator a=b.begin();a!=b.end();a++)
#define RIT(a,b) for(vector<int>::reverse_iterator a=b.end();a!=b.begin();++a)
#include<stack>
#define ROF(a,b,c) for(int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#define REP(a,b) for(register int a=0;a<b;++a)
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<queue>
#define debug cerr<<"OK";
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
#define eps 1.e-6
#define N 1010
#define M 2000100
using namespace std;
/*int dx[]={0,0,0,1,-1};
int dy[]={0,1,-1,0,0};*/
ifstream f("evaluare.in");
ofstream g("evaluare.out");
char s[M];
char *p;
int expresie();
int termen();
int factor();
int main ()
{
f>>s;
p=s;
g<<expresie();
return 0;
}
int expresie()
{
int t=termen();
while(*p=='+'||*p=='-')
{
if(*p=='+')
{
p++;
t+=termen();
}
else
{
p++;
t-=termen();
}
}
return t;
}
int termen()
{
int t=factor();
while(*p=='*'||*p=='/')
{
if(*p=='*')
{
p++;
t*=factor();
}
else
{
p++;
t/=factor();
}
}
return t;
}
int factor()
{
int t=0;
if(*p=='(')
{
p++;
t=expresie();
p++;
return t;
}
else
{
while(*p<='9'&&*p>='0')
{
t=t*10+*p-'0';
p++;
}
return t;
}
}