#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int main(){
int a,b,t,temp,carry;
string n,ans;
while(scanf("%d",&a)!=EOF){
cin>>n;
cin>>b;
int len=n.length();
ans="";
for(int i=0;i<len;){
carry=0;
for(int j=i;j<len;j++){
if(n[j]=='A'||n[j]=='a')
t=10;
else if(n[j]=='B'||n[j]=='b')
t=11;
else if(n[j]=='C'||n[j]=='c')
t=12;
else if(n[j]=='D'||n[j]=='d')
t=13;
else if(n[j]=='E'||n[j]=='e')
t=14;
else if(n[j]=='F'||n[j]=='f')
t=15;
else
t=n[j]-'0';
temp=carry*a+t;
n[j]=temp/b+'0';
carry=temp%b;
}
string p;
if(carry<=9)
p=carry+'0';
else
p=carry-10+'A';
ans+=p;
// cout<<n<<endl;
while(n[i]=='0')
i++;
}
reverse(begin(ans),end(ans));
cout<<ans<<endl;
}
return 0;
}
KY56 数制转换
最新推荐文章于 2024-03-16 16:45:14 发布