如题，re全爆

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

string m,n;
int ans[100086];
int b;

int jia(){
	for(int i=0;i<max(m.length(),n.length());i++){
		if(i<m.length()) ans[i]+=m[i]-48;
		if(i<n.length()) ans[i]+=n[i]-48;
		ans[i+1]=ans[i]/b;
		ans[i]=(ans[i]%b);
	}
}

int main(){
	cin>>b>>m>>n;
	reverse(m.begin(),m.end());
	reverse(n.begin(),n.end());
	
	jia();
	
	for(int i=max(m.size(),n.size())-1;i>=0;i--){
		cout<<ans[i];
	}
	
	return 0;
}