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
#include <bits/stdc++.h>
using namespace std;
#define fwd(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) fwd(i, 0, n)
#define all(X) X.begin(), X.end()
#define sz(X) int(size(X))
#define pb push_back
#define eb emplace_back
#define st first
#define nd second
using pii = pair<int, int>; using vi = vector<int>;
using ll = long long; using ld = long double;
#ifdef LOC
auto SS = signal(6, [](int) { *(int *)0 = 0; });
#define DTP(x, y) auto operator << (auto &o, auto a) -> decltype(y, o) { o << "("; x; return o << ")"; }
DTP(o << a.st << ", " << a.nd, a.nd);
DTP(for (auto i : a) o << i << ", ", all(a));
void dump(auto... x) { (( cerr << x << ", " ), ...) <<
'\n'; }
#define deb(x...) cerr << setw(4) << __LINE__ << ":[" #x "]: ", dump(x)
#else
#define deb(...) 0
#endif
 

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout << fixed << setprecision(10);
    string str;
    cin >> str;
    int n = str.length();
    vector<short> a(n), b(n), c(n);
    rep(i, n)a[i] = str[i] - '0';
    cin >> str;
    rep(i, n)b[i] = str[i] - '0';
    cin >> str;
    rep(i, n)c[i] = str[i] - '0';
    vector<bool> carry(n);
    vector<bool> needCarry(n);
    vector<bool> ok(n);
    rep(i, n){
        if((a[i] + b[i]) % 10 == c[i]){
            needCarry[i] = false;
            ok[i] = true;
            if(a[i] + b[i] >= 10)carry[i] = true;
        }else if((a[i] + b[i] + 1) % 10 == c[i]){
            needCarry[i] = true;
            ok[i] = true;
            if(a[i] + b[i] >= 9)carry[i] = true;
        }else{
            ok[i] = false;
        }
    }
    deb(carry);
    deb(needCarry);
    deb(ok);
    vector<pii> intervals;//closed from both sides
    rep(i, n){
        if(!ok[i])continue;
        int l = i;
        int r = i;
        while(r + 1 < n && needCarry[r] == carry[r+1] && ok[r+1])r++;
        intervals.push_back({l, r});
        i = r;
    }
    deb(intervals);
    ll res = 0;
    for(auto [l, r] : intervals){
        ll goodEnds = 0;
        for(int i = l; i <= r; i++)if(!needCarry[i])goodEnds++;
        for(int i = l; i <= r; i++){
            if(!carry[i])res += goodEnds;
            if(!needCarry[i])goodEnds--;
        }
    }
    cout << res << "\n";
    return 0;
}