Submission #1419831

---

Source Code Expand

// 基本テンプレート

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int

template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}

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

int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;

// digit, has4, has9, flag
ll dp[20][2][2][2];

ll solve(string s, int less) {
    memset(dp, 0, sizeof(dp));
    dp[0][0][0][0] = 1;

    int N = s.length();
    rep(i,0,N) rep(j,0,2) rep(k,0,2) rep(f,0,2) {
        int lim = f ? 9 : s[i] - '0';
        rep(x,0,lim+1) {
            dp[i+1][j||x==4][k||x==9][f||x<lim] += dp[i][j][k][f];
        }
    }

    ll ret = 0;
    rep(j,0,2) rep(k,0,2) rep(f,0,2) {
        if(!j && !k) continue;
        if(less == 1 && f == 0) continue;
        ret += dp[N][j][k][f];
    }
    return ret;
}

signed main() {
    string A, B; cin >> A >> B;
    ll ra = solve(A, 1), rb = solve(B, 0);
    cout << rb - ra << endl;
    return 0;
}

Submission Info

Judge Result