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

using namespace std;
typedef long long ll;
const int inf=1e9;
int main() {
    string a,b,c;
    cin>>a>>b>>c;
    int n = a.size();
    int prvdp=inf;
    int prv=inf;
    ll res=0;
    vector<ll>dp(n+1);
    vector<int>pref(n+1, 0);
    for (int i=1; i<=n; i++) {
        int n1 =a[i-1]- '0';
        int n2=b[i-1]- '0';
        int n3=c[i-1]- '0';
        pref[i]=pref[i-1] + ((n1 + n2 + 1)%10==n3 and (n1 + n2 + 1)>=10);
    }
    int longest=0;
    for (int i=1; i<=n; i++) {
        int n1=a[i-1]- '0';
        int n2=b[i-1] - '0';
        int n3=c[i-1] - '0';

        if (n1+n2+1==n3) {
            prvdp=i;
            prv=inf;
            longest=0;
        }
        else if ((n1+n2+1)%10==n3 and (n1+n2+1)>=10) {
            prv=inf;
            longest=0;
        }
        else if (n1 + n2>=10 and (n1 + n2)%10==n3) {
            prv=i;
            longest=0;
        }

        else if ((n1+n2)%10!=n3 and (n1+n2+1)%10!=n3) {
            prv=inf;
            prvdp=inf;
            longest=0;
        }

        else if (n1 + n2==n3) {
            if (prv==inf) prvdp=inf;
        }
        else {
            prv=inf;
            prvdp=inf;
            longest=0;
        }
        if ((n1 + n2)%10==n3) {
            longest++;
            if (prv!=inf and prvdp!=inf and pref[prv-1] - pref[prvdp]==(prv-1) - prvdp)
                dp[i]=dp[prvdp-1] + 1;
            if (prv!=inf)
            dp[i]+=(i - prv);
            else if (n1 + n2==n3) dp[i]+=longest;
            res+=dp[i];
        }

        //cout<<i<<" "<<prvdp<<" "<<prv<<" "<<dp[i]<<'\n';
    }
    cout<<res;
    return 0;
}