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

long long dp[2][2] = {};

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    string a, b, c;
    cin >> a >> b >> c;
    long long wyn = 0;
    for (int i=a.size()-1; i>=0; i--) {
        int s = (a[i]-'0')+(b[i]-'0')-(c[i]-'0');
        int start, end;
        if (s == 0) {
            start = 0;
            end = 0;
        } else if (s == 10) {
            start = 0;
            end = 1;
        } else if (s == -1) {
            start = 1;
            end = 0;
        } else if (s == 9) {
            start = 1;
            end = 1;
        } else {
            dp[0][0] = dp[0][1] = dp[1][0] = dp[1][1] = 0;
            continue;
        }
        long long n00 = 0, n01 = 0, n10 = 0, n11 = 0;
        if (start == 0 && end == 0) n00++;
        if (start == 0 && end == 1) n01++;
        if (start == 1 && end == 0) n10++;
        if (start == 1 && end == 1) n11++;
        if (dp[0][0] && 0 == start) {
            if (end == 0) n00 += dp[0][0];
            else n01 += dp[0][0];
        }
        if (dp[0][1] && 1 == start) {
            if (end == 0) n00 += dp[0][1];
            else n01 += dp[0][1];
        }
        if (dp[1][0] && 0 == start) {
            if (end == 0) n10 += dp[1][0];
            else n11 += dp[1][0];
        }
        if (dp[1][1] && 1 == start) {
            if (end == 0) n10 += dp[1][1];
            else n11 += dp[1][1];
        }
        dp[0][0] = n00;
        dp[0][1] = n01;
        dp[1][0] = n10;
        dp[1][1] = n11;
        wyn += dp[0][0];
    }
    cout << wyn;
    return 0;
}