Submission #1727152

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define REP(i,n) for(int i=0;i<n;i++)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define EPS (1e-7)
#define INF 1e9

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;
int vx[]={0,1,0,-1};
int vy[]={1,0,-1,0};

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

const ll mod=1000000000+7;
const int MAX_N=300;

ll calc(ll x){
	string s=to_string(x);
	int n=s.size();
	ll dp[n+1][2][2];
	REP(i,n+1)REP(j,2)REP(k,2)dp[i][j][k]=0;
	dp[0][0][0]=1;
	REP(keta,n){
		REP(less,2){
			REP(ng,2){
				int c=s[keta]-'0';
				REP(d,10){
					if(less || d<=c){
						dp[keta+1][less || d<c][ng || d==4 || d==9]+=dp[keta][less][ng];
					}
				}
			}
		}
	}
	ll result=0;
	REP(less,2)result+=dp[n][less][1];
	return result;
}
int main(){
	ll a,b;
	cin>>a>>b;
	cout<<calc(b)-calc(a-1)<<endl;
	return 0;
}

Submission Info

Judge Result