十进制转八进制
八进制转十进制
#include <stdio.h>
#include <stdlib.h>
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
#define OVERFLOW -2
typedef int ElemType;
typedef int Status;
#define STACK_INIT_SIZE 10
#define STACKINCREMENT 5
typedef struct {
ElemType *base;
int top;
int size;
int increment; // 扩容时,增加的存储容量
} SqStack;
// 构造一个空栈 S
Status InitStack(SqStack &S){
S.base = (ElemType *)malloc(STACK_INIT_SIZE * sizeof(ElemType));
if(!S.base) exit (OVERFLOW);
S.top = 0;
S.size = STACK_INIT_SIZE;
S.increment = STACKINCREMENT;
return OK;
}
// 判栈 S 是否为空栈
Status StackEmpty(SqStack S){
if (S.top==0) return TRUE;
else return FALSE;
}
Status Push (SqStack &S, ElemType e) {
if (S.top == S.size)
{
S.base = (ElemType*)realloc(S.base,(S.size + STACKINCREMENT)*sizeof(ElemType));
if(NULL == S.base)return OVERFLOW;
S.size =STACKINCREMENT + S.size;
}
S.base[S.top]= e;
S.top++;
return OK;
}
//出栈函数
Status Pop (SqStack &S, ElemType &e) {
if (S.top == 0)
return ERROR;
S.top--;
e = S.base[S.top] ;
return OK;
}
//十进制转八进制函数
void conversion()
{ SqStack S;
int n,d;
ElemType e;
printf("\n请输入一个十进制数字:");
scanf("%d",&n) ;
InitStack(S);
while(n){
Push(S,n%8);
n /= 8;
}
printf("输出的八进制数字为:") ;
while(FALSE == StackEmpty(S)){
Pop(S,e);
printf("%d",e);
}
printf("\n");
}
int main()
{
conversion();
}