Submission

Status:

PPPPPPPPP

Subtask/Task Score:

100/100

Score: 100

User: nxtx_ss

Problemset: บวกเลขฐาน

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-05 02:56:40

#include<bits/stdc++.h>
using namespace std;
int main() {
	int n,k=0,sa=0,sb=0,st=0,x[10000];
	string a,b,l;
	cin>>n;
	cin>>a>>b;
	for(int i=0; i<a.size(); i++) {
		if(a[i]>='0' && a[i]<='9'){
		sa=sa+pow(n,a.size()-i-1)*(a[i]-'0');
		}
		else{
		sa=sa+(a[i]-'A'+10)*pow(n,a.size()-i-1);
		}
	}
	for(int i=0; i<b.size(); i++) {
		if(b[i]>='0' && b[i]<='9'){
		sb=sb+pow(n,b.size()-i-1)*(b[i]-'0');
		}
		else{
		sb=sb+(b[i]-'A'+10)*pow(n,b.size()-i-1);
		}
	}
	st=sa+sb;
	for (int i=0; i<10000; i++ ) {
		if(st/n!=0) {
		x[i]=st%n;
		st=st/n;
		k++;
		}
		else{
			x[i]=st%n;
			k++;
			break;
		}
	}
	for (int i=k-1; i>=0; i--) {
		l='0';
		if(x[i]<10) {
			cout<<x[i];
		}
		else {
			l='A'+(x[i]-10);
			cout<<l;
		}
	}
}