Xử lí dãy số

#include<stdio.h>

#include<stdlib.h>

typedef struct stack

{

  int a;

  struct stack *next;

} node;

node* khoitao()

{

  return(NULL);

}

int rong(node*top)

{

  return(top==NULL);

}

int push(node**top,node**tmp)

{

  (*tmp)->next=NULL;

  if(*top==NULL)

    {

      *top=*tmp;

    }

  else

    {

      (*tmp)->next=*top;

      *top=*tmp;

    }

  return(0);

}

int pop(node **top)

{

  int tmp=0;

  node*x;

  if(rong(*top))

    {

      printf("Stack rong.\n");

      return(0);

    }

  else

    {

      tmp=(*top)->a;

      x=*top;

      *top=(*top)->next;

      free(x);

    }

  return(tmp);

}

  FILE*in,*out;

  node*top1,*tmp;

int nhap(node**top1) // so so sanh

{

  int dk=1,bonus;

  char tem;

  *top1=khoitao();

  do // Nhap stack 1

   {

     if((tmp=(node*)malloc(sizeof( struct stack)))==NULL)  //tao node

       {

            printf("khong cap phat duoc bo nho\n");

            exit(1);

       }

    tem=getc(in);

     if(tem>='0'&&tem<='9')             // lay gia tri

       {

            tmp->a=tem-48;

            push(top1,&tmp);       // them vao stack1

            printf("%d\n",tmp->a);

            dk=1;

       }

     else dk=0;

   }while(dk);

   free(tmp);

   return 0;

}

int nhan(int x,node**top)

{

    node*top10;

    int bonus;

/* nhan  stack */

    top10=khoitao();

    bonus=0;

while(rong(*top)!=1)

   {

     if((tmp=(node*)malloc(sizeof( struct stack)))==NULL) //tao node

       {

       }

       printf("--");

     tmp->a= pop(top)*x + bonus;

     if(tmp->a>=10)

       {

            bonus=tmp->a/10;

            tmp->a=tmp->a%10;

       }

     else bonus=0;

     push(&top10,&tmp);

   }

//*top=top10;

  /*  while(top10!=NULL)

    {

        fprintf(out,"%d-",top10->a);

        top10=top10->next;

    }

  while(top!=NULL)

  {

    pop(top);

  }

*/

while(top10!=NULL)

  {

      if((tmp=(node*)malloc(sizeof( struct stack)))==NULL) //tao node

        {

            printf("khong cap phat duoc bo nho\n");

            exit(1);

        }

    tmp->a=pop(&top10);

    push(top,&tmp);

  }

  return 0;

}

node* tru(node**top2,node**top3)

{

    node*top10,*top22,*top33;

    node*top,*tmp2;

    int bonus,a,b;

/* tru  stack */

    top=khoitao();

    top10=khoitao();

    top22=khoitao();

    top33=khoitao();

    bonus=0;

    while((rong(*top2)&&rong(*top3)&&bonus==0)!=1)

   {

     if((tmp=(node*)malloc(sizeof( struct stack)))==NULL) //tao node

       {

       }

    a=pop(top2);

    if((tmp2=(node*)malloc(sizeof( struct stack)))==NULL) //tao node

        {

            printf("khong cap phat duoc bo nho\n");

            exit(1);

        }

    tmp2->a=a;

    push(&top22,&tmp2);

       b=pop(top3);

    if((tmp2=(node*)malloc(sizeof( struct stack)))==NULL) //tao node

        {

            printf("khong cap phat duoc bo nho\n");

            exit(1);

        }

    tmp2->a=b;

    push(&top33,&tmp2);

       printf("++");

       if(a>=b)

       {

            tmp->a= a-b +bonus;

            bonus=0;

       }

       else

       {

           tmp->a= 10+a-b+bonus;

           bonus=-1;

       }

     push(&top10,&tmp);

   }

   while(top10!=NULL)

  {

      if((tmp=(node*)malloc(sizeof( struct stack)))==NULL) //tao node

        {

            printf("khong cap phat duoc bo nho\n");

            exit(1);

        }

    tmp->a=pop(&top10);

    push(&top,&tmp);

  }

     while(top22!=NULL)

  {

      if((tmp=(node*)malloc(sizeof( struct stack)))==NULL) //tao node

        {

            printf("khong cap phat duoc bo nho\n");

            exit(1);

        }

    tmp->a=pop(&top22);

    push(top2,&tmp);

  }

     while(top33!=NULL)

  {

      if((tmp=(node*)malloc(sizeof( struct stack)))==NULL) //tao node

        {

            printf("khong cap phat duoc bo nho\n");

            exit(1);

        }

    tmp->a=pop(&top33);

    push(top3,&tmp);

  }

   return top;

}

int bang(node*top)

{

    node*chay;

    chay=top;

    while(chay!=NULL)

    {

        if(chay->a>0) return 0;

        chay=chay->next;

    }

    return 1;

}

int kiem_hang(node*top)

{

    node*tmp,*top2,*top3,*chay;

    top2=khoitao();

    top3=khoitao();

    // nhap k-2 gia tri 6

    if((tmp=(node*)malloc(sizeof( struct stack)))==NULL)  //tao node

       {

            printf("khong cap phat duoc bo nho\n");

            exit(1);

       }

       tmp->a=6;

       push(&top2,&tmp);

       // nhap k-1 gia tri 17

    if((tmp=(node*)malloc(sizeof( struct stack)))==NULL)  //tao node

       {

            printf("khong cap phat duoc bo nho\n");

            exit(1);

       }

       tmp->a=17;

       push(&top3,&tmp);

    tmp=tru(&top,&top2);

    if(bang(tmp))

      {

        while(rong(top2)!=1) pop(&top2);

        while(rong(tmp)!=1) pop(&tmp);

        return 1;

      }

    tmp=tru(&top,&top3);

    if(bang(tmp))

      {

        while(rong(top3)!=1) pop(&top3);

        while(rong(tmp)!=1) pop(&tmp);

        return 1;

      }

    do

    {

        printf("\n\n\n\n\n");

        nhan(5,&top3);

        nhan(6,&top2);

        tmp=tru(&top3,&top2);

            chay=tmp;

    while(chay!=NULL)

    {

        printf("%d-",chay->a);

        chay=chay->next;

    }

    return 1;

    if(bang(tmp))

      {

        while(rong(top2)!=1) pop(&top2);

        while(rong(top3)!=1) pop(&top3);

        while(rong(tmp)!=1) pop(&tmp);

        return 1;

      }

        while(top2!=NULL) pop(&top2);

        top2=top3;

        top3=tmp;

    }while(bang(tmp)!=0);

    return 0;

}

int main()

{

    int n,i;

    double a;

    out=fopen("output.txt","w+");

    if((in=fopen("input.txt","r+"))==NULL)

    {

        printf("khong nhap duoc file");

        return 1;

    }

    fscanf(in,"%d",&n);

    getc(in);

    for(n;n>0;n--)

    {

        nhap(&top1);

        fprintf(out,"%d\n",kiem_hang(top1));

    }

    fclose(in);

    fclose(out);

    return 0;

}