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
#include <bits/stdc++.h>
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using namespace std;
template <class T>
using Ve = vector<T>;
#define ALL(v) (v).begin(), (v).end()
#define pii pair<ll, ll>
#define rep(i, a, b) for(ll i = (a); i <= (b); ++i)
#define per(i, a, b) for(ll i = (a); i >= (b); --i)
#define pb push_back
bool Mbe;
ll read() {
    ll x = 0, f = 1; char ch = getchar();
    while(ch < '0' || ch > '9') {if(ch == '-') f = -1; ch = getchar();}
    while(ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
    return x * f;
}
void write(ll x) {
    if(x < 0) putchar('-'), x = -x;
    if(x > 9) write(x / 10);
    putchar(x % 10 + '0');
}
const ll N = 1e6 + 9, Mod[2] = {998244353, 1000000007};
ll n, pw[2][N], pre[2][N];
char a[N], b[N], c[N];
map<pii, ll> mp;
bool Med;
int main() {
    cerr << fabs(&Med - &Mbe) / 1048576.0 << "MB\n";
    scanf("%s%s%s", a + 1, b + 1, c + 1);
    n = strlen(a + 1);
    pw[0][0] = pw[1][0] = 1;
    rep(i, 0, 1) {
        rep(j, 1, n) pw[i][j] = pw[i][j - 1] * 10 % Mod[i];
        rep(j, 1, n) pre[i][j] = (pre[i][j - 1] + pw[i][n - j] * (a[j] - '0' + b[j] - '0' - (c[j] - '0')) % Mod[i] + Mod[i]) % Mod[i];
    }
    mp[{0, 0}] = 1; ll ans = 0;
    rep(i, 1, n) ans += mp[{pre[0][i], pre[1][i]}], mp[{pre[0][i], pre[1][i]}]++;
    write(ans), putchar('\n');
    cerr << "\n" << clock() * 1.0 / CLOCKS_PER_SEC * 1000 << "ms\n";
    return 0;
}