Submission #1772882

---

Source Code Expand

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<memory>
#include<functional>
#include<set>
 
using namespace std;
 
#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
#define p(p) cout<<(p)<<" ";
#define pb push_back
#define mp make_pair
#define INF 1<<25

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pi;
typedef long long ll;

int dy[8]={1,1,1,0,0,-1,-1,-1};
int dx[8]={-1,0,1,-1,1,-1,0,1};
struct S{
	int a,b,c;
};
bool asc(const S& left,const S& right){
	return left.c > right.c;
}

ll dp[20][2][2]; //keta,less,ng
ll f(ll t){
	string S = to_string(t);
	int N =S.size();
	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 lim = S[keta]-'0';
				rep(d,10){
					if(less || d<=lim)
						dp[keta+1][less][ng||d==4||d==9]+=dp[keta][less][ng];
				}
			}
		}
	}
	int ret=0;
	rep(i,2)ret+=dp[N][i][1];
	return ret;
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	ll A,B;
	cin>>A>>B;
	cout<<f(B)-f(A-1)<<endl;
	return 0;
}

Submission Info

Judge Result