提交时间:2024-08-19 15:20:52

运行 ID: 166762

#include <bits/stdc++.h> using namespace std; int main(){ string w="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"; string a,b; int n,x[1000],y[1000]; cin >> n >> a >> b; while(a.size()<b.size()){ a='0'+a; } while(a.size()>b.size()){ b='0'+b; } a='0'+a; b='0'+b; for(int i=a.size()-1;i>=0;i--){ x[i]=w.find(a[i],0); y[i]=w.find(b[i],0); } for(int i=a.size()-1;i>=0;i--){ x[i]=x[i]+y[i]; if(x[i]>=n){ for(int k=i;x[k]>=n;k--){ x[k]=x[k]-n; x[k-1]++; } } a[i]=w[x[i]]; } while(a[0]=='0'){ a.erase(0,1); } cout << (a.size()==0?"0":a); return 0; }