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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
#include <bits/stdc++.h>
using namespace std;

int main()
{
    ios_base::sync_with_stdio(0);
    cout.tie(0);
    cin.tie(0);

    string S, K;

    cin >> S;
    cin >> K;

    int r = max(K.size(), S.size());

    string A = "";

    int carry = 0;

    int x, y;

    int pom;

    for(int i = 0; i < r; i++)
    {

        if(K.size() <= i)
        {
            x = S[S.size() - 1 - i] - '0';

            if(carry == 1)
            {
                x++;
            }

            carry = x / 10;

            x %= 10;

            A += (x + '0');

            continue;
        }

        if(S.size() <= i)
        {
            y = K[K.size() - 1 - i] - '0';

            if(carry == 1)
            {
                y++;
            }

            carry = y / 10;

            y %= 10;

            A += (y + '0');

            continue;
        }


        x = S[S.size() - 1 - i] - '0';
        y = K[K.size() - 1 - i] - '0';

        pom = x + y + carry;

        carry = pom / 10;

        pom %= 10;

        A += (pom + '0');
    }

    if(carry == 1)
    {
        A += '1';
    }

    reverse(A.begin(), A.end());

    cout << A << endl;

    return 0;
}