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
88
89
90
91
92
93
94
#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=a;i<(int)b;++i)
#define FORD(i,a,b) for(int i=a;i>=(int)b;--i)
#define PB push_back
#define EB emplace_back
#define FI first
#define SE second
#define umap unordered_map
#define uset unordered_set
#define vi vector<int>
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define vpii vector<pii>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ALL(X) (X).begin(),(X).end()
#ifndef DEBUG
#define endl (char)10
#endif
using namespace std;
using ll = long long;
using ld = long double;

template <class T>
istream& operator>> (istream& is, vector<T>& vec){
    FOR(i,0,vec.size()) is >> vec[i];
    return is;
}
template <class T>
ostream& operator<< (ostream& os, vector<T>& vec){
    for(auto& t : vec) os << t << " ";
    return os;
}
template<class T, class U>
ostream& operator<< (ostream& os, const pair<T, U>& p){
    os << p.FI << " " << p.SE;
    return os;
}
template<class T, class U>
istream& operator>> (istream& is, pair<T, U>& p){
    is >> p.FI >> p.SE;
    return is;
}

ll podlicz(vi& d, vi& p, int b, int e) {
    if (e <= b) return 0;
    ll ans = 0;
    int ilek = 0;
    FOR(i,b,e) if (p[i] == 0) ilek++;
    FOR(i,b,e){
        if(d[i] == 0) {
            ans += ilek;
        }
        if (p[i] == 0) ilek--;
    }
    return ans;
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    string s, t, u;
    cin >> s >> t >> u;
    int n = s.size();
    vi d(n, 0), p(n, 0), b(n + 1, 0);
    FOR(i,0,n){
        int x = s[i] + t[i] - 2 * 48;
        int y = x % 10;
        int z = u[i] - 48;
        if (z == y) {
            d[i] = (x > 9);
        } else if(z == (y + 1) % 10){
            p[i] = 1;
            d[i] = (x > 8);
        } else {
            b[i] = 1;
        }
    }
    b[n] = 1;
    int prev = 0;
    ll ans = 0;
    FOR(i,0,n+1){
        if(b[i]) {
            ans += podlicz(d, p, prev, i);
            prev = i + 1;
        }
        else if (i < n && b[i + 1] == 0 && p[i] != d[i + 1]) {
            ans += podlicz(d, p, prev, i + 1);
            prev = i + 1;
        }
    }
    cout << ans << endl;
}