栈的应用-进制转化

#include <stdio.h>
#include <stdlib.h>

#define STACKSIZE    10
#define RADIX        16

typedef struct
{
    int *base;
    int *top;
    int stack_size;
}SqStack;

SqStack CreatStack ()
{
    SqStack S;
    int e;
    S.base = (int *)malloc(STACKSIZE*sizeof(int));
    S.top = S.base;
    S.stack_size = STACKSIZE;
    scanf("%d", &e);
    while(e)
    {
        *(S.top++) = e%RADIX;
        e = e/RADIX;
    }
    return S;
}
void PrintStack (SqStack S)
{
    while(S.top != S.base)
    {
        if(*(--S.top) < 10)
            printf("%d", *(S.top));
        else
            printf("%c", 'A'+(*(S.top)-10));
    }
    printf("\n");
}

int main ()
{
    PrintStack(CreatStack());
    return 0;
}