进制转换
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26347 Accepted Submission(s): 14601
Problem Description
输入一个十进制数N,将它转换成R进制数输出。
Input
输入数据包含多个测试实例,每个测试实例包含两个整数N(32位整数)和R(2<=R<=16, R<>10)。
Output
为每个测试实例输出转换后的数,每个输出占一行。如果R大于10,则对应的数字规则参考16进制(比如,10用A表示,等等)。
Sample Input
7 2 23 12 -4 3
Sample Output
111 1B -11
#include<stdio.h>
typedef int ElemType;
struct LNode
{
ElemType data;
struct LNode *next;
};//S为栈顶指针
typedef LNode *LinkStack;
void InitStack_L(LinkStack &S)
{
S=NULL;
}
void Push_L(LinkStack &S,ElemType e)
{
LinkStack p;
p=new LNode;
p->data=e;
p->next=S;
S=p;
}
bool Pop_L(LinkStack &S,ElemType &e)
{
if(S)
{
LinkStack p=S;
S=S->next;
e=p->data;
delete p;
return true;
}
return false;
}
bool StackEmpty_L(LinkStack &S)
{
if(S==NULL)
return true;
return false;
}
void DestroyStack_L(LinkStack &S)
{
LinkStack p;
while(S)
{
p=S;
S=S->next;
delete p;
}
delete S;
}
int main()
{
int n,r;
while(~scanf("%d%d",&n,&r))
{
int flag=1;
ElemType e;
LinkStack Q;
InitStack_L(Q);
if(n<0)
{
flag=0;
n=-n;
}
while(n)
{
Push_L(Q,n%r);
n=n/r;
}
if(flag==0)
printf("-");
while(!StackEmpty_L(Q))
{
Pop_L(Q,e);
if(e>9)
{
char c=e-10+'A';
printf("%c",c);
}
else
printf("%d",e);
}
printf("\n");
}
return 0;
}