提交时间:2024-08-19 15:42:13
运行 ID: 166949
#include<bits/stdc++.h> using namespace std; const int N=1e5+5; int main() { string a,b,w="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"; int n,i,k,x[N],y[N]; cin>>n>>a>>b; while(a.size()<b.size()) a='0'+a; while(b.size()<a.size()) b='0'+b; a='0'+a; b='0'+b; for(i=a.size()-1;i>=0;i--) { x[i]=w.find(a[i],0); y[i]=w.find(b[i],0); } for(i=a.size()-1;i>=0;i--) { x[i]=x[i]+y[i]; if(x[i]>=n) for(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)<<endl; return 0; }