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
#include <bits/stdc++.h>
#define FOR(i,p,k) for(int i=(p);i<=(k);++i)
#define REP(i,n) FOR(i,0,(n)-1)
#define RFOR(i,p,n) for(int i=(p);i>=(n);--i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define ssize(x) int((x).size())
#define fi first
#define se second
#define V vector
#define pb push_back
#define eb emplace_back
#define C const
#define pn printf("\n")
using namespace std;
typedef long long ll;
typedef __int128_t lll;
typedef V<int> vi;
typedef V<ll> vll;
typedef const int ci;
typedef const ll cll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
void chmin(auto &a, auto b){a=min(a,b);}
void chmax(auto &a, auto b){a=max(a,b);}
ci inf = 2.1e9;
cll infll = 4.5e18;
int I(){
    int z;
    cin >> z;
    return z;
}

void answer(){
    string a, b, c;
    cin >> a >> b >> c;
    ci n = ssize(a);

    ll wyn = 0;
    pii dp = {0, 0};
    REP(i, n){
        ci aa = a[i]-'0';
        ci bb = b[i]-'0';
        ci cc = c[i]-'0';
        pii nowe = {0, 0};
        if(aa+bb == cc) chmax(nowe.fi, dp.fi+1);
        if(aa+bb == cc+10) chmax(nowe.fi, dp.se);
        if(aa+bb+1 == cc) chmax(nowe.se, dp.fi+1);
        if(aa+bb+1 == cc+10) chmax(nowe.se, dp.se);
        dp = nowe;
        wyn += dp.fi;
    }
    printf("%lld\n", wyn);
}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    int tt = 1;
    while(tt--) answer();
}