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
/*
Runda 3 - 
*/

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<queue>
#include<stack>
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <chrono>

using namespace std;
using namespace __gnu_pbds;

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef vector<LL> VLL;
typedef vector<LD> VLD;
typedef vector<VLL > VVLL;
typedef vector<VLD > VVLD;
typedef vector<PII > VPII;
typedef vector<PLL > VPLL;
template<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;
template<class T> using max_heap = priority_queue<T>;

#define FOR(x, b, e) for(int x=b; x<=(e); ++x)
#define FORD(x, b, e) for(int x=b; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second
#define THIS (*this)
#define LSB(x) (x & -x)
#define SQR(x) ((x)*(x))

int main() {
	ios_base::sync_with_stdio(0);
    cin.tie(NULL); cout.tie(NULL);
    string a, b, c; cin >> a >> b >> c;
    int n = a.size();
    LL ans = 0;
    LL zero = 0, one = 0;
    FORD(i, n - 1, 0) {
        int sum = a[i] - '0' + b[i] - '0';
        if (sum == c[i] - '0') {
            zero++; ans += zero; one = 0;
            //printf("found %d at pos: %d\n", zero, i);
        } else if (sum + 1 == c[i] - '0') {
            zero = one; ans += zero; one = 0;
            //printf("found %d at pos: %d\n", zero, i);
        } else if (sum % 10 == c[i] - '0') {
            one = zero + 1; zero = 0;
            //printf("one is %d at pos: %d\n", one, i);
        } else if ((sum + 1) % 10 == c[i] - '0') {
            one = one; zero = 0;
            //printf("one is %d at pos: %d\n", one, i);
        } else {
            one = 0; zero = 0;
            //printf("clear everything at pos %d\n", i);
        }
    }
    cout << ans << '\n';

    return 0;
}