1074 宇宙无敌加法器

输入样例：

30527
06203
415

输出样例：

7201

#include <iostream>
using namespace std;
int main()
{
    string radix, num1, num2;
    cin >> radix >> num1 >> num2;
    //将num1和num2的长度转为相同
    if (num1.length() > num2.length()) {
        string temp = "";
        for (int i = 0; i < num1.length() - num2.length(); i++) {
            temp += "0";
        }
        num2 = temp + num2;
    }
    if (num2.length() > num1.length()) {
        string temp = "";
        for (int i = 0; i < num2.length() - num1.length(); i++) {
            temp += "0";
        }
        num1 = temp + num1;
    }
    int temp = radix.length() - 1;
    int carry = 0;
    string result = "";
    //运算
    for (int i = num1.length() - 1; i >= 0; i--) {
        int sum = (num1[i] - '0') + (num2[i] - '0') + carry;
        int r = radix[temp] - '0';
        temp--;
        if (r == 0) {
            r = 10;
        }
        carry = sum / r;
        result = (char)(sum % r + '0') + result ;
    }
    //有进位进制
    while (carry != 0 && temp >= 0) {
        int sum = carry;
        int r = radix[temp] - '0';
        temp--;
        if (r == 0) {
            r = 10;
        }
        carry = sum / r;
        result = (char)(sum % r + '0') + result ;
    }
    //有进位没进制
    if (carry != 0) {
        result = (char)(carry + '0') + result ;
    }
    int tag = 0;
    for (int i = 0; i < result.length(); i++) {
        if (tag == 1) {
            cout << result[i];
            continue;
        }
        if (result[i] != '0') {
            if (tag == 0) {
                tag = 1;
            }
            cout << result[i];
        }
    }
    if (tag == 0) {
        cout << 0;
    }
}