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

const int MAX_N = 1e6 + 5;

ll dp[MAX_N][2];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    string nums[3];
    for (int i = 0; i < 3; i++) {
        cin >> nums[i];
    }
    int n = nums[0].size();
    ll res = 0;
    for (int i = n - 1; i >= 0; --i) {
        if ((nums[0][i] - '0' + nums[1][i] - '0') % 10 == (nums[2][i] - '0')) {
            dp[i][(nums[0][i] - '0' + nums[1][i] - '0') > 9] = dp[i + 1][0] + 1;
        }
        if ((nums[0][i] - '0' + nums[1][i] - '0' + 1) % 10 == (nums[2][i] - '0')) {
            dp[i][(nums[0][i] - '0' + nums[1][i] - '0' + 1) > 9] = dp[i + 1][1];
        }
        res += dp[i][0];
    }

    cout << res << endl;
    return 0;
}