pta-L1-3 宇宙无敌加法器 (20分)

L1-3 宇宙无敌加法器 (20分)

#include <bits/stdc++.h>
//#define int ll
using namespace std;

//#pragma GCC optimize(2)

typedef long long ll;
const ll mod = 1e9 + 7;
const int maxn = 1e5 + 10;

string s;
char d[25];
int num=0;

int jia(int x,int y,int yu,int i){
    int jz=s[i]-'0', he=x+y+yu;
    if (jz==0) jz=10;
    int ddd=('0'+he%jz);
    d[num]=(char)ddd,num++;
    return he/jz;
}

void solve() {
    string b,a;
    cin>>s>>a>>b;
    int yu=0,k=s.size();
    for (int i = a.size()-1,j=b.size()-1; max(i,j)>=0; i--,j--) {
        int x=0,y=0;
        if (i>=0&&a[i]<='9'&&a[i]>='0') x=a[i]-'0';
        if (j>=0&&b[j]<='9'&&b[j]>='0') y=b[j]-'0';
        //cout<<x<<" "<<y<<" "<<yu;
        k--,yu=jia(x,y,yu,k);
    }
    while  (yu)
        d[num]=(char)(yu%(s[k-1]-'0')+'0'),num++,yu/=s[k-1]-'0',k--;
    while (d[num]>'9'||d[num]<'1')num--;
    if (num<0) cout<<0;
    else
        for (int i = num; i >=0; --i) cout<<d[i];
}

int main() {
    //ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int _ = 1;
    //cin >> _;
    while (_--) {
        solve();
    }
    return 0;
}