Cod sursa(job #827091)

Utilizator varga13VarGaz13 varga13 Data 1 decembrie 2012 16:54:08
Problema Evaluarea unei expresii Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 2.27 kb
#include <fstream>
#include <stdlib.h>
#define inta long int
inta const MAX=429496729;
using namespace std;
char s[100010], *p=s;
ifstream f("evaluare.in");
ofstream g("evaluare.out");

inta bituire();
inta adunare();
inta inmultire();
inta term();
inta extract();
inta max();
inta min();
inta abso();
inta pow();
inta funct();

int main()
{
f>>s;
f.close();
g<<bituire();
g.close();
    return 0;
}


inta bituire()
{

inta a=adunare();

while(*p=='&'||*p=='|')
{

    if(*p=='&')
    {
    p++;
    a&=adunare();
    }
    else if(*p=='|')
   {
    p++;
   a|=adunare();
   }

}
    return a;

}



inta adunare()
{
inta a=inmultire();

while(*p=='+'||*p=='-')
{

    if(*p=='+')
    {
    p++;
    a+=inmultire();
    }
    else if(*p=='-')
   {
    p++;
   a-=inmultire();
   }

}
    return a;
}

inta inmultire()
{
inta a=term();

while(*p=='*'||*p=='/')
{
     if(*p=='*')
    {
    p++;
    a*=term();
    }
    else if(*p=='/')
    {
    p++;
    a/=term();
    }


}
return a;
}

inta term()
{inta a=0;
    if(*p=='(')
       {
        p++;
        a=bituire();
        p++;
       }
    else if(*p<='9'&&*p>='0')

    a=extract();

    else if(*p=='m'||*p=='a'||*p=='p')
        {

           a=funct();
        }

          return a;
}

inta funct()
{inta a;

p++;
switch (*p)
{
    case 'o': {p++; a=pow(); break;}
    case 'b': {p++; a=abso();  break;}
    case 'i': {p++; a=min();  break;}
    case 'a': {p++; a=max();  break;}
}


}

inta max()
{
int max=0,a;
p++;
    while(*p!=')')
    {a=0;
    p++;
          a=bituire();

          if(max<a) max=a;
    }
    p++;
    return max;

}

inta min()
{p++;
int max=MAX,a;

    while(*p!=')')
    {a=0;
    p++;
           a=bituire();
          if(max>a) max=a;
    }
    p++;
    return max;

}

inta abso()
{bool ok=true;
inta a=0;;
    p++;
    a=bituire();


return abs(a);

}

inta pow()
{p++;
inta r=1;
inta a=bituire();

inta b=bituire();

for(inta i=0;i<b;i++)r*=a;
p++;
return r;
}


inta extract()
{inta a=0;
     while(*p<='9'&&*p>='0')
          {
              a=a*10+*p-'0';
              p++;
          }
          return a;
}