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 using namespace std; #define PII pair #define VI vector #define VPII vector #define LL long long #define LD long double #define f first #define s second #define MP make_pair #define PB push_back #define endl '\n' #define ALL(c) (c).begin(), (c).end() #define SIZ(c) (int)(c).size() #define REP(i, n) for(int i = 0; i < (int)(n); ++i) #define FOR(i, b, e) for(int i = (b); i <= (int)(e); ++i) #define FORD(i, b, e) for(int i = (b); i >= (int)(e); --i) #define ll LL #define st f #define nd s #define pb PB #define mp MP #define eb emplace_back #define siz(c) SIZ(c) const int inf = 1e9+7; const ll INF = 1e18L+7; #define sim template ostream & operator << (ostream &p, pair x) {return p << "<" << x.f << ", " << x.s << ">";} sim> auto operator << (ostream &p, n y) -> typename enable_if::value, decltype(y.begin(), p)>::type {int o = 0; p << "{"; for(auto c: y) {if(o++) p << ", "; p << c;} return p << "}";} void dor() {cerr << endl;} sim, class...s> void dor(n p, s...y) {cerr << p << " "; dor(y...);} sim, class s> void mini(n &p, s y) {if(p>y) p = y;} sim, class s> void maxi(n &p, s y) {if(p> n; FOR(i, 1, LEN) { pos[i] = n % 10; n /= 10; } dp[0] = 1; FOR(i, 1, LEN) { FOR(x, 0, 9) FOR(y, 0, 9) { if(x + y == pos[i]) dp[i] += dp[i-1]; if(pos[i] == 1 && i > 1 && x + y == pos[i-1] + 10) dp[i] += dp[i-2]; } } printf("%lld\n", dp[LEN]); }