先挂上题目链接~https://www.patest.cn/contests/pat-b-practise/1074
分析: STL的reverse函数很好用a,注意最后一位的c不为0时高位要补上。。
代码:
#include<bits/stdc++.h>
#include<string>
using namespace std;
char radix[100];
char s1[100],s2[100];
int res[100];
//#define loc
int main(){
int c=0,len1,len2;
#ifdef loc
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
scanf("%s", radix);
scanf("%s", s1);
scanf("%s", s2);
len1 = strlen(s1);
len2 = strlen(s2);
reverse(radix, radix+strlen(radix));
reverse(s1, s1+len1);
reverse(s2, s2+len2);
int i = 0;
for(i = 0; i<min(len1, len2); i++){
int tem = s1[i]-'0'+s2[i]-'0'+c;
int temr = radix[i]-'0';
if(temr == 0) temr = 10;
c = tem/temr;
tem -= c*temr;
res[i] = tem;
}
while(i < len1){
int tem = s1[i]-'0'+c;
int temr = radix[i]-'0';
if(temr == 0) temr = 10;
c = tem/temr;
tem -= c*temr;
res[i] = tem;
i++;
}
while(i < len2){
int tem = s2[i]-'0'+c;
int temr = radix[i]-'0';
if(temr == 0) temr = 10;
c = tem/temr;
tem -= c*temr;
res[i] = tem;
i++;
}
if(c != 0) res[i++] = c; //别忘了加上最后一位,否则有两个测试点过不去
reverse(res, res+i);
int idx = 0;
while(idx<i && res[idx] == 0) idx++;
if(idx == i){
printf("0");//特判结果是否为0
return 0;
}
for(int j = idx; j<i; j++)
printf("%d", res[j]);
return 0;
}