M¹nh D¬ng Biªn So¹n
Bé M«n CÊu Tróc D÷ LiÖu
Gi¶i ThuËt 2012
§ª Sè 6
Trong Bé §Ò ¤n TËp
#include<iostream.h>
#include<malloc.h>
#include<fstream.h>
#include<string.h>
ifstream tepvao("C:/cau truc du lieu/dethi/trungto.in.txt");
ofstream tepra("C:/cau truc du lieu/dethi/hauto.out.txt");
/*
Chuyen tu trung to sang hau to
*/
struct node
{
char conyeu;
struct node *next;
};
typedef struct node *stacknode;
typedef struct
{
stacknode top;
}Stack;
Stack dau;
void KhoiTaoStack(Stack *S)
{
S->top=NULL;
return ;
}
int StackRong(Stack S)

}
int pri(char x)
{
if(x=='^')return 3;
if(x=='*'||x=='/')return 2;
if(x=='+'||x=='-')return 1;
return 0;
}
void hauto(char S[])
{
int n=strlen(S);
Stack cun; KhoiTaoStack(&cun);
for(int i=0;i<n;i++)
{
if(S[i]=='(')PUSHStack(&cun,S[i]);
else if(S[i]==')')
{
while(1)
{
if(xemdinh(&cun)=='('){POPStack(&cun);break;}
else
if(pri(xemdinh(&cun))>=1)tepra<<POPStack(&cun)<<" ";
else if(StackRong(cun))break;
}
if(xemdinh(&cun)=='(')POPStack(&cun);
}
else if(pri(S[i])>=1)
{
while(1)
{

main()
{
char S[1000][600];
int n;
NhapDL(S,n);
InKetQua(S,n);
}