Submission #1770452

---

Source Code Expand

#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define int ll
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define IN(a, b, x) (a<=x&&x<b)
#define MP make_pair
#define PB push_back
#ifdef int
const ll INF = (1LL<<60);
#else
const int INF = (1LL<<30);
#endif
const double PI = 3.14159265359;
const double EPS = 1e-12;
const int MOD = 1000000007;

template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};

int dp[20][2][2];
signed main(void)
{
  ll A, B;
  cin >> A >> B;
  A--;
  string a = to_string(A);
  int n = a.size();

  dp[0][0][0] = 1;
  REP(i, n) REP(j, 2) REP(k, 2) {
    int lim = j ? 9 : a[i] - '0';
    REP(d, lim+1) {
      dp[i+1][j || d < lim][k || d==4 || d==9] += dp[i][j][k];
    }
  }
  int ret = dp[n][0][1] + dp[n][1][1];

  string b = to_string(B);
  n = b.size();
  memset(dp, 0, sizeof(dp));
  dp[0][0][0] = 1;
  REP(i, n) REP(j, 2) REP(k, 2) {
    int lim = j ? 9 : b[i] - '0';
    REP(d, lim+1) {
      dp[i+1][j || d < lim][k || d==4 || d==9] += dp[i][j][k];
    }
  }

  cout << dp[n][0][1] + dp[n][1][1] - ret << endl;

  return 0;
}

Submission Info

Judge Result