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
#ifndef LOCAL
#pragma GCC optimize("O3")
#endif
//#include <bits/stdc++.h>
#include <bit>
#include <print>
#include <iostream>
#include <cassert>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <algorithm>
#include <functional>
#include <ranges>
#include <numeric>
#define FOR(i,p,k) for(int i=(p); i<=(k); ++i)
#define REP(i,k) FOR(i,0,(k)-1)
#define RFOR(i,p,n) for(int i=(p); i>=(n); --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define ssize(x) int((x).size())
#define fi first
#define se second
#define V vector
#define pb push_back
#define eb emplace_back
#define C const
#define pn printf("\n")
using namespace std;
typedef long long ll;
typedef V <int> vi;
typedef V <ll> vll;
typedef C int ci;
typedef C ll cll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
void chmin(auto &a, auto b){a=min(a,b);}
void chmax(auto &a, auto b){a=max(a,b);}
ci inf=2.1e9;
cll infll=4.5e18;
int I(){
    int z;
    while ((z=getchar_unlocked())<'-'||z>'9');
    C bool czymin=z=='-';
    int r=czymin ? 0 : z-'0';
    while ((z=getchar_unlocked())>='0'&&z<='9')
        r=r*10+z-'0';
    return czymin ? -r : r;
}
vi dajs(){
    string s;
    cin >> s;
    vi v(ssize(s));
    REP(i, ssize(s))
        v[i]=s[i]-'0';
    return v;
}
void ans(){
    C vi l1=dajs(),l2=dajs(),suma=dajs();
    ci n=ssize(l1);
    ll w=0;
    vi dp(2);
    RFOR(i, n-1, 0) {
        vi ndp(2);
        ci s=l1[i]+l2[i];
        if (s%10==suma[i])
            ndp[s/10] += 1+dp[0];
        else if ((s+1)%10==suma[i])
            ndp[(s+1)/10] += dp[1];
        swap(ndp, dp);
        w+=dp[0];
    }
    printf("%lld\n", w);
}
int main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    int tt=1;
    //tt=I();
    while (tt--)ans();
}