Submission #162548

---

Source Code Expand

#include<cstdio>
#include<vector>
#include<deque>
#include<queue>
#include<string>
#include<iostream>
#include<stack>
#include<set>
#include<map>
#include<algorithm>
#include<cmath>
#define INF 1000000009
#define pb push_back
using namespace std;
int is(int p){
	while(p>0){
	 	int n=p-(p/10*10);
	 	if(n==4 || n==9)return 1;
	 	p=p/10;
	}
	return 0;
}
long long int scal(int x){
	long long int ans=0;
	for(int i=1;i<=x;i++){
		ans+=is(i);
	}
	return ans;
}
long long int cal(long long int x){
	long long int up,down,ans=0;
	up=x/100000;
	down=x%100000;
	if(is(up)==0)ans+=scal(down);else ans+=down;
	ans+=100000*scal(up);
	ans+=scal(100000)*(up-scal(up));
	return ans;
}
int main(){
	long long int x,y,ux,dx,uy,dy,ans1=0,ans2=0;
	cin>>x>>y;
	x--;	
	ux=x/(INF-9);
	uy=y/(INF-9);
	dx=x%(INF-9);
	dy=y%(INF-9);
	if(is(ux)==0){ans1+=cal(dx);}else {ans1+=dx;}
	ans1+=1000000000*cal(ux);
	ans1+=cal(1000000000)*(ux-cal(ux));
	
	if(is(uy)==0){ans2+=cal(dy);}else {ans2+=dy;}
	ans2+=1000000000*cal(uy);
	ans2+=cal(1000000000)*(uy-cal(uy));
	cout<<ans2-ans1<<endl;
	return 0;
}

Submission Info

Judge Result