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
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
// Karol Kosinski 2026
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b);i<_b;++i)
#define FR_(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)
#define FD_(i,b,a) for(int i=(b),_a=(a);i>=_a;--i)
#define ALL(c) (c).begin(),(c).end()
#define SIZE(c) int((c).size())
#define X first
#define Y second
#define endl '\n'
#define NAM(x) #x,'=',x
using namespace std;
using LL = long long;
using ULL = unsigned long long;
using PII = pair<int, int>;
using TIII = tuple<int, int, int>;
template<class...T> void _cout(T...a){(cout<<...<<a);}

#ifndef ENABLE_DEBUG
#define DEB(k,p,f,x...)
#else
#define DEB(k,p,f,x...) {if(k)_cout("------",setw(4),__LINE__," : ",__FUNCTION__,endl);if(p)f(x);}
#endif
#define DEBF(f,x...)    DEB(1,1,f,x)
#define DEBL            DEBF(void,0)
#define DEBC(p,x...)    DEB(0,p,_cout,x)
#define DEBUG(x...)     DEBC(1,x)

constexpr int NX = 1'000'005;

int A[NX][3];
LL NW[NX];

LL solve()
{
    LL res = 0;
    int n, next = 0, counter = 0;
    vector<int> V;
    FOR(i,1,NX)
    {
        NW[i] = NW[i-1] + i;
    }
    FOR(i,0,3)
    {
        string s;
        cin >> s;
        n = SIZE(s);
        reverse( ALL(s) );
        FOR(j,0,n) A[j][i] = s[j] - '0';
        A[n][i] = 1;
    }
    FOR(i,0,n+1)
    {
        auto &B = A[i];
        DEBUG( "-- ", NAM(B[0]), " ", NAM(B[1]), " ", NAM(B[2]) );
        DEBUG( "   ", NAM(next), " ", NAM(counter), endl );
        if ( B[0] + B[1] + next == B[2] )
        {
            if ( next == 0 )
            {
                ++ counter;
            }
            next = 0;
        }
        else if ( B[0] + B[1] + next == B[2] + 10 )
        {
            if ( next == 0 )
            {
                ++ counter;
            }
            next = 1;
        }
        else
        {
            if ( next == 1 ) -- counter;
            if ( counter > 0 ) V.push_back(counter);
            DEBUG( "** reset: ", NAM(counter), endl );
            counter = 0;
            next = 0;
            DEBUG( "-- ", NAM(B[0]), " ", NAM(B[1]), " ", NAM(B[2]) );
            DEBUG( "   ", NAM(next), " ", NAM(counter), endl );
            if ( B[0] + B[1] + next == B[2] )
            {
                if ( next == 0 )
                {
                    ++ counter;
                }
                next = 0;
            }
            else if ( B[0] + B[1] + next == B[2] + 10 )
            {
                if ( next == 0 )
                {
                    ++ counter;
                }
                next = 1;
            }
        }
    }
    for ( auto v : V )
    {
        res += NW[v];
    }
    return res;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << solve() << endl;
    return 0;
}