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
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) int((x).size())
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

#ifdef LOCAL
auto operator<<(auto& o, auto x) -> decltype(x.first, o);
auto operator<<(auto& o, auto x) -> decltype(x.end(), o) {
  o << "{";
  for (int i = 0; auto y : x) o << ", " + !i++ * 2 << y;
  return o << "}"; }
auto operator<<(auto& o, auto x) -> decltype(x.first, o) {
  return o << "(" << x.first << ", " << x.second << ")"; }
void __print(auto... x) { ((cerr << x << " "), ...) << endl; }
#define debug(x...) __print("[" #x "]:", x)
#else
#define debug(...) 2137
#endif

const ll mod = (1LL << 61) - 1;
const ll base = 10;
ll add(ll a, ll b) {
  return a + b >= mod ? a + b - mod : a + b;
}
ll sub(ll a, ll b) {
  return add(a, mod - b);
}
ll mult(ll a, ll b) {
  auto c = (__int128) a * b;
  return add(c & mod, c >> 61);
}
ll bp(ll a, ll b) {
  ll r = 1;
  while(b) {
    if(b & 1) r = mult(r, a);
    a = mult(a, a);
    b /= 2;
  }
  return r;
}

int main() {
  cin.tie(0)->sync_with_stdio(0);

  string a, b, c;
  cin >> a >> b >> c;
  int n = a.length();
  vector<ll> h(n + 1);
  map<ll, int> mp;
  mp[0] = 1;
  ll ans = 0;
  ll pw = 1;
  ll inv = bp(base, mod - 2);
  for(int i = 0; i < n; i++) {
    h[i + 1] = add(mult(h[i], base), sub((a[i] - '0') + (b[i] - '0'), (c[i] - '0')));
    pw = mult(pw, inv);
    ans += mp[mult(h[i + 1], pw)]++;
  }
  cout << ans << endl;
}