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

using namespace std;

#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(...) {}
#endif

#define x first
#define y second
#define ir(x, a, b) ((a) <= (x) && (x) <= (b))
#define vec vector
#define rep(i, a, b) for (ll i = a; i < (b); ++i)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)((x).size()))

using ll = long long;
using pii = pair<ll, ll>;

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int N;
  vec<vec<int>> a(3);
  rep (n, 0, 3) {
    string s; 
    cin >> s;
    N = s.size();
    a[n].resize(N);
    debug(s, a);
    rep (k, 0, N) 
      a[n][k] = s[k]-'0';
  }
  int carry = 0;
  vec<ll> v = {0};
  for (int i = N-1; i >= 0; i--) {
    if ((a[0][i] + a[1][i] + carry) % 10 == a[2][i]) {
      debug(i, a[0][i]);
      if ((a[0][i] + a[1][i] + carry) >= 10) {
        carry = 1;
      } else {
        carry = 0;
        v.back()++;
      }
    } else {
      if (carry) i++;
      carry = 0;
      v.push_back(0);
    }
  }
  debug(v);
  ll res = 0;
  for (auto x : v) {
    res += (ll(x) * ll(x+1)) / 2;
  }
  cout << res << "\n";
  return 0;
}