设计算法，把十进制整数转换为二至九进制之间的任一进制输出。

#include<iostream>
using namespace std;
typedef struct Node{
	int data;
	struct Node *next;
}LinkStack;
LinkStack *Push(LinkStack *LS,int x){
	LinkStack *p;
	p=(LinkStack *)malloc(sizeof(LinkStack));
	p->data=x;
	p->next=LS;
	LS=p;
	return LS;
}
LinkStack *Transform(LinkStack *LS) {
	int n=0,d=0;
	cout<<"请输入要转换的整数:";
	cin>>n;
	cout<<endl;
	cout<<"请输入基数(2-9之间):";
	cin>>d;
	if(n<0||d<2||d>9)
	{
		cout<<"输入错误!"<<endl;
		exit(0);
}
	if(n==0)
	LS=Push(LS,0);
	while(n)
	{
		LS=Push(LS,n%d);
		n=n/d;
	}return LS;
}
void Print(LinkStack *LS){
	LinkStack *p;
	p=LS;
	cout<<"转换的结果为:"<<endl;
	while(p!=NULL)
	{
		cout<<p->data;
		p=p->next;
	}cout<<endl;
}
void main(){
	LinkStack *LS;
	LS=NULL;
	LS=Transform(LS);
	Print(LS);
}