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

using namespace std;

#define PB push_back
#define FORE(i, t) for(__typeof(t.begin())i=t.begin();i!=t.end();++i)
#define SZ(x) int((x).size())
#define REP(i, n) for(int i=0,_=(n);i<_;++i)
#define FOR(i, a, b) for(int i=(a),_=(b);i<=_;++i)
#define FORD(i, a, b) for(int i=(a),_=(b);i>=_;--i)

#ifdef DEBUG
#define DEB(x) (cerr << x)
#else
#define DEB(x)
#endif

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;

const int INF = 1e9 + 9;

void inline one() {
    ll n;
    cin >> n;
    ll dp[22] = {0, 1};
    ll previous_digit = 0;
    int last_i = 0;
    for (int i = 2; n > 0; ++i) {
        ll digit = n % 10;
        n /= 10;

        // dodaj jedna nowa liczbe
        dp[i] += (digit + 1) * dp[i - 1];

        // dodaj dwie nowe liczby, pierwsza musi być 1
        if (digit == 1) {
            dp[i] += (9 - previous_digit) * dp[i - 2];
        }

        last_i = i;
        previous_digit = digit;
    }
    cout << dp[last_i] << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    //int z; cin >> z; while(z--)
    one();
}