Submission #1071409

---

Source Code Expand

#include "bits/stdc++.h"

#define REP(i,n) for(int i=0;i<n;++i)
#define RREP(i,n) for(int i=n-1;i>=0;--i)
#define FOR(i,m,n) for(int i=m;i<n;++i)
#define RFOR(i,m,n) for(int i=n-1;i>=m;--i)
#define ALL(v) v.begin(),v.end()
#define PB(a) push_back(a)
#define INF 1000000001
#define MOD 1000000007
#define EPS 1e-9

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

typedef long long ll;
using namespace std;

ll piyo(ll a) {
	if (a < 4) return a;
	else if (a < 9) return a - 1;
	else return a - 2;
}

ll hoge(ll a) {
	ll n = log10(a);
	ll h = pow(10, n);
	ll ans = 1;
	ll tmp = a;
	while (tmp >9) {
		ans *= (piyo(tmp%10)+1);
		tmp /= 10;
	}
	ans *= piyo(tmp);
	REP(i, n) {
		ll res = 7;
		REP(j, i) {
			res *= 8;
		}
		ans += res;
	}

	
	return a - ans;
}


int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	ll a, b;
	cin >> a >> b;
	cout << hoge(b)- hoge(a) << endl;
	return 0;
}

Submission Info

Judge Result