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
#include <iostream>
#include <vector>

using namespace std;
using LL = long long;

int main()
{
	LL n;

	cin >> n;

	vector<int> digits;

	while (n > 0)
	{
		digits.push_back(n % 10);
		n /= 10;
	}

	int cnt = digits.size();

	vector<LL> dp(cnt + 1);
	dp[0] = 1;

	for (int i = 0; i < cnt; ++i)
	{
		dp[i + 1] += dp[i] * (digits[i] + 1);

		if (i < cnt - 1 && digits[i] < 9 && digits[i + 1] == 1)
		{
			dp[i + 2] += dp[i] * (9 - digits[i]);
		}
	}

	cout << dp[cnt];

	return 0;
}