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

#define f first
#define s second
typedef long long ll;
const ll M = 1000LL*1000LL*1000LL+7LL;

void to_digits(string& A, vector<int>& V){
    for(int i = 0; i < (int)A.size(); i++) V[i] = (int)A[i] - (int)'0';
}

void solve(){
    string a, b, c; int n;
    cin >> a >> b >> c;
    n = (int)a.size();
    vector<int> A(n, 0);
    vector<int> B(n, 0);
    vector<int> C(n, 0);
    vector<int> length(n, 0);
    to_digits(a, A); to_digits(b, B); to_digits(c, C);
    ll res = 0LL;
    for(int i = 0; i < n; i++){
        if( (A[i]+B[i])%10 != C[i] ) continue;
        if( A[i]+B[i] < 10 ){
            length[i] = length[i-1]+1;
            res += (ll)length[i];
            continue;
        }
        int l = i-1;
        while( l>=0 && (A[l]+B[l]+1) >= 10 ){
            if( (A[l]+B[l]+1)%10 == C[l] )      l--;
            else break; 
        }
        if( l < 0 ) length[i] = 0;
        else if( (A[l]+B[l]+1)%10 == C[l] ){
            length[i] = 1;
            if( l-1 >= 0 ) length[i] += length[l-1];
        }
        res += (ll)length[i];
    }
    cout << res << "\n";
}

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