typedef int SElemType;
typedef int Status;
typedef struct{

SElemType *base;
SElemType *top;
int stacksize;
}SqStack;

#define STACK_INIT_SIZE 100
#define STACKINCREMENT 10
#define OK 1
#define OVERFLOW -1
#define ERROR 0
#include<malloc.h>
#include<stdio.h>

Status InitStack(SqStack &s)
{
s.base=(SElemType *)malloc(STACK_INIT_SIZE*sizeof(SElemType));
if(!s.base) return(OVERFLOW);
s.top=s.base;
s.stacksize=STACK_INIT_SIZE;
return OK;
}

Status Push(SqStack &s,SElemType e)
{
SElemType*l_temp;
if((s.top-s.base)>=s.stacksize)
{
l_temp=(SElemType*)realloc(s.base,(s.stacksize+STACKINCREMENT)*sizeof(SElemType));
if(!l_temp) return(OVERFLOW);
s.base=l_temp;
s.top=s.base+s.stacksize;
s.stacksize+=STACKINCREMENT;
}
*(s.top++)=e;
return OK;
}

Status Pop(SqStack &s,SElemType &e)
{
if(s.top==s.base) return ERROR;
e=*(--s.top);
return OK;
}
int StackEmpty(SqStack s)
{
if(s.base=s.top) return 1;
else return 0;
}
void conversion(void)
{
SqStack s;
int N,b;
SElemType e;

InitStack(s);
scanf("%d%d",&N,&b);
while(b>1&&N>0)
{
Push(s,N%b);
N=N/b;
}
while(!StackEmpty(s))
{
Pop(s,e);
printf("%d",e);
}
}
void main()
{
conversion();
}


不知道为什么总是得不到正确的结果！

不知道为什么总是得不到正确的结果！

/* 标准文档模板 */

#include "Stdio.h"
#include "Conio.h"

#define STACKSIZE 100
#define STACKINCREASE 10

typedef int type;
typedef struct stack
{
type *top;
type *base;
int stacksize;
}Stack;

void Init(Stack *s)
{ /*初始化栈*/
s->base=(type *)malloc(sizeof(type)*STACKSIZE);
s->top=s->base;
s->stacksize=STACKSIZE;
}

void Destory(Stack *s)
{ /*销毁栈*/
s->stacksize=0;
free(s->base);
}

void Clear(Stack *s)
{ /*置为空栈*/
s->top=s->base;
}

int Empty(Stack *s)
{ /*判断是否为空栈，如果是，则返回1，否则返回0*/
if (s->top==s->base)
return 1;
else
return 0;
}

int Length(Stack *s)
{ /*返回栈的长度*/
return s->top-s->base;
}

type Gettop(Stack *s)
{ /*返回栈顶元素*/
if (s->top==s->base)
printf("The stack is empty!\n");
else
return *(s->top-1);
}

void Push(Stack *s,type e)
{ /*入栈操作*/
if (s->top-s->base>=STACKSIZE)
{
s->base=(type *)realloc(s->base,(STACKSIZE+STACKINCREASE)*sizeof(type));
s->top=s->base+s->stacksize;
}
*(s->top++)=e;
}

type Pop(Stack *s)
{ /*出栈操作，并返回栈顶元素*/
if (s->top==s->base)
printf("The stack is empty!\n");
s->top=s->top-1;
return *(s->top);
}

void conversion(Stack *s)
{ /*数制转换*/
int n,m,flag=0;
Init(s);
printf("Please input 10 jin zhi shu:");
scanf("%d",&n);
printf("\nPlease input the style you want to convert:");
scanf("%d",&m);
while (n)
{
flag=0;
if (n%m>9 && n%m<16)
{
switch(n%m)
{
case 10:
flag=1;
Push(s,65);
break;
case 11:
flag=1;
Push(s,66);
break;
case 12:
flag=1;
Push(s,67);
break;
case 13:
flag=1;
Push(s,68);
break;
case 14:
flag=1;
Push(s,69);
break;
case 15:
flag=1;
Push(s,70);
break;
}
}
if (flag==0)
Push(s,n%m);
n=n/m;
}
printf("\nThe %d jin zhi shu is:",m);
while (!Empty(s))
{
if (Gettop(s)>=65)
printf("%c",Pop(s));
else
printf("%d",Pop(s));
}
}

int main(void)
{
Stack s;
conversion(&s);
getch();
return 0;
}
试试这个