1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    string a, b;
    cin >> a >> b;
    short buf = 0;
    vector<char> c;
    int an = a.size();
    int bn = b.size();
    int common = min(an, bn);
    for (int i = 1; i <= common; i++) {
        buf += a[an - i] - '0';
        buf += b[bn - i] - '0';
        c.push_back((buf % 10) + '0');
        buf /= 10;
    }
    for (int i = an - common - 1; i >= 0; i--) {
        buf += a[i] - '0';
        c.push_back((buf % 10) + '0');
        buf /= 10;
    }
    for (int i = bn - common - 1; i >= 0; i--) {
        buf += b[i] - '0';
        c.push_back((buf % 10) + '0');
        buf /= 10;
    }
    while (buf > 0) {
        c.push_back((buf % 10) + '0');
        buf /= 10;
    }
    string cs{c.rbegin(), c.rend()};
    cout << cs << endl;
}