Submission #3416986

---

Source Code Expand

#include <iostream>
#include <string.h>
#include <stdio.h>
#include <map>
#include <vector>
#include <math.h>
#include <algorithm>
#include <queue>
#include <set>
#include <tuple>
using namespace std;

#define rep(i,a) for(int i=0; i<a; i++)
#define rrep(i,a) for(int i=a; i>=0; i--)
#define rep1(i,a) for(int i=1; i<=a; i++)
#define cout1(a) cout << a << endl;
#define cout2(a,b) cout << a << " " << b << endl;
#define cout3(a,b,c) cout << a << " " << b << " " << c << endl;
#define cout4(a,b,c,d) cout << a << " " << b << " " << c << " " << d << endl;
#define mem(a,n) memset( a, n, sizeof(a))
#define all(a) a.begin(),a.end()
#define int long long
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> V;
typedef vector<V> VV;
typedef vector<VV> VVV;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LLINF = 1e18;
static const double pi = 3.141592653589793;

int solve(string s){
    int len = s.size();
    
    int dp[20][2][2][2]={};
    dp[0][0][0][0]=1;
    rep(i,len)rep(j,2)rep(k,2)rep(l,2){
        int lim = j? 9:s[i]-'0';
        rep(d,lim+1){
            dp[i+1][j||d<lim][k||d==4][l||d==9] += dp[i][j][k][l];
        }
    }
    int res=0;
    rep(j,2)rep(k,2)rep(l,2){
        if(k||l) res += dp[len][j][k][l];
    }
    return res;
}

signed main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int a,b;
    cin>>a>>b;
    
    string A = to_string(a-1);
    string B = to_string(b);
    
    cout1(solve(B)-solve(A));
}

Submission Info

Judge Result