#include <iostream>
\n#include <stdio.h>
\n#include <stdlib.h><\/p>\n
#define ElemType int<\/p>\n
using namespace std;<\/p>\n
typedef struct
\n{
\n ElemType *top;
\n ElemType *base;
\n int Stacksize;
\n} Stack;<\/p>\n
bool InitStack(Stack &S)
\n{
\n if((S.base=(ElemType *)malloc(5*sizeof(ElemType)))==NULL) return false;
\n S.top=S.base;
\n S.Stacksize=5;
\n return true;
\n}<\/p>\n
bool Push(Stack &S,ElemType e)
\n{
\n if(S.top-S.base==S.Stacksize-1)
\n {
\n if((S.base=(ElemType *)realloc(S.base,++S.Stacksize*sizeof(ElemType)))==NULL)
\n return false;
\n S.top=S.base+S.Stacksize-2;
\n }
\n *S.top++=e;
\n return true;
\n}<\/p>\n
bool Pop(Stack &S,ElemType &e)
\n{
\n if(S.top-S.base==0) return false;
\n e=*–S.top;
\n return true;
\n}<\/p>\n
bool StackEmpty(Stack &S)
\n{
\n if(S.top-S.base==0) return true;
\n return false;
\n}<\/p>\n
int main()
\n{
\n Stack S;
\n ElemType e;
\n int decimal,radix;<\/p>\n
if(!InitStack(S)) return -1;
\n cout <<“\u8bf7\u8f93\u5165\u5341\u8fdb\u5236\u6574\u6570\u548c\u8981\u8f6c\u6362\u7684\u8fdb\u5236:”;
\n if(scanf(“%d%d”,&decimal,&radix)!=2) return -1;<\/p>\n
while (decimal)
\n {
\n Push(S,decimal%radix);
\n decimal\/=radix;
\n }<\/p>\n
while(!StackEmpty(S))
\n {
\n Pop(S,e);
\n cout <<e;
\n }
\n cout <<endl;<\/p>\n
return 0;
\n}<\/p>\n","protected":false},"excerpt":{"rendered":"
#include <iostream>
\n#include <stdio.h>
\n#include <stdlib.h><\/p>\n
#define ElemType int<\/p>\n
using namespace std;<\/p>\n
typedef struct
\n{
\n ElemType *top;
\n ElemType *base…<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[326],"tags":[],"class_list":["post-49","post","type-post","status-publish","format-standard","hentry"],"yoast_head":"\n