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
// Arti1990, II UWr

#include <bits/stdc++.h>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,K,FUN)             ({auto SSS=P, PPP = P-1, KKK=(K)+1; while(PPP+1!=KKK) {SSS = (PPP+(KKK-PPP)/2); if(FUN(SSS)) KKK = SSS; else PPP = SSS;} PPP;})
#define testy()                     int _tests; cin>>_tests; FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#define FOR(i, a, b)                for(int i=a; i<=b; i++)
#define FORD(i, a, b)               for(int i=a; i>=b; i--)
#define MP                          make_pair
#define PB                          push_back
#define ff                          first
#define ss                          second
#define deb(X)                      X;
#define SIZE(coll) 					((int)coll.size())

#define M 1000000007
#define INF 1000000007LL

using namespace std;

int n, m, a;
string s1, s2, s3;
int ile[1000007];

int solve()
{
    cin >> s1 >> s2 >> s3;
    n = s1.size();

    long long res = 0, c = 1000, kon;
    vector <pair<int, int> > v;
    FORD(i, n-1, 0)
    {
        int s = s1[i] - '0' + s2[i] - '0';
        int z = s3[i] - '0';
        if(s == z)
        {
            v.PB({i, i});
            ile[i] = 1 + ile[i+1];
            c = 0;
        }
        else if(s == 10 + z)
        {
            c = 1;
            kon = i;
        }
        else if(c == 1 && s + c == z)
        {
            v.PB({i, kon});
            ile[i] = 1 + ile[kon + 1];
            c = 0;
        }
        else if(c == 1 && s + c == 10 + z)
        {
            c = 1;
        }
        else
            c = 1000;
        res += ile[i];
    }

    //for(auto p : v)
    //{
    //    cout << p.ff << " - " << p.ss << '\n';
    //}

    cout << res << '\n';

    return 0;
}

int main()
{
    std::ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    solve();

    return 0;
}