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
#include <bits/stdc++.h>

using namespace std;

constexpr int MAX_N = 1e6;

string s[3];
vector<pair<int, int>> vec;

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

    for (int i : {0, 1, 2}) {
        cin >> s[i];
    }

    int i = 0, diff;
    bool need_carry = false;

    for (int j = 0; j < (int)s[0].length(); ++j) {
        diff = s[0][j] + s[1][j] - s[2][j] - '0';

        if (diff == 0) {
            vec.push_back({j, j});
            goto __reset;
        }

        if (need_carry) {
            if (diff < 9) {
                i = j;
            }
            else {
                diff -= 10;
            }

            need_carry = false;
        }

        if (diff < -1 || diff > 0) {
            goto __reset;
        }

        if (diff == 0) {
            vec.push_back({i, j});
            goto __reset;
        }

        need_carry = true;
        continue;

        __reset:
            i = j + 1;
            need_carry = false;
    }

    if (vec.empty()) {
        cout << "0\n";
        return 0;
    }

    pair<int, int> prev = vec.front();
    vector<int> blocks = {1};

    for (int i = 1; i < (int)vec.size(); ++i) {
        if (prev.second + 1 < vec[i].first) {
            blocks.push_back(1);
        }
        else {
            ++blocks.back();
        }

        prev = vec[i];
    }

    long long ans = 0;

    for (int i : blocks) {
        ans += (long long)i * (i + 1) / 2;
    }

    cout << ans << '\n';
}