1074 宇宙无敌加法器

#include<iostream>
#include<algorithm>
using namespace std;

int main() {
    string table,str1,str2,ans;
    cin>>table>>str1>>str2;
    reverse(table.begin(),table.end());
    reverse(str1.begin(),str1.end());
    reverse(str2.begin(),str2.end());
    int carry = 0;
    for(int i = 0; i < str1.size() || i < str2.size(); ++i) {
        int a = i >= str1.size() ? 0:str1[i]-‘0‘;
        int b = i >= str2.size() ? 0:str2[i]-‘0‘;
        int d = table[i] == ‘0‘? 10:table[i] - ‘0‘;
        ans += (a+b+carry)%d + ‘0‘;
        carry = (a+b+carry)/d;
    }
    if(carry != 0) ans += carry+‘0‘;//两个PAT的最高位求和，可能会产生进位carry，最好不要忘了 拼接上 carry 
    int i = ans.size() - 1,flag = 0 ;
    while(i >= 0 && ans[i] == ‘0‘) --i;
    while(i >= 0) {
        printf("%c",ans[i]);
        --i;
        flag = 1;
    }
    if(flag == 0) printf("0");//两个PAT的和 可能是 0，要特判输出 0
    return 0;
}