数据结构实验之栈一：进制转换

题目描述

输入

输出

示例输入

1279
8

示例输出

2377

#include <stdio.h>
#include <stdlib.h>
#define maxstack 100000
#define numstack 100000
typedef int Elemtype;
typedef struct
{
Elemtype *top;
Elemtype *base;
int stacksize;
}qstack;
int initstack(qstack *L)
{
L->base=(Elemtype *)malloc(maxstack *sizeof(Elemtype));
if(!L->base)
{
exit(0);
}
L->top=L->base;
L->stacksize=maxstack;
return 0;
}
int pushstack(qstack *L,int k)
{
if(L->top-L->base>=L->stacksize)
{
L->base=(Elemtype *)realloc(L->base,(L->stacksize+numstack)*sizeof(Elemtype));
if(!L->base)
{
exit(0);
}
L->top=L->base+L->stacksize+numstack;
}
*L->top++=k;
return 0;
}
int conversion(qstack *L,int n,int m)
{
int k;
while(n)
{
k=n%m;
n=n/m;
pushstack(L,k);
}
return 0;
}
int putstack(qstack *L)
{
while(L->top>L->base)
{
printf("%d",*(L->top-1));
L->top--;
}
return 0;
}
int main()
{
qstack L;
initstack(&L);
int n,m;
scanf("%d %d",&n,&m);
conversion(&L,n,m);
putstack(&L);
return 0;
}