题目:
写法一(个人更喜欢这种写法):
#include<cstdio>
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int len;
string f(int m,int n,int a[]){
string b;
for(int i=0;i<len;){
int k=0;
for(int j=i;j<len;j++){//其实就是短除法倒找余数
int t=(a[j]+k*m)%n;
a[j]=(a[j]+k*m)/n;
k=t;
}
if(k>=0&&k<=9){
b+=char(k+'0');
}
else{
b+=char(k-10+'a');
}
while(a[i]==0){
i++;
}
}
return b;
}
int main(){
int m,n;
string num;
while(scanf("%d%d",&m,&n)!=EOF){
int a[100000];
cin>>num;
len=num.size();
for(int i=0;i<len;i++){
if(num[i]>='0'&&num[i]<='9'){
a[i]=num[i]-'0';
}
else if(num[i]>='A'&&num[i]<='Z'){
a[i]=num[i]-'A'+10;
}
}
string b=f(m,n,a);
reverse(b.begin(),b.end());
cout<<b<<endl;
}
return 0;
}
写法二:
#include<stdio.h>
#include<iostream>
#include<cstring>
using namespace std;
struct bign{
int len;
int d[1000];
bign(){
len=0;
memset(d,0,sizeof(d));
}
};
bign change(char s[]){
bign a;
a.len=strlen(s);
for(int i=0;i<a.len;i++){
if(s[a.len-i-1]>='0'&&s[a.len-i-1]<='9'){
a.d[i]=s[a.len-i-1]-'0';
}
else if(s[a.len-i-1]>='A'&&s[a.len-i-1]<='Z'){
a.d[i]=s[a.len-i-1]-'A'+10;
}
}
return a;
}
int main(){
int m,n;
while(~scanf("%d%d",&m,&n)){
char a[1000]={'\0'};
char ans[1000]={'\0'};
scanf("%s",a);
bign b=change(a);
int len=b.len;
int num=0;
while(len>0){//找商,直到没商可除
int c=0;
for(int i=len-1;i>=0;i--){
int t=(b.d[i]+m*c)/n;
c=(b.d[i]+m*c)%n;
b.d[i]=t;
}
if(c>=0&&c<=9){
ans[num++]=c+'0';
}
else if(c>=10&&c<=36){
ans[num++]=c-10+'a';
}
while(b.d[len-1]==0){
len--;
}
}
for(int i=num-1;i>=0;i--){
printf("%c",ans[i]);
}
printf("\n");
}
return 0;
}