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
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
vl MOD = {(ll)(1e9+7),(ll)(1e9+9),998244353};

vl pref[1000002];

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random_start();
    string s1,s2,s3;
    cin >> s1 >> s2 >> s3;
    int n = siz(s1);
    vl cur = {0,0,0};
    vl P = {1,1,1};
    ll ans = 0;
    pref[n] = cur;
    for(int i = n-1; i >= 0; i--)
    {
        rep(d,3) cur[d] = (cur[d]+P[d]*(s3[i]-'0'-(s2[i]-'0')-(s1[i]-'0')+MOD[d]))%MOD[d];
        rep(d,3) P[d] = (P[d]*10)%MOD[d];
        pref[i] = cur;
    }
    map<vl,ll> mp;
    rep2(r,0,n)
    {
        ans += mp[pref[r]];
        mp[pref[r]]++;
    }
    cout << ans << "\n";
}