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

using namespace std;

typedef long long ll;
#define st first
#define nd second
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll,ll>

const int maxn = 1e6+7;

int tab1[maxn];
int tab2[maxn];
int tab3[maxn];

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

    int n;
    string s;
    
    cin>>s;
    n = s.size();
    
    for(int i=1;i<=n;i++){
        tab1[i] = s[i-1]-'0';
    }

    cin>>s;
    for(int i=1;i<=n;i++){
        tab2[i] = s[i-1]-'0';
    }

    cin>>s;
    for(int i=1;i<=n;i++){
        tab3[i] = s[i-1]-'0';
    }

    ll wyn = 0,ile = 0;
    bool czy = 0;
    for(int i=1;i<=n;i++){
        if(!czy){
            if(tab1[i]+tab2[i] > tab3[i]){
                ile = 0;
            }
            else if(tab1[i]+tab2[i] == tab3[i]){
                ile++;
            }
            else if(tab1[i]+tab2[i] == tab3[i]-1){
                czy = 1;
            }   
            else{ //<tab3[i]-1
                ile = 0;
            }
        }
        else{
            if(tab1[i]+tab2[i]-10 == tab3[i]){
                czy = 0;
                ile++;
            }
            else if(tab1[i]+tab2[i]-10 == tab3[i]-1){
                czy = 1;
            }
            else{
                czy = 0;
                ile = 0;
                i--;
            }
        }
        
        if(!czy){
            wyn += ile;
            //cout<<i<<" "<<ile<<"\n";
        }
    }

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