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

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define all(a) (a).begin(),(a).end()
#define allr(a) (a).rbegin(),(a).rend()
#define ll long long
#define ld long double
#define pll pair<ll,ll>
#define pb push_back
#define F first 
#define S second
#define INF (ll)2e18
#define pii pair<int,int>
#define int ll

void solve() {

    string a,b,c; cin >> a >> b >> c;
    int dp[2] = {0,0};
    int n = a.size();
    int ans = 0;
    for (int i = n-1; i >= 0; i--){
        int res = a[i]+b[i]-2*'0';
        int c_res = c[i]-'0';
        if (c_res == res){
            ans += 1 + dp[0];
        }
        if (c_res == (res+1)){
            ans += dp[1];
        }
        if (res > 9){
            if(c_res == res%10){
                dp[1] = dp[0] + 1;
                dp[0] = 0;
            } else if (c_res == (res+1)%10){
                dp[0] = 0;
                dp[1] = dp[1];
            } else {
                dp[0] = dp[1] = 0;
            }
        }
        else if (res < 9){
            if(c_res == res%10){
                dp[0] = 1 + dp[0];
                dp[1] = 0;
            } else if (c_res == (res+1)%10){
                dp[0] = dp[1];
                dp[1] = 0;
            } else {
                dp[0] = dp[1] = 0;
            }
        } else {
            if(c_res == res%10){
                dp[0] = dp[0] + 1;
                dp[1] = 0;
            } else if (c_res == (res+1)%10){
                dp[0] = 0;
                dp[1] = dp[1];
            } else {
                dp[0] = dp[1] = 0;
            }
        }
    }
    cout << ans << '\n';

}

int32_t main() {

    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
    
    return 0;
}