Pagini recente » Cod sursa (job #2452433) | Cod sursa (job #2189550) | Cod sursa (job #1691812) | Istoria paginii runda/boji_round2/clasament | Cod sursa (job #1458910)
// Se aduce expresia la forma poloneza ( postfixata )
// Se evalueaza noua expresie
#include <iostream>
#include <fstream>
#include <cstring>
#include <cstdlib>
using namespace std;
ifstream fin ("evaluare.in") ;
ofstream fout ("evaluare.out") ;
char coada [10000001] ; // aici se afla forma postfixata
int top_s , lg_c ;
char expresie [10000001] ; // aici se afla forma infixata ( normala )
short priority [3] ;
unsigned char stiva [10000001] ; // stiva de operatori si paranteze ( parantezele nu sunt operatori )
void Citire ()
{
fin.getline ( expresie , 10000001 ) ;
priority ['('] = priority [')'] = 0 ;
priority ['+'] = priority ['-'] = 1 ;
priority ['*'] = priority ['/'] = 2 ;
}
bool isoperator ( char c )
{
return ( strchr ( "+-/*" , c ) != 0 ) ;
}
void ConvertToPostfix ( char * sir ) // calculez forma postfixata
{
while ( *sir != '\0' )
{
if ( isoperator ( *sir ) )
{
if ( top_s > 0 )
while ( priority [ stiva [ top_s ] ] >= priority [ *sir ] ) // verific ca nu cumva in varful stivei sa fie un operator cu prioritate mai mare
coada [ lg_c ] = stiva [ top_s ] , -- top_s , ++ lg_c , coada [ lg_c ] = ',' , ++ lg_c ;
++ top_s , stiva [ top_s ] = *sir , strcpy ( sir , sir + 1 ) ;
}
else
if ( *sir == '(' ) // nu e considerata operator .. ( ii pun prioritate 0 )
++ top_s , stiva [ top_s ] = *sir , strcpy ( sir , sir + 1 ) ;
else
if ( *sir == ')' )
{
while ( stiva [ top_s ] != '(' )
coada [ lg_c ] = stiva [ top_s ] , -- top_s , ++ lg_c , coada [ lg_c ] = ',' , ++ lg_c ;
-- top_s ; // scot paranteza '('
strcpy ( sir , sir + 1 ) ;
}
else // este numar
{
while ( *sir >= '0' && *sir <= '9' )
coada [ lg_c ] = *sir , ++ lg_c , strcpy ( sir , sir + 1 ) ;
coada [ lg_c ] = ',' , ++ lg_c ;
}
}
while ( top_s > 0 ) // daca au mai ramas operatori pe stiva ii scot si ii adaug la coada ( la forma postfixata )
coada [ lg_c ] = stiva [ top_s ] , -- top_s , ++ lg_c , coada [ lg_c ] = ',' , ++ lg_c ;
coada [ lg_c ] = 0 ;
}
long stv [100001] , top ; // aici pun operanzii
// Cand un operator este intalnit scot de pe stiva ultimii 2 operanzi , aplic operatorul intre ei si rezultatul este pus in varful stivei
long EvaluareExpresie ( char sir [100000001] ) // Functie ce se aplica pe forma postfixata
{
int aux1 , aux2 ;
while ( *sir != '\0' )
{
if ( isoperator ( *sir ) )
{
aux1 = stv [ top ] , -- top , aux2 = stv [top] ;
switch ( *sir )
{
case '+' : stv [ top ] = ( aux1 += aux2 ) ; break ;
case '-' : stv [ top ] = ( aux2 -= aux1 ) ; break ;
case '*' : stv [ top ] = ( aux1 *= aux2 ) ; break ;
case '/' : stv [ top ] = ( aux2 /= aux1 ) ; break ;
}
strcpy ( sir , sir + 2 ) ; // sterg operatorul si operatorul comma
}
else // e numar
{
++ top , stv [ top ] = atoi ( sir ) ;
while ( *sir != ',' )
strcpy ( sir , sir + 1 ) ;
strcpy ( sir , sir + 1) ; // la fel , sterg si comma
}
}
return stv [ top ] ;
}
int main()
{
Citire () ;
ConvertToPostfix ( expresie ) ;
fout << EvaluareExpresie ( coada ) ;
return 0;
}