Submission #1770146

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(i=0;i<n;i++)
#define loop(i,a,n) for(i=a;i<n;i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
#define int ll
typedef vector<int> vi;
typedef pair<int,int> pii;

signed main(void) {
  int i,j,k;
  int n;
  string s,t;
  cin>>n;
  n--;
  s=to_string(n);
  n=s.size();
  cin>>t;
  int dp1[20][2][2]={};
  dp1[0][0][0]=1;
  rep(i,n)rep(j,2)rep(k,2)if(dp1[i][j][k]>0){
    int lim,d;
    if(j)lim=9;
    else lim=s[i]-'0';
    rep(d,lim+1)
      dp1[i+1][j||d<lim][k||d==4||d==9]+=dp1[i][j][k];
  }
  n=t.size();
  int dp2[20][2][2]={};
  dp2[0][0][0]=1;
  rep(i,n)rep(j,2)rep(k,2)if(dp2[i][j][k]>0){
    int lim,d;
    if(j)lim=9;
    else lim=t[i]-'0';
    rep(d,lim+1)
      dp2[i+1][j||d<lim][k||d==4||d==9]+=dp2[i][j][k];
  }

  cout<<dp2[n][0][1]+dp2[n][1][1]-dp1[n][0][1]-dp1[n][1][1]<<endl;
}

Submission Info

Judge Result