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
#include <bits/stdc++.h>
using namespace std;
constexpr int N = 2e6 + 7;

string a, b, c;
long long dp[N][2];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> a >> b >> c;
    reverse(a.begin(), a.end());
    reverse(b.begin(), b.end());
    reverse(c.begin(), c.end());

    long long sum = 0;
    for (int i = 0; i < a.size(); i++)
    {
        int add = a[i] - '0' + b[i] - '0';
        int wyn = c[i] - '0';
        if (add % 10 == wyn)
        {
            if (add > 9)
            {
                dp[i][1] = (i == 0 ? 1LL : dp[i - 1][0] + 1LL);
            }
            else
            {
                dp[i][0] = (i == 0 ? 1LL : dp[i - 1][0] + 1LL);
                sum += dp[i][0];
            }
        }
        if ((add + 1) % 10 == wyn)
        {
            if (add + 1 > 9)
            {
                dp[i][1] = (i == 0 ? 0LL : dp[i - 1][1]);
            }
            else
            {
                dp[i][0] = (i == 0 ? 0LL : dp[i - 1][1]);
                sum += dp[i][0];
            }
        }
    }
    // for (int i = 0; i < a.size(); i++)
    // {
    //     cout << dp[i][0] << "|" << dp[i][1] << "\n";
    // }

    cout << sum << "\n";
}