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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
#include<cstdio>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<set>
#include<stack>

using namespace std;

typedef vector<int> VI;
typedef long long LL;
typedef vector<LL> VLL;
typedef pair<int, int> PII;

#define FOR(x, b, e) for(int x=b; x<=(e); ++x)
#define FORD(x, b, e) for(int x=b; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second

int main() {
	ios_base::sync_with_stdio(0);
    cin.tie(NULL); cout.tie(NULL);
    string a, b;
    vector<int> res;
    bool over = false;
    cin >> a >> b;
    int i = a.size() - 1, j = b.size() - 1;
    while (i >= 0 && j >= 0) {
        int v = a[i] - '0' + b[j] - '0';
        if (over) v++;
        over = v > 9;
        res.PB(v % 10);
        i--; j--;
    }
    while (i >= 0) {
        int v = a[i] - '0';
        if (over) v++;
        over = v > 9;
        res.PB(v % 10);
        i--;
    }
    while (j >= 0) {
        int v = b[j] - '0';
        if (over) v++;
        over = v > 9;
        res.PB(v % 10);
        j--;
    }
    if (over) res.PB(1);
    REP(i, res.size()) cout << res[res.size() - 1 - i];
    cout << '\n';
    return 0;
}