Submission #1846795

---

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 PP(p) cout<<(p)<<" ";
#define pb push_back
#define mp make_pair
#define INF 1e18

typedef long long ll;
#define int ll
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef vector<char> vc;
typedef pair<int, int> pi;
//int dy[8]={1,1,1,0,-1,-1,-1,0};
//int dx[8]={-1,0,1,1,1,0,-1,-1};
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};

int N,M;
int a,b;
string A,B;
int dp[20][2][2];
void input(){
	cin>>a>>b;
	a--;
	A=to_string(a);
	B=to_string(b);
	//memset(dp,-1,sizeof(dp));
	rep(i,20)rep(j,2)rep(k,2)dp[i][j][k]=-1;
}
int f(string &S,int now,int no,int less){
	if(now==-1){
		if(no==1)return 1;
		else 	 return 0;
	}
	if(dp[now][no][less]!=-1){
		return dp[now][no][less];
	}
	int ret=0;
	int num=S[now]-'0';
	int Max=(less?9:num);
	rep(i,Max+1){
		ret+=f(S,now-1,no||i==4||i==9,less||i<Max);
	}
	if(less)return dp[now][no][less]=ret;
	else 	return ret;
}

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	input();
	reverse(ALL(A));
	reverse(ALL(B));
	int ret1=f(A,A.size()-1,0,0);
	int ret2=f(B,B.size()-1,0,0);
	P(ret2-ret1)
	return 0;
}

Submission Info

Judge Result