3.1a.c

来自「初级入门数据结构的排序等8个小程序,有兴趣的看看哈!我的作业,呵呵!」· C语言 代码 · 共 70 行

#define Maxsize 100
typedef struct
{
    int data[Maxsize];
    int top;
}SeqStack;
SeqStack *Init_SeqStack()
{
    SeqStack *s;
    s=(SeqStack *)malloc(sizeof(SeqStack));
    s->top=-1;
    return s;
}
/*入栈*/
int Push_Seqstack(SeqStack *s,int x)
{
    if(s->top==Maxsize-1)return 0;
    else{
        s->top++;
        s->data[s->top]=x;
        return 1;
    }
}
/*出栈*/
int Pop_SeqStack(SeqStack *s,int *x)
{
    if(Empty_SeqStack(s)) return 0;
    else{
        *x=s->data[s->top];
        s->top--;
        return 1;
    }
}
/*判空栈*/
int Empty_SeqStack(SeqStack *s)
{
    if(s->top==-1) return 1;
    else return 0;
}
void conversion(int N,int r)
{
    SeqStack *p;
    int y;
    p=Init_SeqStack();
    while(N)
    {
         if(Push_Seqstack(p,N%r)==1)
         {N=N/r;  }
         else
         break;
     }
     while(!Empty_SeqStack(p))
     {
          Pop_SeqStack(p,&y);
          printf("%d",y);
      }
  }

void main()
{
    int M,t;
    printf("please input a number:\n");
    scanf("%d",&M);
    printf("please input t:\n");
    scanf("%d",&t);
    conversion(M,t);
    getch();
}