Submission #1696204

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
 
/*てんぷれぞーん！*/
struct edge {int to,cost;};
typedef long long ll;
typedef pair<int,int> P;
typedef vector<int> VI;
typedef vector<edge> VE;
//static const int INF = 2147483647;
//static const int INF = 1000000000;
//static const int INf = 9223372000000000000;
static const long long INF = 9223372000000000000/2;
static const int NIL = -1;
static const int MOD = 1000000007;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define np next_permutation
#define pq priority_queue
/* t y p o っ て 知 っ て る ゥ ！ ？ */
#define itn int
#define scnaf scanf
#define reutnr return
#define scamf scanf
//int dx4[4] = {0,1,0,-1}, dy4[4] = {-1,0,1,0};
//int dx5[5] = {-1,0,0,0,1}, dy5[5] = {0,-1,0,1,0};
//int dx8[8] = {-1,0,1,1,1,0,-1,-1}, dy8[8] = {1,1,1,0,-1,-1,-1,0};
//int dx9[9] = {-1,0,1,1,1,0,-1,-1,0}, dy9[9] = {1,1,1,0,-1,-1,-1,0,0};
#define int ll

string A,B;
int dp[20][2][2];   //dp[見ている桁][tight][safeかoutか]

int judge(string a){
    for(int i=0;i<a.size();i++){
        if(a[i]=='4' || a[i]=='9') return 1;
    }
    return 0;
}

int dfs(string S, int digit, bool tight, int out){
    if(S.size()==digit) return out;
    if(dp[digit][tight][out]!=-1) return dp[digit][tight][out];
    
    int x = S[digit] - '0';
    int res = 0;
    int r = (tight ? x : 9);

    for(int i=0;i<=r;i++){
        res += dfs(S,digit+1,tight&&i==r,out||(i==4 || i==9));
    }

    return dp[digit][tight][out] = res;
} 

signed main(){
    cin >> A >> B;
    memset(dp,-1,sizeof(dp));
    int low = dfs(A,0,1,0);
    memset(dp,-1,sizeof(dp));
    int high = dfs(B,0,1,0);
    printf("%lld\n",high-low+judge(A));
}

Submission Info

Judge Result