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
#include <iostream>
#include <vector>

typedef long long ll;

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);


    std::string sa, sb, sc;
    std::cin >> sa >> sb >> sc;

    int n = sa.size();
    std::vector<int> A(n), B(n), C(n);

    for (int i = 0; i < n; i++) {
        A[i] = sa[i] - '0';
        B[i] = sb[i] - '0';
        C[i] = sc[i] - '0';
    }

    ll ans = 0;
    ll carry0 = 0, carry1 = 0;

    for (int i = n-1; i >= 0; i--) {
        carry0++;
        ll rest = A[i] + B[i] - C[i];
        if (rest == 10) {
            carry1 = carry0;
            carry0 = 0;
        }
        else if (rest == -1) {
            carry0 = carry1;
            carry1 = 0;
        }
        else if (rest == 0) carry1 = 0;
        else if (rest == 9) carry0 = 0;
        else carry0 = carry1 = 0;
        ans += carry0;
    }

    std::cout << ans << '\n';

    return 0;
}