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

using namespace std;
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef long double ld;

const ll I = 1'000'000'000'000'000'000LL;
const int II = 2'000'000'000;
const ll M = 1'000'000'007LL;
const int N = 1<<20;
bool czy[N];

void Solve()
{
    int n;
    string a, b, c;
    cin >> a >> b >> c;
    n = (int)a.size();
    int cur = 0;
    ll ans = 0LL;
    for(int i = 0; i < n; ++i)
    {
        if((a[i] - '0' + b[i] - '0' + 1) % 10 == (c[i] - '0') % 10)
            czy[i] = 1;
        if((a[i] - '0' + b[i] - '0' + czy[i]) % 10 != (c[i] - '0') % 10)
            { cur = 0; continue;}
        if( ((a[i] - '0' + b[i] - '0' + czy[i]) >= 10) && (czy[i - 1] == 0))
            {cur = 0; continue;}
        if(((a[i] - '0' + b[i] - '0' + czy[i]) < 10) && (czy[i - 1] == 1))
            cur = 0;



        if((a[i] - '0' + b[i] - '0' + czy[i]) < 10)
            ++cur;

        if(czy[i] == 0)
            ans += (ll)cur;


    }
    cout << ans << "\n";
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    // int t; cin >> t;
    // while(t--)
        Solve();

    return 0;
}