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

#define ll long long

vector<int> to_number(string s) {
    vector<int> v(s.length(), 0);
    for (int i = 0; i < s.length(); i++) {
        v[i] = (int)(s[i] - '0');
    }
    return v;
}

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

    string s, p, q;
    cin >> s >> p >> q;
    int n = s.length();
    vector<int> a = to_number(s), b = to_number(p), c = to_number(q);

    ll wyn = 0;
    int i = 0;

    ll len = 0;
    while (i < n) {
        // cerr << "start i = " << i << " len = " << len << "\n";
        // // cerr << a[i] << " " << b[i] << " " << c[i] << "\n";
        while (i < n && a[i] + b[i] == c[i]) {
            i++;
            len++;
        }
        // cerr << "teraz i = " << i << " len = " << len << "\n";

        if (i == n) {
            wyn += (len * (len + 1)) / 2;
            len = 0;
        }

        else {
            if (a[i] + b[i] == c[i] - 1) {
                // cerr << "-1\n";
                int k = i + 1;
                // cerr << "k = " << k << "\n";
                while (k < n && a[k] + b[k] - 10 == c[k] - 1) {
                    k++;
                }
                // cerr << "k = " << k << "\n";  // << (a[k] + b[k]) % 10 << " =?= " << c[k] << "\n";
                
                if (k >= n) {
                    wyn += (len * (len + 1)) / 2;
                    len = 0;
                    i = k;
                }
                else {
                    if (a[k] + b[k] - 10 == c[k]) {
                        // cerr << "tak\n";
                        len++;
                        i = k + 1;
                        
                        if (i >= n) {
                            wyn += (len * (len + 1)) / 2;
                        }
                    }
                    else {
                        wyn += (len * (len + 1)) / 2;
                        len = 0;
                        i = k;

                        // cerr << "teraz i = " << i << " wyn = " << wyn << "\n";
                    }
                }
            }

            else {
                wyn += (len * (len + 1)) / 2;
                len = 0;
                i++;
            }
        }
    }

    cout << wyn << "\n";
    return 0;
}