Submission

Score: 60

User: Hax

Problemset: บวกเลขฐาน

Language: cpp

Time: 0.002 second

Submitted On: 2026-10-12 17:29:26

#include <bits/stdc++.h>
#include <string>

using namespace std;

int main() {
    int base;
    string num1;
    string num2;
    string val = "0123456789ABCDEF";
    int digitSum = 0;
    int carry = 0;
    cin >> base >> num1 >> num2;
    int len = num1.length();
    string ans(len, '0');
    for (int i = 0; i < num1.length(); i ++) {
        int a = val.find(num1[len - 1 - i]);
        int b = val.find(num2[len - 1 - i]);
        digitSum = a + b + carry;
        ans[len - 1 - i] = val[digitSum % base];
        carry = digitSum / base;
    }
    if (carry > 0) {
        cout << val[carry];
    }
    cout << ans << endl;
}