数据结构顺序队列进制转换

#include <stdio.h>
#include <stdlib.h>
#define MAXSIZE 50
typedef struct
{
int data[MAXSIZE];
int front;
int rear;
}sequeue;
void initqueue(sequeue *q)
{
q->front=q->rear=-1;
}
int empty(sequeue *q)
{
if(q->front==q->rear)return 1;
else return 0;
}
int inqueue(sequeue *q,int x)
{
if(q->rear>=MAXSIZE-1)
{
printf(“overflow\n”);
return 0;
}
q->rear++;
q->data[q->rear]=x;
return 1;
}
int outqueue(sequeue *q)
{
if(q->rear<0)
{
printf(“under\n”);
exit(0);
}
q->front++;
return q->data[q->front];
}

int zhuanhuan(int n,int m)
{
int x;
sequeue *s,s1;
s=&s1;
initqueue(s);
while(n!=0)
{
x=n%m;
inqueue(s,x);
n=n/m;
}
while(!empty(s))
{ x=outqueue(s);
printf("%d",x);
}
printf("\n");

return 0；
}
int main()
{
int n,m;
printf(“请输入一个十进制数:”);
scanf("%d",&n);
printf(“转换后;”);
scanf("%d",&m);
zhuanhuan(n,m);
return 0;
}