#include"stdio.h"
#define maxsize 100
typedef struct stack
{
int a[maxsize];
int top;
}stack;
void init_stack(stack &sq)
{sq.top=0;}
int stackempty(stack sq)
{
return(sq.top?0:1);
}
void push(stack &sq,int x)
{
if(sq.top==maxsize)
printf("the stack is full");
sq.a[sq.top++]=x;
}
int pop(stack &sq)
{
if(stackempty(sq))
{
printf("the stack is empty");
}
sq.top--;
return sq.a[sq.top];
}
void jinzhizhuanhuan(int N,int B)
{
int i;
stack sq;
init_stack(sq);
while(N)
{
push(sq,N%B);
N=N/B;
}
while(!stackempty(sq))
{
i=pop(sq);
printf("%d",i);
}
}
main()
{
int N,B;
printf("输入一个十进制数:");
scanf("%d",&N);
printf("转换为几进制 :");
scanf("%d",&B);
jinzhizhuanhuan(N,B);
printf("/n");
}
#define maxsize 100
typedef struct stack
{
int a[maxsize];
int top;
}stack;
void init_stack(stack &sq)
{sq.top=0;}
int stackempty(stack sq)
{
return(sq.top?0:1);
}
void push(stack &sq,int x)
{
if(sq.top==maxsize)
printf("the stack is full");
sq.a[sq.top++]=x;
}
int pop(stack &sq)
{
if(stackempty(sq))
{
printf("the stack is empty");
}
sq.top--;
return sq.a[sq.top];
}
void jinzhizhuanhuan(int N,int B)
{
int i;
stack sq;
init_stack(sq);
while(N)
{
push(sq,N%B);
N=N/B;
}
while(!stackempty(sq))
{
i=pop(sq);
printf("%d",i);
}
}
main()
{
int N,B;
printf("输入一个十进制数:");
scanf("%d",&N);
printf("转换为几进制 :");
scanf("%d",&B);
jinzhizhuanhuan(N,B);
printf("/n");
}