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
#include <algorithm>
#include <bitset>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>

using namespace std;

#define PB push_back
#define MP make_pair
#define F first
#define S second
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) (int)(x).size()
#define CLEAR(tab) memset(tab, 0, sizeof(tab))
#define REP(x, n) for(int x = 0; x < (n); x++)
#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 VAR(v, n) __typeof(n) v = (n)
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define DEBUG(fmt, ...) fprintf(stderr, fmt, ##__VA_ARGS__)

typedef long long int LL;
typedef pair<int,int> PII;
typedef vector<int> VI;

const int MXN = 1000010;
const int C = 262144;
const int INF = 1000000001;
const int MOD = 1000000007;

int n;
string a, b, c;
LL DP[MXN][2];

void test() {
	cin>>a>>b>>c;
	int n = a.length();
	LL res = 0;
	FORD(i, n - 1, 0) {
		int na = a[i] - '0';
		int nb = b[i] - '0';
		int nc = c[i] - '0';

		if(na + nb == nc) {
			DP[i][0] = 1;
			DP[i][0] += DP[i + 1][0];
		}
		else if((na + nb) % 10 == nc && na + nb > 9) {
			DP[i][1] = 1;
			DP[i][1] += DP[i + 1][0];
		}
		int s = na + nb + 1;

		if(s == nc)
			DP[i][0] += DP[i + 1][1];
		if(s >= 10 && s % 10 == nc) {
			DP[i][1] += DP[i + 1][1];
		}
		res += DP[i][0];
	}

	printf("%lld\n", res);
}

int main() {
	int te = 1;
	//scanf("%d", &te);
	while(te--)
		test();
	return 0;
}