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
89
90
91
92
93
94
95
#include <cstdlib>
#include <bitset>
#include <functional>
#include <utility>
#include <chrono>
#include <tuple>
#include <new>
#include <memory>
#include <climits>
#include <cfloat>
#include <cinttypes>
#include <exception>
#include <string>
#include <array>
#include <vector>
#include <deque>
#include <list>
#include <forward_list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>
#include <valarray>
#include <ios>
#include <istream>
#include <ostream>
#include <iostream>
#include <fstream>
#include <streambuf>
#include <cstdio>
#include <thread>
#include <random>
// #include <bits/stdc++.h>
using namespace std;

int A[1000005], B[1000005], C[1000005];
int dyn[1000005][2];
int n;
int main()
{
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(0);

    string wej;
    cin >> wej;

    n = wej.size();
    for (int i = 1; i <= n; i++)
        A[i] = int(wej[i - 1]) - int('0');

    cin >> wej;
    for (int i = 1; i <= n; i++)
        B[i] = int(wej[i - 1]) - int('0');
    cin >> wej;
    for (int i = 1; i <= n; i++)
        C[i] = int(wej[i - 1]) - int('0');

    long long wyn = 0;
    for (int i = 1; i <= n; i++)
    {
        int akt_suma = A[i] + B[i];
        bool czy_overflow = 0;
        if (akt_suma >= 10)
            czy_overflow = 1;

        if (akt_suma % 10 == C[i])
        {
            dyn[i][0] = dyn[i - 1][czy_overflow];
            if (!czy_overflow)
                dyn[i][0]++;
        }

        akt_suma++;
        if (akt_suma >= 10)
            czy_overflow = 1;

        if (akt_suma % 10 == C[i])
        {
            dyn[i][1] = dyn[i - 1][czy_overflow];
            if (!czy_overflow)
                dyn[i][1]++;
        }

        wyn += (long long)dyn[i][0];
    }

    cout << wyn;
}